Solving the team orienteering problem with time windows and mandatory visits by multi-start simulated annealing.
Shih-Wei LinVincent F. YuPublished in: Comput. Ind. Eng. (2017)
Keyphrases
- multi start
- metaheuristic
- simulated annealing
- tabu search
- vehicle routing problem
- combinatorial optimization
- path relinking
- iterated local search
- variable neighborhood descent
- traveling salesman problem
- scatter search
- vehicle routing problem with time windows
- ant colony optimization
- evolutionary algorithm
- solution space
- genetic algorithm
- search procedure
- solution quality
- benchmark problems
- stochastic approximation
- combinatorial problems
- memetic algorithm
- search space
- routing problem
- optimization problems
- branch and bound
- heuristic methods
- neural network
- global optimization
- hill climbing
- search heuristics
- heuristic search
- particle swarm optimization
- scheduling problem
- feasible solution
- computational complexity