A vessel scheduling problem with special cases

Selim Bora, Endre Boros, Lei Lei, W. Art Chovalitwongse, Gino J. Lim, Hamid R. 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 (US)
Title of host publicationOperations Research and Enterprise Systems - 3rd International Conference, ICORES 2014, Revised Selected Papers
EditorsBegoña Vitoriano, Eric Pinson, Fernando Valente
PublisherSpringer Verlag
Pages108-125
Number of pages18
ISBN (Electronic)9783319175089
DOIs
StatePublished - 2015
Event3rd International Conference on Operations Research and Enterprise Systems, ICORES 2014 - Angers, Loire Valley, France
Duration: Mar 6 2014Mar 8 2014

Publication series

NameCommunications in Computer and Information Science
Volume509
ISSN (Print)1865-0929

Other

Other3rd International Conference on Operations Research and Enterprise Systems, ICORES 2014
Country/TerritoryFrance
CityAngers, Loire Valley
Period3/6/143/8/14

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Mathematics(all)

Keywords

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

Fingerprint

Dive into the research topics of 'A vessel scheduling problem with special cases'. Together they form a unique fingerprint.

Cite this