A case of the container-vessel scheduling problem

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

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

Abstract

We study a difficult real life scheduling problem encountered in oil and petrochemical industry, involving inventory and distribution operations, which requires integrated scheduling. The problem itself is NP-complete, however we show some special cases, and propose polynomial time solution methods. These could be used as a starting point for a heuristic making use of these simplified cases. This study proposes two alternative approaches for the main problem, one of them making use of one of the special cases using minimum cost flow formulation, and the other one using Benders Decomposition once the problem is reformulated to make it easier to handle. Both results show promising results and computation time. Benders Decomposition approach allows exact solutions to be found in a much faster fashion.

Original languageEnglish
Title of host publicationICORES 2014 - Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems
PublisherSciTePress
Pages63-71
Number of pages9
ISBN (Print)9789897580178
Publication statusPublished - 2014
Event3rd International Conference on Operations Research and Enterprise Systems, ICORES 2014 - Angers, Loire Valley, France
Duration: 6 Mar 20148 Mar 2014

Other

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

Fingerprint

Container
Benders decomposition
Oil industry
Heuristics
Costs
Petrochemical industry
Polynomials
Fast fashion
NP-complete
Distribution operations
Exact solution
Integrated

Keywords

  • Bender's decomposition
  • Dynamic programming
  • Vessel scheduling

ASJC Scopus subject areas

  • Organizational Behavior and Human Resource Management

Cite this

Bora, S., Boros, E., Lei, L., Chaovalitwongse, W. A., Lim, G. J., & Parsaei, H. (2014). A case of the container-vessel scheduling problem. In ICORES 2014 - Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems (pp. 63-71). SciTePress.

A case of the container-vessel scheduling problem. / Bora, Selim; Boros, Endre; Lei, Lei; Chaovalitwongse, W. Art; Lim, Gino J.; Parsaei, Hamid.

ICORES 2014 - Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems. SciTePress, 2014. p. 63-71.

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

Bora, S, Boros, E, Lei, L, Chaovalitwongse, WA, Lim, GJ & Parsaei, H 2014, A case of the container-vessel scheduling problem. in ICORES 2014 - Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems. SciTePress, pp. 63-71, 3rd International Conference on Operations Research and Enterprise Systems, ICORES 2014, Angers, Loire Valley, France, 6/3/14.
Bora S, Boros E, Lei L, Chaovalitwongse WA, Lim GJ, Parsaei H. A case of the container-vessel scheduling problem. In ICORES 2014 - Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems. SciTePress. 2014. p. 63-71
Bora, Selim ; Boros, Endre ; Lei, Lei ; Chaovalitwongse, W. Art ; Lim, Gino J. ; Parsaei, Hamid. / A case of the container-vessel scheduling problem. ICORES 2014 - Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems. SciTePress, 2014. pp. 63-71
@inproceedings{dd6b13e1fe5c47da8051c856e8e4de88,
title = "A case of the container-vessel scheduling problem",
abstract = "We study a difficult real life scheduling problem encountered in oil and petrochemical industry, involving inventory and distribution operations, which requires integrated scheduling. The problem itself is NP-complete, however we show some special cases, and propose polynomial time solution methods. These could be used as a starting point for a heuristic making use of these simplified cases. This study proposes two alternative approaches for the main problem, one of them making use of one of the special cases using minimum cost flow formulation, and the other one using Benders Decomposition once the problem is reformulated to make it easier to handle. Both results show promising results and computation time. Benders Decomposition approach allows exact solutions to be found in a much faster fashion.",
keywords = "Bender's decomposition, Dynamic programming, Vessel scheduling",
author = "Selim Bora and Endre Boros and Lei Lei and Chaovalitwongse, {W. Art} and Lim, {Gino J.} and Hamid Parsaei",
year = "2014",
language = "English",
isbn = "9789897580178",
pages = "63--71",
booktitle = "ICORES 2014 - Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems",
publisher = "SciTePress",

}

TY - GEN

T1 - A case of the container-vessel scheduling problem

AU - Bora, Selim

AU - Boros, Endre

AU - Lei, Lei

AU - Chaovalitwongse, W. Art

AU - Lim, Gino J.

AU - Parsaei, Hamid

PY - 2014

Y1 - 2014

N2 - We study a difficult real life scheduling problem encountered in oil and petrochemical industry, involving inventory and distribution operations, which requires integrated scheduling. The problem itself is NP-complete, however we show some special cases, and propose polynomial time solution methods. These could be used as a starting point for a heuristic making use of these simplified cases. This study proposes two alternative approaches for the main problem, one of them making use of one of the special cases using minimum cost flow formulation, and the other one using Benders Decomposition once the problem is reformulated to make it easier to handle. Both results show promising results and computation time. Benders Decomposition approach allows exact solutions to be found in a much faster fashion.

AB - We study a difficult real life scheduling problem encountered in oil and petrochemical industry, involving inventory and distribution operations, which requires integrated scheduling. The problem itself is NP-complete, however we show some special cases, and propose polynomial time solution methods. These could be used as a starting point for a heuristic making use of these simplified cases. This study proposes two alternative approaches for the main problem, one of them making use of one of the special cases using minimum cost flow formulation, and the other one using Benders Decomposition once the problem is reformulated to make it easier to handle. Both results show promising results and computation time. Benders Decomposition approach allows exact solutions to be found in a much faster fashion.

KW - Bender's decomposition

KW - Dynamic programming

KW - Vessel scheduling

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

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

M3 - Conference contribution

AN - SCOPUS:84902348085

SN - 9789897580178

SP - 63

EP - 71

BT - ICORES 2014 - Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems

PB - SciTePress

ER -