Journal
COMPUTERS & INDUSTRIAL ENGINEERING
Volume 121, Issue -, Pages 97-112Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2018.05.010
Keywords
Two-echelon vehicle routing problem; Open vehicle routing problem; Location routing problem; Vehicle routing; Integer programing; Simulated annealing
Ask authors/readers for more resources
Multi echelon distribution systems have become more common in recent years. This paper addresses the two echelon open location routing problem (2E-OLRP) which is a variant of the two echelon location routing problem (2E-LRP). This problem seeks to find a minimum-cost set of vehicle routes that do not return to the depot in the first echelon and do not return to satellites in the second echelon due to the presence of individual contractors and third party logistics (3PL) providers. In spite of the large amount of research on LRPs, the 2E-OLRP has received very little attention. Three flow-based mixed-integer linear programs and a hybrid heuristic algorithm are proposed to deal with this problem. Extensive experiments evaluate the effectiveness of these methods.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available