Novel Pareto-based meta-heuristics for solving multi-objective multi-item capacitated lot-sizing problems

  • Vahid Hajipour
  • AmirSaman Kheirkhah
  • Madjid Tavana
  • Nabil Absi


Capacitated production lot-sizing problems (LSPs) are challenging problems to solve due to their combinatorial nature. We consider a multi-item capacitated LSP with setup times, safety stocks, and demand shortages plus lost sales and backorder considerations for various production methods (i.e., job shop, batch flow, or continuous flow among others). We use multi-objective mathematical programming to solve this problem with three conflicting objectives including: (i) minimizing the total production costs; (ii) leveling the production volume in different production periods; and (iii) producing a solution which is as close as possible to the just-in-time level. We also consider lost sales, backorders, safety stocks, storage space limitation, and capacity constraints. We propose two novel Pareto-based multi-objective meta-heuristic algorithms: multi-objective vibration damping optimization (MOVDO) and a multi-objective harmony search algorithm (MOHSA). We compare MOVDO and MOHSA with two well-known evolutionary algorithms called the non-dominated sorting genetic algorithm (NSGA-II) and multi-objective simulated annealing (MOSA) to demonstrate the efficiency and effectiveness of the proposed methods.


Lot-sizing Computational Intelligence Multi-objective optimization Harmony search Vibration damping optimization MOSA NSGA-II 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Trigeiro WW, Thomas JL, McCain JO (1989) Capacitated lot sizing with setups. Manag Sci 35(3):141–161CrossRefGoogle Scholar
  2. 2.
    Chen WH, Thizy JM (1990) Analysis of relaxations for the multi-item capacitated lot-sizing problem. Ann Oper Res 26:29–72MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Karimi B, Fatemi Ghomi SMT, Wilsonb JM (2003) The capacitated lot sizing problem: a review of models and algorithms. Omega 31:365–378CrossRefGoogle Scholar
  4. 4.
    Robinson P, Narayanan A, Sahin F (2009) Coordinated deterministic dynamic demand lot-sizing problem: a review of models and algorithms. Omega 37(1):3–15CrossRefGoogle Scholar
  5. 5.
    Wagner HM, Whitin TM (1958) A dynamic version of the economic lot size model. Manag Sci 5(1):89–96MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Manne AS (1958) Programming of economic lot-sizes. Manag Sci 4:115–135CrossRefGoogle Scholar
  7. 7.
    Brahimi N, Dauzere-Peres S, Najid NM, Nordli A (2006) Single item lot sizing problems. Eur J Oper Res 168(1):1–16MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Kazan O, Nagi R, Rump CM (2000) New lot-sizing formulations for less nervous production schedules. Comput Oper Res 27:1325–1345CrossRefzbMATHGoogle Scholar
  9. 9.
    Silver E, Mael H (1973) A heuristic selecting lot size requirements for the case of deterministic time varying demand rate and discrete opportunities for replenishment. Prod Invent Manag 14:64–74Google Scholar
  10. 10.
    Loparic M, Pochet Y, Wolsey LA (2001) The uncapacitated lot-sizing problem with sales and safety stocks. Math Program 89(487–504):2001MathSciNetzbMATHGoogle Scholar
  11. 11.
    Aksen D, Altinkemer K, Chand S (2003) The single-item lot-sizing problem with immediate lost sales. Eur J Oper Res 147(558–566):2003MathSciNetzbMATHGoogle Scholar
  12. 12.
    Absi N, Kedad-Sidhoum S (2007) MIP-based heuristics for multi item capacitated lot-sizing problem with setup times and shortage costs. RAIRO Oper Res 41(2):171–192MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Absi N, Kedad-Sidhoum S (2008) The multi-item capacitated lot-sizing problem with setup times and shortage costs. Eur J Oper Res 185:1351–1374CrossRefzbMATHGoogle Scholar
  14. 14.
    Absi N, Kedad-Sidhoum S (2009) The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs. Comput Oper Res 36:2926–2936CrossRefzbMATHGoogle Scholar
  15. 15.
    Absi A, Detienne B, Dauzere-Peres S (2013) Heuristics for the multi-item capacitated lot-sizing problem with lost sales. Comput Oper Res 40(1):264–272MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Tempelmeier H, Derstroff M (1996) A lagrangean-based heuristic for dynamic multilevel multi item constrained lot sizing with setup times. Manag Sci 42:738–757CrossRefzbMATHGoogle Scholar
  17. 17.
    Sural H, Denize M, VanWassenhove LN (2009) Lagrangean relaxation based heuristics for lot-sizing with setup times. Eur J Oper Res 194(1):51–60MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Berretta R, Rodrigues LF (2004) A memetic algorithm for a multistage capacitated lot-sizing problem. Int J Prod Econ 87:67–81CrossRefGoogle Scholar
  19. 19.
    Han Y, Tang J, Kaku I, Mu L (2009) Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight. Comput Math Appl 57:1748–1755MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Tang O (2004) Simulated annealing in lot sizing problems. Int J Prod Econ 88:173–181CrossRefGoogle Scholar
  21. 21.
    Xiao Y, Kaku I, Zhao Q, Zhang R (2011) A variable neighborhood search based approach for uncapacitated multilevel lot-sizing problems. Comput Ind Eng 60(2):218–227CrossRefzbMATHGoogle Scholar
  22. 22.
    Coello CA, Lamont GB, Van Veldhuizen DA (2007) Evolutionary algorithms for solving multiobjective problems, 2nd edn. Springer, BerlinzbMATHGoogle Scholar
  23. 23.
    Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6:182–197CrossRefGoogle Scholar
  24. 24.
    Ulungu EL, Teghaem J, Fortemps P, Tuyttens D (1999) MOSA method: a tool for solving multiobjective combinatorial decision problems. J Multi-Criteria Decis Anal 8:221–236CrossRefzbMATHGoogle Scholar
  25. 25.
    Rezaei J, Davoodi M (2011) Multi-objective models for lot-sizing with supplier selection. Int J Prod Econ 130:77–86CrossRefGoogle Scholar
  26. 26.
    Karimi-Nasab M, Aryanezhad MB (2011) A multi-objective production smoothing model with compressible operating times. Appl Math Model 35:3596–3610MathSciNetCrossRefzbMATHGoogle Scholar
  27. 27.
    Karimi-Nasab M, Konstantaras L (2012) A random search heuristic for a multi-objective production planning. Comput Ind Eng 62:479–490CrossRefGoogle Scholar
  28. 28.
    Mehdizadeh E, Tavakkoli-Moghaddam R (2008) Vibration damping optimization. Proceedings of the International Conference of Operations Research and Global Business, Germany, 3–5 SeptemberGoogle Scholar
  29. 29.
    Mehdizadeh E, Tavarroth MR, Hajipour V (2011) A new hybrid algorithm to optimize stochastic-fuzzy capacitated multi-facility location–allocation problem. J Optim Ind Eng 7:71–80Google Scholar
  30. 30.
    Mousavi SM, Akhavan Niaki ST, Mehdizadeh E, Tavarroth MR (2013) The capacitated multi-facility location–allocation problem with probabilistic customer location and demand: two hybrid meta-heuristic algorithms. Int J Syst Sci 44(10):1897–1912MathSciNetCrossRefzbMATHGoogle Scholar
  31. 31.
    Geem ZW (2007) Harmony search algorithm for solving Sudoku. In: Apolloni B, Howlett RJ, Jain L (eds) KES 2007, part I. LNCS (LNAI), vol 4692. Springer, Heidelberg, pp 371–378Google Scholar
  32. 32.
    Lee KS, Geem ZW (2004) A new structural optimization method based on the harmony search algorithm. Comput Struct 82:781–798CrossRefGoogle Scholar
  33. 33.
    Geem ZW, Kim J-H, Loganathan GV (2002) Harmony search optimization: application to pipe network design. Int J Model Simul 22(125–133):2002Google Scholar
  34. 34.
    Taleizadeh AA, Niaki STA, Barzinpour F (2011) Multiple-buyer multiple-vendor multi-product multi-constraint supply chain problem with stochastic demand and variable lead-time: a harmony search algorithm. Appl Math Comput 217:9234–9253MathSciNetzbMATHGoogle Scholar
  35. 35.
    Rahmati SHA, Hajipour V, Niaki STA (2013) A soft-computing Pareto-based meta-heuristic algorithm for a multi-objective multi-server facility location problem. Appl Soft Comput 13(4):1728–1740CrossRefGoogle Scholar
  36. 36.
    Yeniay O, Ankare B (2005) Penalty function methods for constrained optimization with genetic algorithms. Math Comput Appl 10:45–56Google Scholar
  37. 37.
    Geem ZW, Kim J-H, Loganathan GV (2001) A new heuristic optimization algorithm: harmony search. Simulation 76(2):60–68CrossRefGoogle Scholar
  38. 38.
    Haupt RL, Haupt SE (2011) Practical genetic algorithms, 2nd edn. John Wiley & SonsGoogle Scholar
  39. 39.
    Kirkpatrick S, Gelatt C, Vecchi M (2003) Optimization by simulated annealing. Science 220:671–680MathSciNetCrossRefzbMATHGoogle Scholar
  40. 40.
    Bandyopadhyay S, Saha S, Maulik U, Deb K (2008) A simulated annealing-based multiobjective optimization algorithm: AMOSA. IEEE Trans Evol Comput 12(3):269–283CrossRefGoogle Scholar
  41. 41.
    Pasandideh SHR, Niaki STA, Hajipour V (2013) A multi-objective facility location model with batch arrivals: two parameter-tuned meta-heuristic algorithms. J Intell Manuf 24(2):331–348CrossRefGoogle Scholar
  42. 42.
    Zitzler E, Thiele L (1998) Multi-objective optimization using evolutionary algorithms a comparative case study. In: Eiben A E, Back T, Schoenauer M Schwefel H P (eds) Fifth International Conference on Parallel Problem Solving from Nature (PPSN-V), pp. 292–301. Berlin, GermanyGoogle Scholar
  43. 43.
    MATLAB (2010) Version (R2010a). The MathWorks, Inc. Protected by US and International patentsGoogle Scholar

Copyright information

© Springer-Verlag London 2015

Authors and Affiliations

  • Vahid Hajipour
    • 1
  • AmirSaman Kheirkhah
    • 2
  • Madjid Tavana
    • 3
    • 4
  • Nabil Absi
    • 5
  1. 1.Young Researchers and Elite Club, Qazvin BranchIslamic Azad UniversityQazvinIran
  2. 2.Industrial Engineering DepartmentBu-Ali Sina UniversityHamedanIran
  3. 3.Business Systems and Analytics Department, Lindback Distinguished Chair of Information Systems and Decision SciencesLa Salle UniversityPhiladelphiaUSA
  4. 4.Business Information Systems Department, Faculty of Business Administration and EconomicsUniversity of PaderbornPaderbornGermany
  5. 5.Department of Manufacturing Sciences and LogisticsEcole des Mines de Saint-EtienneGardanneFrance

Personalised recommendations