Please use this identifier to cite or link to this item:
https://doi.org/10.1016/j.compchemeng.2010.07.031
Title: | Efficient bulk maritime logistics for the supply and delivery of multiple chemicals | Authors: | Li, J. Karimi, I.A. Srinivasan, R. |
Keywords: | Chemical logistics Inventory management Mixed-integer linear programming Routing Scheduling Supply chains Transportation |
Issue Date: | 9-Dec-2010 | Citation: | Li, J., Karimi, I.A., Srinivasan, R. (2010-12-09). Efficient bulk maritime logistics for the supply and delivery of multiple chemicals. Computers and Chemical Engineering 34 (12) : 2118-2128. ScholarBank@NUS Repository. https://doi.org/10.1016/j.compchemeng.2010.07.031 | Abstract: | Many multinational chemical companies (MNCs) manage the inventories of several raw materials at their worldwide sites. Maritime transportation plays a key role in this chemical logistics. In this paper, we address an inventory service problem in which a chemical MNC uses a fleet of multi-parcel ships with dedicated compartments to move multiple chemicals continually among its internal and external production and consumption sites. The objective is to ensure continuity of operation at all sites by maintaining adequate inventory levels of all raw materials. We develop a novel multi-grid continuous-time mixed-integer linear programming (MILP) formulation based (Susarla, Li, & Karimi, 2010) for this chemical logistics problem. Our model allows limited jetties at each site, non-zero transfer times, variable load/unload quantities, transfer task sequencing, etc. In contrast to the literature, it needs no separate estimates for arrivals at each site. Several examples are solved to illustrate the efficiency of our proposed formulation. © 2010 Elsevier Ltd. | Source Title: | Computers and Chemical Engineering | URI: | http://scholarbank.nus.edu.sg/handle/10635/63797 | ISSN: | 00981354 | DOI: | 10.1016/j.compchemeng.2010.07.031 |
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.