Containership scheduling with transit-time-sensitive container shipment demand

This paper examines the optimal containership schedule with transit-time-sensitive demand that is assumed to be a decreasing continuous function of transit time. A mixed-integer nonlinear non-convex optimization model is first formulated to maximize the total profit of a ship route. In view of the problem structure, a branch-and-bound based holistic solution method is developed. It is rigorously demonstrated that this solution method can obtain an e-optimal solution in a finite number of iterations for general forms of transit-time-sensitive demand. Computational results based on a trans-Pacific liner ship route demonstrate the applicability and efficiency of the solution method.

• Record URL:
  https://doi.org/10.1016/j.trb.2013.04.003
• Record URL:
  http://www.sciencedirect.com/science/article/pii/S0191261513000635
• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/issn/01912615
• Supplemental Notes:
  • Abstract reprinted with permission from Elsevier.
• Authors:
  • Wang, Shuaian
  • Meng, Qiang
  • Liu, Zhiyuan
• Publication Date: 2013-8

Language

• English

Media Info

• Media Type: Print
• Features: Appendices; Figures; References; Tables;
• Pagination: pp 68-83
• Serial:
  • Transportation Research Part B: Methodological
  • Volume: 54
  • Issue Number: 0
  • Publisher: Elsevier
  • ISSN: 0191-2615
  • Serial URL: http://www.sciencedirect.com/science/journal/01912615

Subject/Index Terms

• TRT Terms: Branch and bound algorithms; Containerships; Mixed integer programming; Scheduling; Time dependence
• Subject Areas: Freight Transportation; Marine Transportation; Planning and Forecasting; I72: Traffic and Transport Planning;

Filing Info

• Accession Number: 01487251
• Record Type: Publication
• Files: TRIS
• Created Date: Jul 18 2013 1:53PM