Best routes selection in international intermodal networks

Computers and Operations Research

Volumn 35, Issue 9, 2008, Pages 2877-2891

  Chang, Tsung Sheng ^a  

^a NATIONAL DONG HWA UNIVERSITY   (Taiwan)

Author keywords

Economies of scale; Intermodal; Multicommodity; Multiobjective

Indexed keywords

ECONOMIC ANALYSIS; HEURISTIC ALGORITHMS; MATHEMATICAL MODELS; MULTIOBJECTIVE OPTIMIZATION; NETWORK ROUTING; PROBLEM SOLVING; SCHEDULING;

DEMANDED DELIVERY; ECONOMIES OF SCALE; INTERNATIONAL INTERMODAL NETWORKS; MULTICOMMODITIES;

WATERWAY TRANSPORTATION;

EID: 38749134913     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2006.12.025     Document Type: Article

References (12)

1. Rodrigues A.M., Bowersox D.J., and Calantone R.J. Estimation of global and national logistics expenditures: 2002 data update. Journal of Business Logistics 26 2 (2005) 1-16
2. Min H. International intermodal choices via chance-constrained goal programming. Transportation Research Part A 25 6 (1991) 351-362
3. Barnhart C., and Ratliff H.D. Modeling intermodal routing. Journal of Business Logistics 14 1 (1993) 205-223
4. Boardman B.S., Malstrom E.M., Butler D.P., and Cole M.H. Computer assisted routing of intermodal shipments. Computers & Industrial Engineering 33 1-2 (1997) 311-314
5. Bookbinder J.H., and Fox N.S. Intermodal routing of Canada-Mexico shipments under NAFTA. Transportation Research Part E 34 4 (1998) 289-303
6. Southworth F., and Peterson B.E. Intermodal and international freight network modeling. Transportation Research Part C 8 (2000) 147-166
7. Amiri A., and Pirkul H. New formulation and relaxation to solve a concave-cost network flow problem. Journal of the Operation Research Society 48 (1997) 278-287
8. Balakrishnan A., and Graves S.C. A composite algorithm for a concave-cost network flow problem. Networks 19 (1989) 175-202
9. Croxton K.L., Gendron B., and Magnanti T.L. Models and methods for merge-in-transit operations. Transportation Science 37 1 (2003) 1-22
10. Muriel A., and Munshi F.N. Capacitated multicommodity network flow problems with piecewise linear concave costs. IIE Transactions 36 (2004) 683-696
11. Ahuja R.K., Magnanti T.L., and Orlin J.B. Network flows-theory, algorithms, and applications (1993), Prentice-Hall, Englewood Cliffs, NJ
12. Desrochers M., and Soumis F. A generalized permanent labeling algorithm for the shortest path problem with time windows. INFOR 26 (1998) 191-212