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