Efficient decomposition-based algorithm to solve long-term pipeline scheduling problem

Abstract This paper addresses the scheduling and inventory management of a straight pipeline system connecting a single refinery to multiple distribution centers. By increasing the number of batches and time periods, maintaining the model resolution by using linear programming-based methods and comm...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	S. Moradi, S. A. MirHassani, F. Hooshmand
Formato:	article
Lenguaje:	EN
Publicado:	KeAi Communications Co., Ltd. 2019
Materias:	Multi-product oil pipeline Batch sequencing Decomposition-based algorithm Combinatorial cuts Heuristic method Science Q Petrology QE420-499
Acceso en línea:	https://doaj.org/article/951e8f69de714c2f8e2b97da5ac5c008
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:951e8f69de714c2f8e2b97da5ac5c008
record_format	dspace
spelling	oai:doaj.org-article:951e8f69de714c2f8e2b97da5ac5c0082021-12-02T12:55:59ZEfficient decomposition-based algorithm to solve long-term pipeline scheduling problem10.1007/s12182-019-00359-31672-51071995-8226https://doaj.org/article/951e8f69de714c2f8e2b97da5ac5c0082019-08-01T00:00:00Zhttp://link.springer.com/article/10.1007/s12182-019-00359-3https://doaj.org/toc/1672-5107https://doaj.org/toc/1995-8226Abstract This paper addresses the scheduling and inventory management of a straight pipeline system connecting a single refinery to multiple distribution centers. By increasing the number of batches and time periods, maintaining the model resolution by using linear programming-based methods and commercial solvers would be very time-consuming. In this paper, we make an attempt to utilize the problem structure and develop a decomposition-based algorithm capable of finding near-optimal solutions for large instances in a reasonable time. The algorithm starts with a relaxed version of the model and adds a family of cuts on the fly, so that a near-optimal solution is obtained within a few iterations. The idea behind the cut generation is based on the knowledge of the underlying problem structure. Computational experiments on a real-world data case and some randomly generated instances confirm the efficiency of the proposed algorithm in terms of the solution quality and time.S. MoradiS. A. MirHassaniF. HooshmandKeAi Communications Co., Ltd.articleMulti-product oil pipelineBatch sequencingDecomposition-based algorithmCombinatorial cutsHeuristic methodScienceQPetrologyQE420-499ENPetroleum Science, Vol 16, Iss 5, Pp 1159-1175 (2019)
institution	DOAJ
collection	DOAJ
language	EN
topic	Multi-product oil pipeline Batch sequencing Decomposition-based algorithm Combinatorial cuts Heuristic method Science Q Petrology QE420-499
spellingShingle	Multi-product oil pipeline Batch sequencing Decomposition-based algorithm Combinatorial cuts Heuristic method Science Q Petrology QE420-499 S. Moradi S. A. MirHassani F. Hooshmand Efficient decomposition-based algorithm to solve long-term pipeline scheduling problem
description	Abstract This paper addresses the scheduling and inventory management of a straight pipeline system connecting a single refinery to multiple distribution centers. By increasing the number of batches and time periods, maintaining the model resolution by using linear programming-based methods and commercial solvers would be very time-consuming. In this paper, we make an attempt to utilize the problem structure and develop a decomposition-based algorithm capable of finding near-optimal solutions for large instances in a reasonable time. The algorithm starts with a relaxed version of the model and adds a family of cuts on the fly, so that a near-optimal solution is obtained within a few iterations. The idea behind the cut generation is based on the knowledge of the underlying problem structure. Computational experiments on a real-world data case and some randomly generated instances confirm the efficiency of the proposed algorithm in terms of the solution quality and time.
format	article
author	S. Moradi S. A. MirHassani F. Hooshmand
author_facet	S. Moradi S. A. MirHassani F. Hooshmand
author_sort	S. Moradi
title	Efficient decomposition-based algorithm to solve long-term pipeline scheduling problem
title_short	Efficient decomposition-based algorithm to solve long-term pipeline scheduling problem
title_full	Efficient decomposition-based algorithm to solve long-term pipeline scheduling problem
title_fullStr	Efficient decomposition-based algorithm to solve long-term pipeline scheduling problem
title_full_unstemmed	Efficient decomposition-based algorithm to solve long-term pipeline scheduling problem
title_sort	efficient decomposition-based algorithm to solve long-term pipeline scheduling problem
publisher	KeAi Communications Co., Ltd.
publishDate	2019
url	https://doaj.org/article/951e8f69de714c2f8e2b97da5ac5c008
work_keys_str_mv	AT smoradi efficientdecompositionbasedalgorithmtosolvelongtermpipelineschedulingproblem AT samirhassani efficientdecompositionbasedalgorithmtosolvelongtermpipelineschedulingproblem AT fhooshmand efficientdecompositionbasedalgorithmtosolvelongtermpipelineschedulingproblem
_version_	1718393581288292352

Efficient decomposition-based algorithm to solve long-term pipeline scheduling problem

Ejemplares similares