Real-time management of vehicle breakdowns in urban freight distribution

被引:12
作者
Minis, I. [1 ]
Mamasis, K. [1 ]
Zeimpekis, V. [1 ]
机构
[1] Univ Aegean, Dept Financial & Management Engn, Chios 82100, Greece
关键词
Team orienteering problem; Freight distribution; Distribution vehicle breakdown; Vehicle routing; City logistics; TEAM ORIENTEERING PROBLEM; MAXIMUM COLLECTION PROBLEM; TABU SEARCH;
D O I
10.1007/s10732-011-9191-1
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper considers a problem in which an unexpected event immobilises a vehicle of a distribution fleet permanently, and the remaining vehicles are rerouted to serve some of the clients of the failed vehicle. We model this case as a variation of the Team Orienteering Problem (TOP), constraining all vehicle routes to an upper time, or distance, limit, and taking into account the limited capacity of the fleet vehicles. The problem requires an effective solution in almost real time. We propose a new heuristic to provide efficient solutions within this strict computational time constraint. To test the quality of the heuristic, we have developed and validated a Genetic Algorithm (GA) that obtains high quality (but computationally expensive) solutions. The solutions of the heuristic compare favorably to those obtained by the GA. The latter has also been tested successfully in a real-time fleet management system.
引用
收藏
页码:375 / 400
页数:26
相关论文
共 26 条
[1]   The capacitated team orienteering and profitable tour problems [J].
Archetti, C. ;
Feillet, D. ;
Hertz, A. ;
Speranza, M. G. .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2009, 60 (06) :831-842
[2]   Metaheuristics for the team orienteering problem [J].
Archetti, Claudia ;
Hertz, Alain ;
Speranza, Maria Grazia .
JOURNAL OF HEURISTICS, 2007, 13 (01) :49-76
[3]   An exact algorithm for team orienteering problems [J].
Boussier, Sylvain ;
Feillet, Dominique ;
Gendreau, Michel .
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2007, 5 (03) :211-230
[4]  
Braysy O., 2000, P ROUT 2000 WORKSH S
[5]   A HEURISTIC FOR THE MULTIPLE TOUR MAXIMUM COLLECTION PROBLEM [J].
BUTT, SE ;
CAVALIER, TM .
COMPUTERS & OPERATIONS RESEARCH, 1994, 21 (01) :101-111
[6]   An optimal solution procedure or the multiple tour maximum collection problem using column generation [J].
Butt, SE ;
Ryan, DM .
COMPUTERS & OPERATIONS RESEARCH, 1999, 26 (04) :427-441
[7]   The team orienteering problem [J].
Chao, IM ;
Golden, BL ;
Wasil, EA .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 88 (03) :464-474
[8]   A fast and effective heuristic for the orienteering problem [J].
Chao, IM ;
Golden, BL ;
Wasil, EA .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 88 (03) :475-489
[9]  
Fink A., 2000, OPERATIONS RESEARCHC, P91
[10]  
GOLDEN BL, 1987, NAV RES LOG, V34, P307, DOI 10.1002/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO