Search

This paper considers a multimodal transportation problem, which is the problem of determining the transportation flow, i.e. volume of container cargoes, and the transportation mode in each trade route, for the objective of minimizing the sum of shipping and inland transportation costs. The problem takes account of two restrictions: maximum cargo volumes capacitated at each seaport and maximum number of vehicles available at each transportation mode. To solve optimally the problem, this paper employs a mixed integer programming, which is an operations research technique. A case study is performed on the container cargo data in Korea and we draw several implications to improve efficiency in the transportation of international trade cargoes in Korea. [ABSTRACT FROM AUTHOR]