A quasi-human algorithm for solving the three-dimensional rectangular packing problem

DOI10.1007/s11432-010-4112-8zbMath1220.90108OpenAlexW2013927526MaRDI QIDQ543092

Kun He, Wenqi Huang

Publication date: 17 June 2011

Published in: Science China. Information Sciences (Search for Journal in Brave)

Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-010-4112-8

zbMATH Keywords

quasi-humanaction spacethree-dimensional packingNP hardcaving degree

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (2)

Solving the maximum vertex weight clique problem via binary quadratic programming ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review

Cites Work

• A pure quasi-human algorithm for solving the cuboid packing problem
• Neighborhood structures for the container loading problem: a VNS implementation
• A caving degree approach for the single container loading problem
• Three-dimensional packing of items with limited load bearing strength
• A Parallel Genetic Algorithm for Solving the Container Loading Problem
• The complexity of theorem-proving procedures
• A hybrid genetic algorithm for the container loading problem

This page was built for publication: A quasi-human algorithm for solving the three-dimensional rectangular packing problem