文章基本信息

标题：A Neighborhood Search and Set Cover Hybrid Heuristic for the Two-Echelon Vehicle Routing Problem
本地全文：下载
作者：Youcef Amarouche ; Rym N. Guibadj ; Aziz Moukrim 等
期刊名称：OASIcs : OpenAccess Series in Informatics
电子版ISSN：2190-6807
出版年度：2018
卷号：65
页码：1-15
DOI：10.4230/OASIcs.ATMOS.2018.11
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：The Two-Echelon Vehicle Routing Problem (2E-VRP) is a variant of the classical vehicle routing problem arising in the context of city logistics. In the 2E-VRP, freight from a main depot is delivered to final customers using intermediate facilities, called satellites. In this paper, we propose a new hybrid heuristic method for solving the 2E-VRP that relies on two components. The first component effectively explores the search space in order to discover a set of interesting routes. The second recombines the discovered routes into high-quality solutions. Experimentations on benchmark instances show the performance of our approach: our algorithm achieves high-quality solutions in short computational times and improves the current best known solutions for several large scale instances.
关键词：Two-Echelon Vehicle Routing Problem; City Logistics; hybrid method; integer programming