International Journal of Mathematical, Engineering and Management Sciences

ISSN: 2455-7749

Modeling Multi-Plant Capacitated Lot Sizing Problem with Interplant Transfer

Amitkumar Patil
Department of Mechanical Engineering, Malaviya National Institute of Technology Jaipur, Rajasthan, India.

Gaurav Kumar Badhotiya
Department of Mechanical Engineering, Graphic Era (Deemed to be University), Dehradun, Uttarakhand, India

Bimal Nepal
Department of Engineering Technology & Industrial Distribution, Texas A&M University, College Station, TX 77843, USA.

Gunjan Soni
Department of Mechanical Engineering, Malaviya National Institute of Technology Jaipur, Rajasthan, India.

DOI https://doi.org/10.33889/IJMEMS.2021.6.3.057

Received on January 21, 2021
  ;
Accepted on May 07, 2021

Abstract

Lot sizing models involve operational and tactical decisions. These decisions may entail multi-level production processes such as assembly operations with multiple plants and limited capacities. Lot sizing problems are widely recognized as NP-hard problems therefore difficult to solve, especially the ones with multiple plants and capacity constraints. The level of complexity rises to an even higher level when there is an interplant transfer between the plants. This paper presents a Genetic Algorithm (GA) based solution methodology applied to large scale multi-plant capacitated lot sizing problem with interplant transfer (MPCLSP-IT). Although the GA has been a very effective and widely accepted meta-heuristic approach used to solve large scale complex problems, it has not been employed for MPCLSP-IT problem. This paper solves the MPCLSP-IT problem in large scale instances by using a genetic algorithm, and in doing so successfully obtains a better solution in terms of computation time when compared to the results obtained by the other methods such as Lagrangian relaxation, greedy randomized adaptive search procedure (GRASP) heuristics, and GRASP-path relinking techniques used in extant literature.

Keywords- Multi-plant capacitated lot sizing problem, Inter-plant transfer, Metaheuristics, Genetic algorithm, Production planning.

Citation

Patil, A., Badhotiya, G. K. Nepal, B., & Soni, G. (2021). Modeling Multi-Plant Capacitated Lot Sizing Problem with Interplant Transfer. International Journal of Mathematical, Engineering and Management Sciences, 6(3), 961-974. https://doi.org/10.33889/IJMEMS.2021.6.3.057.

Conflict of Interest

The authors confirm that there is no conflict of interest to declare for this publication.

Acknowledgements

This research did not receive any specific grant from funding agencies in the public, commercial, or not-for-profit sectors. The authors would like to thank the editor and anonymous reviewers for their comments that help improve the quality of this work.

References

Almada-Lobo, B., Klabjan, D., Antónia Carravilla, M.A., & Oliveira, J.F. (2007). Single machine multi-product capacitated lot sizing with sequence-dependent setups. International Journal of Production Research, 45(20), 4873-4894. https://doi.org/10.1080/00207540601094465.

Almeder, C. (2010). A hybrid optimization approach for multi-level capacitated lot-sizing problems. European Journal of Operational Research, 200(2), 599-606. https://doi.org/10.1016/j.ejor.2009.01.019.

Aytug, H., Khouja, M., & Vergara, F.E. (2003). Use of genetic algorithms to solve production and operations management problems: a review. International Journal of Production Research, 41(17), 3955-4009. https://doi.org/10.1080/00207540310001626319.

Baccouche, M., Boukachour, J., & Benabdelhafid, A. (2005). Hybrid genetic algorithm for the generalised assignment problem. Journal of Decision Systems, 14(1-2), 83-107. https://doi.org/10.3166/jds.14.83-107

Badhotiya, G.K., Soni, G., & Mittal, M.L. (2018). An analysis of mathematical models for multi-site production and distribution planning. International Journal of Intelligent Enterprise, 5(4), 309-332. https://doi.org/10.1504/IJIE.2018.095714.

Badhotiya, G.K., Soni, G., & Mittal, M.L. (2019). Fuzzy multi-objective optimization for multi-site integrated production and distribution planning in two echelon supply chain. The International Journal of Advanced Manufacturing Technology, 102(1), 635-645. https://doi.org/10.1007/s00170-018-3204-2.

Brahimi, N., Absi, N., Dauzère-Pérès, S., & Nordli, A. (2017). Single-item dynamic lot-sizing problems: an updated survey. European Journal of Operational Research, 263(3), 838-863.

Brandimarte, P. (2006). Multi-item capacitated lot-sizing with demand uncertainty. International Journal of Production Research, 44(15), 2997-3022. https://doi.org/10.1080/00207540500435116.

Buschkühl, L., Sahling, F., Helber, S., & Tempelmeier, H. (2010). Dynamic capacitated lot-sizing problems: a classification and review of solution approaches. Or Spectrum, 32(2), 231-261. https://doi.org/10.1007/s00291-008-0150-7.

Carvalho, D.M., & Nascimento, M.C.V. (2016). Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items. Computers & Operations Research, 71, 137-148. https://doi.org/10.1016/j.cor.2016.01.019.

Carvalho, D.M., & Nascimento, M.C.V. (2018). A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over. Computers & Operations Research, 100, 43-53. https://doi.org/10.1016/j.cor.2018.07.008.

de Armas, J., & Laguna, M. (2019). Parallel machine, capacitated lot-sizing and scheduling for the pipe-insulation industry. International Journal of Production Research, 58(3), 800-817. https://doi.org/10.1080/00207543.2019.1600763.

Deleplanque, S., Kedad-Sidhoum, S., & Quilliot, A. (2013). Lagrangean heuristic for a multi-plant lot-sizing problem with transfer and storage capacities. RAIRO-Operations Research, 47(4), 429-443. https://doi.org/10.1051/ro/2013050.

Deleplanque, S., Quilliot, A., & Kedad-Sidhoum, S. (2012). Decomposing a multi-plant, multi-item lot-sizing problem with transfer costs/capacities into facility location and flow sub-problems. IFAC Proceedings Volumes, 45(6), 1433-1438. https://doi.org/10.3182/20120523-3-RO-2023.00062.

Ghirardi, M., & Amerio, A. (2019). Matheuristics for the lot sizing problem with back-ordering, setup carry-overs, and non-identical machines. Computers & Industrial Engineering, 127, 822-831. https://doi.org/10.1016/j.cie.2018.11.023.

Goldberg, D.E., & Holland, J.H. (1988). Genetic algorithms and machine learning. Machine Learning, 3(2), 95–99. https://doi.org/10.1023/A:1022602019183.

González-Neira, E.M., & Montoya-Torres, J.R. (2017). A GRASP meta-heuristic for the hybrid flowshop scheduling problem. Journal of Decision Systems, 26(3), 294-306. https://doi.org/10.1080/12460125.2017.1351863.

Gopalakrishnan, M., Ding, K., Bourjolly, J.M., & Mohan, S. (2001). A tabu-search heuristic for the capacitated lot-sizing problem with set-up carryover. Management Science, 47(6), 851-863. https://doi.org/10.1287/mnsc.47.6.851.9813.

Goren, H.G., Tunali, S., & Jans, R. (2012). A hybrid approach for the capacitated lot sizing problem with setup carryover. International Journal of Production Research, 50(6), 1582-1597. https://doi.org/10.1080/00207543.2011.559486.

Gruson, M., Bazrafshan, M., Cordeau, J.F., & Jans, R. (2019). A comparison of formulations for a three-level lot sizing and replenishment problem with a distribution structure. Computers & Operations Research, 111, 297-310. https://doi.org/10.1016/j.cor.2019.07.005.

Guinet, A. (2001). Multi-site planning: a transshipment problem. International Journal of Production Economics, 74(1-3), 21-32. https://doi.org/10.1016/S0925-5273(01)00104-9.

Goren, H.G., Tunali, S., & Jans, R. (2010). A review of applications of genetic algorithms in lot sizing. Journal of Intelligent Manufacturing, 21(4), 575-590. https://doi.org/10.1007/s10845-008-0205-2.

Gupta, D., & Magnusson, T. (2005). The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times. Computers & Operations Research, 32(4), 727-747. https://doi.org/10.1016/j.cor.2003.08.014.

Hetreux, G., Merce, C., & Fontan, G. (1996). Multi—stage, multi—product planning: a hierarchical approach using time aggregation. Journal of Decision Systems, 5(1-2), 35-50. https://doi.org/10.1080/12460125.1996.10511673.

Hwang, H.C., & Kang, J. (2020). The two-level lot-sizing problem with outbound shipment. Omega, 90, 101997. https://doi.org/10.1016/j.omega.2018.11.006.

Jans, R., & Degraeve, Z. (2007). Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches. European Journal of Operational Research, 177(3), 1855-1875. https://doi.org/10.1016/j.ejor.2005.12.008.

Kelly Jr, J.D., & Davis, L. (1991, August). A hybrid genetic algorithm for classification. In International Joint Conferences on Artificial Intelligence (Vol. 91, pp. 645-650).

Karimi, B., Ghomi, S.F., & Wilson, J.M. (2003). The capacitated lot sizing problem: a review of models and algorithms. Omega, 31(5), 365-378. https://doi.org/10.1016/S0305-0483(03)00059-8.

Kumar, A., Pant, S., & Ram, M. (2019). Gray wolf optimizer approach to the reliability‐cost optimization of residual heat removal system of a nuclear power plant safety system. Quality and Reliability Engineering International, 35(7), 2228-2239. https://doi.org/10.1002/qre.2499.

Maes, J., McClain, J.O., & Van Wassenhove, L.N. (1991). Multilevel capacitated lotsizing complexity and LP-based heuristics. European Journal of Operational Research, 53(2), 131-148. https://doi.org/10.1016/0377-2217(91)90130-N.

Nascimento, M.C.V., Resende, M.G.C., & Toledo, F.M. (2010). GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem. European Journal of Operational Research, 200(3), 747-754. https://doi.org/10.1016/j.ejor.2009.01.047.

Nascimento, M.C.V., & Toledo, F.M.B. (2008). A hybrid heuristic for the multi-plant capacitated lot sizing problem with setup carry-over. Journal of the Brazilian Computer Society, 14(4), 7-15. https://doi.org/10.1007/BF03192568.

Negi, G., Kumar, A., Pant, S., & Ram, M. (2021). GWO: a review and applications. International Journal of System Assurance Engineering and Management, 12(1),1-8. https://doi.org/10.1007/s13198-020-00995-8.

Mohammadi, M., Musa, S.N., & Omar, M.B. (2020). Optimisation of multi-plant capacitated lot-sizing problems in an integrated supply chain network using calibrated metaheuristic algorithms. International Journal of Operational Research, 39(3), 325-363. https://doi.org/10.1504/ijor.2020.10029302.

Özdamar, L., & Barbarosoglu, G. (2000). An integrated Lagrangean relaxation-simulated annealing approach to the multi-level multi-item capacitated lot sizing problem. International Journal of Production Economics, 68(3), 319-331. https://doi.org/10.1016/S0925-5273(99)00100-0.

Pant, S., Kumar, A., & Ram, M. (2017a). Flower pollination algorithm development: a state of art review. International Journal of System Assurance Engineering and Management, 8(2), 1858-1866. https://doi.org/10.1007/s13198-017-0623-7.

Pant, S., Kumar, A., Bhan, S., & Ram, M. (2017b). A modified particle swarm optimization algorithm for nonlinear optimization. Nonlinear Studies, 24(1), 127-135.

Quadt, D., & Kuhn, H. (2008). Capacitated lot-sizing with extensions: a review. 4OR, 6(1), 61-83. https://doi.org/10.1007/s10288-007-0057-1.

Sahling, F., Buschkühl, L., Tempelmeier, H., & Helber, S. (2009). Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic. Computers & Operations Research, 36(9), 2546-2553. https://doi.org/10.1016/j.cor.2008.10.009.

Sambasivan, M., & Schmidt, C.P. (2002). A heuristic procedure for solving multi-plant, multi-item, multi-period capacitated lot-sizing problems. Asia Pacific Journal of Operational Research, 19(1), 87-106.

Sambasivan, M., & Yahya, S. (2005). A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers. Computers & Operations Research, 32(3), 537-555. https://doi.org/10.1016/j.cor.2003.08.002.

Uniyal, N., Pant, S., & Kumar, A. (2020). An overview of few nature inspired optimization techniques and its reliability applications. International Journal of Mathematical, Engineering and Management Sciences, 5(4), 732-743. https://doi.org/10.33889/IJMEMS.2020.5.4.058.

Vercellis, C. (1999). Multi-plant production planning in capacitated self-configuring two-stage serial systems. European Journal of Operational Research, 119(2), 451-460. https://doi.org/10.1016/S0377-2217(99)00146-0.

Vincent, B., Duhamel, C., Ren, L., & Tchernev, N. (2020). A population-based metaheuristic for the capacitated lot-sizing problem with unrelated parallel machines. International Journal of Production Research, 58(21), 6689-6706. https://doi.org/10.1080/00207543.2019.1685699.

Privacy Policy| Terms & Conditions