A vessel scheduling problem with special cases

Selim Bora, Endre Boros, Lei Lei, W. Art Chovalitwongse, Gino J. Lim, Hamid Parsaei

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We study the inventory and distribution operations encountered in oil and petrochemical industry. We show some special cases for the NP-complete problem, and propose polynomial time solution methods. We propose two approaches for the main problem. One of them makes use of the minimum cost flow formulation of the same problem under some assumptions, and the other one uses Benders Decomposition. In addition, we propose another problem and its formulation which involves time-windows for delivery, for which the same approaches can be applied. However, methodology or the results for the latter problem are not given.

Original languageEnglish
Title of host publicationOperations Research and Enterprise Systems - 3rd International Conference, ICORES 2014, Revised Selected Papers
PublisherSpringer Verlag
Pages108-125
Number of pages18
Volume509
ISBN (Electronic)9783319175089
DOIs
Publication statusPublished - 2015
Externally publishedYes
Event3rd International Conference on Operations Research and Enterprise Systems, ICORES 2014 - Angers, Loire Valley, France
Duration: 6 Mar 20148 Mar 2014

Publication series

NameCommunications in Computer and Information Science
Volume509
ISSN (Print)18650929

Other

Other3rd International Conference on Operations Research and Enterprise Systems, ICORES 2014
CountryFrance
CityAngers, Loire Valley
Period6/3/148/3/14

Fingerprint

Petrochemicals
Computational complexity
Scheduling
Polynomials
Decomposition
Costs
Industry
Oils

Keywords

  • Bender’s decomposition
  • Minimum cost network flow
  • Vessel scheduling

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Bora, S., Boros, E., Lei, L., Chovalitwongse, W. A., Lim, G. J., & Parsaei, H. (2015). A vessel scheduling problem with special cases. In Operations Research and Enterprise Systems - 3rd International Conference, ICORES 2014, Revised Selected Papers (Vol. 509, pp. 108-125). (Communications in Computer and Information Science; Vol. 509). Springer Verlag. https://doi.org/10.1007/978-3-319-17509-6_8

A vessel scheduling problem with special cases. / Bora, Selim; Boros, Endre; Lei, Lei; Chovalitwongse, W. Art; Lim, Gino J.; Parsaei, Hamid.

Operations Research and Enterprise Systems - 3rd International Conference, ICORES 2014, Revised Selected Papers. Vol. 509 Springer Verlag, 2015. p. 108-125 (Communications in Computer and Information Science; Vol. 509).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bora, S, Boros, E, Lei, L, Chovalitwongse, WA, Lim, GJ & Parsaei, H 2015, A vessel scheduling problem with special cases. in Operations Research and Enterprise Systems - 3rd International Conference, ICORES 2014, Revised Selected Papers. vol. 509, Communications in Computer and Information Science, vol. 509, Springer Verlag, pp. 108-125, 3rd International Conference on Operations Research and Enterprise Systems, ICORES 2014, Angers, Loire Valley, France, 6/3/14. https://doi.org/10.1007/978-3-319-17509-6_8
Bora S, Boros E, Lei L, Chovalitwongse WA, Lim GJ, Parsaei H. A vessel scheduling problem with special cases. In Operations Research and Enterprise Systems - 3rd International Conference, ICORES 2014, Revised Selected Papers. Vol. 509. Springer Verlag. 2015. p. 108-125. (Communications in Computer and Information Science). https://doi.org/10.1007/978-3-319-17509-6_8
Bora, Selim ; Boros, Endre ; Lei, Lei ; Chovalitwongse, W. Art ; Lim, Gino J. ; Parsaei, Hamid. / A vessel scheduling problem with special cases. Operations Research and Enterprise Systems - 3rd International Conference, ICORES 2014, Revised Selected Papers. Vol. 509 Springer Verlag, 2015. pp. 108-125 (Communications in Computer and Information Science).
@inproceedings{037fb5935aff4d5194320a037c83a2e7,
title = "A vessel scheduling problem with special cases",
abstract = "We study the inventory and distribution operations encountered in oil and petrochemical industry. We show some special cases for the NP-complete problem, and propose polynomial time solution methods. We propose two approaches for the main problem. One of them makes use of the minimum cost flow formulation of the same problem under some assumptions, and the other one uses Benders Decomposition. In addition, we propose another problem and its formulation which involves time-windows for delivery, for which the same approaches can be applied. However, methodology or the results for the latter problem are not given.",
keywords = "Bender’s decomposition, Minimum cost network flow, Vessel scheduling",
author = "Selim Bora and Endre Boros and Lei Lei and Chovalitwongse, {W. Art} and Lim, {Gino J.} and Hamid Parsaei",
year = "2015",
doi = "10.1007/978-3-319-17509-6_8",
language = "English",
volume = "509",
series = "Communications in Computer and Information Science",
publisher = "Springer Verlag",
pages = "108--125",
booktitle = "Operations Research and Enterprise Systems - 3rd International Conference, ICORES 2014, Revised Selected Papers",

}

TY - GEN

T1 - A vessel scheduling problem with special cases

AU - Bora, Selim

AU - Boros, Endre

AU - Lei, Lei

AU - Chovalitwongse, W. Art

AU - Lim, Gino J.

AU - Parsaei, Hamid

PY - 2015

Y1 - 2015

N2 - We study the inventory and distribution operations encountered in oil and petrochemical industry. We show some special cases for the NP-complete problem, and propose polynomial time solution methods. We propose two approaches for the main problem. One of them makes use of the minimum cost flow formulation of the same problem under some assumptions, and the other one uses Benders Decomposition. In addition, we propose another problem and its formulation which involves time-windows for delivery, for which the same approaches can be applied. However, methodology or the results for the latter problem are not given.

AB - We study the inventory and distribution operations encountered in oil and petrochemical industry. We show some special cases for the NP-complete problem, and propose polynomial time solution methods. We propose two approaches for the main problem. One of them makes use of the minimum cost flow formulation of the same problem under some assumptions, and the other one uses Benders Decomposition. In addition, we propose another problem and its formulation which involves time-windows for delivery, for which the same approaches can be applied. However, methodology or the results for the latter problem are not given.

KW - Bender’s decomposition

KW - Minimum cost network flow

KW - Vessel scheduling

UR - http://www.scopus.com/inward/record.url?scp=84929615017&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84929615017&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-17509-6_8

DO - 10.1007/978-3-319-17509-6_8

M3 - Conference contribution

AN - SCOPUS:84929615017

VL - 509

T3 - Communications in Computer and Information Science

SP - 108

EP - 125

BT - Operations Research and Enterprise Systems - 3rd International Conference, ICORES 2014, Revised Selected Papers

PB - Springer Verlag

ER -