Constraint Satisfaction Technology for Stacking Problem with Ordered Constraints

The stacking problem with ordered constraints (SPOC) is a typical combinatorial optimization problem and NP-hard character. In order to simplify problem, it is treated as a constraint satisfaction problem. A constraint satisfaction model is given. A hybrid solving algorithm is designed based on cons...

Full description

Saved in:
Bibliographic Details
Main Authors: Hou, Dong-liang, Chen, Fang-rong
Format: Conference Proceeding
Language:English
Subjects:
bin packing problem
constraint satisfaction
stacking problem
yard management
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The stacking problem with ordered constraints (SPOC) is a typical combinatorial optimization problem and NP-hard character. In order to simplify problem, it is treated as a constraint satisfaction problem. A constraint satisfaction model is given. A hybrid solving algorithm is designed based on constraint satisfaction and Best-Fit approximation algorithm. The validity of the proposed solving algorithm is demonstrated by numerical simulation experiment from the production data in container yard.
ISSN:1877-7058
1877-7058
DOI:10.1016/j.proeng.2012.01.487