##
**Best routes selection in international intermodal networks.**
*(English)*
Zbl 1144.90322

Summary: 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.

### MSC:

90B10 | Deterministic network models in operations research |

90C29 | Multi-objective and goal programming |

PDF
BibTeX
XML
Cite

\textit{T.-S. Chang}, Comput. Oper. Res. 35, No. 9, 2877--2891 (2008; Zbl 1144.90322)

Full Text:
DOI

### References:

[1] | Rodrigues, A. M.; Bowersox, D. J.; Calantone, R. J., Estimation of global and national logistics expenditures: 2002 data update, Journal of Business Logistics, 26, 2, 1-16 (2005) |

[2] | Min, H., International intermodal choices via chance-constrained goal programming, Transportation Research Part A, 25, 6, 351-362 (1991) |

[3] | Barnhart, C.; Ratliff, H. D., Modeling intermodal routing, Journal of Business Logistics, 14, 1, 205-223 (1993) |

[4] | Boardman, B. S.; Malstrom, E. M.; Butler, D. P.; Cole, M. H., Computer assisted routing of intermodal shipments, Computers & Industrial Engineering, 33, 1-2, 311-314 (1997) |

[5] | Bookbinder, J. H.; Fox, N. S., Intermodal routing of Canada-Mexico shipments under NAFTA, Transportation Research Part E, 34, 4, 289-303 (1998) |

[6] | Southworth, F.; Peterson, B. E., Intermodal and international freight network modeling, Transportation Research Part C, 8, 147-166 (2000) |

[7] | Amiri, A.; Pirkul, H., New formulation and relaxation to solve a concave-cost network flow problem, Journal of the Operation Research Society, 48, 278-287 (1997) · Zbl 0890.90060 |

[8] | Balakrishnan, A.; Graves, S. C., A composite algorithm for a concave-cost network flow problem, Networks, 19, 175-202 (1989) · Zbl 0673.90034 |

[9] | Croxton, K. L.; Gendron, B.; Magnanti, T. L., Models and methods for merge-in-transit operations, Transportation Science, 37, 1, 1-22 (2003) |

[10] | Muriel, A.; Munshi, F. N., Capacitated multicommodity network flow problems with piecewise linear concave costs, IIE Transactions, 36, 683-696 (2004) |

[11] | Ahuja, R. K.; Magnanti, T. L.; Orlin, J. B., Network flows—theory, algorithms, and applications (1993), Prentice-Hall: Prentice-Hall Englewood Cliffs, NJ · Zbl 1201.90001 |

[12] | Desrochers, M.; Soumis, F., A generalized permanent labeling algorithm for the shortest path problem with time windows, INFOR, 26, 191-212 (1998) · Zbl 0652.90097 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.