Constraint programming approach for spatial packaging problem

DOI10.1007/978-3-319-33954-2_23MaRDI QIDQ2815121zbMATH OpenOpenAlexFDO

Authors Abdelilah Sakti, Tarik Hadžić, Brian st. Rock, Giusi Quartarone, Lawrence E. Zeidner

Publication date 27 June 2016

Published in Integration of AI and OR Techniques in Constraint Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-33954-2_23

zbMATH Keywords

3D packing problemconstraint programmingpipe-routing problemspatial packaging problemtaxicab geometry

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 2050783
• A particular approach for the three-dimensional packing problem with additional constraints
• A global optimization approach for solving three-dimensional open dimension rectangular packing problems
• Layout optimization for the objects located within a rotating vessel -- a three-dimensional packing problem with behavioral constraints
• AN EFFICIENT APPROACH FOR THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM WITH PRACTICAL CONSTRAINTS

Cited in

(2)

• A pipe routing hybrid approach based on A-star search and linear programming
• Applying spatial representation techniques to the container packing problem

This page was built for publication: Constraint programming approach for spatial packaging problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2815121)