Department of Industrial Engineering,Tarbiat Modares University
Abstract
The location-routing problem is one of the most important location problems for designing
integrated logistics systems. In the last three decades, various types of objective function and constraints
have been considered for this problem. However, time window constraints have received little attention,
despite their numerous real-life applications. In this article, a new 4-index mathematical model, an
ecient and fast heuristic and a lower bound for the two-echelon location-routing problems with soft
time window constraints are presented. The proposed heuristic tries to solve the problem via creating
an initial solution, then improving it by searching on six neighborhoods of the solution, and using the
Or-opt heuristic. At the end, computational results show the eciency of the proposed heuristic, using
the proposed lower bound.
Zegordi, S., & Nikbakhsh, E. (2010). A Heuristic Algorithm and a Lower Bound for the Two-Echelon Location-Routing Problem with Soft Time Window Constraints. Scientia Iranica, 17(1), -.
MLA
S.H. Zegordi; E. Nikbakhsh. "A Heuristic Algorithm and a Lower Bound for the Two-Echelon Location-Routing Problem with Soft Time Window Constraints". Scientia Iranica, 17, 1, 2010, -.
HARVARD
Zegordi, S., Nikbakhsh, E. (2010). 'A Heuristic Algorithm and a Lower Bound for the Two-Echelon Location-Routing Problem with Soft Time Window Constraints', Scientia Iranica, 17(1), pp. -.
VANCOUVER
Zegordi, S., Nikbakhsh, E. A Heuristic Algorithm and a Lower Bound for the Two-Echelon Location-Routing Problem with Soft Time Window Constraints. Scientia Iranica, 2010; 17(1): -.
)