An Ant-Based Heuristic for the Railway Traveling Salesman Problem.
Petrica C. PopCamelia-Mihaela PinteaCorina Pop SitarPublished in: EvoWorkshops (2007)
Keyphrases
- traveling salesman problem
- ant colony optimization
- combinatorial optimization
- lin kernighan
- traveling salesman
- benchmark instances
- variable neighborhood search
- neighborhood search
- minimum spanning tree
- combinatorial optimization problems
- combinatorial problems
- ant colony optimization algorithm
- transportation networks
- metaheuristic
- satisfy the triangle inequality
- swarm intelligence
- hamiltonian cycle
- path relinking
- neural network
- vehicle routing problem
- optimization problems
- simulated annealing
- optimal solution
- discrete optimization problems
- crossover operator
- branch and bound
- nature inspired
- discrete particle swarm optimization
- genetic local search
- valid inequalities
- aco algorithm
- mixed integer programming
- ant colony algorithm
- state space
- dynamic programming
- genetic algorithm