The vehicle routing problem with heterogeneous locker boxes
From MaRDI portal
Publication:2033310
DOI10.1007/s10100-020-00725-2OpenAlexW3118985022MaRDI QIDQ2033310
Jasmin Grabenschweiger, Richard F. Hartl, Karl F. Doerner, Savelsbergh, Martin W. P.
Publication date: 16 June 2021
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-020-00725-2
metaheuristicscity logisticshome deliveryalternative delivery locationscapacitated bin packingcapacity at delivery locationcompensation payment
Related Items (4)
Vehicle routing with private and shared delivery locations ⋮ Mobile parcel lockers with individual customer service ⋮ Last‐mile delivery with drone and lockers ⋮ A tribute to Rudolf vetschera
Cites Work
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- Heuristics for the variable sized bin-packing problem
- A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution
- Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): model and implementation using hybrid approach
- Heuristics and lower bounds for the bin packing problem with conflicts
- Algorithms for the variable sized bin packing problem
- An approximation scheme for bin packing with conflicts
- Optimizing the changing locations of mobile parcel lockers in last-mile distribution
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Variable Sized Bin Packing
- Least squares quantization in PCM
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
This page was built for publication: The vehicle routing problem with heterogeneous locker boxes
