Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning
DOI10.1016/J.COR.2021.105308OpenAlexW3152042512MaRDI QIDQ2668752FDOQ2668752
Authors: Teodor Gabriel Crainic, Franklin Djeumou Fomeni, Walter Rei 
Publication date: 7 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2021.105308
Recommendations
- Logistics capacity planning: a stochastic bin packing formulation and a progressive hedging meta-heuristic
- A generalized bin packing problem for parcel delivery in last-mile logistics
- A branch-and-price algorithm for the temporal bin packing problem
- Bin‐packing problem with concave costs of bin utilization
- A tailored two-phase constructive heuristic for the three-dimensional multiple bin size bin packing problem with transportation constraints
integer programmingconsolidationlogistics capacity planningconstructive heuristicsitem-to-bin assignment costsmulti-period variable size and cost bin packing
Cites Work
- Title not available (Why is that?)
- An improved typology of cutting and packing problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms for the variable sized bin packing problem
- Assembly line balancing as generalized bin packing
- Parallel machine problems with equal processing times: a survey
- A typology of cutting and packing problems
- The two-dimensional bin packing problem with variable bin sizes and costs
- Accelerating column generation for variable sized bin-packing problems
- Title not available (Why is that?)
- Solving the variable size bin packing problem with discretized formulations
- Logistics capacity planning: a stochastic bin packing formulation and a progressive hedging meta-heuristic
- Bin packing and related problems: general arc-flow formulation with graph compression
- Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items
- Combinatorial optimization. Theory and applications.
- Exactly solving packing problems with fragmentation
- Collaboration among small shippers in a transportation market
- On the complexity of assembly line balancing problems
- Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
- A generalized bin packing problem for parcel delivery in last-mile logistics
- Irregular packing problems: a review of mathematical models
- A branch-and-price algorithm for the temporal bin packing problem
- Multi-objective temporal bin packing problem: an application in cloud computing
- Compact integer linear programming formulations for the temporal bin packing problem with fire-ups
Cited In (6)
- Benders decomposition for robust distribution network design and operations in online retailing
- A dynamic packing approach for Internet-of-Things and logistics applications
- A generalized bin packing problem for parcel delivery in last-mile logistics
- Packing chained items in aligned bins with applications to container transshipment and project scheduling
- Logistics capacity planning: a stochastic bin packing formulation and a progressive hedging meta-heuristic
- Worst-case analysis of heuristic approaches for the temporal bin packing problem with fire-ups
Uses Software
This page was built for publication: Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2668752)
