Heuristic, meta-heuristic and hyper-heuristic approaches for fresh produce inventory control and shelf space allocation

Journal of the Operational Research Society

Volumn 59, Issue 10, 2008, Pages 1387-1397

  Bai, R ^a   Burke, E K ^a   Kendall, G ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

Fresh produce; Hyper heuristics; Inventory; Meta heuristics; Shelf space allocation

Indexed keywords

DECISION MAKING; DECISION SUPPORT SYSTEMS; HEURISTIC ALGORITHMS; INVENTORY CONTROL; POLYNOMIAL APPROXIMATION; SIMULATED ANNEALING;

FRESH PRODUCE; HYPER-HEURISTICS; INVENTORY; META HEURISTICS; SHELF SPACE ALLOCATION;

HEURISTIC METHODS;

EID: 51349121874     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2602463     Document Type: Article

References (32)

1. Bai R and Kendall G (2005). An investigation of automated planograms using a simulated annealing based hyper-heuristic. In: Ibaraki T, Nonobe K and Yagiura M (eds). Metaheuristics: Progress as Real Problem Solvers, Operations Research/Computer Science interfaces Series, Vol. 32. Springer: Berlin, Heidelberg, New York, pp 87-108.
2. Bai R and Kendall G (2007). A model for fresh produce shelf space allocation and inventory management with freshness condition dependent demand. INFORMS J Comput, accepted.
3. Bilgin B, Ozcan E and Korkmaz EE (2006). An experimental study on hyper-heuristics and exam timetabling. Proceedings of the 6th International Conference on the Practice and Theory of Automated Timetabling (PATAT), Brono, Czech Republic, August 30-September 1, pp 123-140.
4. Borin N, Farris PW and Freeland JR (1994). A model for determining retail product category assortment and shelf space allocation. Decis Sci 25: 359-384.
5. Bretthauer KM and Shetty B (2002). The nonlinear knapsack problem-algorithms and applications. Eur J Opl Res 138: 459-472.
6. Burke EK, Hart E, Kendall G, Newall J, Ross P and Schulenburg S (2003a). Hyper-heuristics: An emerging direction in modern search technology. In: Glover FW and Kochenberger GA (eds). Handbook of Meta-Heuristics. Kluwer: Dordrecht, pp 457-474.
7. Burke EK, Kendall G and Soubeiga E (2003). A tabu-search hyperheuristic for timetabling and rostering. J Heuristics 9: 451-470.
8. Burke EK, McCollum B, Meisels A, Petrovic S and Qu R (2007). A graph-based hyper-heuristic for educational timetabling problems. Eur J Opl Res 176: 177-192.
9. Burke EK, Petrovic S and Qu R (2006). Case based heuristic selection for timetabling problems. J Scheduling 9(2): 99-113.
10. Curhan R (1972). The relationship between shelf space and unit sales in supermarkets. J Market Res 9: 406-412.
11. Dowsland KA, Soubeiga E and Burke EK (2007). A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation. Eur J Opl Res 179: 759-774.
12. Feo TA and Resende MGC (1995). Greedy randomized adaptive search procedures. J Global Optim 6: 109-133.
13. Giri BC, Pal S, Goswami A and Chaudhuri KS (1996). An inventory model for deteriorating items with stock-dependent demand rate. Eur J Opl Res 95: 604-610.
14. Goyal SK and Giri BC (2001). Recent trends in modelling of deteriorating inventory. Eur J Opl Res 134: 1-16.
15. Hart E, Ross P and Nelson JA (1998). Solving a real-world problem using an evolving heuristically driven schedule builder. Evolut Comput 6(1): 61-80.
16. Kar S, Bhunia AK and Maiti M (2001). Inventory of multideteriorating items sold from two shops under single management with constraints on space and investment. Comput Opl Res 28: 1203-1221.
17. Kendall G and Mohd Hussin N (2005). An investigation of a tabu search based hyper-heuristic for examination timetabling. In: Kendall G, Burke EK and Petrovic S (eds). Multidisciplinary Scheduling: Theory and Application. Springer: Berlin, pp 309-328.
18. Kotzan J and Evanson R (1969). Responsiveness of drug store sales to shelf space allocations. J Market Res 6: 465-469.
19. Lundy M and Mees A (1986). Convergence of an annealing algorithm. Math Prog 34: 111-124.
20. Mandal BN and Phaujdar S (1989). An inventory model for deteriorating items and stock-dependent consumption rate. J Opl Res Soc 40: 483-488.
21. Martello S and Toth P (1990). Knapsack Problems: Algorithms and Computer Implementations. John Wiley & Sons: New York.
22. Nahmias 5 (1982). Perishable inventory theory: A review. Opns Res 30: 680-708.
23. Nareyek A (2003). Choosing search heuristics by non-stationary reinforcement learning. In: Resende MGC and de Sousa JP (eds). Metaheuristics: Comp Decision-Making. Kluwer: Dordrecht, pp 523-544.
24. Ozean E, Bilgin B and Korkmaz EE (2006). Hill climbers and mutational heuristics in hyperheuristics. In: Poli R, Cotta C, Coello CAC, Pelikan M, Ishibuchi H, Sastry K, Whitley D, Zitzler E, Sebag M and Sendhoff B. Parallel Problem Solving from Nature - PPSN IX: Selected Papers from the 9th International Conference, Lecture Notes in Computer Science Series, Vol. 4193, Springer: Berlin, pp 202-211.
25. Raafat F (1991). Survey of literature on continuously deteriorating inventory models. J Opl Res Soc 42: 27-37.
26. Rattadilok P, Gaw A, and Kwan RSK (2005). Distributed choice function hyper-heuristics for timetabling and scheduling. In: Burke EK and Trick M (eds). The Practice and Theory of Automated Timetabling V: Selected Papers from the 5th International Conference on the Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science Series, Vol. 3616, Springer: Berlin, pp 51-70.
27. Ross P (2005). Hyper-heuristics. In: Burke EK and Kendall G (eds). Search Methodologies: Introductory Tutorials in Optim and Decision Support Tech. Springer: Berlin, pp 529-556.
28. Ross P, Marin-Blazquez JG, Schulenburg S and Hart E (2003). Learning a procedure that can solve hard bin-packing problems: A new GA-based approach to hyper-heuristics. Proceedings of the Genetic and Evolutionary Comput Conference, GECCO 2003, Chicago, Illinois, USA, pp 1295-1306.
29. Ross P, Schulenburg S, Marin-Blazquez JG and Hart E (2002). Hyper heuristics: Learning to combine simple heuristics in binpacking problems. Proceedings of the Genetic and Evolutionary Comput Conference (GECCO2002), New York, US, 9-13 July, pp 942-948.
30. Terashima-Marin H, Ross P and Valenzuela-Rendon M (1999). Evolution of constraint satisfaction strategies in examination timetabling. Proceedings of the Genetic and Evolutionary Comput Conference (GECCO 1999), Orlando, Florida, USA, 13-17 July, pp 1011-1018.
31. Urban T (1998). An inventory-theoretic approach to product assortment and shelf-space allocation. J Retailing 74: 15-35.
32. Yang M-H and Chen W-C (1999). A study on shelf space allocation and management. Int J Prod Econ 60(61): 309-317.