Solving permutational routing problems by population-based metaheuristics.
Wojciech BozejkoMieczyslaw WodeckiPublished in: Comput. Ind. Eng. (2009)
Keyphrases
- routing problem
- combinatorial optimization
- vehicle routing problem
- scatter search
- traveling salesman problem
- particle swarm optimization
- variable neighborhood search
- metaheuristic
- vehicle routing problem with time windows
- vehicle routing
- simulated annealing
- travel time
- resource constraints
- optimization problems
- search procedures
- np hard
- cutting plane algorithm
- multi depot
- routing algorithm
- depth first search
- real time
- genetic algorithm
- benchmark instances
- branch and bound
- tabu search
- digital libraries