A Parallel Genetic Algorithm for Solving the Container Loading Problem
From MaRDI portal
Publication:3148106
DOI10.1111/1475-3995.00369zbMath1008.90001OpenAlexW2155404110MaRDI QIDQ3148106
Hermann Gehring, Andreas Bortfeldt
Publication date: 30 September 2002
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/1475-3995.00369
Applications of mathematical programming (90C90) Transportation, logistics and supply chain management (90B06)
Related Items
A parallel hybrid local search algorithm for the container loading problem, Logistic constraints in container loading problems: the impact of complete shipment conditions, A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem, An integrated approach to the vehicle routing and container loading problems, A caving degree approach for the single container loading problem, A heuristic algorithm for container loading of pallets with infill boxes, A hybrid approach for the vehicle routing problem with three-dimensional loading constraints, On a hybrid genetic algorithm for solving the container loading problem with no orientation constraints, A new iterative-doubling greedy-lookahead algorithm for the single container loading problem, A prototype column generation strategy for the multiple container loading problem, Systematic reviews as a metaknowledge tool: caveats and a review of available options, The static stability of support factor‐based rectangular packings: an assessment by regression analysis, The container loading problem with cargo stability: a study on support factors, mechanical equilibrium and grids, A tree search method for the container loading problem with shipment priority, Metaheuristics for truck loading in the car production industry, Solving packing problems by a distributed global optimization algorithm, A hybrid genetic algorithm with a new packing strategy for the three-dimensional bin packing problem, A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach, Graph Coloring Models and Metaheuristics for Packing Applications, Numerical optimization method for packing regular convex polygons, Analysing trade‐offs in container loading: combining load plan construction heuristics with agent‐based simulation, A global search framework for practical three-dimensional packing with variable carton orientations, 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, A fast heuristic for a three-dimensional non-convex domain loading problem, A quasi-human algorithm for solving the three-dimensional rectangular packing problem, A pure quasi-human algorithm for solving the cuboid packing problem, Neighborhood structures for the container loading problem: a VNS implementation, An efficient placement heuristic for three-dimensional rectangular packing, Sparsest balanced packing of irregular 3D objects in a cylindrical container, Weight distribution in container loading: a case study, A comparative review of 3D container loading algorithms, Heuristics for container loading of furniture, Three-dimensional packing of items with limited load bearing strength, Optimization Models for the Three-Dimensional Container Loading Problem with Practical Constraints, Constraints in container loading -- a state-of-the-art review
