Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/114583
Title: Routing and scheduling of parcel tankers: A novel solution approach
Authors: Oh, H.-C.
Karimi, I.A. 
Keywords: Optimization
Parcel tanker
Routing and scheduling
Stowage
Issue Date: 2008
Citation: Oh, H.-C.,Karimi, I.A. (2008). Routing and scheduling of parcel tankers: A novel solution approach. 10th Int. Workshop on Harbor, Maritime and Multimodal Logistics Modeling and Simulation, HMS 2008, Held at the International Mediterranean and Latin American Modeling Multiconference, I3M 2008 : 98-103. ScholarBank@NUS Repository.
Abstract: For more than half a century, tanker routing and scheduling problems have also attracted extensive interest from researchers. To date, only one existing tanker routing and scheduling model explicitly accounts for the cargo stowage constraints faced by tanker owners. But the originators of the latter model fail to offer efficient solution methodology that can meet the practical needs of industry practitioners. This paper aims to bridge the research gap in the domain of tanker routing and scheduling in two major ways. First, it introduces a novel solution methodology that can (1) efficiently solve tanker routing and scheduling problem with all key operating constraints, and (2) meet the practical needs of industry practitioners. In addition to highlighting the pros and cons of our tool relative to existing tools, this paper also discusses research opportunities that remain available in this field. Copyright © (2008) by CAL-TEK S.r.l.
Source Title: 10th Int. Workshop on Harbor, Maritime and Multimodal Logistics Modeling and Simulation, HMS 2008, Held at the International Mediterranean and Latin American Modeling Multiconference, I3M 2008
URI: http://scholarbank.nus.edu.sg/handle/10635/114583
Appears in Collections:Staff Publications

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

Google ScholarTM

Check


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