http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
라벨 가시성 제약을 고려하는 팔레트 적재문제와 직사각 적재문제를 위한 새로운 발견적 해법
윤기섭(Kiseop Yoon),이종섭(Jongsub Lee) 한국SCM학회 2015 한국SCM학회지 Vol.15 No.2
The pallet loading problem (PLP), which is a typical combinatorial optimization problem, seeks to find a way of loading the maximum number of identical items on a single rectangular pallet. If the number of types of items is more than one, it is a rectangle packing problem (RPP). In this paper, two heuristic algorithms are proposed for the pallet loading problem and rectangle packing problem with label visibility constraint. The constraint of label visibility means that the item labels must be visible from the outside of the pallets to allow to be scanned prior to unloading. We first propose an algorithm for the pallet loading problem which concerns the identical item. Then an algorithm for the rectangle packing problem is proposed using the algorithm for the pallet loading problem. Computational results show that the proposed algorithm can be successfully applied to the real world problems occurred in the industry of warehousing and logistics.