On the three-dimensional container packing problem under home delivery service

Asia-Pacific Journal of Operational Research

Volumn 28, Issue 5, 2011, Pages 601-621

  Liu, Wan Yu ^a   Lin, Chun Cheng ^b   Yu, Chang Sung ^c  

^a ALETHEIA UNIVERSITY   (Taiwan)

^b NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^c NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Container packing problem; home delivery; logistics; transportation

Indexed keywords

COST DRIVERS; HOME DELIVERY; HOME DELIVERY SERVICES; PACKING PROBLEMS; RECTANGULAR CONTAINERS; UTILIZATION RATES;

THREE DIMENSIONAL; UNLOADING;

CONTAINERS;

EID: 80855139340     PISSN: 02175959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0217595911003466     Document Type: Article

References (25)

1. Abdou, G and M Elmasry (1999). 3D random stacking of weakly heterogeneous palletization problems. International Journal of Production Research, 37, 1505-1524.
2. Abdou, G and M Yang (1994). A systematic approach for the three dimensional palletization problems. International Journal of Production Research, 32, 2381-2394.
3. Beasley, J (1985). An exact two-dimensional non-cutting tree search procedure. Operations Research, 33, 49-64. (Pubitemid 15475049)
4. Beasley, J (1990). OR-library: Distributing test problems by electronic mail. Journal of the Operational Research Society, 41, 1069-1072.
5. Bischoff, E and M Ratcliff (1995). Issues in the development of approaches to container loading. Omega-International Journal of Management Sciences, 23, 377-390.
6. Bortfeldt, A, H Gehring, and D Mack (2003). A parallel tabu search algorithm for solving the container loading problem. Parallel Computing, 29, 641-662.
7. Cormen, T, C Leiserson, R Rivest, and C Stein (2002). Introduction to Algorithms, 2nd edn. Boston, MA: MIT Press.
8. Fanslau, T and A Bortfeldt (2009). A tree search algorithm for solving the container loading problem. INFORMS Journal on Computing. In press.
9. Garey, M and D Johnson (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: Freeman.
10. Gehring, H and A Bortfeldt (1997). A genetic algorithm for solving the container loading problem. International Transactions on Operational Research, 4, 401-418.
11. George, J and D Robinson (1980). A heuristic for packing boxes into a container. Computers and Operations Research, 7, 147-156.
12. Gilmore, P and R Gomory (1965). Multistage cutting stock problems of two and more dimensions. Operations Research, 13, 94-120.
13. Jin, Z, K Ohno, and J Du (2004). An efficient approach for the three-dimensional container packing problem with practical constraints. Asia-Pacific Journal of Operational Research, 21, 279-295.
14. K̈am̈ar̈ainen, V and M Punakivi (2002). Developing cost-effective operations for the e-grocery supply chain. International Journal of Logistics: Research and Applications, 5, 285-298. (Pubitemid 36063647)
15. K̈am̈ar̈ainen, V, S Saranen, and H Jan (2000). How goods receipt affects e-grocery efficiently? In Proc. of 11th International Working Seminar on Production Economics.
16. Lim, A, B Rodrigues, and Y Wang (2003). A multi-faced buildup algorithm for three-dimensional packing problems. Omega-International Journal of Management Sciences, 31, 471-481. (Pubitemid 37325113)
17. Mack, D, A Bortfeldt, and H Gehring (2004). A parallel hybrid local search algorithm for the container loading problem. International Transactions in Operational Research, 11, 511-533. (Pubitemid 39146684)
18. Morabito, R and M Arenales (1994). An AND/OR-graph approach to the container loading problem. International Transactions in Operational Research, 1, 59-74.
19. Moura, A and J. F Oliveira (2005). A grasp approach to the container-loading problem. IEEE Intelligent Systems, 20, 50-57. (Pubitemid 41263300)
20. OR-Library. (2007) OR-library. Available at http://people.brunel.ac.uk/ ∼mastjjb/jeb/info.html
21. Parreno, F, R Alvarez-Valdes, J Tamarit, and J Oliveira (2008). A maximal-space algorithm for the container loading problem. INFORMS Journal on Computing, 20, 412-422.
22. Punakivi, M (2003). Comparing Alternative Home Delivery Models for e-Grocery Home Delivery. Unpublished doctoral dissertation, Helsinki University of Technology, Finland.
23. Punakivi, M and J Saranen (2001). Identifying the success factors in e-grocery home delivery. International Journal of Retail and Distribution Management, 29, 156-163.
24. The Economist (2000). Survey: E-commerce-Shopping around the web. The Economist, 354, s5-s6.
25. Ẅascher, G, H Haußner, and H Schumann (2007). An improved typology of cutting and packing problems. European Journal of Operational Research, 183, 1109-1130. (Pubitemid 47030730)