301
Views
50
CrossRef citations to date
0
Altmetric
Theoretical Paper

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

, &
Pages 1387-1397 | Received 01 Dec 2005, Accepted 01 May 2007, Published online: 21 Dec 2017

References

  • 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.
  • 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.
  • 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.
  • BorinNFarrisPWFreelandJRA model for determining retail product category assortment and shelf space allocationDecis Sci19942535938410.1111/j.1540-5915.1994.tb01848.x
  • BretthauerKMShettyBThe nonlinear knapsack problem—algorithms and applicationsEur J Opl Res200213845947210.1016/S0377-2217(01)00179-5
  • BurkeEKHartEKendallGNewallJRossPSchulenburgSHyper-heuristics: An emerging direction in modern search technologyHandbook of Meta-Heuristics2003457474
  • BurkeEKKendallGSoubeigaEA tabu-search hyperheuristic for timetabling and rosteringJ Heuristics2003945147010.1023/B:HEUR.0000012446.94732.b6
  • BurkeEKMcCollumBMeiselsAPetrovicSQuRA graph-based hyper-heuristic for educational timetabling problemsEur J Opl Res200717617719210.1016/j.ejor.2005.08.012
  • BurkeEKPetrovicSQuRCase based heuristic selection for timetabling problemsJ Scheduling2006929911310.1007/s10951-006-6775-y
  • CurhanRThe relationship between shelf space and unit sales in supermarketsJ Market Res1972940641210.2307/3149304
  • DowslandKASoubeigaEBurkeEKA simulated annealing based hyperheuristic for determining shipper sizes for storage and transportationEur J Opl Res200717975977410.1016/j.ejor.2005.03.058
  • FeoTAResendeMGCGreedy randomized adaptive search proceduresJ Global Optim1995610913310.1007/BF01096763
  • GiriBCPalSGoswamiAChaudhuriKSAn inventory model for deteriorating items with stock-dependent demand rateEur J Opl Res19969560461010.1016/0377-2217(95)00309-6
  • GoyalSKGiriBCRecent trends in modelling of deteriorating inventoryEur J Opl Res200113411610.1016/S0377-2217(00)00248-4
  • HartERossPNelsonJASolving a real-world problem using an evolving heuristically driven schedule builderEvolut Comput199861618010.1162/evco.1998.6.1.61
  • KarSBhuniaAKMaitiMInventory of multi-deteriorating items sold from two shops under single management with constraints on space and investmentComput Opl Res2001281203122110.1016/S0305-0548(00)00034-4
  • KendallGMohd HussinNAn investigation of a tabu search based hyper-heuristic for examination timetablingMultidisciplinary Scheduling: Theory and Application2005309328
  • KotzanJEvansonRResponsiveness of drug store sales to shelf space allocationsJ Market Res1969646546910.2307/3150084
  • LundyMMeesAConvergence of an annealing algorithmMath Prog19863411112410.1007/BF01582166
  • MandalBNPhaujdarSAn inventory model for deteriorating items and stock-dependent consumption rateJ Opl Res Soc19894048348810.1057/jors.1989.75
  • MartelloSTothPKnapsack Problems: Algorithms and Computer Implementations1990
  • NahmiasSPerishable inventory theory: A reviewOpns Res19823068070810.1287/opre.30.4.680
  • NareyekAChoosing search heuristics by non-stationary reinforcement learningMetaheuristics: Comp Decision-Making2003523544
  • Ozcan E, Bilgin B and Korkmaz EE (2006). Hill climbers and mutational heuristics in hyperheuristics 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.
  • RaafatFSurvey of literature on continuously deteriorating inventory modelsJ Opl Res Soc199142273710.1057/jors.1991.4
  • 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.
  • RossPHyper-heuristicsSearch Methodologies: Introductory Tutorials in Optim and Decision Support Tech2005529556
  • 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.
  • Ross P, Schulenburg S, Marin-Blazquez JG and Hart E (2002). Hyper heuristics: Learning to combine simple heuristics in bin-packing problems. Proceedings of the Genetic and Evolutionary Comput Conference (GECCO2002), New York, US, 9–13 July, pp 942–948.
  • 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.
  • UrbanTAn inventory-theoretic approach to product assortment and shelf-space allocationJ Retailing199874153510.1016/S0022-4359(99)80086-4
  • YangM-HChenW-CA study on shelf space allocation and managementInt J Prod Econ1999606130931710.1016/S0925-5273(98)00134-0

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.