International Journal of Nonlinear Analysis and Applications

Presenting a multi-objective model to develop depot location through particle swarm optimization algorithm in Artawheel Tire Company

Document Type : Research Paper

Authors

Department of Industrial Management, Central Tehran Branch, Islamic Azad University, Tehran, Iran

Abstract

This study aimed to present a multi-objective model for the location of depots through a particle swarm optimization algorithm in Artawheel Tire Company. It is applied in terms of purpose and survey and descriptive in terms of the nature of research and data collection. Data collection tools are documents and interviews with experts. Also, the research is of the predictive type in proportion to the fact that the research seeks to locate the depot using the particle swarm optimization algorithm. Given that this problem falls into the category of Hard-PN problems, a meta-heuristic method based on the particle swarm optimization algorithm is used to solve it. Two particle group optimization algorithms and genetics have been used as benchmark algorithms to evaluate the performance of the proposed algorithm. The proposed particle cluster optimization algorithms are implemented in the Matlab 7.5 programming software and the genetic algorithm is implemented using the Matlab 7.5 software toolbox. According to the results of this study, it was found that the use of a particle swarm algorithm to solve the problem of vehicle routing can improve the objective function as well as the total number of routes travelled by vehicles.

Keywords

[1] M. Ahmadinejad, H. Ghaderi, M. Hadian, P. Haghighatfard and A. Bordbar, Optimal location of urban medical centers using: GIS region 11 of Tehran, J. Fasa Univ. Med. Sci. 4 (2014), no. 4, 463–474.
[2] M. Albareda-Sambola, J.A. Dıaz and E. Fernandez, A compact model and tight bounds for a combined location routing problem, Comput. Oper. Res. 32 (2015), 407–428.
[3] D. Ambrosino and M.G. Scutella, Distribution network design: New problems and related models, Eur. J. Oper. Res. 165 (2010), 610–624.
[4] I. Averbakh and O. Berman, Minmax p-traveling salesmen location problems on a tree, Annal. Oper. Res. 110 (2002), no. 1, 55–68.
[5] F. Barzinpour, M. Saffarian, Mohsen and E. Teymouri, Cross-functional algorithm for solving the planning model of screening and allocation, J. Res. Appl. Oper. 11 (2014), no. 2, 27–50.
[6] M. Bashiri, H. Rezaei and A. Moslemi, A strong approach to relocating three-level supply chain depots in uncertainty, Journal of Production and Operations Manag. 3 (2012), no. 4, 101–116.
[7] J.E. Beasley and E.M. Nascimento, The vehicle routing-allocation problem: A unifying framework, Top 4 (1996), 1, 65–86.
[8] O. Beramn and D. Simchi-Levi, The conditional location problem on networks, Transport. Sci. 24 (1990), 77–78.
[9] A. Billionnet, S. Elloumi and L. Grouz Djerbi, Designing radio-mobile access networks based on synchronous digital hierarchy rings, Comput. Oper. Res. 32 (2005), no. 2, 379–394.
[10] I.M. Branco and J.D. Coelho, The Hamiltonian p-median problem, European J. Oper. Res. 47 (1990), no. 1, 86–95.
[11] R.C. Burness and J.A. White, The traveling salesman location problem, Transport. Sci. 10 (1976), no. 4, 348–360.
[12] A. Bruns, A. Klose and P. St¨ahly, Restructuring of Swiss parcel delivery services, OR-Spektrum, 22 (2000), no. 2, 285–302.
[13] A.L. Chen, G.K. Yang and Z.M. Wu, Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem, J. Zhejiang Univ. Sci. A 7 (2014), no. 4, 607–614.
[14] I. Contreras, J.F. Cordeau and G. Laporte, Stochastic uncapacitated hub location, Eur. J. Oper. Res. 212 (2011), no. 3, 518–528.
[15] R. Eberhart and J. Kennedy, Particle swarm optimization, Proc. IEEE Int. Conf. Neural Networks, 1995, pp. 1942–1948.
[16] M.C. Georgiadis, P. Tsiakis, P. Longinidis and M.K. Sofioglou, Optimal design of supply chain networks under uncertain transient demand variations, Omega 39 (2011), no. 3, 254–272.
[17] P.K. Ho and J. Perl, Warehouse location under service-sensitive demand, J. Bus. Logistics 16 (2014), no. 1, 133–162.
[18] B. Holland, Implementing fuzzy goal programming for warehouse selection, J. Constr. Eng. Manag. 13 (2015), no. 2, 1–16.
[19] S.K. Jacobsen and O.B. Madsen, A comparative study of heuristics for a two-level routing-location problem, Eur. J. Oper. Res. 5 (1980), no. 6, 378–387.
[20] M. Labbe and G. Laporte, Maximizing user convenience and postal service efficiency in post box location, JORBEL-Belgian J. Oper. Res. Statist. Comput. Sci. 26 (1986), no. 2, 21–36.
[21] M. Labbe, G. Laporte, I. Rodrıguez-Mart´ın and J.J. Salazar-Gonzalez, Locating median cycles in networks, Eur. J. Oper. Res. 160 (2013), 457–470.
[22] M. Labbe, I. Rodrıguez-Martın and J.J. Salazar-Gonzalez, A branch-and-cut algorithm for the plant-cycle location problem, J. Oper. Res. Soc. 55 (2014), 513–520.
[23] R. Lahyani, F. Semet and B. Trouillet, Vehicle routing problems with scheduling constraints, Metaheuristics for Production Scheduling, B. Jarboui, P. Siarry and J. Teghem (Eds), 2013.
[24] Y. Lee, J. Han and K. Kang, A fiber routing problem in designing optical transport networks with wavelength division multiplexed systems, Photonic Network Commun. 5 (2003), 247–257.
[25] S.C. Liu and S.B. Lee, A two-phase heuristic method for the multi-depot location routing problem taking inventory control decisions into considerations, Int. J. Adv. Manufact. Tech. 22 (2013), 941–950.
[26] S. Mazzeo and I. Loiseau, An ant colony algorithm for the capacitated vehicle routing, Electron. Notes Discrete Math. 18 (2014), no. 5, 181–186.
[27] C. McDiarmid, Probability modelling and optimal location of a travelling salesman, J. Oper. Res. Soc. 43 (1992), no. 5, 533–538.
[28] E. Melachrinoudis, H. Min and X. Wu, A multiobjective model for the dynamic location of landfills, Location Sci. 3 (1995), no. 3, 143–166.
[29] R. Moghimi, A. Alizadeh and M. Safavi, Strategic Location of Depot s, First Int. Conf. Account. Manag., Tehran, 2015.
[30] G. Mosheiov, The pickup delivery location problem on networks, Networks 26 (1995), no. 4, 243–251.
[31] J.M. Nambiar, L.F. Gelders and L.N. Van Wassenhove, Plant location and vehicle routing in the Malaysian rubber smallholder sector: A case study, Eur. J. Oper. Res. 38 (1989), no. 1, 14–26.
[32] G. Nagy and S. Salhi, The many-to-many location-routing problem, Top 6 (1998), no. 2, 261–275.
[33] A. Noruzi, Location of warehouse routing and route allocation assumption, First Int. Conf. Account. Manag., Tehran, 2015.
[34] J. Perl and M.S. Daskin, A warehouse location-routing problem, Transport. Res. Part B: Methodol. 19 (1985), no. 5, 381–396.
[35] M.R. Rafiei, Optimal location of sales centers using GIS, J. Landscape Manag. 12 (2014), no. 8, 39–52.
[36] M. Schwardt and J. Dethloff, Solving a continuous location-routing problem by use of a self-organizing map, Int. J. Phys. Distribut. Logistics Manag. 35 (2005), no. 6.
[37] M. Wasner and G. Zapfel, An integrated multi-depot hub location vehicle routing model for network planning of parcel service, Int. J. Prod. Econ. 90 (2014), 403–419.
[38] C. Watson-Gandy and P. Dohrn, Depot location with van salesmen—a practical approach, Omega 1 (1973), 321–329.
[39] T.H. Wu, C. Low and J.-W. Bai, Heuristic solutions to multi-depot location-routing problems, Manag. Sci. 29 (2002), no. 10.
International Journal of Nonlinear Analysis and Applications
Volume 14, Issue 11
November 2023
Pages 271-286
  • Receive Date: 25 May 2022
  • Revise Date: 06 July 2022
  • Accept Date: 26 July 2022