A novel modeling approach for the fleet deployment problem within a short-term planning horizon
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.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 46 (2010)
Issue (Month): 1 (January)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic|
When requesting a correction, please mention this item's handle: RePEc:eee:transe:v:46:y:2010:i:1:p:76-89. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If references are entirely missing, you can add them using this form.