A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation

European Journal of Operational Research

Volumn 179, Issue 3, 2007, Pages 759-774

  Dowsland, Kathryn A ^a,b   Soubeiga, Eric ^a   Burke, Edmund ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

^b Gower Optimal Algorithms Ltd   (United Kingdom)

Author keywords

Hyperheuristics; Logistics; Packing; Simulated annealing

Indexed keywords

CONTAINERS; FREIGHT TRANSPORTATION; HEURISTIC METHODS; SIMULATED ANNEALING;

HYPERHEURISTICS; P-MEDIAN PROBLEM; PACKAGING WASTE;

PACKAGING;

CONTAINERS; HEURISTIC METHODS; PACKAGING; TRANSPORT;

EID: 33845941176     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.03.058     Document Type: Article

References (42)

1. Beasley J.E. A note on solving large p-median problems. European Journal of Operational Research 21 (1985) 270-273
2. Bischoff E., and Dowsland W.B. The application of the micro to product design and distribution. Journal of the Operational Research Society 33 (1982) 271-280
3. Burke E.K., Kendall G., and Soubeiga E. A Tabu Search Hyper-Heuristic for Timetabling and Rostering. Journal of Heuristics 9 6 (2003) 451-470
4. Burke E.K., Kendall G., Newall J.P., Hart E., Ross P., and Schulenburg S. Hyper-heuristics: An Emerging Direction in Modern Search Technology. In: Glover F., and Kochenberger G. (Eds). Handbook of Meta-heuristics (2003), Kluwer 457-474 Chapter 16
5. Burke E.K., Kendall G., and Whitwell G. A New Placement Heuristic for the Orthogonal Stock Cutting Problem. Operations Research 52 4 (2004) 655-671
6. Cagan J., Shimada K., and Yin S. A survey of computational approaches to three-dimensional layout problems. Computer Aided Design 34 (2002) 597-611
7. Congram R., Potts C., and Van de Velde S. An iterated dynasearch algorithm for the single-machine weighted tardiness problem. INFORMS Journal of Computing 14 (2002) 52-67
8. Cowling P., Kendall G., and Soubeiga E. A hyperheuristic approach to scheduling a sales summit. Practice and Theory of Automated Timetabling III (PATAT 2000). In: Burke E.K., and Erben W. (Eds). LNCS 2079 (2000), Springer 176-190
9. Cowling, P., Kendall, G., Soubeiga, E., 2002. Hyperheuristics: A tool for rapid prototyping in scheduling and optimisation. In: Cagoni, S., Gottlieb, J., Hart, E., Middendorf, M., Günther, R. (Eds.), Applications of Evolutionary Computing: In: Proceedings of Evo Workshops 2002, Kinsale, Ireland, April 3-4, 2002, LNCS 2279, Springer-Verlag, pp. 1-10.
10. Crispin A.J., Clay P., Taylor G.E., Bayes T., and Reedman D. Genetic algorithms applied to leather lay plan material utilisation. IMechE Part B: Journal of Engineering Manufacture 217 (2003) 1753-1756
11. Dowsland K.A. Determining an upper bound for a class of rectangular packing problems. Computers and Operational Research 12 (1985) 201-205
12. Dowsland K.A. An exact algorithm for the pallet loading problem. European Journal of Operational Research 31 (1987) 78-84
13. Dowsland K.A. A combined database and algorithmic approach to the pallet loading problem. Journal of the Operational Research Society 38 (1987) 341-345
14. Dowsland K.A. Using simulated annealing for efficient allocation of students to practical classes. Applied Simulated Annealing. In: Vidal R.V.V. (Ed). LNEMS 396 (1993), Springer 151-174
15. Dowsland K.A. Some experiments with simulated annealing techniques for packing problems. European Journal of Operational Research 68 (1993) 389-399
16. Estivill-Castro V., and Torres-Velazquez R. Hybrid genetic algorithm for solving the p-median problem. SEAL'98. In: Yao X., et al. (Ed). LNCS 1585 (1999), Springer 18-25
17. Garcia-Lopez F., Melian-Batista B., Moreno-Perez J.A., and Moreno-Vega J.M. Parallelization of the scatter search for the p-median problem. Parallel Computing 29 (2003) 575-589
18. Han, L., Kendall, G., 2003. Guided Operators for a Hyper-Heuristic Genetic Algorithm. In: T.D. Gedeon, L.C.C. Fung (Eds.) Proceedings of AI-2003: Advances in Artificial Intelligence. The 16th Australian Conference on Artificial Intelligence (AI'03), Perth, Australia 3-5 December 2003. Springer Lecture Notes in Artificial Intelligence 2903, pp. 807-820.
19. Hanjoul P., and Peeters D. A comparison of two dual-based procedures for solving the p-median problem. European Journal of Operational Research 20 (1985) 387-396
20. Hansen P., and Mladenovic N. Variable neighbourhood search for the p-median. Location Science 5 (1997) 207-226
21. Hopper E., and Turton B.C.H. An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem. European Journal of Operations Research 128 (2001) 34-57
22. Hribar M., and Daskin M.S. A dynamic programming heuristic for the p-median problem. European Journal of Operational Research 101 (1997) 499-508
23. Kendall, G., Mohamad, M., 2004. Channel Assignment Optimisation Using a Hyper-heuristic. Accepted for The 2004 IEEE Conference on Cybernetics and Intelligent Systems (CIS'04), Singapore, 1-3 December.
24. Kendall, G., Mohd Hussain, N., 2004. A Tabu Search Hyper-heuristic Approach to the Examination Timetabling Problem at MARA University of Technology. In: Proceedings of the 5th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2004), August 18-02-2004, Pittsburgh, USA, pp. 199-217.
25. Leung J.Y.-T., Dror M., and Young G.H. A Note on an Open-end Packing Problem. Journal of Scheduling 4 4 (2001) 201-207
26. Lodi A., Martello S., and Monaci M. Two-dimensional packing problems: A survey. European Journal of Operations Research 141 (2003) 241-252
27. Lundy M., and Mees A. Convergence of an annealing algorithm. Maths Programming 34 (1986) 111-124
28. Menon S., and Schrage L. Order allocation for stock cutting in the paper industry. Operations Research 50 2 (2002) 324-332
29. Morabito R., and Arenales M. Optimizing the cutting of stock plates in a furniture company. International Journal of Production Research 38 12 (2000) 2725-2742
30. Mukhacheva E.A., and Mukhacheva A.S. The Rectangular Packing Problem: Local Optimum Search Methods Based on Block Structures. Automation and Remote Control 65 2 (2004) 248-257
31. Orlin J., Ahuja R., Ergun O., and Punnen A. A survey of very large scale neighbourhood techniques. Discrete Applied Maths 23 (2002) 75-102
32. Puchinger J., Raidl G.R., and Koller G. Solving a real-world glass cutting problem. Evolutionary Computation in Combinatorial Optimization. In: Gottlieb J., and Raidl G. (Eds). LNCS 3004 (2004), Springer 165-176
33. Resende M.G.C., and Werneck R.F. A hybrid heuristic for the p-median problem. Journal of Heuristics 10 (2004) 59-88
34. Rolland E., Schilling D.A., and Current J.R. An efficient tabu search procedure for the p-median problem. European Journal of Operational Research 96 (1996) 329-342
35. Ross P., Schulenburg S., Marín-Blázquez J.G., and Hart E. Hyper-heurstics: Learning to combine simple heuristics in bin-packing problems. GECCO 2002: In: Proceedings of the Genetic and Evolutionary Computation Conference, New York, NY, 2002 (2002), Morgan Kauffmann 942-948
36. Ross P., Mari{dotless}́n-Blázquez J.G., Schulenburg S., and Hart E. Learning a Procedure That Can Solve Hard Bin-Packing Problems: A New GA-Based Approach to Hyper-heurstics. Genetic and Evolutionary Computation-GECCO 2003. In: Goos G., Hartmanis J., and van Leewen J. (Eds). LNCS 2724 (2003), Springer 1295-1306
37. Soubeiga, E., 2003. Development and application of hyperheuristics to personnel scheduling. PhD Thesis, Department of Computer Science, The University of Nottingham.
38. Teitz M.B., and Bart P. Heuristic methods for estimating the generalized vertex median of a weighted graph. Operations Research 16 (1968) 955-961
39. Thompson J.M., and Dowsland K.A. General cooling schedules for a simulated annealing based timetabling system. Practice and Theory of Automated Timetabling. In: Burke E., and Ross P. (Eds). LNCS 1153 (1996), Springer 345-363
40. Thompson J.M., and Dowsland K.A. A robust simulated annealing based timetabling system. Computers and Operational Research 25 (1998) 637-648
41. Whitaker R. A fast algorithm for the greedy interchange for large scale clustering and median location problems. INFOR 21 (1983) 95-108
42. Yeung L.H.W., and Tang W.K.S. A Hybrid Genetic Approach for Garment Cutting in the Clothing Industry. IEEE Transactions on Industrial Electronics 50 3 (2003) 449-455