An analysis of multi-item inventory model using particle swarm optimization under discrete delivery orders and limited storage space
AbstractThis study explores an economic production quantity (EPQ) model designed with the assumptions of discrete delivery orders and storage capacity constraints for a multi-item production inventory system. The main purpose of this study is to determine the optimal order quantity, the optimal number of deliveries and the optimal delivery quantity. First, the developed model as part of this study was analyzed using Genetic Algorithm (GA). Numerical analysis results were compared with those of previous studies and it was found that it is possible to have better results with an increasing number of iteration. The same model was then analyzed using Particle Swarm Optimization (PSO) algorithm. A comparison of the optimization methods showed that PSO gives better results over the GA under the same number of iterations and using the same population. The effects of important model parameters such as number of iterations, population, crossover, mutation rate on the optimal solution were analyzed. The results showed that PSO performs better than the GA with respect to the total cost and the total runtime as the solution of the problem in question.
F. W. Harris, “How Many Parts to Make at Once,” Factory, Mag. Manag., vol. 10, no. 2, p. 135–136,152, 1913.
E. W. Taft, “The most economical production lot.,” Iron Age, vol. 101, no. 18, pp. 1410–1412, 1918.
S. Eilon, “Scheduling for batch production,” Inst. Prod. Eng. J., vol. 36, no. 9, pp. 549–570, 1957.
J. Rogers, “A Computational Approach to the Economic Lot Scheduling Problem,” Manage. Sci., vol. 4, no. 3, pp. 264–291, 1958.
E. E. Bomberger, “A Dynamic Programming Approach to a Lot Size Scheduling Problem,” Manage. Sci., vol. 12, no. 11, pp. 778–784, 1966.
J. G. Madigan, “Scheduling a Multi-Product Single Machine System for an Infinite Planning Period,” Management Science, vol. 14. INFORMS, pp. 713–719, 1968.
C. L. Doll and D. C. Whybark, “An Iterative Procedure for the Single-Machine Multi-Product Lot Scheduling Problem,” Management Science, vol. 20. INFORMS, pp. 50–55, 1973.
E. A. Silver, “A Simple Method of Determining Order Quantities in Joint Replenishments under Deterministic Demand,” Management Science, vol. 22. INFORMS, pp. 1351–1361, 1976.
S. E. Elmaghraby, “The Economic Lot Scheduling Problem (ELSP): Review and Extensions,” Management Science, vol. 24. INFORMS, pp. 587–598, 1978.
S. K. Gupta and J. Kyparisis, “Single machine scheduling research,” Omega, vol. 15, no. 3, pp. 207–227, Jan. 1987.
G. Gallego and I. Moon, “The Effect of Externalizing Setups in the Economic Lot Scheduling Problem,” Oper. Res., vol. 40, no. 3, pp. 614–619, Jun. 1992.
S. Arcade, “Single machine multi-product batch scheduling: Testing several solution methods,” Omega, vol. 21, no. 6, pp. 709–711, Nov. 1993.
M. Khouja, Z. Michalewicz, and M. Wilmot, “The use of genetic algorithms to solve the economic lot size scheduling problem,” Eur. J. Oper. Res., vol. 110, no. 3, pp. 509–524, Nov. 1998.
I. Moon, E. A. Silver, and S. Choi, “Hybrid genetic algorithm for the economic lot-scheduling problem,” Int. J. Prod. Res., vol. 40, no. 4, pp. 809–824, 2002.
T. Kim, Y. Hong, and S. Y. Chang, “Joint economic procurement—production–delivery policy for multiple items in a single-manufacturer, multiple-retailer system,” Int. J. Prod. Econ., vol. 103, no. 1, pp. 199–208, Sep. 2006.
O. Tang and R. Teunter, “Economic Lot Scheduling Problem with Returns.,” Prod. Oper. Manag., vol. 15, no. 4, p. 488, 2006.
R. Teunter, O. Tang, and K. Kaparis, “Heuristics for the economic lot scheduling problem with returns,” Int. J. Prod. Econ., vol. 118, no. 1, pp. 323–330, Mar. 2009.
A. Taleizadeh, A. A. Najafi, and S. T. Akhavan Niaki, “Economic Production Quantity model with scrapped items and limited production capacity,” Sci. Iran., vol. 17, no. 1 E, pp. 58–69, 2010.
A. A. Taleizadeh, H. M. Wee, and S. J. Sadjadi, “Multi-product production quantity model with repair failure and partial backordering,” Comput. Ind. Eng., vol. 59, no. 1, pp. 45–54, 2010.
S. Zanoni, A. Segerstedt, O. Tang, and L. Mazzoldi, “Multi-product economic lot scheduling problem with manufacturing and remanufacturing using a basic period policy,” Comput. Ind. Eng., vol. 62, no. 4, pp. 1025–1033, May 2012.
A. A. Taleizadeh, L. E. Cárdenas-Barrón, J. Biabani, and R. Nikousokhan, “Multi products single machine EPQ model with immediate rework process,” Int. J. Ind. Eng. Comput., vol. 3, no. 2, pp. 93–102, 2012.
A. A. Taleizadeh, S. G. Jalali-Naini, H. M. Wee, and T. C. Kuo, “An imperfect multi-product production system with rework,” Sci. Iran., vol. 20, no. 3, pp. 811–823, 2013.
H.-C. Chang, L.-Y. Ouyang, K.-S. Wu, and C.-H. Ho, “Integrated vendor–buyer cooperative inventory models with controllable lead time and ordering cost reduction,” Eur. J. Oper. Res., vol. 170, no. 2, pp. 481–495, Apr. 2006.
S. Pal, M. K. Maiti, and M. Maiti, “An EPQ model with price discounted promotional demand in an imprecise planning horizon via Genetic Algorithm,” Comput. Ind. Eng., vol. 57, no. 1, pp. 181–187, 2009.
G. C. Mahata and P. Mahata, “Analysis of a fuzzy economic order quantity model for deteriorating items under retailer partial trade credit financing in a supply chain,” Math. Comput. Model., vol. 53, no. 9–10, pp. 1621–1636, 2011.
A. H. Nobil, A. H. A. Sedigh, and L. E. Cárdenas-Barrón, “A multiproduct single machine economic production quantity (EPQ) inventory model with discrete delivery order, joint production policy and budget constraints,” Ann. Oper. Res., pp. 1–37, 2017.
S. H. R. Pasandideh, S. T. A. Niaki, and M. H. Far, “A multiproduct EOQ model with permissible delay in payments and shortage within warehouse space constraint: a genetic algorithm approach,” Int. J. Math. Oper. Res., vol. 10, no. 3, p. 316, 2017.
A. A. Taleizadeh, L. E. Cárdenas-Barrón, and B. Mohammadi, “A deterministic multi product single machine EPQ model with backordering, scraped products, rework and interruption in manufacturing process,” Int. J. Prod. Econ., vol. 150, pp. 9–27, Apr. 2014.
L. Đorđević, S. Antić, M. Čangalović, and A. Lisec, “A metaheuristic approach to solving a multiproduct EOQ-based inventory problem with storage space constraints,” Optim. Lett., vol. 11, no. 6, pp. 1137–1154, 2017.
H. Mokhtari, “A joint internal production and external supplier order lot size optimization under defective manufacturing and rework,” Int. J. Adv. Manuf. Technol., pp. 1–20, 2017.
S. H. R. Pasandideh and S. T. A. Niaki, “A genetic algorithm approach to optimize a multi-products EPQ model with discrete delivery orders and constrained space,” Appl. Math. Comput., vol. 195, no. 2, pp. 506–514, 2008.
A. H. Nobil, S. T. A. Niaki, and E. Nobil, “An effective and simple algorithm to solve the discrete multi-product economic production quantity model,” Econ. Comput. Econ. Cybern. Stud. Res., vol. 51, no. 3, pp. 251–261, 2017.
J. H. Holland, Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. MIT press, 1992.
J. Kennedy and R. Eberhart, “Particle swarm optimization,” in Proceedings of ICNN’95 - International Conference on Neural Networks, 1995, vol. 4, pp. 1942–1948.
Copyright (c) 2019 International Journal of Intelligent Systems and Applications in Engineering
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
All papers should be submitted electronically. All submitted manuscripts must be original work that is not under submission at another journal or under consideration for publication in another form, such as a monograph or chapter of a book. Authors of submitted papers are obligated not to submit their paper for publication elsewhere until an editorial decision is rendered on their submission. Further, authors of accepted papers are prohibited from publishing the results in other publications that appear before the paper is published in the Journal unless they receive approval for doing so from the Editor-In-Chief.
IJISAE open access articles are licensed under a Creative Commons Attribution-ShareAlike 4.0 International License. This license lets the audience to give appropriate credit, provide a link to the license, and indicate if changes were made and if they remix, transform, or build upon the material, they must distribute contributions under the same license as the original.