Modeling and solution methods for viable routes in multimodal networks

This study aims to present a shortest viable route selecting model and its algorithm for freight transportation management in multimodal networks. A route is called viable only if its sequence of modes is feasible with respect to a set of constraints. Three characteristics of viable intermodal routes are identified :(1)logical modal sequence;(2) limited transfer times; and (3) transportation economies of scale. A model incorporating the three characteristics into the intermodal routing selection problem is developed. The concepts of generalized cost and penalty factor are employed. Label correcting approach is used to solve the model. An illustrative example is provided. The model can be developed as a tool for decision support.