Stochastic Mixed 0-1 Integer Programming Applied to International Transportation Problems under Uncertainty

Today-s business has inevitably been set in the global supply chain management environment. International transportation has never played such an important role in the global supply chain network, because movement of shipments from one country to another tends to be more frequent than ever before. This paper studies international transportation problems experienced by an international transportation company. Because of the limited fleet capacity, the transportation company has to hire additional trucks from two countries in advance. However, customer-s shipment information is uncertain, and decisions have to be made before accurate information can be obtained. This paper proposes a stochastic mixed 0-1 programming model to solve the international transportation problems under uncertain demand. A series of experiments demonstrate the effectiveness of the proposed stochastic model.


Authors:



References:
[1] C.J., Vidal, and M. Goetschalckx, "Strategy production-distribution
models: a critical review with emphasis on global supply chain models," European Journal of Operational Research, vol. 98, pp. 1-18,
1997.
[2] M. Goetschalckx, C.J. Vidal, and K. Dogan, "Modelling and design of
global logistics systems: A review of integrated strategic and tactical
models and design algorithms," European Journal of Operational
Research, vol. 143, pp. 1-18, 2002.
[3] M.J., Meixell, and V.B. Gargeya, "Global supply chain design: a literature review and critique," Transportation Research Part E, vol.
41, pp. 531-550, 2005.
[4] A. Bergan, and R. Bushman, "Crossing the border: The NAFTA
perspective," presented in the first Latin American ITS regional Conference, Buenos Aires, Argentia, March, 1998.
[5] B. Bochner, B. Stockton, D .Burke, and R. Harrison, "A prototype southern border facility to expedite NAFTA trucks entering the United
States," in the Proceeding of the 80th Annual Meeting of the Transportation Research Board, Paper Number: 01-0406, 2001.