A caving degree approach for the single container loading problem

From MaRDI portal
Publication:2378453

DOI10.1016/j.ejor.2008.02.024zbMath1161.90013OpenAlexW2166690783MaRDI QIDQ2378453

Wenqi Huang, Kun He

Publication date: 8 January 2009

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

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




Related Items

A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi HuangAn efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industryThe multiple container loading problem with preferenceA heuristic algorithm for container loading of pallets with infill boxesVCS: A new heuristic function for selecting boxes in the single container loading problemA new heuristic algorithm for the circular packing problem with equilibrium constraintsCorner occupying theorem for the two-dimensional integral rectangle packing problemA novel hybrid tabu search approach to container loadingAn efficient method for the three-dimensional container loading problem by forming box sizesConsideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature reviewThree-dimensional container loading models with cargo stability and load bearing constraintsA quasi-human algorithm for solving the three-dimensional rectangular packing problemAn efficient placement heuristic for three-dimensional rectangular packingThree-stage heuristic algorithm for three-dimensional irregular packing problemWeight distribution in container loading: a case studyA comparative review of 3D container loading algorithmsOptimization Models for the Three-Dimensional Container Loading Problem with Practical ConstraintsConstraints in container loading -- a state-of-the-art review


Uses Software


Cites Work