A CAPACITATED GENERAL ROUTING PROBLEM ON MIXED NETWORKS

被引:15
作者
PANDIT, R [1 ]
MURALIDHARAN, B [1 ]
机构
[1] IOWA STATE UNIV SCI & TECHNOL, DEPT IND & MFG SYST ENGN, AMES, IA 50011 USA
关键词
D O I
10.1016/0305-0548(94)00035-7
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This study addresses the problem of routing vehicles over the specified segments of a mixed network, The routing problem is modeled as a Capacitated General Routing Problem (CGRP). The solution to the problem is a set of routes for the vehicles which are consistent with the capacity and work-hours constraints. For the CGRP, we present a heuristic procedure to solve for large size problems. Both route-first-partition-next (RFPN) and partition-first-and-route-next (PFRN) approaches are discussed. Computational results of the developed procedure are also presented.
引用
收藏
页码:465 / 478
页数:14
相关论文
共 32 条
[1]  
[Anonymous], 1974, NETWORKS, DOI DOI 10.1002/NET.3230040106
[2]  
BODIN L, 1983, COMPUT OPER RES, V10, P63, DOI 10.1016/0305-0548(83)90030-8
[3]   CLASSIFICATION IN VEHICLE-ROUTING AND SCHEDULING [J].
BODIN, L ;
GOLDEN, B .
NETWORKS, 1981, 11 (02) :97-108
[4]   THE DESIGN OF A COMPUTERIZED SANITATION VEHICLE-ROUTING AND SCHEDULING SYSTEM FOR THE TOWN OF OYSTER-BAY, NEW-YORK [J].
BODIN, L ;
FAGIN, G ;
WELEBNY, R ;
GREENBERG, J .
COMPUTERS & OPERATIONS RESEARCH, 1989, 16 (01) :45-54
[5]  
BODIN L, 1990, OPS RES, V38
[6]  
BODIN L, 1986, COMPUTERS OPS RES, V13, P277
[7]  
BODIN L, 1987, OPS RES, V35
[8]   DETAILED DESCRIPTION OF A COMPUTER-SYSTEM FOR THE ROUTING AND SCHEDULING OF STREET SWEEPERS [J].
BODIN, LD ;
KURSH, SJ .
COMPUTERS & OPERATIONS RESEARCH, 1979, 6 (04) :181-198
[9]  
BURKARD ER, 1980, LECTURE NOTES EC MAT
[10]  
CHRISTOFIDES N, 1973, OMEGA, P719