A hybrid genetic algorithm with a new packing strategy for the three-dimensional bin packing problem
From MaRDI portal
Publication:2449252
DOI10.1016/j.amc.2012.07.036zbMath1286.90084MaRDI QIDQ2449252
Kyungdaw Kang, Hongfeng Wang, Il-Kyeong Moon
Publication date: 7 May 2014
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2012.07.036
optimization; genetic algorithm; heuristic algorithm; container loading problem; bin packing problem
Related Items
An integer program and a hybrid genetic algorithm for the university timetabling problem, The split delivery vehicle routing problem with time windows and three-dimensional loading constraints, Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review, The forgotten sons: warehousing systems for brick-and-mortar retail chains, Effective loading in combined vehicle routing and container loading problems, An AIMMS-based decision-making model for optimizing the intelligent stowage of export containers in a single bay, The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers, A comparative review of 3D container loading algorithms
Cites Work
- Unnamed Item
- Loading plates with non-identical items
- On genetic algorithms for the packing of polygons
- Three-dimensional packing of items with limited load bearing strength
- A Tree Search Algorithm for Solving the Container Loading Problem
- A Parallel Genetic Algorithm for Solving the Container Loading Problem
- A Genetic Algorithm for Solving the Container Loading Problem
- Orthogonal Packings in Two Dimensions
- A hybrid genetic algorithm for the container loading problem