A polynomial-time algorithm for sailing speed optimization with containership resource sharing

Shuaian Wang, Xinchang Wang

Research output: Journal article publicationJournal articleAcademic researchpeer-review

14 Citations (Scopus)

Abstract

The level of service can be incorporated into a sailing speed optimization model from the perspective of supply chain management or from the perspective of shipping lines. We design a polynomial-time algorithm workable to solve the two models based on bi-section search methods. The novelties of the algorithm include constructing a new parameter on which the bi-section search will be executed and deriving a near-optimal solution by taking advantage of the problem structure. We also provide theoretical results that guarantee the validity of the polynomial-time algorithm.
Original languageEnglish
Pages (from-to)394-405
Number of pages12
JournalTransportation Research Part B: Methodological
Volume93
DOIs
Publication statusPublished - 1 Nov 2016

Keywords

  • Bi-section search
  • Bunker fuel
  • Containership
  • Polynomial-time algorithm
  • Sailing speed
  • Transit time

ASJC Scopus subject areas

  • Transportation
  • Management Science and Operations Research

Cite this