SEARCH

SEARCH BY CITATION

Keywords:

  • Intermodal transport;
  • shortest path, scheduling

We describe the problem of intermodal international freight transport that is faced by some logistic service providers and the solution that ORTEC's logistic suite offers to these customers. This solution is based on a state of the art k-shortest path algorithm for directed networks. Our focus is on the modeling aspects of the problem. In particular, we propose an approach in two phases and methods to reduce the size of the network, so as to obtain a solution within an acceptable calculation time.