Improving Time Efficiency of a Hierarchical Metaheuristic for the Euclidean TSP using Crossed Cubes Interconnection Networks.
Aymen Takie Eddine SelmiMohamed Faouzi ZerarkaAbdelhakim CherietSmain FemmamPublished in: EBIMCS (2023)
Keyphrases
- metaheuristic
- ant colony optimization
- combinatorial optimization
- optimization problems
- search space
- traveling salesman problem
- optimal solution
- genetic algorithm
- simulated annealing
- tabu search
- interconnection networks
- scatter search
- path relinking
- aco algorithms
- multistage
- particle swarm optimization
- vehicle routing problem
- aco algorithm
- variable neighborhood search
- evolutionary algorithm
- set of benchmark instances
- fault tolerant
- branch and bound algorithm
- iterated local search
- knapsack problem
- distributed systems
- routing algorithm
- search algorithm
- end to end
- guided local search
- ant colony optimization metaheuristic