A hybrid simulated annealing algorithm for solving multi-objective container-loading problems

Applied Artificial Intelligence

Volumn 24, Issue 5, 2010, Pages 463-486

  Dereli, Türkay ^a   Sena Das, Gülesin ^b  

^a GAZIANTEP UNIVERSITY   (Turkey)

^b SCIENTIFIC AND TECHNOLOGICAL RESEARCH COUNCIL OF TURKEY   (Turkey)

Author keywords

[No Author keywords available]

Indexed keywords

GOAL PROGRAMMING; SIMULATED ANNEALING;

ALGORITHM FOR SOLVING; ANNEALING ALGORITHM; BENCHMARK PROBLEMS; CONTAINER-LOADING PROBLEMS; GOAL PROGRAMMING MODEL; HYBRID SIMULATED ANNEALING ALGORITHM; MULTI OBJECTIVE; NEW APPROACHES; OBJECTIVE WEIGHT; REAL-WORLD;

CONTAINERS;

EID: 77952939073     PISSN: 08839514     EISSN: 10876545     Source Type: Journal    
DOI: 10.1080/08839514.2010.481488     Document Type: Article

References (42)

1. Andersson, J. 2000. A survey of multiobjective optimization in engineering design. Linkoping, Sweden: Department of Mechanical Engineering, Linkoping University. Technical Report LiTHIKP-R-1097.
2. Baykasoǧlu, A. 2005. A preemptive goal programming using simulated annealing. Engineering Optimization 37: 49-63.
3. Bischoff, E. E. 2003. Dealing with load bearing strength considerations in container loading problems. Swansea: European Business Management School, University of Wales.
4. Bischoff, E. E., F. Janetz, and M. S. W. Ratcliff. 1995. Loading pallets with non-identical items. European Journal of Operational Research 84:681-692.
5. Bischoff, E. E., and M. D. Marriott. 1990. A comparative evaluation of heuristics for container loading. European Journal of Operational Research 44:267-276.
6. Bischoff, E. E., and M. S. W. Ratcliff. 1995. Loading multiple pallets. Journal of Operational Research Society 46:1322-1336.
7. Bortfeldt, A., and H. Gehring. 1998. A tabu search algorithm for weakly heterogeneous container loading problems. OR Spektrum 20:237-250.
8. Bortfeldt, A., and H. Gehring. 2001. A hybrid genetic algorithm for the container loading problem. European Journal of Operational Research 131:143-161.
9. Bortfeldt, A., H. Gehring, and D. Mack. 2002. A parallel tabu search algorithm for solving the container loading problem. Parallel Computing 29:641-662.
10. Brusco, M. J., G. M. Thompson, and L. W. Jacobs. 1997. A morph-based simulated annealing heuristic for a modified bin-packing problem. Journal of the Operations Research Society 48:433-439.
11. Charnes, A., and W. W. Cooper. 1961. Management Models and Industrial Applications of Linear Programming. New York: Wiley.
12. Dereli, T., and G. S. Das. 2007. A hybrid simulated annealing algorithm for two-dimensional strip packing problems. Lecture Notes in Computer Science 4431:508-516.
13. Dyckhoff, H. 1990. A typology of cutting and packing problems. European Journal of Operational Research 44:145-159.
14. Eglese, R. W. 1990. Simulated annealing: A tool for operational research. European Journal of Operational Research 46:271-281.
15. Eley, M. 2002. Solving container loading problems by block arrangement. European Journal of Operational Research 141:393-409.
16. Ertek, G., and K. Kiliç. 2006. Decision support for packing in warehouses. Lecture Notes in Computer Science 4263:115-124.
17. Faina, L. 2000. A global optimization algorithm for the three-dimensional packing problem. European Journal of Operational Research 126:340-354.
18. Gehring, H., and A. Bortfeldt. 1997. A genetic algorithm for solving the container loading problem. International Transactions in Operational Research 4:401-418.
19. Gehring, H., and A. Bortfeldt. 2002. A parallel genetic algorithm for solving the container loading problem. International Transactions in Operational Research 9:497-511.
20. Gehring, H., K. Menschner, and M. Meyer. 1990. A computer-based heuristic for packing pooled shipment containers. European Journal of Operational Research 44:277-288.
21. George, J. A., and D. F. Robinson. 1980. A heuristic for packing boxes into a container. Computers and Operations Research 7:147-156.
22. Haessler, R. W., and F. B. Talbot. 1990. Load planning for shipments of low density products. European Journal of Operational Research 44:289-299.
23. Hemminki, U. 1993. A Heuristic for Container Loading. Finland: University of Turku, Institute for Applied Mathematics, Turku.
24. Huang, W., and K. He. 2007. An efficient algorithm for solving the container loading problem. Lecture Notes in Computer Science 4614:396-407.
25. Kirkpatrick, S., C. D. Gelatt, and M. P. Vecchi. 1983. Optimization by simulated annealing. Science 220:671-680.
26. Kocjan, W., and K. Holmstrom. 2006. The AUTOPACK project, algorithms for container loading. Vasteras, Sweden: Department of Mathematics and Physics, Malardalen University. Research Report MdH/IMa, 2006-2103
27. Kong, M., P. Tian, and Y. Kao. 2008. A new ant colony optimization algorithm for the multidimensional knapsack problem. Computers and Operations Research 35:2672-2683.
28. Leung, S. Y. S., W. K. Wong, and P. Y. Mok. 2008. Multiple-objective genetic optimization of the spatial design for packing and distribution carton boxes. Computers & Industrial Engineering 54:889-902.
29. Lim, A., B. Rodrigues, and Y. Yang. 2005. 3-D container packing heuristic. Applied Intelligence 22:125-134.
30. Liu, D. S., K. C. Tan, C. K. Goh, and W. K. Ho. 2006. On solving multi-objective bin packing problems using particle swarm optimization. In Proceedings of the IEEE Congress On Evolutionary Computation, 2095-2102. Vancouver: IEEE.
31. Loh, H. T., and A. Y. C. Nee. 1992. A packing algorithm for hexahedral boxes. In Proceedings of the Industrial Automation Conference, 115-126. Singapore.
32. 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.
33. Marler, R. T., and J. S. Arora. 2004. Review of multi-objective optimization concepts and algorithms for engineering. Optimal design laboratory. Iowa City: College of Engineering, The University of Iowa. Technical Report No. ODL-01.04.
34. Morabito, R. N., and M. N. Arenales. 1994. An and-or graph approach to the container loading problem. International Transactions in Operational Research 1:59-73.
35. Moura, A., and J. Oliveira. 2005. A grasp approach to the container-loading problem. IEEE Intelligent Systems 20(4):50-57.
36. Ngoi, B. K. A., M. L. Tay, and E. S. Chua. 1994. Applying spatial representation techniques to the container packing problem. International Journal of Production Research 32:111-123.
37. Pimpawat, C., and N. Chaiyaratana. 2004. Three-dimensional container loading using a cooperative co-evolutionary genetic algorithm. Applied Artificial Intelligence 18:581-601.
38. Pisinger, D. 2002. Heuristics for the container loading problem. European Journal of Operational Research 141:382-392.
39. Scheithauer, G. 1992. Algorithms for the container loading problem. In Operational Research Proceedings, eds. W. Gaul, A. Bachem, W. Habenicht, W. Runge, and W. W. Stahl, 445-452. Berlin: Springer.
40. Wang, Z., and K. W. Li. 2007. Layer-layout-based heuristics for loading homogeneous items into a single container. Journal of Zhejiang University - Science A 8:1944-1952.
41. Wascher, G., H. Haussner, and H. Schumann. 2007. An improved typology of cutting and packing problems. European Journal of Operational Research 183:1109-1130.
42. Yeung, L. H. W., and W. K. S. Tang. 2005. A hybrid genetic approach for container loading in logistics industry. IEEE Transactions on Industrial Engineering 52:617-627.