A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem

Abstract. We consider the two-echelon location-routing problem (2ELRP), a well-known problem in freight distribution arising when establishing a two-level transport system with limited capacities. The problem is a generalization of the NP-hard location routing problem (LRP), involving strategic (location), tactical (allocation) and operational (routing) decisions at the same time. We present a variable neighborhood search (VNS) based on a previous successful VNS for the LRP, accordingly adapted as well as extended. The proposed algorithm provides solutions of high quality in short time, making use of seven different basic neighborhood structures parameterized with different perturbation size leading to a total of 21 specific neighborhood structures. For intensification, two consecutive local search methods are applied, optimizing the transport costs efficiently by considering only recently changed solution parts. Experimental results clearly show that our method is at least competi...

• Type: Journal
• Year: 2012
• Where: EVOW
• Authors: Martin Schwengerer, Sandro Pirkwieser, Günther R. Raidl
• Keywords: Artificial Intelligence, EVOW 2012, Freight Distribution, Neighborhood Search, Solution Quality