Some applications of the generalized vehicle routing problem

被引：62

作者：

Baldacci, R. ^{[2
]}

Bartolini, E. ^{[3
]}

Laporte, G. ^{[1
]}

机构：

[1] HEC Montreal, Montreal, PQ H3T 2A7, Canada

[2] Univ Bologna, Cesena, Italy

[3] Univ Bologna, Bologna, Italy

来源：

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | 2010年 / 61卷 / 07期

基金：

加拿大自然科学与工程研究理事会;

关键词：

Generalized Vehicle Routing Problem; models; applications; TRAVELING SALESMAN PROBLEM; CHINESE POSTMAN PROBLEM; HEALTH-CARE FACILITIES; EFFICIENT TRANSFORMATION; ORIENTEERING PROBLEM; SUHUM DISTRICT; TOUR PROBLEM; GHANA;

D O I：

10.1057/jors.2009.51

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

The Generalized Vehicle Routing Problem (GVRP) is an extension of the classical Vehicle Routing Problem (VRP) in which the vertex set is partitioned into clusters and vehicles must visit exactly one (or at least one) vertex per cluster. The GVRP provides a useful modelling framework for a wide variety of applications. The purpose of this paper is to provide such examples of applications and models. These include the Travelling Salesman with Profits, several VRP extensions, the Windy Routing Problem, and the design of tandem configurations for automated guided vehicles.

引用

页码：1072 / 1077

页数：6

共 44 条

[1]

[Anonymous], 1988, Vehicle routing: Methods and studies

[2] Loop based facility planning and material handling [J].