A metaheuristic for the double traveling salesman problem with partial last-in-first-out loading constraints.
Blas MardonesGustavo GaticaCarlos Contreras BoltonPublished in: Int. Trans. Oper. Res. (2023)
Keyphrases
- traveling salesman problem
- metaheuristic
- ant colony optimization
- combinatorial optimization
- combinatorial problems
- optimization problems
- path relinking
- vehicle routing problem
- combinatorial optimization problems
- variable neighborhood search
- nature inspired
- tabu search
- simulated annealing
- subtour elimination
- valid inequalities
- swarm intelligence
- benchmark instances
- genetic algorithm
- search space
- scatter search
- evolutionary algorithm
- crossover operator
- ant colony optimization algorithm
- search methods
- particle swarm optimization
- aco algorithm
- traveling salesman
- constraint satisfaction
- constraint programming
- minimum spanning tree
- graph coloring
- cost function
- hyper heuristics
- job shop scheduling problem
- constraint satisfaction problems
- optimal solution
- objective function
- dantzig wolfe