计算机工程与应用
計算機工程與應用
계산궤공정여응용
COMPUTER ENGINEERING AND APPLICATIONS
2010年
1期
7-10
,共4页
堆垛问题%堆场管理%装箱问题%约束满足%装箱启发式
堆垛問題%堆場管理%裝箱問題%約束滿足%裝箱啟髮式
퇴타문제%퇴장관리%장상문제%약속만족%장상계발식
stack selection problem%yard management%bin packing problem%constraint satisfaction%bin packing heuristics
入库堆垛问题普遍存在于堆场作业管理中,是在货物数目和出库顺序已知的前提下,要求较长(重)的货物置于较短(轻)的货物下方,目标是实现占用垛位数最少.通过问题分析,将其归结为一类带顺序约束的A形装箱问题,并建立了约束满足模型,设计了嵌入经典装箱启发式的约束满足求解算法.实验表明,该算法对于求解复杂约束下的大规模堆场问题较现有的装箱启发式有一定程度的改善.
入庫堆垛問題普遍存在于堆場作業管理中,是在貨物數目和齣庫順序已知的前提下,要求較長(重)的貨物置于較短(輕)的貨物下方,目標是實現佔用垛位數最少.通過問題分析,將其歸結為一類帶順序約束的A形裝箱問題,併建立瞭約束滿足模型,設計瞭嵌入經典裝箱啟髮式的約束滿足求解算法.實驗錶明,該算法對于求解複雜約束下的大規模堆場問題較現有的裝箱啟髮式有一定程度的改善.
입고퇴타문제보편존재우퇴장작업관리중,시재화물수목화출고순서이지적전제하,요구교장(중)적화물치우교단(경)적화물하방,목표시실현점용타위수최소.통과문제분석,장기귀결위일류대순서약속적A형장상문제,병건립료약속만족모형,설계료감입경전장상계발식적약속만족구해산법.실험표명,해산법대우구해복잡약속하적대규모퇴장문제교현유적장상계발식유일정정도적개선.
To deal with stack selection problem with the known item numbers and retrieval order during the loading process,in which the longest(and/or heaviest)incoming items are placed at the bouom in needed and the target is to occupy as few stacks as possible.This problem is reduced to an extension of bin packing problem named A-shaped bin packing problem with ordered constraint.This is a new combinatorial optimization problem which has many applications in practice,such as in warehousing stack entering in the yard management.A constraint satisfaction model is given,and a hybrid solving algorithm is designed based on constraint satisfaction technology embedding with Best-Fit approximation algorithm.Simulative examples illustrate the effectiveness of the proposed algorithm for large-scale storage yard problem with complex constraints over the existing bin packing heuristics.
