ROUTING CONTAINER SHIPS USING LAGRANGEAN RELAXATION AND DECOMPOSITION

This paper describes a container-ship routing scenario in which a shipping company provides services to a network of ports. The authors formulate a mathematical programming model that maximizes total profit (i.e., revenue minus operating costs) for multiple ships and determines: (1) the optimal sequence of ports of call for each ship, (b) the number of trips each ship makes in a planning horizon, and (c) the amount of cargo transported between any two ports by each ship. The model contains discrete, 0-1 and continuous variables, and nonlinear complicating constraints. The multiple container ship model is quite different from those of vehicle routing and traveling salesman problems. The authors use a decomposition method for the model as well as for the network in order to solve the problem. Several problems on 10- to 20-port networks are solved and the results presented.

  • Availability:
  • Corporate Authors:

    Operations Research Society of America

    Mount Royal and Guilford Avenue
    Baltimore, MD  United States  21202
  • Authors:
    • Rana, K
    • VICKSON, R G
  • Publication Date: 1991-8

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00612570
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Aug 31 1991 12:00AM