Modeling and Solving a Multimodal Routing Problem with Timetables and Time Windows

Luigi Moccia, Jean‐François Cordeau, Gilbert Laporte, Stefan Røpke, Maria Pia Valentini

2008 · 15 citations · 30 references

Concepts

Abstract

This paper studies a routing problem in a multimodal network with shipment consolidation options. A freight forwarder can use a mix of flexible-time and scheduled transportation services. Time windows are a prominent aspect of the problem. For instance, they are used to model opening hours of the terminals, as well as pickup and delivery time slots. The various features of the problem can be described as elements of a digraph and their integration leads to a holistic graph representation. This allows an origin- destination integer multi-commodity flow formulation with non-convex piecewise linear costs, time windows, and side constraints. Column generation algorithms are designed to compute lower bounds. These column generation algorithms are also embedded within heuristics aimed at finding feasible integer solutions. Computational results with real-life data are presented and show the efficacy of the proposed approach.

References

30