Volume 16, Issue 4 (12-2019)                   2019, 16(4): 15-36 | Back to browse issues page

XML Persian Abstract Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Ghaderi A, Khanzadeh C. A Combined Stochastic Programming and Robust Optimization Approach for Location-Routing Problem and Solving it via Variable Neighborhood Search algorithm. Journal of Operational Research and Its Applications. 2019; 16 (4) :15-36
URL: http://jamlu.liau.ac.ir/article-1-1698-en.html
Assistant Professor of Industrial Engineering, University of Kurdistan, Sanandaj, Iran
Abstract:   (1594 Views)
The location-routing problem is one of the combined problems in the area of supply chain management that simultaneously make decisions related to location of depots and routing of the vehicles. In this paper, the single-depot capacitated location-routing problem under uncertainty is presented. The problem aims to find the optimal location of a single depot and the routing of vehicles to serve the customers when the parameters may change under different circumstances. To get closer to real-world situations, travel time of vehicles, the fixed cost of using vehicles and customers’ demand are considered as a source of uncertainty. A combined approach including robust optimization and stochastic programming was presented to deal with the uncertainty in the problem at hand. For this purpose, a mixed integer programming model is developed and a numerical example is provided to illustrate the solution procedure on the related network. To solve the problem, Variable Neighborhood Search is also proposed. The results obtained from solving sample problems using an exact and heuristic algorithm represent the acceptable performance of the proposed algorithm.
Full-Text [PDF 1367 kb]   (680 Downloads)    
Type of Study: Applicable | Subject: Special
Received: 2018/06/5 | Accepted: 2019/09/14 | Published: 2019/12/28

Add your comments about this article : Your username or Email:

Send email to the article author

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.