An adaptive Bayesian approach to gradient-free global optimization by Jianneng Yu, Alexandre V Morozov

“…The importance of global optimization has inspired the development of numerous heuristic algorithms based on analogies with physical, chemical or biological systems. …”
Get full text

Multilevel Threshold Segmentation of Skin Lesions in Color Images Using Coronavirus Optimization Algorithm by Yousef S. Alsahafi, Doaa S. Elshora, Ehab R. Mohamed, Khalid M. Hosny

“…The proposed algorithm is compared to the following five meta-heuristic algorithms: Arithmetic Optimization Algorithm (AOA), Sine Cosine Algorithm (SCA), Reptile Search Algorithm (RSA), Flower Pollination Algorithm (FPA), Seagull Optimization Algorithm (SOA), and Artificial Gorilla Troops Optimizer (GTO) to prove its superiority. …”
Get full text

The Stochastic Container Relocation Problem by Galle, Virgile, Manshadi, VH, Borjian Boroujeni, Setareh, Barnhart, Cynthia, Jaillet, Patrick

“…Moreover, we introduce two new heuristics outperforming the best existing heuristics. Algorithms, bounds, and heuristics are tested in an extensive computational section. …”
Get full text

Fundamental performance limits and efficient polices for Transportation-On-Demand systems by Pavone, Marco, Treleaven, Kyle Ballantyne, Frazzoli, Emilio

“…Routing service vehicles through customers is usually accomplished with heuristic algorithms. In this paper we study TOD systems in a formal setting that allows us to characterize fundamental performance limits and devise dynamic routing policies with provable performance guarantees. …”
Get full text
Get full text

Optimizing a fuzzy multi-objective closed-loop supply chain model considering financial resources using meta-heuristic by Eskandari, Zahra, Avakh Darestani, Soroush, Imannezhad, Rana, Sharifi, Mani

“…This paper presents a multi-objective mathematical model which aims to optimize and harmonize a supply chain to reduce costs, improve quality, and achieve a competitive advantage and position using meta-heuristic algorithms. The purpose of optimization in this field is to increase quality and customer satisfaction and reduce production time and related prices. …”
Get full text

Multi-Robot Exploration of Unknown Space Using Combined Meta-Heuristic Salp Swarm Algorithm and Deterministic Coordinated Multi-Robot Exploration by Ali El Romeh, Seyedali Mirjalili

“…Many previous methods are based on deterministic or meta-heuristic algorithms, but limited work has combined both techniques to consolidate both classes’ benefits and alleviate their drawbacks. …”
Get full text

Optimization of Load Sharing in Compressor Station Based on Improved Salp Swarm Algorithm by Jiawei Zhang, Lin Li, Qizhi Zhang, Yanbin Wu

“…Then, GASSA is applied to optimize the booster compressor station load distribution model and compared with some well-known meta-heuristic algorithms. The results show that GASSA outperforms other algorithms in terms of accuracy and reliability.…”
Get full text

BCDP: Budget Constrained and Delay-Bounded Placement for Hybrid Roadside Units in Vehicular Ad Hoc Networks by Peng Li, Chuanhe Huang, Qin Liu

“…Simulation results show the heuristic algorithms can significantly improve the coverage range and reduce the total deployment cost, compared with other heuristic methods.…”
Get full text

Development of a Power and Communication Bus Using HIL and Computational Intelligence by Marek Sznura, Piotr Przystałka

“…Attention was also paid to the problem of the selection of the behavioural parameters of the heuristic algorithms. The overall results proved the high practical potential of the DLN, which was developed using the proposed optimization method.…”
Get full text

Failure Recovery Model for Single Link with Congestion-Avoidance in SDN by CHEN Ziqiang, XIA Zhengyou

“…As a new network architecture,the software defined network(SDN)simplifies the network management logic by separating data plane and control plane,which is one of the popular research subjects of next-generation network.However,due to frequent link failures and other factors,it is difficult to guarantee the reliability of SDN,which is a problem well recognized in the industry.The existing SDN link failure recovery models often have the problems of long recovery delay,requiring too many flow entries and ignoring link congestion after recovery from failure.To solve these problems,this paper proposes a single-link failure recovery model(LFA-CA)based on segment routing(SR).The model employs the two heuristic algorithms of BPF and BPU to calculate a loop-free backup path during network initialization and update the congestion avoiding backup path during operation,respectively,so as to achieve fast recovery from single-link failure and congestion avoidance after failure.In this paper,massive simulation experiments are carried out to evaluate the performance of our model,and the results prove that compared with some of the existing SDN single-link failure recovery models,LFA-CA consumes less forwarding rules and has better load balancing ability after failure.…”
Get full text

A Novel Approach Algorithm for Determining the Initial Basic Feasible Solution for Transportation Problems by E.M.D.B. Ekanayake, E. M. U. S. B. Ekanayake

“…Comparatively speaking, the algorithmic technique suggested by this work is less complex than the well-known meta-heuristic algorithms in the literature. Finally, provide a case study to demonstrate the proposed approach.…”
Get full text

A tree search algorithm towards solving Ising formulated combinatorial optimization problems by Yunuo Cen, Debasis Das, Xuanyao Fong

“…Abstract Simulated annealing (SA) attracts more attention among classical heuristic algorithms because many combinatorial optimization problems can be easily recast as the ground state search problem of the Ising Hamiltonian. …”
Get full text

Control Meets Inference: Using Network Control to Uncover the Behaviour of Opponents by Zhongqi Cai, Enrico Gerding, Markus Brede

“…Along with benchmark cases we propose two heuristic algorithms for designing optimal influence allocations. …”
Get full text

A New Meta-Heuristics Data Clustering Algorithm Based on Tabu Search and Adaptive Search Memory by Youseef Alotaibi

“…Thus, a new meta-heuristics algorithm called (MHTSASM) is proposed in this paper for data clustering, which is based on TS and K-M. …”
Get full text

Social Milieu Oriented Routing: A New Dimension to Enhance Network Security in WSNs by Lianggui Liu, Li Chen, Huiling Jia

“…This challenging social milieu oriented routing with more than one end-to-end Quality of Trust (QoT) constraint has proved to be NP-complete. Heuristic algorithms with polynomial and pseudo-polynomial-time complexities are often used to deal with this challenging problem. …”
Get full text

A Multi-Objective Learning Whale Optimization Algorithm for Open Vehicle Routing Problem with Two-Dimensional Loading Constraints by Yutong Zhang, Hongwei Li, Zhaotu Wang, Huajian Wang

“…From the simulation analysis of different instances, it can be seen that the MLWOA algorithm has an absolute advantage in comparison with the standard WOA and other heuristic algorithms, regardless of the running results at the scale of 25, 50, or 100 datasets.…”
Get full text

Predicting Propositional Satisfiability Based on Graph Attention Networks by Wenjing Chang, Hengkai Zhang, Junwei Luo

“…These capture the displacement-invariant architecture well, whether building end-to-end models or improving heuristic algorithms for traditional solvers. We present the first framework for predicting the satisfiability of domain-specific SAT problems using graph attention networks, GAT-SAT. …”
Get full text

Intelligent reflecting surface‐aided network planning by Fan‐Hsun Tseng, Yu‐Shan Liang, Yen‐Wu Ti, Chia‐Mu Yu

“…Due to its obvious NP‐hardness, two efficient heuristic algorithms that can reach a near‐optimal solution, that is, the WSC algorithm and the tree‐based WSC (TBWSC) algorithm is then proposed. …”
Get full text

Quantum mixing of Markov chains for special distributions by V Dunjko, H J Briegel

“…Such a speed-up would also imply a speed-up of a broad family of heuristic algorithms. However, a true quadratic speed up has thus far only been demonstrated for special classes of MCs. …”
Get full text

Optimal Mapping of Spiking Neural Network to Neuromorphic Hardware for Edge-AI by Chao Xiao, Jihua Chen, Lei Wang

“…Finally, we employ a meta-heuristics algorithm to search for the best cluster-to-core mapping scheme in the reduced searching space. …”
Get full text