Advertisement

Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Application of a hybrid simulated annealing-mutation operator to solve fuzzy capacitated location-routing problem

Abstract

In the field of supply chain management and logistics, using vehicles to deliver products from depots to customers is one of the major operations. Before using vehicles, optimizing the location of depots is necessary in a location-routing problem (LRP). Also, before transportation products, optimizing the routing of vehicles is required so as to provide a low-cost and efficient service for customers. In this paper, the mathematical modelling of LRP is developed according to the existing condition and constraint in the real world. Maximum travelling time constraint is added, and we apply fuzzy numbers to determine customer demands, travelling time and drop time. The objective is to open a subset of depots to assign customers to these depots and to design vehicle routes, in order to minimize both the cost of open depots and the total cost of the routes. The proposed problem is modelled as a fuzzy linear programming (FLP), by applying the fuzzy ranking function method; the proposed FLP is converted to an exact linear programming (LP). A Lingo solver is used to solve this LP model in very small size. LRP is an non-deterministic polynomial-time hard (NP-Hard) problem, and because of the limitation of Lingo solver in solving medium, and large-size numerical examples, a hybrid algorithm including simulated annealing and mutation operator is proposed to solve these numerical examples. Also, a heuristic algorithm is proposed to find a suitable initial solution which is used in hybrid algorithm. At the end, a different analysis of the applied algorithm and a proposed model are introduced.

This is a preview of subscription content, log in to check access.

References

  1. 1.

    Salhi S, Rand CK (1989) The effect of ignoring routes when locating depots. Eur J Oper Res 39:150–156

  2. 2.

    Min H, Jayaraman V, Srivastava R (1998) Combined location-routing problems: a synthesis and future research directions. Eur J Oper Res 108:1–15

  3. 3.

    Nagy G, Salhi S (2007) Location-routing, issues, models and methods: a review. Eur J Oper Res 117:649–672

  4. 4.

    Laporte G (1988) Location-routing problem. In: Golden BL, Assad AA (eds) Vehicle routing: methods and studies. North-Holland, Amsterdam, pp 163–197

  5. 5.

    Wu TH, Low C, Bai JW (2002) Heuristic solutions to multi-depot location-routing problems. Computer and Operations Research 29:1393–1415

  6. 6.

    Prins C, Prodhon C, Wolfler-Calvo R (2006) Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking. OR 4(3):221–238

  7. 7.

    Prins C, Prodhon C, Wolfler-Calvo R (2006) A memetic algorithm with population management (MA|PM) for the capacitated location-routing problem. In: Lecture notes in computerscience. Springer, Berlin, pp 183–194

  8. 8.

    Prins C, Prodhon C, Soriano P, Wolfler-Calvo R (2007) Solving the capacitated location-routing problem by a cooperative lagrangean relaxation-granular tabu search heuristic. Transp Sci 41(4):470–483

  9. 9.

    Barreto SS, Ferreira C, Paixao J, Santos BS (2007) Using clustering analysis in capacitated location-routing problem. Eur J Oper Res 179(3):968–977

  10. 10.

    Duhamel C, Lacomme P, Prins C, and Prodhon C (2008) A memetic approach for the capacitated location-routing problem. Proceedings of the EU/Meeting 2008 workshop on Metaheuristics for logistics and vehicle routing. University of Technology of Troyes, France

  11. 11.

    Duhamel C, Lacomme P, Prins C, Prodhon C (2010) A GRASP × ELS approach for the capacitated location-routing problem. Comput Oper Res 37:1912–1923

  12. 12.

    Yu VF, Lin SW, Lee W, Ting CJ (2010) A simulated annealing heuristic for the capacitated location-routing problem. Comput Ind Eng 58:288–299

  13. 13.

    Nagy G, Salhi S (1998) The many-to-many location-routing problem. Investigation Operativa 6(2):261–275

  14. 14.

    Lin CKY, Kwok RCW (2006) Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data. Eur J Oper Res 175:1833–1849

  15. 15.

    Salhi S, Nagy G (2009) Local improvement in planner facility location using vehicle routing. Annals of Operation Research. doi:10.1007/s10479-007-0223-z

  16. 16.

    Caballero R, Gonzalez M, Guerrero FM, Paralera C (2007) Solving a multiobjective location-routing problem with a metaheuristic based on tabu search. Application to a real case in Andalusia. Eur J Oper Res 117:1751–1763

  17. 17.

    Crevier B, Cordeau JF, Laporte G (2007) The multiple-depot vehicle routing problemwith inter-depot routes. Eur J Oper Res 176:759–773

  18. 18.

    Albareda-Sambola M, Diaz JA, Fernndez E (2005) A compact model and tight bounds for a combined location-routing problem. Computer and Operations Research 32:407–428

  19. 19.

    Aksen D, Altinkemer K (2008) A location-routing problem for the conversion to the click-and-mortar retailing: the static case. Eur J Oper Res 186:554–575

  20. 20.

    Ambrosino D, Sciomachen A, Scutella MG (2009) A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem. Computer and Operations Research 36:442–460

  21. 21.

    Chan Y, Carter WB, Burnes MD (2001) A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands. Computer and Operations Research 28:803–826

  22. 22.

    Ichoua S, Gendreau M, Potvin JY (2003) Vehicle dispatching with time-dependent travel times. Eur J Oper Res 144(2):379–396

  23. 23.

    Lau HCW, Chan TM, Tsui WT, Chan FTS, Ho GTS, Choy KL (2009) A fuzzy guided multi-objective evolutionary algorithm model for solving transportation problem. Expert Syst Appl 36:8255–8268

  24. 24.

    Erbao C, Lai M (2009) A hybrid differential evolution algorithm to vehicle routing problem with fuzzy demands. J Comput Appl Math 231:302–310

  25. 25.

    Xu J, Yan F, Li S (2011) Vehicle routing optimization with soft time windows in a fuzzy random environment. Transportation Research Part E 47:1075–1091

  26. 26.

    Erbao C, Mingyong L (2010) The open vehicle routing problem with fuzzy demands. Expert Syst Appl 37:2405–2411

  27. 27.

    Malekly H, Haddadi B, and Tavakkoli-Moghadam R (2009) A fuzzy random vehicle routing problem: the case of Iran. In: Proceeding of the 39th International Conference on Computers and Industrial Engineering. 1070–1075

  28. 28.

    Tang J, Pan Z, Fung RYK, Lau H (2009) Vehicle routing problem with fuzzy time windows. Fuzzy Set Syst 160:683–695

  29. 29.

    Liu CS, Lai MY (2009) The vehicle routing problem with uncertain demand at nodes. Transportation Research Part E 45:517–524

  30. 30.

    Zujun MA, Ying DAI, Huajun LI, Chanchan WANG (2008) A fuzzy-location-routing-inventory problem in logistics distribution systems. The Eight International Conference of Chinese Logistics and Transportation Professionals, ASCE, 2728–2733

  31. 31.

    Zheng Y, Liu B (2006) Fuzzy vehicle routing model with credibility measure and its hybrid intelligent algorithm. Appl Math Comput 176:673–683

  32. 32.

    Sheng HM, Wang JC, Huang HH, Yen DC (2006) Fuzzy measure on vehicle routing problem of hospital materials. Expert Syst Appl 30:367–377

  33. 33.

    Lai KK, Liu B, and Peng J (2003) Vehicle routing problem with fuzzy travel times and its genetic algorithm, Technical Report

  34. 34.

    Teodorovic D, Pavkovic G (1996) The fuzzy set theory approach to the vehicle routing problem when demand at nodes is uncertain. Fuzzy Set Syst 82:307–317

  35. 35.

    Cheng R, Gen M (1995) Vehicle routing problem with fuzzy due-time using genetic algorithm. Japanese Journal of Fuzzy Theory and Systems 7(5):1050–1061

  36. 36.

    Teodorovic D, Kikuchi S (1991) Application of fuzzy set theory to the saving based vehicle routing algorithm. Civil Engineering and Environment Systems 8(2):87–93

  37. 37.

    Kaufmann AA, Gapta MM (1991) Introduction to fuzzy arithmetic: theory and applications. Van Nostrand Reinhold, New York

  38. 38.

    Dubois DA, Prade H (1980) Fuzzy sets and systems: theory and applications. Academic Press Inc, New York

  39. 39.

    Chen SM, Chen JH (2009) Fuzzy risk analysis based on ranking generalized fuzzy numbers with different heights and different spreads. Expert Syst Appl 36:6833–6842

  40. 40.

    Tanaka H, Okuda T, Asai K (1984) On fuzzy mathematical programming. Journal of Cyber 3:37–46

  41. 41.

    Tanaka H, Asai K (1984) Fuzzy linear programming problems with fuzzy numbers. Fuzzy Sets Sys 13:1–10

  42. 42.

    Maleki HR, Tata M, Mashinchi M (2000) Linear programming with fuzzy variables. Fuzzy Sets Sys 109:21–33

  43. 43.

    Fang SC, Hu CF (1999) Linear programming with fuzzy coefficients in constraints. Comput Math Appl 37:63–76

  44. 44.

    Gasimov RN, Yenilmez K (2002) Solving fuzzy linear programming problems with linear membership function. Turk J Math 26:375–396

  45. 45.

    Maleki HR (2002) Ranking functions and their applications to fuzzy linear programming. Far East J Math Sci (FJMS) 4:283–301

  46. 46.

    Mishmast Nehi H, Maleki HR, Mashinchi M (2004) Solving fuzzy number linear programming problem by Lexicographic ranking function. Italian J Pure Appl Math 15:9–20

  47. 47.

    Chen SP, Hsueh YJ (2008) A simple approach to fuzzy critical path analysis in project networks. Appl Math Model 32:1289–1297

  48. 48.

    Cadenas JM, Verdegy JL (2000) Using ranking functions in multiobjective fuzzy linear programming. Fuzzy Set Syst 111:47–53

  49. 49.

    Shih LH (1999) Cement transportation planning via fuzzy linear programming. International Journal of Production Economics 58:277–287

  50. 50.

    Mahdavi-Amiri N, Nasseri SH (2006) Duality in fuzzy number linear programming by use of a certain linear ranking function. Appl Math Comput 180:206–216

  51. 51.

    Mahdavi-Amiri N, Nasseri SH (2010) Duality results and dual simplex method for linear programming problems with trapezoidal fuzzy variables. Fuzzy Sets and Systema 158:1961–1978

  52. 52.

    Metropolis N, Rosenbluth AW, Teller AH (1953) Equation of state calculations by fast computing machines. Journal of Chemical Physics 21:1087–1092

  53. 53.

    Wu TH, Low C, Bai JW (2002) Heuristic solutions to multi-depot location-routing problems. Comput Oper Res 29:1393–1415

  54. 54.

    Bouhafs L, Hajjam A, Koukam A (2006) A combination of simulated annealing and ant colony system for the capacitated location-routing problem. Lecture Notes in Computer Science 4251:409–415

  55. 55.

    Yu FV, Lin SW, Lee W, Ting CJ (2009) A simulated annealing heuristic for the capacitated location-routing problem. Comput Ind Eng. doi:10.1016/j.cie2009.10.007

  56. 56.

    Wu TH, Chang CC, Yeh JY (2009) A hybrid heuristic algorithm adopting both Boltzmann function and mutation operator for manufacturing cell formation problems. Int J Production Economics 120:669–688

  57. 57.

    Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor

  58. 58.

    Pham JH, Karaboga D (2000) Intelligent optimization techniques. Springer, London

Download references

Author information

Correspondence to Maghsoud Amiri.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Golozari, F., Jafari, A. & Amiri, M. Application of a hybrid simulated annealing-mutation operator to solve fuzzy capacitated location-routing problem. Int J Adv Manuf Technol 67, 1791–1807 (2013). https://doi.org/10.1007/s00170-012-4609-y

Download citation

Keywords

  • Supply chain management
  • Fuzzy capacitated location-routing problem (FCLRP)
  • Fuzzy linear programming (FLP)
  • Ranking function
  • Hybrid simulated annealing-mutation operator (HSAM)