Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.tre.2009.06.004
Title: A novel modeling approach for the fleet deployment problem within a short-term planning horizon
Authors: Gelareh, S. 
Meng, Q. 
Keywords: Containership
Fleet deployment
Linearization
Liner shipping
Mixed integer programming
Issue Date: Jan-2010
Source: Gelareh, S., Meng, Q. (2010-01). A novel modeling approach for the fleet deployment problem within a short-term planning horizon. Transportation Research Part E: Logistics and Transportation Review 46 (1) : 76-89. ScholarBank@NUS Repository. https://doi.org/10.1016/j.tre.2009.06.004
Abstract: This paper is concerned with model development for a short-term fleet deployment problem of liner shipping operations. We first present a mixed integer nonlinear programming model in which the optimal vessel speeds for different vessel types on different routes are interpreted as their realistic optimal travel times. We then linearize the proposed nonlinear model and obtain a mixed integer linear programming (MILP) model that can be efficiently solved by a standard mixed integer programming solver such as CPLEX. The MILP model determines the optimal route service frequency pattern and take into account the time window constraints of shipping services. Finally, we report our numerical results and performance of CPLEX on randomly generated instances. © 2009 Elsevier Ltd. All rights reserved.
Source Title: Transportation Research Part E: Logistics and Transportation Review
URI: http://scholarbank.nus.edu.sg/handle/10635/54632
ISSN: 13665545
DOI: 10.1016/j.tre.2009.06.004
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

61
checked on Dec 7, 2017

WEB OF SCIENCETM
Citations

52
checked on Nov 22, 2017

Page view(s)

34
checked on Dec 11, 2017

Google ScholarTM

Check

Altmetric


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