Ship Scheduling and Network Design for Cargo Routing in Liner Shipping

This paper presents both an integrated model and a mixed-integer linear program in order to simultaneously solve the problems of ship-scheduling and the cargo-routing. The design of the service network is a common problem for liner shipping carriers, with service route efficiency and profitability forming the core of the route design process. In their proposed model, the authors incorporate such relevant constraints as weekly frequency for the operated routes. Emerging trends such as cargo transshipment between several (at least two) service routes are also incorporated. Algorithms exploiting the "separability" presented by the problem (i.e., greedy heuristic, column generation-based algorithm, two-phase Benders) are introduced to solve the mixed-integer program. The generation of ship schedules is conducted using an iterative search algorithm. Also included are computational experiments performed on a simulation that randomly generates real life scenarios involving approximately 20 ports and 100 ships. Results show a high percentage of ships' capacities in use, along with a large number of transshipments.

  • Availability:
  • Authors:
    • Agarwal, Richa
    • Ergun, Ozlem
  • Publication Date: 2008-5

Language

  • English

Media Info

  • Media Type: Print
  • Features: Figures; Illustrations; Maps; References; Tables;
  • Pagination: pp 175-196
  • Serial:

Subject/Index Terms

Filing Info

  • Accession Number: 01103731
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Jun 30 2008 8:26AM