Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning

DOI10.1016/J.COR.2021.105308MaRDI QIDQ2668752zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

integer programmingconsolidationlogistics capacity planningconstructive heuristicsitem-to-bin assignment costsmulti-period variable size and cost bin packing

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

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

Cites work

• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 3550182 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1175962 (Why is no real title available?)
• A branch-and-price algorithm for the temporal bin packing problem
• A generalized bin packing problem for parcel delivery in last-mile logistics
• A typology of cutting and packing problems
• Accelerating column generation for variable sized bin-packing problems
• Algorithms for the variable sized bin packing problem
• An improved typology of cutting and packing problems
• Assembly line balancing as generalized bin packing
• 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
• Collaboration among small shippers in a transportation market
• Combinatorial optimization. Theory and applications.
• Compact integer linear programming formulations for the temporal bin packing problem with fire-ups
• Exactly solving packing problems with fragmentation
• Irregular packing problems: a review of mathematical models
• Logistics capacity planning: a stochastic bin packing formulation and a progressive hedging meta-heuristic
• Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
• Multi-objective temporal bin packing problem: an application in cloud computing
• On the complexity of assembly line balancing problems
• Parallel machine problems with equal processing times: a survey
• Solving the variable size bin packing problem with discretized formulations
• The two-dimensional bin packing problem with variable bin sizes and costs

Cited in

(6)

• Worst-case analysis of heuristic approaches for the temporal bin packing problem with fire-ups
• Benders decomposition for robust distribution network design and operations in online retailing
• A dynamic packing approach for Internet-of-Things and logistics applications
• 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
• Packing chained items in aligned bins with applications to container transshipment and project scheduling

Describes a project that uses

Uses Software

• CPLEX

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)