New mathematical modeling for a location–routing–inventory problem in a multi-period closed-loop supply chain in a car industry
محورهای موضوعی : Mathematical Optimization
F. Forouzanfar
1
(Department of Industrial Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran)
R. Tavakkoli-Moghaddam
2
(School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran|LCFC, Arts et Métier Paris Tech, Metz, France)
M. Bashiri
3
(Department of Industrial Engineering, Faculty of Engineering, Shahed University, Tehran, Iran)
A. Baboli
4
(DISP Laboratory, INSA-Lyon, University of Lyon, Villeurbanne, France)
S. M . Hadji Molana
5
(Department of Industrial Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran)
کلید واژه: routing, Location, inventory . Multi-period . Closed-loop supply chain . Lost sales . Backlog,
چکیده مقاله :
This paper studies a location–routing–inventory problem in a multi-period closed-loop supply chain with multiple suppliers, producers, distribution centers, customers, collection centers, recovery, and recycling centers. In this supply chain, centers are multiple levels, a price increase factor is considered for operational costs at centers, inventory and shortage (including lost sales and backlog) are allowed at production centers, arrival time of vehicles of each plant to its dedicated distribution centers and also departure from them are considered, in such a way that the sum of system costs and the sum of maximum time at each level should be minimized. The aforementioned problem is formulated in the form of a bi-objective nonlinear integer programming model. Due to the NP-hard nature of the problem, two meta-heuristics, namely, non-dominated sorting genetic algorithm (NSGA-II) and multi-objective particle swarm optimization (MOPSO), are used in large sizes. In addition, a Taguchi method is used to set the parameters of these algorithms to enhance their performance. To evaluate the efficiency of the proposed algorithms, the results for small-sized problems are compared with the results of the ε-constraint method. Finally, four measuring metrics, namely, the number of Pareto solutions, mean ideal distance, spacing metric, and quality metric, are used to compare NSGA-II and MOPSO.
