Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/74740
Title: Scheduling tank container movements for chemical logistics
Authors: Karimi, I.A. 
Sharafali, M. 
Mahalingam, H.
Issue Date: 2004
Source: Karimi, I.A.,Sharafali, M.,Mahalingam, H. (2004). Scheduling tank container movements for chemical logistics. AIChE Annual Meeting, Conference Proceedings : -. ScholarBank@NUS Repository.
Abstract: The transport of chemicals by pipelines is ideal, but is not always possible. Chemical logistics requires a mix of means such as trucks, trains, ships, barges, tankers, etc. Bulk shipping of chemicals occurs in huge volumes, and involves VLCC and various multiparcel chemical tankers. The former routinely transport crude oils worldwide, while the latter transport clean petrochemical products and other chemicals, e.g., vegetable oils. An innovative, event-based, "pull" approach for the minimum-cost or the maximum-profit scheduling of the transport and cleaning of multi-product tank containers (loaded and empty) given a set of projected shipment orders is a presented. The problem is a continuous-time, linear programming formulation that successfully solves large, industrially relevant problems. Compared to the network modeling approach used for traditional dry containers, the current approach appears is more efficient and flexible. It also applies easily to dry containers. Other key practical extensions such as alternate ship schedules, delivery time-windows, and inter-modal transport routes are incorporated. The problem and the method are illustrated through numerical examples. This is an abstract of a paper presented at the AIChE Annual Meeting (Austin, TX 11/7-12/2004).
Source Title: AIChE Annual Meeting, Conference Proceedings
URI: http://scholarbank.nus.edu.sg/handle/10635/74740
Appears in Collections:Staff Publications

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

Page view(s)

24
checked on Jan 20, 2018

Google ScholarTM

Check


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