CLOVES: A cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up

被引：54

作者：

Ganesh, K. ^{[1
]}

Narendran, T. T. ^{[1
]}

机构：

[1] Indian Inst Technol, Dept Management Studies, Madras 600036, Tamil Nadu, India

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2007年 / 178卷 / 03期

关键词：

distribution; logistics; vehicle routing problem; clustering; genetic algorithm;

D O I：

10.1016/j.ejor.2006.01.037

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper addresses the vehicle routing problem with sequence-constrained delivery and pick-up (VRPDP). We propose a multi-phase constructive heuristic that clusters nodes based on proximity, orients them along a route using shrink-wrap algorithm and allots vehicles using generalized assignment procedure. We employ genetic algorithm for an intensive final search. Trials on a large number of test-problems have yielded encouraging results. (c) 2006 Elsevier B.V. All rights reserved.

引用

页码：699 / 717

页数：19

共 41 条

[1]

Anderberg M.R., 1973, Probability and Mathematical Statistics

[2]

Anily S, 1996, NAV RES LOG, V43, P415, DOI 10.1002/(SICI)1520-6750(199604)43:3<415::AID-NAV7>3.0.CO

[3]

2-C

[4] THE TRAVELING SALESMAN PROBLEM WITH DELIVERY AND BACKHAULS [J].

ANILY, S ;

MOSHEIOV, G .

OPERATIONS RESEARCH LETTERS, 1994, 16 (01) :11-18

[5]

[Anonymous], 1975, Ann Arbor

[6]

AUGERAT P, 1995, 949M U J FOUR GREN F

[7]

Casco DO, 1988, Vehicle Routing: Methods and Studies, V16, P127

[8] EXPECTED DISTANCES IN DISTRIBUTION PROBLEMS [J].

CHRISTOF.N ;

EILON, S .

OPERATIONAL RESEARCH QUARTERLY, 1969, 20 (04) :437-&

[9]

Christofides N., 1979, Combinatorial optimization, P315

[10] SCHEDULING OF VEHICLES FROM CENTRAL DEPOT TO NUMBER OF DELIVERY POINTS [J].

CLARKE, G ;

WRIGHT, JW .

OPERATIONS RESEARCH, 1964, 12 (04) :568-&

← 1 2 3 4 5 →