Constraint Satisfaction Technology for Stacking Problem with Ordered Constraints
| Autor: | Fang-rong Chen, Dong-liang Hou |
|---|---|
| Rok vydání: | 2012 |
| Předmět: |
Complexity of constraint satisfaction
Mathematical optimization Backtracking constraint satisfaction General Medicine Constraint satisfaction bin packing problem stacking problem Constraint satisfaction dual problem Constraint logic programming Local consistency yard management Decomposition method (constraint satisfaction) Engineering(all) Constraint satisfaction problem Mathematics |
| Zdroj: | Procedia Engineering. 29:3317-3321 |
| ISSN: | 1877-7058 |
| DOI: | 10.1016/j.proeng.2012.01.487 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|