Computer Algorithm for Routing Oversized Trucks

by Shiva K. Pant, (A.M.ASCE), Assoc. Transp. Planning Engr.; Metropolitan Transp. Planning Div., Virginia Dept. of Highways, Richmond, VA,
Frederick J. Wegmann, (A.M.ASCE), Assoc. Prof.; Systems-Design Dept., Univ. of Wisconsin-Milwaukee, Milwaukee, WI,

Serial Information: Transportation Engineering Journal of ASCE, 1973, Vol. 99, Issue 1, Pg. 151-166

Document Type: Journal Paper


A computer algorithm for routing oversized trucks through a network was developed. The basic input to the algorithm consists of the usual network description in terms of speed and distance on constituent links, and in addition, the height and weight limits on each link, and the height and weight of the truck to be routed between specified origins and destinations. The algorithm computes the minimum time path on the basic network or on the residual network subsequent to removal of all links having an allowable height and weight less than the corresponding parameters for the truck to be routed. The output also includes the distance along the minimum time path and the corresponding overweight fee computed on the basis of a certain rate per excess ton-mile traveled. These outputs can then be compared to determine the increase in user costs resulting from routing a truck over a minimum time path that avoids restricted links.

Subject Headings: Trucks | Algorithms | Computing in civil engineering | Travel time | Computer networks | Route preferences | Fees

Services: Buy this book/Buy this article


Return to search