Volume 20, Issue 1 (Inernational Journal of Indsutrial Engineering & Production Research 2009)                   2009, 20(1): 1-14 | Back to browse issues page

XML Persian Abstract Print


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

Zegordi S H, Nikbakhsh E. A Heuristic and a Lower Bound for the Two-Echelon Location-Routing Problem . Journal title 2009; 20 (1) :1-14
URL: http://ijiepm.iust.ac.ir/article-1-56-en.html
, zegordi@modares.ac.ir
Abstract:   (13188 Views)

 During the last three decades, the integrated optimization approach to logistics systems has become one of the most important aspects of the supply chain optimization. This approach simultaneously considers the interdependence of the location of the facilities, suppliers/customers allocation to the facilities, the structure of transportation routes, and inventory planning and control. Location-routing problem is one of the most important classes of location problems for considering this approach. In this problem, the number and location of facilities, size of the transportation fleet, and the route structures are to be found with respect to the location and characteristics of suppliers and customers. In this study, a mathematical model, an efficient and fast heuristic algorithm, an effective metaheuristic algorithm based on simulated annealing, and a new lower bound for the two-echelon location-routing problem with vehicle fleet capacity and maximum route length constraints are presented. At the end, the computational results show the efficiency of the proposed algorithms using the proposed obtained lower bound.

Full-Text [PDF 562 kb]   (4391 Downloads)    
Type of Study: Research |
Received: 2009/05/27 | Published: 2009/04/15

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

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.