Abstract

This paper proposes a multi-item economic order quantity model with imperfect items in supply deliveries. The inspection process to classify the items is not perfect and involves two types of error: Type-I and Type-II. To cope with the uncertainty involved in real-world applications and to bring the problem closer to reality, operational constraints are assumed stochastic. The aim is to determine the optimal order and back order sizes of the items in order to achieve maximum total profit. As the proposed mathematical model is a constrained nonlinear programming, three different solution methods including an exact method named the interior-point and two novel meta-heuristics named grey wolf optimizer (GWO) and moth-flame optimization (MFO) algorithms are utilized to solve the problem. In order to demonstrate the most efficient solution method, the performance of the three solution methods is evaluated when they solve some test problems of different sizes. Various comparison measures including percentage relative error, relative percentage deviation, and computation time are used to compare the solution methods. Based on the results, MFO performs better in small and medium instances in terms of percentage relative error; meanwhile, GWO shows a better performance in terms of relative percentage deviation in large-size test problems. In the end, sensitivity analyses are carried out to investigate how any parameter change affects the objective function value of the mathematical model in order to determine the most critical parameter.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.