A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading.
Marilène CherkeslyGuy DesaulniersGilbert LaportePublished in: Comput. Oper. Res. (2015)
Keyphrases
- metaheuristic
- vehicle routing problem
- simulated annealing
- combinatorial optimization
- particle swarm optimization
- tabu search
- traveling salesman problem
- ant colony optimization
- vehicle routing
- scatter search
- vehicle routing problem with time windows
- routing problem
- optimization problems
- genetic algorithm
- search space
- hybrid metaheuristic
- benchmark instances
- travel time
- solution space
- iterated local search
- mathematical programming
- optimal solution
- path relinking
- evolutionary algorithm
- harmony search
- swarm intelligence
- benchmark problems
- branch and bound
- multi start
- variable neighborhood search
- nature inspired
- memetic algorithm
- differential evolution
- neural network
- greedy randomized adaptive search procedure
- search procedure
- cost function
- max min
- artificial bee colony
- job shop scheduling problem
- column generation
- integer programming
- global optimization
- metaheuristic algorithms
- genetic algorithm ga