Please use this identifier to cite or link to this item:
Title: Optimal operating strategy for a long-haul liner service route
Authors: Meng, Q. 
Wang, S.
Keywords: Branch-and-bound
Liner shipping
Sailing speed
Issue Date: 16-Nov-2011
Citation: Meng, Q., Wang, S. (2011-11-16). Optimal operating strategy for a long-haul liner service route. European Journal of Operational Research 215 (1) : 105-114. ScholarBank@NUS Repository.
Abstract: This paper proposes an optimal operating strategy problem arising in liner shipping industry that aims to determine service frequency, containership fleet deployment plan, and sailing speed for a long-haul liner service route. The problem is formulated as a mixed-integer nonlinear programming model that cannot be solved efficiently by the existing solution algorithms. In view of some unique characteristics of the liner shipping operations, this paper proposes an efficient and exact branch-and-bound based -optimal algorithm. In particular, a mixed-integer nonlinear model is first developed for a given service frequency and ship type; two linearization techniques are subsequently presented to approximate this model with a mixed-integer linear program; and the branch-and-bound approach controls the approximation error below a specified tolerance. This paper further demonstrates that the branch-and-bound based -optimal algorithm obtains a globally optimal solution with the predetermined relative optimality tolerance in a finite number of iterations. The case study based on an existing long-haul liner service route shows the effectiveness and efficiency of the proposed solution method. © 2011 Elsevier B.V. All rights reserved.
Source Title: European Journal of Operational Research
ISSN: 03772217
DOI: 10.1016/j.ejor.2011.05.057
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Feb 19, 2019


checked on Feb 11, 2019

Page view(s)

checked on Nov 24, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.