The multiple container loading problem with preference

DOI10.1016/j.ejor.2015.07.002zbMath1346.90523OpenAlexW1431896391MaRDI QIDQ320625

Tian Tian, Lijun Wei, Wenbin Zhu, Andrew E. B. Lim

Publication date: 7 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.07.002

zbMATH Keywords

combinatorial optimizationpackingstatistical estimationdecision support

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (9)

A heuristic algorithm for container loading of pallets with infill boxes ⋮ A beam search algorithm for the biobjective container loading problem ⋮ An efficient method for the three-dimensional container loading problem by forming box sizes ⋮ Minimizing late deliveries in a truck loading problem ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ Formalizing spatial configuration optimization problems with the use of a special function class ⋮ The exact solutions of several types of container loading problems ⋮ A two-phase approach for single container loading with weakly heterogeneous boxes

Uses Software

• Packlib2
• Ts2pack

Cites Work

• Unnamed Item
• A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem
• A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
• A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
• The multiple container loading cost minimization problem
• A tree search method for the container loading problem with shipment priority
• An efficient placement heuristic for three-dimensional rectangular packing
• An efficient approach for the multi-pallet loading problem
• Heuristics for the container loading problem
• Solving container loading problems by block arrangement
• Heuristic algorithms for the three-dimensional bin packing problem
• A bottleneck assignment approach to the multiple container loading problem
• A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
• A prototype column generation strategy for the multiple container loading problem
• Neighborhood structures for the container loading problem: a VNS implementation
• Constraints in container loading -- a state-of-the-art review
• TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
• A caving degree approach for the single container loading problem
• An improved typology of cutting and packing problems
• PackLib\(^{2}\): an integrated library of multi-dimensional packing problems
• Guided Local Search for the Three-Dimensional Bin-Packing Problem
• A Tree Search Algorithm for Solving the Container Loading Problem
• Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
• A parallel hybrid local search algorithm for the container loading problem
• A Genetic Algorithm for Solving the Container Loading Problem
• The Three-Dimensional Bin Packing Problem
• An AND/OR-graph approach to the container loading problem
• A hybrid genetic algorithm for the container loading problem

This page was built for publication: The multiple container loading problem with preference