Decision support system for real-time urban freight management

被引:16
作者
Grzybowska, Hanna [1 ]
Barcelo, Jaume [1 ]
机构
[1] Tech Univ Catalonia, Off 307, Barcelona 08034, Spain
来源
SEVENTH INTERNATIONAL CONFERENCE ON CITY LOGISTICS | 2012年 / 39卷
关键词
Decission support system; real-time freight management; dynamic traffic simulation models; pickup and delivery vehicle routing problem with time windows; parallel tabu search; DELIVERY PROBLEM; DYNAMIC PICKUP; TABU SEARCH; WINDOWS; HEURISTICS;
D O I
10.1016/j.sbspro.2012.03.142
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
The urban network is a highly dynamic system. Thus, a modern and efficient fleet management in urban areas should account for dynamics of traffic conditions and variability in travel times, since they significantly affect the distribution of goods and the provision of services. For the proficient dynamic fleet management decisions it is proper instead of relying exclusively on the experience of a dispatcher, to base the freight management decisions on information provided by a professional Decision Support System (DSS), which facilitates the consideration of all the factors conditioning the addressed problem. This paper provides a proposal of such DSS for real-time freight management. Its design is based on integration of selected pickup and delivery vehicle routing model and dynamic traffic simulation models, which objective is to carefully emulate the evolving traffic conditions. The optimal dynamic routing and scheduling of a vehicle fleet is obtained due to dynamic modifications of the current routing and scheduling plan on the basis of the newly revealed information conditioning the addressed problem. (C) 2012 Published by Elsevier Ltd. Selection and/or peer-review under responsibility of 7th International Conference on City Logistics
引用
收藏
页码:712 / 725
页数:14
相关论文
共 17 条
[1]  
Barcelo J, 2010, 89 TRB ANN M WASH DC
[2]  
Barcelo J, 2010, 12 WCTR LISB
[3]  
Caramia M., 2001, Proceedings of the Symposium on Operation Research 2001, P3
[4]   A unified tabu search heuristic for vehicle routing problems with time windows [J].
Cordeau, JF ;
Laporte, G ;
Mercier, A .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2001, 52 (08) :928-936
[5]   On dynamic pickup and delivery vehicle routing with several time windows and waiting times [J].
Fabri, A ;
Recht, P .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2006, 40 (04) :335-350
[6]   Dynamic vehicle routing based on online traffic information [J].
Fleischmann, B ;
Gnutzmann, S ;
Sandvoss, E .
TRANSPORTATION SCIENCE, 2004, 38 (04) :420-433
[7]   Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries [J].
Gendreau, Michel ;
Guertin, Francois ;
Potvin, Jean-Yves ;
Seguin, Rene .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2006, 14 (03) :157-174
[8]   A FORMAL BASIS FOR HEURISTIC DETERMINATION OF MINIMUM COST PATHS [J].
HART, PE ;
NILSSON, NJ ;
RAPHAEL, B .
IEEE TRANSACTIONS ON SYSTEMS SCIENCE AND CYBERNETICS, 1968, SSC4 (02) :100-+
[9]  
Lau HC, 2001, PROC INT C TOOLS ART, P333, DOI 10.1109/ICTAI.2001.974481
[10]   A metaheuristic for the pickup and delivery problem with time windows [J].
Li, HB ;
Lim, A .
ICTAI 2001: 13TH IEEE INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2001, :160-167