Please use this identifier to cite or link to this item:
|Title:||Routing and cargo allocation planning of a parcel tanker|
|Citation:||Neo, K.-H.,Oh, H.-C.,Karimi, I.A. (2006). Routing and cargo allocation planning of a parcel tanker. Computer Aided Chemical Engineering 21 (C) : 1985-1990. ScholarBank@NUS Repository. https://doi.org/10.1016/S1570-7946(06)80339-1|
|Abstract:||A parcel tanker is an ocean carrier that has multiple compartments to hold multiple liquid chemical cargoes and prevent them from mixing. Management of parcel tankers entails several operational constraints. The types of cargoes that their compartments can hold depend on (1) construction materials and coatings of compartments and (2) contents of neighboring compartments. Furthermore, the weights of cargoes among the compartments must be properly distributed to ensure ship stability. Cargo loading and unloading, compartment cleaning requirements, and draft limitations complicate the parcel tanker operation and route planning even further. To the best of the authors' knowledge, none of the existing models that address routing and scheduling of parcel tankers considers the aforementioned operational constraints simultaneously. To address this research gap, we introduce a new routing and scheduling model that explicitly considers the unique operational limitations of parcel tankers. Essentially our new model involves deciding which ports the ship should visit and in which sequence, which cargoes it should pickup and unload, and to which compartments each cargo should be assigned and when over the entire trip so as to maximize the profit for the ship. Finally, we also apply our new model on a case study to illustrate the importance of including cargo compatibility and ship stability constraints in routing and scheduling of a parcel tanker. © 2006 Elsevier B.V. All rights reserved.|
|Source Title:||Computer Aided Chemical Engineering|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 8, 2018
checked on Nov 3, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.