An intermodal multicommodity routing problem with scheduled services

Authors:
Burak Ayar;Hande Yaman
Affiliations:
Department of Industrial Engineering, Bilkent University, Ankara, Turkey 06800;Department of Industrial Engineering, Bilkent University, Ankara, Turkey 06800
Venue:
Computational Optimization and Applications
Year:
2012

Citing 4
Cited 0

Computer assisted routing of intermodal shipments

Proceedings of the 21st international conference on Computers and industrial engineering
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems

Operations Research
Best routes selection in international intermodal networks

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study a multicommodity routing problem faced by an intermodal service operator that uses ground and maritime transportation. Given a planning horizon, a set of commodities to be picked up at their release times and to be delivered not later than their duedates, the problem is to decide on routes for these commodities using trucks and scheduled and capacitated maritime services at minimum cost of transportation and stocking at the seaports. Two mixed integer programming formulations and valid inequalities are proposed for this problem. The results of a computational study to evaluate the strength of the linear programming relaxations and the solution times are reported.