A Solution Algorithm for Long Haul Freight Network Design Using Shipper-Carrier Freight Flow Prediction with Explicit Capacity Constraints

Apivatanagul, Pruttipong “Palm” and A C Regan

University of California Transportation Center, Working Papers from University of California Transportation Center

Abstract: Freight transportation has long been recognized as an important foundation of economic strength. Previous studies use traditional methods to examine a set of scenarios. However, due to the complexity of transportation projects which can have substitution effects in a network the number of resulting scenarios may be more than can be examined on a case by case basis. In this paper, a sequential shipper-carrier freight flow prediction model is examined. Additionally, an explicit capacity constraint is used to divert the traffic volume from congested links. A branch and bound method is applied to obtain a solution to our model. We discuss the benefits and limitations of our method, examine its computational efficiency and provide a numerical example. The results show that project selection by the traditional case by case analysis method cannot capture the complexity of freight transportation network improvements and yields the sub-optimal solution.

Keywords: Social; and; Behavioral; Sciences (search for similar items in EconPapers)
Date: 2008-01-01
References: Add references at CitEc
Citations:

Downloads: (external link)
https://www.escholarship.org/uc/item/7v1185pz.pdf;origin=repeccitec (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:cdl:uctcwp:qt7v1185pz

Access Statistics for this paper

More papers in University of California Transportation Center, Working Papers from University of California Transportation Center Contact information at EDIRC.
Bibliographic data for series maintained by Lisa Schiff ().