A comprehensive review on NSGA-II for multi-objective combinatorial optimization problems
This paper provides an extensive review of the popular multi-objective optimization
algorithm NSGA-II for selected combinatorial optimization problems viz. assignment …
algorithm NSGA-II for selected combinatorial optimization problems viz. assignment …
A decomposition-based many-objective ant colony optimization algorithm with adaptive solution construction and selection approaches
H Zhao, C Zhang, X Zheng, C Zhang… - Swarm and Evolutionary …, 2022 - Elsevier
The ant colony optimization algorithm (ACO) had an exceptional performance in solving
discrete optimization problems because of its design in solution construction and search …
discrete optimization problems because of its design in solution construction and search …
A scheme library-based ant colony optimization with 2-opt local search for dynamic traveling salesman problem
The dynamic traveling salesman problem (DTSP) is significant in logistics distribution in real-
world applications in smart cities, but it is uncertain and difficult to solve. This paper …
world applications in smart cities, but it is uncertain and difficult to solve. This paper …
Finding the global optimal solution in dynamic multiple TSPTW with data-driven ACO
Dynamic Travelling Salesman Problem (D-TSP) is a classic dynamic optimization problem
(DOP), which aims to maintain the optimal route with every change of the graph. D-TSP often …
(DOP), which aims to maintain the optimal route with every change of the graph. D-TSP often …