Three Dimensional Packing Algorithm with Consideration of Loading and Unloading Order

Naoki Kobatake, Hidenori Ohta, Mario Nakamori

2013

Abstract

A novel packing problem for truck or containership transportation is considered. A truck or a ship visits several accumulation places in a delivery tour, and items are loaded or unloaded at each accumulation place. In order to carry items as many as possible at one delivery tour, we often have to unpack and repack some items even at nondestination places if they blockade loading other items. Such packing and repacking, however, will make the transportation cost increase. Thus, a packing that requirs smaller number of unpacking and repacking is desired. In this paper, we extend the slicing-tree which is a method of a representation of packing and propose an algorithm to pack items into the container with minimum the number of unpacking and re-packing.

References

  1. S. D. Allen et al., 2011. A hybrid placement strategy for the three-dimensional strip packing problem, European Journal of Operational Research, Vol. 209, pp.219-227.
  2. L. Cheng et al., 2004, Floorplan Design for 3-D ICs, Proc. SASIMI, pp.395-401.
  3. G. Fuellerer et al., 2010. Metaheuristics for vehicle routing problems with three-dimensional loading constraints, European Journal of Operational Research, Vol. 201, pp.751-759.
  4. H. Kawashima et al., 2010, An efficient implementation of a constructive algorithm for the three-dimensional packing problem, Forum of Information Technology 2010 (FIT2010) Vol. 1,pp.31-38.
  5. F. K. Miyazawa, and Y. Wakabayashi, 2009, "Threedimensional packings with rotations," Computers & Operations Research, Vol. 36, pp.2801-2815.
  6. H. Ohta et al., 2008. The O-Sequence: Representation of 3D-Dissection, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E91-A, pp.2111-2119.
Download


Paper Citation


in Harvard Style

Kobatake N., Ohta H. and Nakamori M. (2013). Three Dimensional Packing Algorithm with Consideration of Loading and Unloading Order . In Proceedings of the 2nd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-8565-40-2, pages 264-269. DOI: 10.5220/0004277502640269


in Bibtex Style

@conference{icores13,
author={Naoki Kobatake and Hidenori Ohta and Mario Nakamori},
title={Three Dimensional Packing Algorithm with Consideration of Loading and Unloading Order},
booktitle={Proceedings of the 2nd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2013},
pages={264-269},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004277502640269},
isbn={978-989-8565-40-2},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 2nd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - Three Dimensional Packing Algorithm with Consideration of Loading and Unloading Order
SN - 978-989-8565-40-2
AU - Kobatake N.
AU - Ohta H.
AU - Nakamori M.
PY - 2013
SP - 264
EP - 269
DO - 10.5220/0004277502640269