Fast Approximation Heuristics for Multi-Objective Vehicle Routing Problems.
Martin Josef GeigerPublished in: EvoApplications (2) (2010)
Keyphrases
- multi objective
- vehicle routing problem
- simulated annealing and tabu search
- tabu search
- vehicle routing problem with time windows
- particle swarm optimization
- metaheuristic
- evolutionary algorithm
- hyper heuristics
- multi objective optimization
- routing problem
- optimization algorithm
- genetic algorithm
- tree search algorithm
- traveling salesman problem
- test instances
- benchmark instances
- multiple objectives
- objective function
- search strategies
- exact algorithms
- greedy randomized adaptive search procedure
- guided local search
- waste collection
- multiobjective optimization
- nsga ii
- benchmark problems
- knapsack problem
- heuristic search
- heuristic methods
- approximation algorithms
- memetic algorithm
- search algorithm
- bi objective
- simulated annealing
- combinatorial optimization
- pick up and delivery
- np hard
- search heuristics
- optimization problems
- evolutionary computation
- multi depot
- test problems
- scheduling problem
- scatter search
- path relinking
- variable neighborhood search
- lower bound
- search methods
- feasible solution