Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Computer assisted routing of intermodal shipments
Proceedings of the 21st international conference on Computers and industrial engineering
Models and Methods for Merge-in-Transit Operations
Transportation Science
Solving time-dependent multimodal transport problems using a transfer graph model
Computers and Industrial Engineering
Spatial big-data challenges intersecting mobility and cloud computing
MobiDE '12 Proceedings of the Eleventh ACM International Workshop on Data Engineering for Wireless and Mobile Access
An intermodal multicommodity routing problem with scheduled services
Computational Optimization and Applications
Decision support in intermodal transport: A new research agenda
Computers in Industry
| Hi-index | 0.01 |
This study focuses on one of the intermodal operational issues: how to select best routes for shipments through the international intermodal network. International intermodal routing is complicated by three important characteristics: (1) multiple objectives; (2) scheduled transportation modes and demanded delivery times; and (3) transportation economies of scale. In this paper, the international intermodal routing problem is formulated as a multiobjective multimodal multicommodity flow problem (MMMFP) with time windows and concave costs. The objectives of this paper are to develop a mathematical model encompassing all three essential characteristics, and to propose an algorithm that can effectively provide answers to the model. The problem is NP-hard. It follows that the proposed algorithm is a heuristic. Based on relaxation and decomposition techniques, the original problem is broken into a set of smaller and easier subproblems. The case studies show that it is important to incorporate the three characteristics into the international intermodal routing problem, and our proposed algorithm can effectively and efficiently solve the MMMFP with time windows and concave costs.