Shipper–Carrier Dynamic Freight Assignment Model Using a Variational Inequality Approach

Abstract

This paper develops a dynamic freight assignment model that captures the shipper–carrier mechanism of the freight industry. The shippers minimize their cost by choosing a carrier with the lowest shipping cost for each shipment. The market reaches equilibrium when no shipper can reduce its cost further by changing the carrier for any shipment. Each carrier optimizes its operations so that it can reduce its shipping costs and attract more business from the shippers. An iterative variational inequality (VI) formulation is used to model the market equilibrium including the feedback from the carriers to the shippers. The cost function in the VI is obtained from a carrier submodel that is a dynamic, multimodal, multicommodity network-assignment model based on a linear programming formulation. The formulation and solution algorithms are presented in this paper. A test network is used to implement the solution algorithm to demonstrate the applicability of the model.

Get full access to this article

View all access options for this article.

References

Yang

Time-Dependent Multi-Modal Multicommodity Freight Network Assignment Model. Master's thesis. Northwestern University, Evanston, Ill., 1998.

Crainic

T. G.

Florian

Guélat

and Spiess

. Strategic Planning of Freight Transportation: STAN, An Interactive-Graphic System. In Transportation Research Record 1283, TRB, National Research Council, Washington, D.C., 1990, pp. 97–124.

Kresge

D. T.

and Roberts

P. O.

. Systems Analysis and Simulation Models. Techniques of Transport Planning. The Brookings Institution, Washington, D.C., 1971.

Sharp

G. P.

A Multi-Commodity, Intermodal Transportation Network Model. Presented at 20th Annual Meeting of the Transportation Research Forum, 1979.

Sharp

G. P.

and Jones

P. S.

. Procedures for Multi-State, Multi-Mode Analysis: Vol. I, Executive Summary. Report No. DOT-OST-80050-17/V.I. U.S. Department of Transportation, 1981.

Friesz

T. L.

Strategic Freight Network Planning Models. In Handbook of Transportation Modeling, 1st ed. Elsevier Science Ltd., London, 2001, pp. 527–537.

Kornhaunser

A. L.

Hornung

Harzony

and Lutin

. The Princeton Railroad Network Model: Application of Computer Graphics in the Analysis of a Changing Industry. Presented at the Harvard Graphics Conference, Transportation Program, Princeton University, Princeton, N.J., 1979.

Bronzini

M. S.

Evolution of a Multimodal Freight Transportation Network Model. Proceedings Transportation Research Forum, Vol. 21, No. 1 1980, pp. 475–485.

Guelat

Florian

and Crainic

T. G.

. A Multimode Multiproduct Network Assignment Model for Strategic Planning of Freight Flows. Transportation Science, Vol. 24, No. 1 1990, pp. 25–39.

10.

Friesz

T. L.

Gottfried

and Morlok

E. K.

. A Freight Network Equilibrium Model. Tech. Report CUE-FNEM-1981-8-1. Department of Civil and Urban Engineering, University of Pennsylvania, Philadelphia, 1981.

11.

Friesz

T. L.

Gottfried

J. A.

and Morlok

E. K.

. A Sequential Shipper–Carrier Network Model for Predicting Freight Flows. Transportation Science, Vol. 20, 1986, pp. 80–91.

12.

Castelli

Longo

Presenti

and Ukovich

. Two-Player Non-cooperative Games over a Freight Transportation Network. Transportation Science, Vol. 38, No. 2 2004, pp. 149–159.

13.

Fernandez

J. E.

Joaquin

De Cea

and Soto

A. O.

. A Multi-Modal Supply-Demand Equilibrium Model for Predicting Intercity Freight Flows. Transportation Research, Part B: Methodological, Vol. 37, 2003, pp. 615–640.

14.

Brotcorne

Labbe

Marcotte

and Savard

. A Bilevel Model and Solution Algorithm for a Freight Tariff-Setting Problem. Transportation Science, Vol. 34, No. 3 2000, pp. 289–302.

15.

Friesz

T. L.

Bernstein

and Suo

. Dynamic Disequilibrium Interregional Commodity Flow Model. Transportation Research, Vol. 32B, No. 4, 1998, pp. 467–483.

16.

Ziliaskopoulos

A. K.

and Wardell

. An Inter-Modal Optimum Path Algorithm for Multi-Modal Networks with Dynamic Arc Travel Times and Switching Delays. European Journal of Operational Research, Vol. 125, 2000, pp. 486–502.

17.

Ziliaskopoulos

A. K.

and Mahmassani

H. S.

. Time-Dependent Shortest-Path Algorithm for Real-Time Intelligent Vehicle Highway Systems Applications. In Transportation Research Record 1408, TRB, National Research Council, Washington, D.C., 1993, pp. 94–100.

18.

Nagurney

Dynamics of Supply Chains: A Multilevel Network Perspective. Environment and Planning, Vol. 29, 2002, pp. 795–818.

19.

Bertsekas

and Gafni

. Projection Methods for Variational Inequalities with Application to the Traffic Assignment Problem. Mathematical Programming, Vol. 17, 1982, pp. 139–159.