The liner shipping network design problem has proven to be hard to solve. However, well-designed route nets are paramount to liner shipping companies both in terms of competitiveness and environmental impact. Fast evaluations of the multicommodity flow subproblem is one of the bottlenecks when determining the optimal routing and fleet deployment in the network design problem. Additionally, most existing models do not consider the level of service. To accommodate that, we present an algorithm for solving the multicommodity flow subproblem with limits on commodity travel time.
Transportation and Logistics; Network flows; Network Design
Main Research Area:
26th European Conference on Operational Research, 2013