期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 254, 期 1, 页码 80-91出版社
ELSEVIER
DOI: 10.1016/j.ejor.2016.03.040
关键词
Routing; Two-echelon VRP; Synchronization; City logistics; Adaptive large neighborhood search
资金
- Natural Sciences and Engineering Research Council of Canada
- Fonds de recherche du Quebec - Nature et technologies
The two-echelon vehicle routing problem (2E-VRP) consists in making deliveries to a set of customers using two distinct fleets of vehicles. First-level vehicles pick up requests at a distribution center and bring them to intermediate sites. At these locations, the requests are transferred to second-level vehicles, which deliver them. This paper addresses a variant of the 2E-VRP that integrates constraints arising in city logistics such as time window constraints, synchronization constraints, and multiple trips at the second level. The corresponding problem is called the two-echelon multiple-trip vehicle routing problem with satellite synchronization (2E-MTVRP-SS). We propose an adaptive large neighborhood search to solve this problem. Custom destruction and repair heuristics and an efficient feasibility check for moves have been designed and evaluated on modified benchmarks for the VRP with time windows. (C) 2016 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据