VCS: A new heuristic function for selecting boxes in the single container loading problem

DOI10.1016/J.COR.2017.01.002zbMath1391.90040DBLPjournals/cor/ArayaGN17OpenAlexW2569397598WikidataQ56476020 ScholiaQ56476020MaRDI QIDQ1652261

Eduardo Nuñez, Keitel Guerrero, Ignacio J. Araya

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2017.01.002

zbMATH Keywords

combinatorial optimizationcontainer loading problemevaluation functionconstructive algorithmsload planing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (8)

Logistic constraints in container loading problems: the impact of complete shipment conditions ⋮ A matheuristic framework for the three-dimensional single large object placement problem with practical constraints ⋮ A beam search algorithm for the biobjective container loading problem ⋮ An efficient method for the three-dimensional container loading problem by forming box sizes ⋮ Modeling soft unloading constraints in the multi-drop container loading problem ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ The exact solutions of several types of container loading problems ⋮ A two-phase approach for single container loading with weakly heterogeneous boxes

Cites Work

• Unnamed Item
• A beam search approach to the container loading problem
• A simple randomized algorithm for two-dimensional strip packing
• A novel hybrid tabu search approach to container loading
• An efficient placement heuristic for three-dimensional rectangular packing
• A new heuristic algorithm for cuboids packing with no orientation constraints
• Weight distribution considerations in container loading
• Loading plates with non-identical items
• Packing small boxes into a big box.
• A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem
• MIP-based approaches for the container loading problem with multi-drop constraints
• Three-dimensional container loading models with cargo stability and load bearing constraints
• A parallel multi-population biased random-key genetic algorithm for a container loading problem
• An efficient deterministic heuristic for two-dimensional rectangular packing
• A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
• Neighborhood structures for the container loading problem: a VNS implementation
• A caving degree approach for the single container loading problem
• An improved typology of cutting and packing problems
• An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem
• A Tree Search Algorithm for Solving the Container Loading Problem
• A Maximal-Space Algorithm for the Container Loading Problem
• An Exact Algorithm for Higher-Dimensional Orthogonal Packing
• Multidimensional binary search trees used for associative searching
• A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
• A hybrid genetic algorithm for the container loading problem

This page was built for publication: VCS: A new heuristic function for selecting boxes in the single container loading problem