An Intermodal Time-Dependent Minimum Cost Path Algorithm

Abstract

Transportation problems, in terms of both passenger and freight applications, are increasingly being addressed with inter-modal solutions. This chapter discusses the problem of computing optimum paths on a network with many modes of transport and time-varying link costs and travel times, accounting for the fixed schedule modes and mode-switching delays. An efficient algorithm is introduced that computes optimum path trees from all nodes and possible discrete departure times, while accounting for travel and transfer delays, as well as differences in perceived costs associated with specific modes and transfers. The algorithm, called the time-dependent inter-modal minimum cost path (TDIMCP) algorithm, is extended to set the necessary framework for solving the problem of inter-modal routing of hazardous materials, taking into consideration both risk and cost at the transfer points and travel links. Travel and transfer risk associated with hazmat routing are incorporated into the cost calculation of the TDIMCP problem, considering both the likelihood of an incident and the consequences of that incident. The inter-modal hazmat routing algorithm is then applied to a series of scenarios on a test network to illustrate the behavior of the algorithm