An adaptive memory heuristic for a class of vehicle routing problems with minmax objective

被引：73

作者：

Golden, BL

Laporte, G

Taillard, ED

机构：

[1] UNIV MARYLAND,DEPT MANAGEMENT SCI & STAT,COLL BUSINESS & MANAGEMENT,COLLEGE PK,MD 20742

[2] UNIV MONTREAL,CTR RECH TRANSPORTS,MONTREAL,PQ H3C 3J7,CANADA

[3] IDSIA,CH-6900 LUGANO,SWITZERLAND

来源：

COMPUTERS & OPERATIONS RESEARCH | 1997年 / 24卷 / 05期

关键词：

D O I：

10.1016/S0305-0548(96)00065-2

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

We propose a heuristic for a class of vehicle routing problems (VRPs) with minmax objective. These include the Capacitated VRP, the Capacitated VRP with multiple use of vehicles, and the m-Travelling Salesman Problem with multiple use of vehicles. A tabu search based adaptive memory procedure of instances indicate that the method produces very good solutions within reasonable computing times. (C) 1997 Elsevier Science Ltd. All rights reserved.

引用

页码：445 / 452

页数：8

共 12 条

[1]

Christofides N., 1979, COMBINATORIAL OPTIMI, P313

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