An efficient transformation of the generalized vehicle routing problem

被引：122

作者：

Ghiani, G

Improta, G

机构：

[1] Univ Naples Federico II, Dipartimento Sistemi & Informat, I-80125 Naples, Italy

[2] Ecole Hautes Etud Commerciales, Gerad, Montreal, PQ H3T 2A7, Canada

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2000年 / 122卷 / 01期

关键词：

generalized vehicle routing problem; location-routing; arc routing;

D O I：

10.1016/S0377-2217(99)00073-9

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

The Generalized Vehicle Routing Problem (GVRP) is the problem of designing optimal delivery or collection routes, subject to capacity restrictions, from a given depot to a number of predefined, mutually exclusive and exhaustive clusters. In this paper we describe an efficient transformation of the GVRP into a Capacitated Are Routing Problem (CARP) for which an exact algorithm and several approximate procedures are reported in literature. It constitutes the only known approach for solving the GVRP. (C) 2000 Elsevier Science B.V. All rights reserved.

引用

页码：11 / 17

页数：7

共 13 条

[1]

Araque J. R., 1994, Annals of Operations Research, V50, P37, DOI 10.1007/BF02085634

[2]

ASSAD AA, 1995, HDB OPERATIONS RES M

[3] ARC ROUTING-PROBLEMS .1. THE CHINESE POSTMAN PROBLEM [J].