The two-echelon vehicle routing problem with covering options: City logistics with cargo bikes and parcel lockers.
David L. J. U. EnthovenBolor JargalsaikhanKees Jan RoodbergenMichiel A. J. uit het BroekAlbert H. SchrotenboerPublished in: Comput. Oper. Res. (2020)
Keyphrases
- vehicle routing problem
- multi depot
- logistics distribution
- supply chain
- vehicle routing
- vehicle routing problem with time windows
- metaheuristic
- tabu search
- routing problem
- travel time
- search strategies
- traveling salesman problem
- benchmark problems
- test instances
- urban areas
- hybrid metaheuristic
- np hard
- benchmark instances
- combinatorial optimization
- memetic algorithm
- particle swarm optimization
- iterated local search
- scheduling problem
- pick up and delivery
- greedy randomized adaptive search procedure
- lead time
- variable neighborhood search
- genetic algorithm
- information retrieval
- special case
- search space
- lower bound