Exact hybrid algorithms for solving a bi-objective vehicle routing problem.
Peter ReiterWalter J. GutjahrPublished in: Central Eur. J. Oper. Res. (2012)
Keyphrases
- hybrid algorithms
- vehicle routing problem
- bi objective
- metaheuristic
- routing problem
- ant colony optimization
- tabu search
- knapsack problem
- combinatorial optimization
- multi objective
- efficient solutions
- hybrid algorithm
- traveling salesman problem
- simulated annealing
- shortest path problem
- combinatorial optimization problems
- travel time
- particle swarm optimization
- variable neighborhood search
- optimization problems
- benchmark problems
- search space
- genetic algorithm
- multi objective optimization
- multiple objectives
- optimal solution
- np hard
- neighborhood search
- vehicle routing problem with simultaneous
- nsga ii
- search strategies
- artificial neural networks
- hill climbing
- network design
- optimization algorithm
- dynamic programming
- evolutionary algorithm
- branch and bound algorithm
- computational efficiency