Modelling and algorithm for the slab designing problem based on constraint satisfaction
-
摘要: 針對客戶訂單的重量需求為固定值、客戶訂單分配過程中有最小重量限制的板坯設計問題,建立了以最小化板坯數量為目標的約束滿足模型.通過三劃分問題的多項式歸結,證明了該問題是強NP難的;針對問題的特殊性質,給出了變量選擇策略和值選擇策略;提出了基于約束滿足技術的求解算法,并證明了算法的收斂性;通過數據實驗對算法的有效性進行了驗證.Abstract: A constraint satisfaction model whose objective is to minimize the slab number was built for slab production in consideration of the slab designing problem with a fixed demand of order weight and a minimum limitation of order weight assigned in one slab. The problem was proved to be NP-hard by reducing a known NP-hard three-partition problem to the discussed problem in polynomial time. Concerning with special characteristics of the problem, variable selection strategies and value selection strategies were presented. A constraint-satisfaction-based algorithm was proposed and it was proved to be convergent. The effectiveness of the proposed algorithm was verified with simulation experiments.
-
Key words:
- hot rolling /
- slabs /
- production planning /
- constraint satisfaction /
- variable selection /
- value selection
-

計量
- 文章訪問數: 150
- HTML全文瀏覽量: 32
- PDF下載量: 5
- 被引次數: 0