A generalized bin packing problem for parcel delivery in last-mile logistics
From MaRDI portal
Publication:1755394
DOI10.1016/j.ejor.2018.10.056zbMath1430.90051OpenAlexW2899000355WikidataQ128977075 ScholiaQ128977075MaRDI QIDQ1755394
Mauro Maria Baldi, Daniele Manerba, Roberto Tadei, Guido Perboli
Publication date: 9 January 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.10.056
Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Related Items
Homogeneous grouping of non-prime steel products for online auctions: a case study ⋮ Compact integer linear programming formulations for the temporal bin packing problem with fire-ups ⋮ Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning ⋮ Two-echelon collaborative routing problem with heterogeneous crowd-shippers ⋮ Robust planning of sorting operations in express delivery systems ⋮ A branch-and-bound approach for a vehicle routing problem with customer costs
Uses Software
Cites Work
- Unnamed Item
- Logistics capacity planning: a stochastic bin packing formulation and a progressive hedging meta-heuristic
- The stochastic generalized bin packing problem
- Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items
- Relaxations and exact solution of the variable sized bin packing problem
- New bin packing fast lower bounds
- Heuristics for the variable sized bin-packing problem
- Algorithms for packing and scheduling problems. (Abstract of thesis)
- New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty
- Scheduling last-mile deliveries with truck-based autonomous robots
- A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution
- Product allocation to different types of distribution center in retail logistics networks
- The traveling purchaser problem and its variants
- Variable neighbourhood search for the variable sized bin packing problem
- Optimal quoting of delivery time by a third party logistics provider: the impact of shipment consolidation and temporal pricing schemes
- Efficient algorithms for the offline variable sized bin-packing problem
- The multi-Handler knapsack problem under uncertainty
- Computing the asymptotic worst-case of bin packing lower bounds
- Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
- Variable Sized Bin Packing
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- The capacitated transshipment location problem with stochastic handling utilities at the facilities
