Results 1 to 10 of about 17,512 (264)

Recent Evolutionary Algorithm Variants for Combinatorial Optimization Problem

Applications of Modelling and Simulation, 2023
The evolutionary algorithm has been extensively used to solve a range of combinatorial optimization problems. The adaptability of evolutionary algorithm mechanisms provides diverse approaches to handle combinatorial optimization challenges.
Anniza Hamdan, Sze San Nah, Goh Say Leng, Chiew Kang Leng, Tiong Wei King   +4 more
doaj  

On simple combinatorial optimization problems

Discrete Mathematics, 1992
AbstractWe characterize (0,1) linear programming matrices for which a greedy algorithm and its dual solve certain covering and packing problems. Special cases are shortest path and minimum spanning tree algorithms.
openaire   +1 more source

Stochastic Simulated Quantum Annealing for Fast Solution of Combinatorial Optimization Problems

IEEE Access
Combinatorial optimization problems are frequently classified as NP-hard, which means that the time needed to find the optimal solution generally increases exponentially with the problem size.
Naoya Onizawa, Ryoma Sasaki, Duckgyu Shin, Warren J. Gross, Takahiro Hanyu   +4 more
doaj   +1 more source

A comparative evaluation of swarm intelligence techniques for solving combinatorial optimization problems

International Journal of Advanced Robotic Systems, 2017
This article presents a critical evaluation of swarm intelligence techniques for solving combinatorial optimization problems. Since, unarguably, the traveling salesman’s problem is the most developed, studied, and popular combinatorial problem, this ...
Julius Odili, Mohd Nizam Mohmad Kahar, A Noraziah, Syafiq F Kamarulzaman   +3 more
doaj   +1 more source

State Transition Simulated Annealing Algorithm for Discrete-Continuous Optimization Problems

IEEE Access, 2019
A simulated annealing (SA) algorithm is an effective method for solving optimization problems, especially for combinatorial optimization problems. However, SA algorithms rely heavily on the iterative mechanism of the neighborhood structure.
Xiaoxia Han, Yingchao Dong, Lin Yue, Quanxi Xu   +3 more
doaj   +1 more source

Similarity-based parameter transferability in the quantum approximate optimization algorithm

Frontiers in Quantum Science and Technology, 2023
The quantum approximate optimization algorithm (QAOA) is one of the most promising candidates for achieving quantum advantage through quantum-enhanced combinatorial optimization.
Alexey Galda, Alexey Galda, Eesh Gupta, Eesh Gupta, Jose Falla, Jose Falla, Xiaoyuan Liu, Xiaoyuan Liu, Danylo Lykov, Yuri Alexeev, Ilya Safro   +10 more
doaj   +1 more source

A General Combinatorial Ant System-based Distributed Routing Algorithm for Communication Networks [PDF]

Journal of Systemics, Cybernetics and Informatics, 2007
In this paper, a general Combinatorial Ant System-based distributed routing algorithm modeled like a dynamic combinatorial optimization problem is presented.
Jose Aguilar, Miguel Labrador
doaj  

On the depth of combinatorial optimization problems

Discrete Applied Mathematics, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Domination analysis of combinatorial optimization problems

Discrete Applied Mathematics, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gregory Z. Gutin, Alek Vainshtein, Anders Yeo   +2 more
openaire   +1 more source

Combinatorial optimization of permutation-based quadratic assignment problem using optics inspired optimization [PDF]

Journal of Applied Research on Industrial Engineering, 2019
A lot of real-world problems such as the assignment of special rooms in hospitals, operating room layout, image processing, etc., could be formulated in terms of Quadratic assignment problem. Different exact methods are suggested to solve these problems,
Soheila Badrloo, Ali Husseinzadeh Kashan
doaj   +1 more source