Branch-and-price for the Multi-depot Pickup and Delivery Problem with Heterogeneous Fleet and Soft Time Windows.
Andrea BettinelliAlberto CeselliGiovanni RighiniPublished in: CTW (2010)
Keyphrases
- multi depot
- vehicle routing problem
- vehicle routing problem with time windows
- routing problem
- metaheuristic
- tabu search
- memetic algorithm
- benchmark problems
- traveling salesman problem
- np hard
- combinatorial optimization problems
- travel time
- combinatorial optimization
- scheduling problem
- particle swarm optimization
- simulated annealing
- optimization problems
- knapsack problem
- genetic algorithm
- ant colony optimization
- search space