Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.jtrangeo.2010.05.007
Title: Analysis of intermodal freight from China to Indian Ocean: A goal programming approach
Authors: Yang, X.
Low, J.M.W. 
Tang, L.C. 
Keywords: Goal programming
Intermodal transportation
Route competitions and developments
Routing between China and Indian Ocean
Issue Date: Jul-2011
Citation: Yang, X., Low, J.M.W., Tang, L.C. (2011-07). Analysis of intermodal freight from China to Indian Ocean: A goal programming approach. Journal of Transport Geography 19 (4) : 515-527. ScholarBank@NUS Repository. https://doi.org/10.1016/j.jtrangeo.2010.05.007
Abstract: This paper presents an intermodal network optimization model to examine the competitiveness of 36 alternative routings for freight moving from China to and beyond Indian Ocean. The proposed model, which is built upon the principles of goal programming, is able to handle multiple and conflicting objective functions such as minimizing transportation cost, transit time and transit time variability while ensuring flow continuity and transit nodes compatibility among the rail, road, ocean vessel, airplane and inland waterway transports. Transportation time and cost obtained from comprehensive industry sources are then fed into the intermodal transport network connecting two important Chinese origins and four Indian destinations, from which the most attractive routes are identified. In addition, the paper investigates several non-dominated transportation cases through sensitivity analysis tests, and analyzes the potential competitiveness and possible influences of future route developments to current transportation patterns in Asia. © 2010 Elsevier Ltd.
Source Title: Journal of Transport Geography
URI: http://scholarbank.nus.edu.sg/handle/10635/63021
ISSN: 09666923
DOI: 10.1016/j.jtrangeo.2010.05.007
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.