A parallel multi-population biased random-key genetic algorithm for a container loading problem

DOI10.1016/j.cor.2011.03.009zbMath1251.90238MaRDI QIDQ1761962

José Fernando Gonçalves, Mauricio G. C. Resende

Publication date: 15 November 2012

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

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

zbMATH Keywords

genetic algorithm; container loading; 3D packing; multi-population; random keys

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90B80: Discrete location and assignment

Related Items

Optimization Models for the Three-Dimensional Container Loading Problem with Practical Constraints, A Genetic Algorithm for Scheduling Alternative Tasks Subject to Technical Failure, An efficient method for the three-dimensional container loading problem by forming box sizes, The double traveling salesman problem with partial last‐in‐first‐out loading constraints, 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 biased random‐key genetic algorithm for the home health care problem, A biased random-key genetic algorithm for the unequal area facility layout problem, A biased random-key genetic algorithm for the capacitated minimum spanning tree problem, A heuristic algorithm for a supply chain's production-distribution planning, A biased random-key genetic algorithm for the container pre-marshalling problem, A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks, A Python/C++ library for bound-constrained global optimization using a biased random-key genetic algorithm, Sharing loading costs for multi compartment vehicles, VCS: A new heuristic function for selecting boxes in the single container loading problem, A new load balance methodology for container loading problem in road transportation, A global search framework for practical three-dimensional packing with variable carton orientations, Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems, A biased random-key genetic algorithm for the set orienteering problem, A beam search algorithm for the biobjective container loading problem, A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects, A two-phase approach for single container loading with weakly heterogeneous boxes, Constraints in container loading -- a state-of-the-art review, The dial-a-ride problem with private fleet and common carrier, A biased random-key genetic algorithm for the minimization of open stacks problem, A physical packing sequence algorithm for the container loading problem with static mechanical equilibrium conditions, A comparative review of 3D container loading algorithms, A two-stage packing problem procedure

Cites Work

• Unnamed Item
• Unnamed Item
• Weight distribution considerations in container loading
• Loading plates with non-identical items
• An efficient approach for the multi-pallet loading problem
• A genetic algorithm for the weight setting problem in OSPF routing
• Heuristics for the container loading problem
• Solving container loading problems by block arrangement
• Neighborhood structures for the container loading problem: a VNS implementation
• A genetic algorithm for the resource constrained multi-project scheduling problem
• A hybrid genetic algorithm for the job shop scheduling problem
• Three-dimensional packing of items with limited load bearing strength
• An improved typology of cutting and packing problems
• A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
• A Tree Search Algorithm for Solving the Container Loading Problem
• A Maximal-Space Algorithm for the Container Loading Problem
• A Parallel Genetic Algorithm for Solving the Container Loading Problem
• A parallel hybrid local search algorithm for the container loading problem
• Survivable IP network design with OSPF routing
• Solving the single-container loading problem by a fast heuristic method
• A Genetic Algorithm for Solving the Container Loading Problem
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Approximate algorithms for the container loading problem
• The Three-Dimensional Bin Packing Problem
• An AND/OR-graph approach to the container loading problem
• Loading Multiple Pallets
• A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing
• A hybrid genetic algorithm for the container loading problem