THE VEHICLE-ROUTING PROBLEM WITH STOCHASTIC TRAVEL-TIMES

被引：246

作者：

LAPORTE, G

LOUVEAUX, F

MERCURE, H

机构：

[1] FAC UNIV NOTRE DAME PAIX,B-5000 NAMUR,BELGIUM

[2] ECOLE HAUTES ETUD COMMERCIALES MONTREAL,GERAD,MONTREAL H3T 1V6,QUEBEC,CANADA

来源：

TRANSPORTATION SCIENCE | 1992年 / 26卷 / 03期

关键词：

D O I：

10.1287/trsc.26.3.161

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper considers vehicle routing problems (VRPs) with stochastic service and travel times, in which vehicles incur a penalty proportional to the duration of their route in excess of a preset constant. Three mathematical programming models are presented: a chance constrained model, a three-index simple recourse model and a two-index recourse model. A general branch and cut algorithm for the three models is described. Computational results indicate that moderate size problems can be solved to optimality.

引用

页码：161 / 170

页数：10

共 16 条

[1]

[Anonymous], 1954, OPERATIONS RES, DOI DOI 10.1287/OPRE.2.4.393

[2]

Bertsimas D., 1988, THESIS MIT

[3] A MULTICUT ALGORITHM FOR 2-STAGE STOCHASTIC LINEAR-PROGRAMS [J].