Please use this identifier to cite or link to this item: https://doi.org/10.1021/ie050840s
Title: Scheduling trans-shipment operations in maritime chemical transportation
Authors: Huang, C.
Karimi, I.A. 
Issue Date: 15-Mar-2006
Source: Huang, C., Karimi, I.A. (2006-03-15). Scheduling trans-shipment operations in maritime chemical transportation. Industrial and Engineering Chemistry Research 45 (6) : 1955-1973. ScholarBank@NUS Repository. https://doi.org/10.1021/ie050840s
Abstract: Trans-shipment or direct ship-to-ship transfer of bulk liquid cargos for regional distribution is a routine activity in maritime chemical logistics. Efficient scheduling of trans-shipment operations is economically crucial, because of the expensive multiparcel carriers. In this work, we consider a general chemical trans-shipment problem, in which multiple donor carriers trans-ship several chemical cargos to multiple recipient carriers. We develop nine continuous-time mixed-integer linear programming (MILP) formulations of three types for determining the optimal sequences, positions, and timings for unloading various cargos. Two of these models using the big-M relaxation to solve several test problems with reasonable speed, but their performance varies with the numbers of two-sided cargos and ships. For even larger problems, we simplify our rigorous model heuristically using a cargo aggregation assumption, which reduces the formulation size tremendously and decreases model solution times by ∼2 orders of magnitude, yet gives near-optimal solutions. © 2006 American Chemical Society.
Source Title: Industrial and Engineering Chemistry Research
URI: http://scholarbank.nus.edu.sg/handle/10635/64551
ISSN: 08885885
DOI: 10.1021/ie050840s
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

13
checked on Dec 6, 2017

WEB OF SCIENCETM
Citations

9
checked on Nov 22, 2017

Page view(s)

28
checked on Dec 10, 2017

Google ScholarTM

Check

Altmetric


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