Minimising Total Costs of a Two-Echelon Multi-Depot Capacitated Vehicle Routing Problem (2E-MD-CVRP) that Describes the Utilisation of the Amsterdam City Canal Network for Last Mile Parcel Delivery.
Bartje AlewijnseAlexander HüblPublished in: APMS (4) (2021)
Keyphrases
- vehicle routing problem
- multi depot
- routing problem
- vehicle routing problem with time windows
- total cost
- optimal solution
- capacity constraints
- metaheuristic
- tabu search
- network flow
- lead time
- benchmark problems
- combinatorial optimization
- traveling salesman problem
- travel time
- network traffic
- multi item
- column generation
- memetic algorithm
- ant colony optimization
- optimization problems
- integer programming
- combinatorial optimization problems
- particle swarm optimization