The Multi-Trip Vehicle Routing Problem with Time Windows and Release Dates

被引：112

作者：

Cattaruzza, Diego ^{[1
,2
,3
]}

Absi, Nabil ^{[1
,2
]}

Feillet, Dominique ^{[1
,2
]}

机构：

[1] Ecole Mines St Etienne, F-13541 Gardanne, France

[2] LIMOS UMR CNRS 6158, F-13541 Gardanne, France

[3] Univ Lille, CNRS, Ctr Rech Informat Signal & Automat Lille, Centrale Lille,CRIStAL,UMR 9189, F-59000 Lille, France

来源：

TRANSPORTATION SCIENCE | 2016年 / 50卷 / 02期

关键词：

vehicle routing; multi-trip; release dates; genetic algorithm; split; EXACT ALGORITHM; LOCAL SEARCH;

D O I：

10.1287/trsc.2015.0608

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

The multi-trip vehicle routing problem with time windows and release dates is a variant of the multi-trip vehicle routing problem where a time window and a release date are associated with each customer. The release date represents the date when the merchandise requested by a customer becomes available at the depot. The interest for this problem comes from the field of city logistics and the study of delivery systems involving City Distribution Centers (CDC). In these systems, goods are first delivered to a CDC before being transferred to eco-friendly vehicles for final delivery. We propose to address the problem through a population-based algorithm, with a giant tour representation for individuals. An efficient labeling procedure allows turning giant tours into solutions. Experiments demonstrate the effectiveness of the method.

引用

页码：676 / 693

页数：18

共 37 条

[1] Multi-period vehicle loading with stochastic release dates [J].