Efficient Simulation Algorithm and Heuristic Local Optimization Approach for Multiproduct Pipeline Networks

Background: Managing multiproduct pipeline systems is a complex task of critical importance in the petroleum industry. Experts frequently rely on simulation tools to design and validate pumping operation schedules. However, existing tools are often problem-specific and too slow to be effectively used for optimization purposes. Methods: In this paper, a new scheduling model is introduced, which inherently eliminates all conflicts except for tank overflows and underflows. A Discrete-Event Simulation algorithm was developed, capable of handling mesh-like pipeline topologies, reverse flows, and interface tracking. The computational performance of the new method is demonstrated using three local search-based optimization variants, including a simulated annealing metaheuristic. Results: A case study was made involving four problems, with 4–6 sites and 5–7 products in mesh-like and straight topologies, respectively, and a large-scale instance. Scheduling horizons of 2–28 days were used. The proposed simulation algorithm significantly outperforms a prior approach in speed, and the optimization algorithms effectively converged to feasible, high-quality schedules for most instances. Conclusions: This paper proposes a novel simulation technique for multiproduct pipeline scheduling along with three local search algorithm variants that demonstrate optimization capabilities.

Authors

Institutions

Publication Details

Journal
Logistics
Published
2025-08-12
DOI
https://doi.org/10.3390/logistics9030114
Primary Topic
VLSI and FPGA Design Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient Simulation Algorithm and Heuristic Local Optimization Approach for Multiproduct Pipeline Networks

András Éles, István Heckl
1 links
Logistics
VLSI and FPGA Design Techniques
article

Efficient Simulation Algorithm and Heuristic Local Optimization Approach for Multiproduct Pipeline Networks

András Éles, István Heckl
article en

Abstract

Background: Managing multiproduct pipeline systems is a complex task of critical importance in the petroleum industry. Experts frequently rely on simulation tools to design and validate pumping operation schedules. However, existing tools are often problem-specific and too slow to be effectively used for optimization purposes. Methods: In this paper, a new scheduling model is introduced, which inherently eliminates all conflicts except for tank overflows and underflows. A Discrete-Event Simulation algorithm was developed, capable of handling mesh-like pipeline topologies, reverse flows, and interface tracking. The computational performance of the new method is demonstrated using three local search-based optimization variants, including a simulated annealing metaheuristic. Results: A case study was made involving four problems, with 4–6 sites and 5–7 products in mesh-like and straight topologies, respectively, and a large-scale instance. Scheduling horizons of 2–28 days were used. The proposed simulation algorithm significantly outperforms a prior approach in speed, and the optimization algorithms effectively converged to feasible, high-quality schedules for most instances. Conclusions: This paper proposes a novel simulation technique for multiproduct pipeline scheduling along with three local search algorithm variants that demonstrate optimization capabilities.

LogisticsVol. 9(3)
University of Pannonia (HU)
Openalex Percentile: Top 82%
VLSI and FPGA Design Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.