4.7 Article

The multi-product pipeline scheduling system

期刊

COMPUTERS & MATHEMATICS WITH APPLICATIONS
卷 56, 期 4, 页码 891-897

出版社

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.camwa.2008.01.035

关键词

petroleum; transportation; multi-product pipeline; distribution scheduling; IP formulation

向作者/读者索取更多资源

This paper presents an integer programming approach to oil derivative transportation scheduling. The system reported is composed of an oil refinery, one multi-branch multi-product pipeline connected to several depots and also local consumer markets which receive large amounts of refinery products. Batches of refined products and grades are pumped back-to-back in the pipeline, without any separation device between them. The sequence and lengths of such pumping runs should be carefully selected in order to meet market demands while satisfying many pipeline operational constraints such as minimum interfaces. (C) 2008 Elsevier Ltd. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

Article Management

Efficient Benders decomposition for distance-based critical node detection problem

F. Hooshmand, F. Mirarabrazi, S. A. MirHassani

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2020)

Article Computer Science, Theory & Methods

Stochastic virtual network embedding via accelerated Benders decomposition

Behrooz Farkiani, Bahador Bakhshi, S. Ali MirHassani

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE (2019)

Article Computer Science, Interdisciplinary Applications

Logic-based benders decomposition algorithm for contamination detection problem in water networks

F. Hooshmand, F. Amerehi, S. A. MirHassani

COMPUTERS & OPERATIONS RESEARCH (2020)

Article Computer Science, Artificial Intelligence

Solving two-dimensional cutting stock problem via a DNA computing algorithm

M. Dodge, S. A. MirHassani, F. Hooshmand

Summary: The paper presents a DNA computing algorithm based on the sticker model to solve the two-dimensional cutting stock problem (TDCSP), proving that the time complexity of this algorithm on DNA computers is polynomial, taking into account the number of small pieces and the dimensions of the main board.

NATURAL COMPUTING (2021)

Article Computer Science, Information Systems

A Fast Near-Optimal Approach for Energy-Aware SFC Deployment

Behrooz Farkiani, Bahador Bakhshi, S. A. MirHassani

IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT (2019)

Article Construction & Building Technology

Pavement maintenance and rehabilitation planning optimisation under budget and pavement deterioration uncertainty

Amirhossein Fani, Amir Golroo, S. Ali Mirhassani, Amir H. Gandomi

Summary: The study aims to develop an optimization framework for network-level pavement maintenance and rehabilitation planning considering the uncertain nature of pavement deterioration and the budget with a multistage stochastic mixed-integer programming model. The proposed model can find the optimal plan feasible for all possible scenarios of uncertainty and optimize the expectation of the objective function.

INTERNATIONAL JOURNAL OF PAVEMENT ENGINEERING (2022)

Article Construction & Building Technology

A progressive hedging approach for large-scale pavement maintenance scheduling under uncertainty

Amirhossein Fani, Hamed Naseri, Amir Golroo, S. Ali Mirhassani, Amir H. Gandomi

Summary: This study proposes a multi-stage stochastic mixed-integer programming model to address the high-level complexity of large-scale pavement maintenance scheduling problems. The findings show that the introduced approach is capable of effectively handling uncertainty in maintenance and rehabilitation problems.

INTERNATIONAL JOURNAL OF PAVEMENT ENGINEERING (2022)

Article Computer Science, Interdisciplinary Applications

EIA-CNDP: An exact iterative algorithm for critical node detection problem

Javad Rezaei, Fatemeh Zare-Mirakabad, Seyed Ali MirHassani, Sayed-Amir Marashi

Summary: This paper discusses the critical node detection problem in network robustness design, proposing a new solution and verifying its effectiveness, as well as introducing a new exact algorithm to improve the solving efficiency.

COMPUTERS & OPERATIONS RESEARCH (2021)

Article Computer Science, Hardware & Architecture

Prioritized Deployment of Dynamic Service Function Chains

Behrooz Farkiani, Bahador Bakhshi, S. Ali MirHassani, Tim Wauters, Bruno Volckaert, Filip De Turck

Summary: This paper studies the problem of deployment and reconfiguration of a set of chains with different priorities with the objective of maximizing the service provider's profit. It proposes a MILP formulation and two solving algorithms, showing that the proposed heuristic can find a feasible solution in at least 83% of simulation runs in less than 7 seconds. The exact algorithm achieves 25% more profit 8 times faster than state-of-the-art MILP solving methods.

IEEE-ACM TRANSACTIONS ON NETWORKING (2021)

Article Computer Science, Interdisciplinary Applications

A solution approach for cardinality minimization problem based on fractional programming

S. M. Mirhadi, S. A. MirHassani

Summary: This paper proposes a new algorithm for solving the linear Cardinality Minimization Problem by converting it to the sum-of-ratio problem and solving it with an optimization algorithm. The efficiency of the algorithm is demonstrated through numerical experiments.

JOURNAL OF COMBINATORIAL OPTIMIZATION (2022)

Article Engineering, Civil

Risk-Based Formulation of the Transit Priority Network Design

Ahmadreza Ghaffari, Mahmoud Mesbah, Ali Khodaii, S. Ali MirHassani

Summary: This paper proposes a model to find the optimal transit priority scheme in a multimodal transportation network under uncertain demand. The model is formulated as a risk-based bi-level optimization problem and solved using an ant colony algorithm. Numerical results show that demand uncertainty has a significant impact on the solution, and the proposed model is applicable to realistic networks.

IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS (2022)

Article Operations Research & Management Science

A novel two-phase decomposition-based algorithm to solve MINLP pipeline scheduling problem

Neda Beheshti Asl, S. A. MirHassani, S. Relvas, F. Hooshmand

Summary: This paper presents an efficient decomposition-based heuristic to solve a new variant of the pipeline scheduling problem, considering the impact of flow-rate stability on energy consumption. By developing a new continuous-time mixed-integer nonlinear programming model and applying decomposition technique, the proposed method is able to generate near-optimal solutions and achieve more stable flow-rates.

OPERATIONAL RESEARCH (2022)

Article Operations Research & Management Science

A heuristic method to find a quick feasible solution based on the ratio programming

M. N. Yarahmadi, S. A. MirHassani, F. Hooshmand

Summary: This paper presents a novel method, called the feasible-finder model (FFM), to find a high-quality feasible solution for 0-1 mixed-integer programming problems. By solving a sequence of linear programming problems using an efficient ratio programming method, FFM proves to provide feasible solutions for the original MIP problem. Additionally, a quality-controlling cut is generated and added in each iteration to improve the solution quality. Computational results on CORAL and MIPLIB instances confirm the effectiveness of this method.

OPERATIONAL RESEARCH (2023)

Article Operations Research & Management Science

Two-stage stochastic programming model to locate capacitated EV-charging stations in urban areas under demand uncertainty

S. A. MirHassani, A. Khaleghi, F. Hooshmand

EURO JOURNAL ON TRANSPORTATION AND LOGISTICS (2020)

Article Engineering, Civil

Risk-Based Models for Optimal Sensor Location Problems in Water Networks

F. Hooshmand, F. Amerehi, S. A. MirHassani

JOURNAL OF WATER RESOURCES PLANNING AND MANAGEMENT (2020)

Article Mathematics, Applied

A fractional-order image segmentation model with application to low-contrast and piecewise smooth images

Junfeng Cao, Ke Chen, Huan Han

Summary: This paper proposes a two-stage image segmentation model based on structure tensor and fractional-order regularization. In the first stage, fractional-order regularization is used to approximate the Hausdorff measure of the MS model. The solution is found using the ADI scheme. In the second stage, thresholding is used for target segmentation. The proposed model demonstrates superior performance compared to state-of-the-art methods.

COMPUTERS & MATHEMATICS WITH APPLICATIONS (2024)

Article Mathematics, Applied

Dual-grid mapping method for the advection-diffusion-reaction equation in a heterogeneous medium

Dylan J. Oliver, Ian W. Turner, Elliot J. Carr

Summary: This paper discusses a projection-based framework for numerical computation of advection-diffusion-reaction (ADR) equations in heterogeneous media with multiple layers or complex geometric structures. By obtaining approximate solutions on a coarse grid and reconstructing solutions on a fine grid, the computational cost is significantly reduced while accurately approximating complex solutions.

COMPUTERS & MATHEMATICS WITH APPLICATIONS (2024)

Article Mathematics, Applied

An implicit-in-time DPG formulation of the 1D1V Vlasov-Poisson equations

Nathan V. Roberts, Sean T. Miller, Stephen D. Bond, Eric C. Cyr

Summary: In this study, the time-marching discontinuous Petrov-Galerkin (DPG) method is applied to the Vlasov equation for the first time, using backward Euler for a Vlasov-Poisson discretization. Adaptive mesh refinement is demonstrated on two problems: the two-stream instability problem and a cold diode problem.

COMPUTERS & MATHEMATICS WITH APPLICATIONS (2024)

Article Mathematics, Applied

Generating probability distributions on intervals and spheres: Convex decomposition

Yizhi Sun, Zhilin Sun

Summary: This work investigates the convexity of a specific class of positive definite probability measures and demonstrates the preservation of convexity under multiplication and intertwining product. The study reveals that any integrable function on an interval with a polynomial expansion of fast absolute convergence can be decomposed into a pair of positive convex interval probabilities, simplifying the study of interval distributions and discontinuous probabilistic Galerkin schemes.

COMPUTERS & MATHEMATICS WITH APPLICATIONS (2024)

Article Mathematics, Applied

Implementation of Legendre wavelet method for the size dependent bending analysis of nano beam resonator under nonlocal strain gradient theory

Bhagwan Singh, Komal Jangid, Santwana Mukhopadhyay

Summary: This paper examines the prediction of bending characteristics of nanoscale materials using the Moore-Gibson-Thompson thermoelasticity theory in conjunction with the nonlocal strain gradient theory. The study finds that the stiffness of the materials can be affected by nonlocal and length-scale parameters, and the aspect ratios of the beam structure play a significant role in bending simulations.

COMPUTERS & MATHEMATICS WITH APPLICATIONS (2024)

Article Mathematics, Applied

A parallel finite element post-processing algorithm for the damped Stokes equations

Guoliang Wang, Bo Zheng, Yueqiang Shang

Summary: This paper presents and analyzes a parallel finite element post-processing algorithm for the simulation of Stokes equations with a nonlinear damping term, which integrates the algorithmic advantages of the two-level approach, the partition of unity method, and the post-processing technique. The algorithm generates a global continuous approximate solution using the partition of unity method and improves the smoothness of the solution by adding an extra coarse grid correction step. It has good parallel performance and is validated through theoretical error estimates and numerical test examples.

COMPUTERS & MATHEMATICS WITH APPLICATIONS (2024)

Article Mathematics, Applied

Rotated block diagonal preconditioners for Navier-Stokes control problems

Hao Xu, Zeng-Qi Wang

Summary: Fluid flow control problems are crucial in industrial applications, and solving the optimal control of Navier-Stokes equations is challenging. By using Oseen's approximation and matrix splitting preconditioners, we can efficiently solve the linear systems and improve convergence.

COMPUTERS & MATHEMATICS WITH APPLICATIONS (2024)

Article Mathematics, Applied

Accurate numerical simulations for fractional diffusion equations using spectral deferred correction methods

Zhengya Yang, Xuejuan Chen, Yanping Chen, Jing Wang

Summary: This paper focuses on the high-order stable numerical solutions of the time-space fractional diffusion equation. The Fourier spectral method is used for spatial discretization and the Spectral Deferred Correction (SDC) method is used for numerical solutions in time. As a result, a high-precision numerical discretization scheme for solving the fractional diffusion equation is obtained, and the convergence and stability of the scheme are proved. Several numerical examples are presented to demonstrate the effectiveness and feasibility of the proposed numerical scheme.

COMPUTERS & MATHEMATICS WITH APPLICATIONS (2024)