Please use this identifier to cite or link to this item:
https://doi.org/10.1016/j.compchemeng.2003.08.009
Title: | Improving the logistics of multi-compartment chemical tankers | Authors: | Jetlund, A.S. Karimi, I.A. |
Keywords: | Chemical shipping Dynamic scheduling Maritime transportation Multi-commodity Routing Transshipment |
Issue Date: | 15-Jul-2004 | Citation: | Jetlund, A.S., Karimi, I.A. (2004-07-15). Improving the logistics of multi-compartment chemical tankers. Computers and Chemical Engineering 28 (8) : 1267-1283. ScholarBank@NUS Repository. https://doi.org/10.1016/j.compchemeng.2003.08.009 | Abstract: | Ocean transportation is the workhorse for logistics in global chemical supply chains. Often, logistics cost can be as high as 20% of the purchasing cost. Efficient routing and scheduling of multi-parcel chemical tankers to reduce logistics expenditure is important for both chemical and shipping industry. We consider the maximum-profit scheduling of a fleet of multi-parcel tankers engaged in shipping bulk liquid chemicals. For this, we present a mixed-integer linear programming (MILP) formulation using variable-length slots and propose a heuristic decomposition algorithm that obtains the fleet schedule by repeatedly solving the base formulation for a single ship. The formulation is generally applicable to all kinds of carriers engaged in the transportation of multiple commodities, and to transportation systems where frequent schedule updates or a short-term planning horizon is required. We illustrate our approach on a real industrial case study involving 10 tankers, 36 ports and 79 cargos. Our approach showed an increase of 32.7% in profit as compared to the plan actually used by a major chemical shipping company. © 2003 Elsevier Ltd. All rights reserved. | Source Title: | Computers and Chemical Engineering | URI: | http://scholarbank.nus.edu.sg/handle/10635/64073 | ISSN: | 00981354 | DOI: | 10.1016/j.compchemeng.2003.08.009 |
Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.