A Population-Based Local Search for Solving a Bi-objective Vehicle Routing Problem.
Joseph M. PasiaKarl F. DoernerRichard F. HartlMarc ReimannPublished in: EvoCOP (2007)
Keyphrases
- vehicle routing problem
- combinatorial optimization
- bi objective
- routing problem
- metaheuristic
- ant colony optimization
- tabu search
- simulated annealing
- memetic algorithm
- traveling salesman problem
- combinatorial optimization problems
- iterated local search
- multi objective
- efficient solutions
- vehicle routing problem with time windows
- optimization problems
- multi objective optimization
- shortest path problem
- travel time
- particle swarm optimization
- branch and bound
- hybrid metaheuristic
- neighborhood search
- benchmark instances
- knapsack problem
- genetic algorithm
- network design
- greedy randomized adaptive search procedure
- vehicle routing problem with simultaneous
- branch and bound algorithm
- job shop scheduling problem
- variable neighborhood search
- path relinking
- optimal solution
- benchmark problems
- evolutionary algorithm
- neural network
- pick up and delivery
- search algorithm
- nsga ii
- differential evolution
- single machine scheduling problem
- np hard
- search methods
- exact algorithms
- multiple objectives
- heuristic methods