A unified matheuristic for solving multi-constrained traveling salesman problems with profits.
Rahma LahyaniMahdi KhemakhemFrédéric SemetPublished in: EURO J. Comput. Optim. (2017)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- discrete optimization problems
- hamiltonian cycle
- constrained problems
- combinatorial optimization problems
- combinatorial problems
- optimization problems
- metaheuristic
- ant colony optimization
- branch and bound algorithm
- graph coloring
- discrete optimization
- simulated annealing
- vehicle routing problem
- neural network
- branch and bound
- objective function