An Efficient Algorithm for Solving a Stochastic Location-routing Problem

Volume 12, Issue 1, pp 27 - 38 http://dx.doi.org/10.22436/jmcs.012.01.03

Download PDF

Download XML

• Export citations
  • CITATIONS & REFERENCES
  • EndNote (.ENW)
  • Mendeley, JabRef (.BIB)
  • Papers, Zotero, Reference Manager, RefWorks (.RIS)
  • ARTICLE CITATION
  • EndNote (.ENW)
  • Mendeley, JabRef (.BIB)
  • Papers, Zotero, Reference Manager, RefWorks (.RIS)
  • REFERENCES
  • EndNote (.ENW)
  • Mendeley, JabRef (.BIB)
  • Papers, Zotero, Reference Manager, RefWorks (.RIS)

• 2393 Downloads
• 2956 Views

Authors

H. A. Hassan-pour - Department of Industrial Engineering, Faculty of Engineering, Imam Hossein University, Tehran, Iran. M. Mosadegh-khah - Department of Industrial Engineering, Faculty of Engineering, Imam Hossein University, Tehran, Iran. M. Zareei - Department of Industrial Engineering, Faculty of Engineering, Imam Hossein University, Tehran, Iran.

Abstract

The purpose of this paper is to determine the location of facilities and routes of vehicles, in which the facilities and routes are available within probability interval (0, 1). Hence, this study is coherent the stochastic aspects of the location problem and the vehicle routing problem (VRP). The location problem is solved by optimization software. Because of the computational complexity of the stochastic vehicle routing problem (SVRP), it is solved by a meta-heuristic algorithm based on simulated annealing (SA). This hybrid algorithm uses genetic operators in order to improve the quality of the obtained solutions. Our proposed hybrid SA is more efficient than the original SA algorithm. The associated results are compared with the results obtained by SA and optimization software.

Share and Cite

Keywords

• Location
• Vehicle routing problem
• Stochastic
• simulated annealing
• Genetic operators.

MSC

•  90B80
•  90B06

References

• [1] H. Min, V. Jayaraman, R. Srivastava, Combined location-routing problem: A synthesis and future research directions, European Journal of Operational Research, 108 (1998), 1-15.
  • View Article
  • Google Scholar


• [2] G. Nagy, S. Salhi, Location- routing: Issues, models and methods, European Journal of Operational Research, 176 (2007), 649-672
  • View Article
  • MathSciNet
  • Google Scholar
  • MATH


• [3] S. D. Lee, W. T. Chang , On solving the discrete location problems when the facilities are prone to failure, Applied Mathematical Modeling, 31 (2007), 817-831.
  • View Article
  • Google Scholar
  • MATH


• [4] H. S. Hwang, Design of supply-chain logistics system considering service level , Computers & Industrial Engineering, 43 (2002), 283-297.
  • View Article
  • Google Scholar


• [5] H. S. Hwang, A stochastic set-covering location model for both ameliorating and deteriorating items, Computers & Industrial Engineering, 46 (2004), 313-319.
  • View Article
  • Google Scholar


• [6] H. A. Hassan-Pour, M. Mosadegh-Khah, R. Tavakkoli-Moghaddam, Solving a multi-objective multi-depot stochastic location-routing problem by a hybrid simulated annealing , Proceeding of the institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture, 223 (2009), 1045-1054.
  • View Article
  • Google Scholar


• [7] T. H. Wu, C. Low, J. W. Bai, Heuristic solution to multi-depot location-routing problems, Computers & Operations Research, 29 (2002), 1393-1415.
  • View Article
  • Google Scholar
  • MATH


• [8] K. Doerner, A. Focke, W. J. Gujahr, Multicriteria tour planning for mobile healthcare facilities in a developing country, European Journal of Operational Research, 179 (2007), 1078-1096.
  • View Article
  • Google Scholar
  • MATH


• [9] G. Zhou, H. Min, M. Gen , A genetic algorithm approach to the bi-criteria allocation of customers to warehouses, International Journal of production Economics, 86 (2003), 34- 45.
  • View Article
  • Google Scholar


• [10] F. Chu, N. Labadi, C. Prins, Heuristics for the periodic capacitated arc routing problem, Journal of Intelligent Manufacturing, 16(2) (2005), 243-251.
  • View Article
  • Google Scholar


• [11] S. Alumur, B. Y. Kara , A new model for the hazardous waste location-routing problem, Computers & operations Research, 34 (2007), 1406-1423.
  • View Article
  • Google Scholar
  • MATH


• [12] E. Erkut, O. Alp , Designing a road network for hazardous material shipment, Computers & Operations Research, 34 (2007), 1389-1405.
  • View Article
  • Google Scholar


• [13] R. Caballero, M. Gonzalez, F. M. Guerrero, J. Molina, C. Paralera, Solving a multiobjective location routing problem with a metaheuristic based on tabu search: Application to a real case in Andalusia, European Journal of Operational Research, 176 (2007), 1751-1763.
  • View Article
  • Google Scholar
  • MATH


• [14] S. Z. Erdogan, E. M. Esin , Routing table updating by using intelligent agents , Journal of Intelligent Manufacturing, 20(2) (2009), 187-193.
  • View Article
  • Google Scholar


• [15] S. C. Liu, C. H. Chung, A heuristic method for the vehicle routing problem with backhauls and inventory, Journal of Intelligent Manufacturing, 20(1) (2009), 29-42.
  • View Article
  • Google Scholar


• [16] S. C. Liu, C. H. Chung, A heuristic method for the vehicle routing problem with backhauls and inventory , Journal of Intelligent Manufacturing, 20(1) (), 29-42.
  • View Article
  • Google Scholar


• [17] H. A. Hassan-Pour, M. Mosadegh-Khah, R. Tavakkoli-Moghaddam, An integrated location-routing problem in a stochastic environment by a hybrid simulated annealing, Proceedings of the 6th International Symposium on Intelligent & Manufacturing Systems, Sakarya University, Turkey, (2008), 552-558.


• [18] A. R. Rahimi-Vahed, M. Rabbani, R. Tavakkoli-Moghaddam, S. A. Torabi, F. Jolai, A multi-objective scatter search for mixed-model assembly line sequencing problem, Advanced Engineering Informatics, 21 (2007), 85-99.
  • View Article
  • Google Scholar


• [19] R. Tavakkoli-Moghaddam, N. Saffaei, Y. Gholipour, A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length, Applied Mathematics and Computation, 176 (2006), 445-454.
  • View Article
  • MathSciNet
  • Google Scholar
  • MATH