Nature-Inspired Metaheuristic Techniques for Combinatorial Optimization Problems: Overview and Recent Advances
Combinatorial optimization problems are often considered NP-hard problems in the field of decision science and the industrial revolution. As a successful transformation to tackle complex dimensional problems, metaheuristic algorithms have been implemented in a wide area of combinatorial optimization...
Main Authors: | Md Ashikur Rahman, Rajalingam Sokkalingam, Mahmod Othman, Kallol Biswas, Lazim Abdullah, Evizal Abdul Kadir |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-10-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/9/20/2633 |
Similar Items
-
The retrace traveling salesman problem : a new extension of traveling salesman problem /
by: 212543 Juraidawati Arbain
Published: (2003) -
The retrace traveling salesman problem : a new extension of traveling salesman problem [compact disc] /
by: 212543 Juraidawati Arbain
Published: (2003) -
The retrace traveling salesman problem : a new extension of traveling salesman problem [microfilm] /
by: Juraidawati Arbain
Published: (2003) -
Combinatorial Optimization Problems and Metaheuristics: Review, Challenges, Design, and Development
by: Fernando Peres, et al.
Published: (2021-07-01) -
Selected Genetic Algorithms for Vehicle Routing Problem Solving
by: Joanna Ochelska-Mierzejewska, et al.
Published: (2021-12-01)