Impact of designated secure rest facilities an single-lane truck-dispatching productivity

被引:0
作者
Morris, Steven M. [1 ]
Erera, Alan L. [1 ]
White, Chelsea C., III [1 ]
机构
[1] Georgia Inst Technol, H Milton Stewart Sch Ind & Syst Engn, Atlanta, GA 30332 USA
关键词
D O I
10.3141/2032-05
中图分类号
TU [建筑科学];
学科分类号
0813 ;
摘要
This paper develops an approach for analyzing how restricting rest (sleep) locations for long-haul truckers may affect operational productivity, given hours-of-service regulations. Productivity is measured by the minimum number of unique drivers required to execute a set of load requests feasibly over a known planning horizon. When drivers may stop for rest at any location, they should be able to maximize utilization under regulated driving hours. When drivers may stop for rest only at certain discrete locations, drivers may suffer decreased utilization. The framework and results developed in this paper should be especially useful in the analysis of truck transportation of security-sensitive commodities, such as food products and hazardous materials, for which there exists strong external pressure to ensure that drivers rest only in secure locations to reduce risks of tampering. The analysis considers the simplest case, in which all loads to be transported move along a single lane. The paper presents an optimal tree search algorithm for determining the minimum number of drivers required to cover a set of loads given a set of allowed rest locations. Because the optimal approach is often computationally burdensome, the paper also presents and analyzes a set of simple heuristics for determining feasible load-to-driver assignments that can augment the search for the true minimum. Analysis of a sample data set demonstrates the approach and indicates that for lanes of realistic length, the productivity impact of restricting rest to a small number of discrete locations is likely to be small.
引用
收藏
页码:35 / 42
页数:8
相关论文
共 8 条
[1]  
BEUJON GJ, 1991, TRANSPORT SCI, V25, P19
[2]  
BREWSTER R, 2005, 84 ANN M TRANSP RES
[3]   Fleet sizing and empty equipment redistribution for center-terminal transportation networks [J].
Du, YF ;
Hall, R .
MANAGEMENT SCIENCE, 1997, 43 (02) :145-157
[4]  
ERERA AL, IN PRESS COMPUTERS O
[5]  
Ervin Eric, 2004, P 2004 WINT SIM C
[6]   An adaptive dynamic programming algorithm for the heterogeneous resource allocation problem [J].
Powell, WB ;
Shapiro, JA ;
Simao, HP .
TRANSPORTATION SCIENCE, 2002, 36 (02) :231-249
[7]   Minimum vehicle fleet size under time-window constraints at a container terminal [J].
Vis, IFA ;
de Koster, RMB ;
Savelsbergh, MWP .
TRANSPORTATION SCIENCE, 2005, 39 (02) :249-260
[8]  
Vis IFA, 2001, J OPER RES SOC, V52, P409, DOI 10.1057/palgrave.jors.2601094