The two echelon open location routing problem: Mathematical model and hybrid heuristic. (July 2018)

• Record Type: Journal Article
• Authors: Pichka, Khosro; Bajgiran, Amirsaman H.; Petering, Matthew E.H.; Jang, Jaejin; Yue, Xiaohang
• Is Part Of: Computers & industrial engineering. Volume 121(2018)
• Page Start: 97
• Page End: 112
• Publication Date: 2018-07
• Subjects: Two-echelon vehicle routing problem -- Open vehicle routing problem -- Location routing problem -- Vehicle routing -- Integer programing -- Simulated annealing; Engineering -- Data processing -- Periodicals; Industrial engineering -- Periodicals; 620.00285
• DOI: 10.1016/j.cie.2018.05.010
• Languages: English
• ISSNs: 0360-8352

Abstract

Highlights: We explore a new problem: the two echelon open location routing problem (2E-OLRP). We formulate three mixed-integer linear programming models of the problem. A hybrid simulated annealing heuristic is developed to solve large problem instances. The proposed heuristic produces solutions that, on average, are within 7.9% of optimal. Abstract: 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.