A hybrid dynamic programming and memetic algorithm to the Traveling Salesman Problem with Hotel Selection.
Yongliang LuUna BenlicQinghua WuPublished in: Comput. Oper. Res. (2018)
Keyphrases
- traveling salesman problem
- memetic algorithm
- crossover operator
- combinatorial optimization
- vehicle routing problem
- dynamic programming
- benchmark instances
- ant colony optimization
- tabu search
- combinatorial optimization problems
- optimization problems
- timetabling problem
- travel time
- metaheuristic
- combinatorial problems
- ant colony optimization algorithm
- traveling salesman
- hamiltonian cycle
- evolutionary computation
- branch and bound
- simulated annealing
- state space
- job shop scheduling problem
- neural network
- branch and bound algorithm
- markov decision processes
- reinforcement learning
- subtour elimination
- genetic local search
- linear programming
- genetic algorithm