Skip to main content

Advertisement

SpringerLink
Log in

Fixed-quantity dynamic lot sizing using simulated annealing

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

In this paper, simulated annealing (SA) is applied to the deterministic dynamic lot-sizing problem with batch ordering and backorders. Batch ordering requires orders that are integer multiples of a fixed quantity that is larger than 1. The performance of the developed SA heuristic is compared to that of a genetic algorithm (GA) and a modified silver-meal (MSM) heuristic developed in the literature, based on the frequency of obtaining the optimum solution and the percentage average deviation from the optimum solution. In addition, the effects of three factors on the performance of the SA, GA, and the MSM are investigated in a 23 factorial experiment. The investigated factors are the demand pattern, the batch size, and the length of the planning horizon. Results indicate that the SA heuristic has the best performance, followed by GA, in terms of the frequency of obtaining the optimum solution and the average deviation from the optimum solution. SA is also the most robust of the investigated heuristics as its performance is only affected by the length of the planning horizon.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Wagner H, Whitin T (1958) Dynamic version of the economic lot size model. Manage Sci 5:89-96

    Article  MathSciNet  Google Scholar 

  2. Vander Eecken J (1968) Investigation of a class of constrained inventory problems, unpublished doctoral dissertation, Yale University

  3. Elmaghraby S, Bawle V (1972) Optimization of batch ordering under deterministic variable demand. Manage Sci 18(9):508–517

    Article  MATH  MathSciNet  Google Scholar 

  4. Bitran GR, Matsuo H (1986) Approximation formulations for the single-product capacitated lot size problem. Oper Res 34(1):63–74

    Article  MATH  MathSciNet  Google Scholar 

  5. Li C-L, Hsu V, Xiao W-Q (2004) Dynamic lot sizing with batch ordering and truckload discounts. Oper Res 52(4):639–654

    Article  MathSciNet  MATH  Google Scholar 

  6. Silver E, Peterson R (1985) Decision systems for inventory management and production planning, 2nd edn. Wiley, New York

  7. Jans R, Degraeve Z (2007) Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches. Eur J Oper Res 177(3):1855–1875

    Article  MATH  Google Scholar 

  8. Stadtler H (2000) An improved rolling schedule for the dynamic single-level lot-sizing problem. Manage Sci 46(2):318–326

    Article  Google Scholar 

  9. Silver E, Meal H (1973) A heuristic for selecting lot size quantities for the case of a deterministic time-varying demand rate and discrete opportunities for replenishment. Prod Invent Manage 14:64–74

    Google Scholar 

  10. Shittu EA (2003) Applying genetic algorithms to the deterministic time-varying fixed-quantity lot-sizing problem. Master thesis. Cairo, Egypt: The American University in Cairo

  11. Gaafar L (2006) Applying genetic algorithms to dynamic lot sizing with batch ordering. Comput Ind Eng 51(3):433–444

    Article  Google Scholar 

  12. Gaafar L, Masoud S (2005) Genetic algorithms and simulated annealing for scheduling in agile manufacturing. Int J Prod Res 43(14):3069–3085

    Article  MATH  Google Scholar 

  13. Zolfaghari S, Liang M (2002) Comparative study of simulated annealing, genetic algorithms and Tabu search for solving binary and comprehensive machine-grouping problems. Int J Prod Res 40(9):2141–2158

    Article  MATH  Google Scholar 

  14. Prasad PS, Chetty OK (2001) Multilevel lot sizing with a genetic algorithm under fixed and rolling horizons. Int J Adv Manuf Technol 18(7):520–527

    Article  Google Scholar 

  15. Staggemeier A, Clark A, Aickelin U, Smith J (2002) A hybrid genetic algorithm to solve a lot sizing and scheduling problem. 16th Triannual Conference of the International Federation of Operational Research Societies, Edinburgh

  16. Dellaert N, Jeunet J (2000) Solving large unconstrained multilevel lot-sizing problems using a hybrid genetic algorithm. Int J Prod Res 38(5):1083–1099

    Article  MATH  Google Scholar 

  17. Kuik R, Salomon M, Van Wassenhove L, Maes J (1993) Linear programming, simulated annealing and tabu search heuristics for lot-sizing in bottleneck assembly systems. IIE Trans 25(1):62–72

    Article  Google Scholar 

  18. Ouenniche J, Boctor F (1998) Sequencing, lot-sizing and scheduling of several products in job shops: the common cycle approach. Int J Prod Res 36(4):1125–1140

    Article  MATH  Google Scholar 

  19. Barbarosoðlu G, Özdamar L (2000) Analysis of solution space-dependent performance of simulated annealing: the case of the multi-level capacitated lot sizing problem. Comput Oper Res 27(9):895–903

    Article  Google Scholar 

  20. Özdamar L, Bozyel M (2000) The capacitated lot-sizing problem with overtime decisions and setup times. IIE Trans 32(11):1043–1057

    Google Scholar 

  21. Bruggemann W, Jahnke H (2000) The discrete lot-sizing and scheduling problem: complexity and modification for batch availability. Eur J Oper Res 124(3):511–528

    Article  MathSciNet  Google Scholar 

  22. Özdamar L, Barbarosoðlu G (2000) An integrated Lagrangean relaxation simulated annealing approach to the multi level multi item capacitated lot-sizing problem. Int J Prod Econ 68(3):319–331

    Article  Google Scholar 

  23. Tang O (2004) Simulated annealing in lot-sizing problems. Int J Prod Econ 88(2):173–181

    Article  Google Scholar 

  24. Singh K, Mukherjee A, Tiwari M (2004) Incorporating kin selection in simulated annealing algorithm and its performance evaluation. Eur J Oper Res 158(1):34–45

    Article  MATH  Google Scholar 

  25. Jeunet J, Jonard N (2005) Single point stochastic search algorithms for the multi level lot-sizing problem. Comput Oper Res 32(4):985–1006

    Article  MATH  MathSciNet  Google Scholar 

  26. Özdamar L, Birbil S (1998) Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions. Eur J Oper Res 110(3):525–547

    Article  MATH  Google Scholar 

  27. Hung Y, Chien K (2000) A multi-class multi-level capacitated lot sizing model. J Oper Res Soc 51(11):1309–1318

    Article  MATH  Google Scholar 

  28. Özdamar L, Birbil S, Potmann M-C (2002) Technical note: new results for the capacitated lot sizing problem with overtime decisions and setup times. Prod Plan Control 13(1):2–10

    Article  Google Scholar 

  29. Kirkpatrick S, Gelatt C, Vecchi M (1983) Optimization by simulated annealing. Science 220(4598):671–680

    Article  MathSciNet  Google Scholar 

  30. Fink A, Vob S (1999) Applications of modern heuristic search methods to continuous flow-shop scheduling problems. Technical report, Technische Universitat Braunschweig, Germany, http://www.winforms.phil.tu-bs.de/personal/afink/cfs.pdf

  31. Aarts E, Van Laarhoven P (1987) Simulated annealing: theory and applications. D. Reidel Publishing Co., Dordrecht

    MATH  Google Scholar 

  32. Aly A (2005) Fixed-quantity lot-sizing using simulated annealing. Master thesis. The American University in Cairo, Cairo, Egypt

  33. Holland J (1975) Adaptation in natural and artificial systems. The University of Michigan Press, Ann Arbor, Michigan

    Google Scholar 

  34. Gaafar L, Choueiki M (2000) A neural network model for solving the lot-sizing problem. Omega: Int J Manage Sci 28(2):175–184

    Google Scholar 

  35. The MathWorks, Inc (2002) The MATLAB manual. The MathWorks, Inc

  36. Stat-Ease (2001) Design-Expert® software. Version 6, http://www.stat-ease.com

  37. Montgomery D (2001) Design and analysis of experiment, 5th edn. Wiley, New York

    Google Scholar 

  38. Bedworth D, Bailey J (1987) Integrated production control systems, 2nd edn. Wiley, New York

Download references

Author information

Authors and Affiliations

  1. Mechanical Engineering, The American University in Cairo, 113 Kasr Elaini St., Cairo, 11511, Egypt

    Lotfi K. Gaafar, Ashraf O. Nassef & Ahmed I. Aly

Authors
  1. Lotfi K. Gaafar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ashraf O. Nassef
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ahmed I. Aly
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lotfi K. Gaafar.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gaafar, L.K., Nassef, A.O. & Aly, A.I. Fixed-quantity dynamic lot sizing using simulated annealing. Int J Adv Manuf Technol 41, 122–131 (2009). https://doi.org/10.1007/s00170-008-1447-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-008-1447-z

Keywords

Search

Navigation