Skip to main content
SpringerLink
Log in

Effect of Capacity Tightness on Performance of MOPSO Algorithm: Case of Multi-item Capacitated Lot-Sizing Problem

  • Conference paper
  • First Online:
Book cover Advances in Materials, Mechanics and Manufacturing

Part of the book series: Lecture Notes in Mechanical Engineering ((LNME))

  • 654 Accesses

Abstract

This paper investigates the effect of capacity tightness on performance of multi-objective particle swarm optimization (MOPSO) algorithm in solving the multi-item capacitated lot-sizing problem with consideration of setup times and backlogging (MICLSP-SB). The considered problem is formulated as a multi-objective optimization model. The formulated model aims at simultaneously minimizing two objective functions. The first one seeks to minimize the total cost, which the sum of production, setup and backlogging costs. The second one seeks to minimize the total inventory level. Sensitivity analysis is performed on a set of generated problem instances. The capacity tightness factor is defined as the ratio between the required capacity and the total available capacity. Three levels of capacity tightness factor are considered for each problem instances. The metrics, which are used for evaluating the performances of the MOPSO algorithm, are number of Pareto solutions, spacing and computational time. Results of sensitivity analysis show a considerable impact of capacity tightness on performances of MOPSO algorithm in terms of number of Pareto solutions and computational time. This investigation offers to the decision makers a clear insight into the performances of MOPSO algorithm in solving the considered MICLSP-SB depending on problem features especially, the capacity tightness factor.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Chen W-H, Thizy J-M (1990) Analysis of relaxations for the multi-item capacitated lot-sizing problem. Ann Oper Res 26:29–72. https://doi.org/10.1007/BF02248584

    Article  MathSciNet  Google Scholar 

  2. Ding S, Chen C, Xin B, Pardalos PM (2018) A bi-objective load balancing model in a distributed simulation system using NSGA-II and MOPSO approaches. Appl Soft Comput J 63:249–267. https://doi.org/10.1016/j.asoc.2017.09.012

    Article  Google Scholar 

  3. Hajipour V, Kheirkhah A, Tavana M, Absi N (2015) Novel Pareto-based meta-heuristics for solving multi-objective multi-item capacitated lot-sizing problems. Int J Adv Manuf Technol 80:31–45. https://doi.org/10.1007/s00170-015-6993-6

    Article  Google Scholar 

  4. Kennedy J, Eberhart R (1995) Particle swarm optimization. In: IEEE international conference of neural networking, pp 1942–1948. https://doi.org/10.1109/ICNN.1995.488968

  5. Lin JT, Chiu C-C (2018) A hybrid particle swarm optimization with local search for stochastic resource allocation problem. J Intell Manuf 29:481–495. https://doi.org/10.1007/s10845-015-1124-7

    Article  Google Scholar 

  6. Mehdizadeh E, Hajipour V, Mohammadizadeh MR (2016) A bi-objective multi-item capacitated lot-sizing model: two Pareto-based meta-heuristic algorithms. Int J Manage Sci Eng Manag 11:279–293. https://doi.org/10.1080/17509653.2015.1086965

    Article  Google Scholar 

  7. Mehdizadeh E, Kivi AF (2014) Three meta-heuristic algorithms for the single-item capacitated lot-sizing problem. Int J Eng 27:1223–1232. https://doi.org/10.5829/idosi.ije.2014.27.08b.08

  8. Mehdizadeh E, Kivib AF (2014) Three metaheuristic algorithms for solving the multi-item capacitated lot-sizing problem with product returns and remanufacturing. J Optim Ind Eng 16:41–53

    Google Scholar 

  9. Pan T, Zhang Z, Cao H (2014) Collaborative production planning with production time windows and order splitting in make-to-order manufacturing. Comput Ind Eng 67:1–9. https://doi.org/10.1016/j.cie.2013.10.006

    Article  Google Scholar 

  10. Piperagkas GS, Konstantaras I, Skouri K, Parsopoulos KE (2012) Solving the stochastic dynamic lot-sizing problem through nature-inspired heuristics. Comput Oper Res 39:1555–1565. https://doi.org/10.1016/j.cor.2011.09.004

    Article  MathSciNet  MATH  Google Scholar 

  11. Rezaei J, Davoodi M (2011) Multi-objective models for lot-sizing with supplier selection. Int J Prod Econ 130:77–86. https://doi.org/10.1016/j.ijpe.2010.11.017

    Article  Google Scholar 

  12. Sahithi VV, Krishna PS, Lalithkumar K, Rao CSP (2015) An iterative improvement search and binary particle swarm optimization for large capacitated multi item multi level lot sizing (CMIMLLS) problem. Int J Eng Res Gen Sci 3:1092–1106

    Google Scholar 

  13. Suo X, Yu X, Li H (2017) Subset simulation for multi-objective optimization. Appl Math Model. https://doi.org/10.1016/j.apm.2017.02.005

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mechanics, Modeling and Manufacturing Research Laboratory, Sfax University, National Engineering School of Sfax (ENIS), Route de Sokra B.P, 1173-3038, Sfax, Tunisia

    Hanen Ben Ammar, Omar Ayadi & Faouzi Masmoudi

Authors
  1. Hanen Ben Ammar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Omar Ayadi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Faouzi Masmoudi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hanen Ben Ammar .

Editor information

Editors and Affiliations

  1. Department of Mechanical Engineering, National School of Engineers of Sfax, Sfax, Tunisia

    Fakher Chaari

  2. Department of Mechanical Engineering, National School of Engineers of Sfax, Sfax, Tunisia

    Maher Barkallah

  3. National School of Engineers of Gafsa, Gafsa, Tunisia

    Anas Bouguecha

  4. Department of Mechanical Engineering, National School of Engineers of Sfax, Sfax, Tunisia

    Bassem Zouari

  5. Department of Mechanical Engineering, National School of Engineers of Sfax, Sfax, Tunisia

    Mohamed Taoufik Khabou

  6. Sfax Preparatory Engineering Institute, Sfax, Tunisia

    Mounir Kchaou

  7. Department of Mechanical Engineering, National School of Engineers of Sfax, Sfax, Tunisia

    Mohamed Haddar

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ammar, H.B., Ayadi, O., Masmoudi, F. (2020). Effect of Capacity Tightness on Performance of MOPSO Algorithm: Case of Multi-item Capacitated Lot-Sizing Problem. In: Chaari, F., et al. Advances in Materials, Mechanics and Manufacturing. Lecture Notes in Mechanical Engineering. Springer, Cham. https://doi.org/10.1007/978-3-030-24247-3_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-24247-3_22

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-24246-6

  • Online ISBN: 978-3-030-24247-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation