Route Selection and Consolidation in International Intermodal Freight Transportation

  • M. K. Tiwari
  • R. A. Kumar
  • P. Mohapatra
  • W. K. Yew
  • L. Benyoucef
Part of the Springer Series in Advanced Manufacturing book series (SSAM)


This chapter focuses on selecting the route in international intermodal freight transportation network considering the following characteristics, first and foremost multi-objective: minimization of travel time and travel cost, later schedules and delivery times of every service provider in each pair of location, and lastly variable cost must be included in every location. The study aims to formulate the problem into mixed integer linear programming (MILP) model and develop an algorithm which encompassing all the above essential characteristics. It is NP-hard problem; it follows the proposed algorithm (nested partitions method) that is heuristic and multi-attribute decision-making (MADM) method. An illustrative experiment is considered and our proposed algorithm is applied to obtain an effective and efficient solution.


Intermodal  Mixed integer linear programming Nested partition method multi-attribute decision making 


  1. Barnhart C, Ratliff HD (1993) Modelling intermodal routing. J Bus Logis 4(1):205–223Google Scholar
  2. Boardman BS, Malstrom EM, Butler DP, Cole MH (1997) Computer assisted routing of intermodal shipments. Comput Ind Eng 33(1–2):311–314CrossRefGoogle Scholar
  3. Bookbinder JH, Fox NS (1998) Intermodal routing of Canada–Mexico shipments under NAFTA. Transp. Res. Part E 34(4):289–303Google Scholar
  4. Çakır O (2009) Benders decomposition applied to multi–commodity, multi–mode distribution planning. Expert Syst Appl 36(4):8212–8217CrossRefGoogle Scholar
  5. Chang TS (2008) Best routes selection in international intermodal networks. Comput Oper Res 35(9):2877–2891CrossRefMATHGoogle Scholar
  6. Cho JH, Kim HS, Choi HR (2012) An intermodal transport network planning algorithm using dynamic programming—a case study: from Bussan to Rotterdam in intermodal freight routing. Appl. Intell 36(3):529–541CrossRefGoogle Scholar
  7. Crainic TG, Rousseau JM (1986) Multi–commodity, multimode freight transportation: a general modeling and algorithmic framework for the service network design problem. Transp Res Part B 20(3):225–242Google Scholar
  8. Hu ZH (2011) A container multimodal transportation scheduling approach based on immune affinity model for emergency relief. Expert Syst Appl 38(3):2632–2639CrossRefGoogle Scholar
  9. Hwang CL, Yoon KS (1981) Multiple attribute decision making: methods and applications. In: Lecture notes in economics and mathematical systems (Multiple Attribute Decision Making), vol 186. Springer, BerlinGoogle Scholar
  10. Kang K, Niu H, Zhu Y, Zhang W (2010) Research on improved iIntegrated optimization model for mode and route in multimodal transportation basing on the PSO-ACO. Conf Publ Logistics Syst Intell Manage 3:1445–1449Google Scholar
  11. Leung LC, Hui YV, Wang Y, Chen C (2009) A 0–1 LP model for the integration and consolidation of air cargo shipments. Oper Res 57(2):402–412CrossRefGoogle Scholar
  12. Min H (1991) International intermodal choices via chance–constrained goal programming. Transp Res Part A 25(6):351–62Google Scholar
  13. Olafsson S (2003) Two–stage nested partitions method for stochastic optimization. Meth Comput Appl Prob 6(1):5–27MathSciNetCrossRefGoogle Scholar
  14. Rafay I, Charles RS (2010) Intermodal logistics: the interplay of financial, operational and service issues. Transp Res Part E 46(6):926–949CrossRefGoogle Scholar
  15. Rahim A, Farhad S (2011) Time–dependent personal tour planning and scheduling in metropolises. Expert Syst Appl 38(10):12439–12452CrossRefGoogle Scholar
  16. Rao V (2007) Decision making in the manufacturing environment using graph theory and fuzzy multiple attribute decision making methods. Springer Series in Advanced Manufacturing, doi:  10.1007/978-1-4471-4375-8_1. Springer-Verlag, London 2013
  17. Shi L, Olafsson S (2000) Nested partitions method for global optimization. Oper Res 48(3):390–407MathSciNetCrossRefMATHGoogle Scholar
  18. Shi L, Olafsson S (2008) Nested partitions method, theory and applications. Springer, Berlin Google Scholar
  19. Shi L, Olafsson S, Sun N (1999) New parallel randomized algorithms for the travelling salesman problem. Comput Oper Res 26(4):371–394MathSciNetCrossRefMATHGoogle Scholar
  20. Southworth F, Peterson BE (2000) Intermodal and international freight network modelling. Transp Res Part C 8(1–6):147–66Google Scholar
  21. Tadashi Y, Bona FR, Jun C, Eiichi T (2009) Designing multimodal freight transport networks: a heuristic approach and applications. Transp Sci 43(2):129–143CrossRefGoogle Scholar
  22. Yang Y, Low MWJ, Tang LC (2011) Analysis of intermodal freight from China to Indian Ocean: a goal programming approach. J Transp Geog 19(4):515–527CrossRefGoogle Scholar
  23. Zhang Y, Jun Y, Wei G, Wu L (2010) Find multi–objective paths in stochastic networks via chaotic immune PSO. Expert Syst Appl 37(3):1911–1919CrossRefGoogle Scholar

Copyright information

© Springer-Verlag London 2014

Authors and Affiliations

  • M. K. Tiwari
    • 1
  • R. A. Kumar
    • 1
  • P. Mohapatra
    • 1
  • W. K. Yew
    • 2
  • L. Benyoucef
    • 3
  1. 1.Department of Industrial Engineering and ManagementIndian Institute of TechnologyKharagpurIndia
  2. 2.Department of Manufacturing and Industrial EngineeringUniversitiy TeknologiSkudaiMalaysia
  3. 3.Aix-Marseille UniversityMarseille Cedex 20France

Personalised recommendations