Please use this identifier to cite or link to this item:
https://doi.org/10.1021/ie0501632
Title: | Contract selection and tank allocation in a terminaling and storage facility | Authors: | Tay, H.L. Karimi, I.A. Peck, C.K. Peh, X.L. |
Issue Date: | 14-Sep-2005 | Citation: | Tay, H.L., Karimi, I.A., Peck, C.K., Peh, X.L. (2005-09-14). Contract selection and tank allocation in a terminaling and storage facility. Industrial and Engineering Chemistry Research 44 (19) : 7435-7450. ScholarBank@NUS Repository. https://doi.org/10.1021/ie0501632 | Abstract: | Chemical logistics play a key role in chemical supply chains. Terminaling and tank storage of liquid chemicals is a very common activity in the transport, use, and trading of chemicals. Efficient utilization of the available tank capacity at a storage terminal is a difficult combinatorial problem and is paramount in reducing costs for both the terminal operator and its customers. We present three multiperiod mixed-integer linear-programming (MILP) formulations for selecting contracts and allocating tanks to contracts in a typical storage terminal to maximize profit. One of the three models seems promising for managing a moderate-size facility. For managing larger facilities, we propose two heuristics. We illustrate our models and algorithms with a case study involving 27 tanks and 40 contracts. The heuristics give comparable solutions that are roughly 8-9% lower than the optimum solution. On one hand, they show the advantage of rigorous optimization, while on the other, they show that even these heuristics could represent significant savings compared to the manual procedures used in the chemical logistics industry. © 2005 American Chemical Society. | Source Title: | Industrial and Engineering Chemistry Research | URI: | http://scholarbank.nus.edu.sg/handle/10635/63654 | ISSN: | 08885885 | DOI: | 10.1021/ie0501632 |
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.