Investigation of the impact of different versions of GCC on various metaheuristic-based solvers for traveling salesman problem.
Deniz DalEsra CelikPublished in: J. Supercomput. (2023)
Keyphrases
- traveling salesman problem
- metaheuristic
- ant colony optimization
- combinatorial optimization
- optimization problems
- path relinking
- combinatorial optimization problems
- variable neighborhood search
- combinatorial problems
- vehicle routing problem
- tabu search
- simulated annealing
- benchmark instances
- scatter search
- search space
- ant colony optimization algorithm
- evolutionary algorithm
- nature inspired
- optimal solution
- branch and bound
- genetic algorithm
- branch and bound algorithm
- particle swarm optimization
- mathematical programming
- search methods
- aco algorithm
- quadratic assignment problem
- crossover operator
- routing problem
- minimum spanning tree
- hyper heuristics
- cost function
- linear programming
- benchmark problems
- aco algorithms
- traveling salesman
- exact algorithms
- swarm intelligence
- objective function