4.6 Article

Algorithm for Long-Term Scheduling of Multiproduct Pipelines

期刊

INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH
卷 50, 期 24, 页码 13899-13910

出版社

AMER CHEMICAL SOC
DOI: 10.1021/ie200101a

关键词

-

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

In this article a mixed integer linear programming (MILP) model is presented for scheduling a multiproduct oil pipeline that connects a refinery to a few distribution centers. The scheduling task was carried out while considering a number of aspects such as satisfying daily demand, forcing settling periods for quality control, observing prespecified shutdown periods, and calculating batch size by considering the type of product. Finally, an approach to solve the model in long-term planning is proposed. The algorithm is able to achieve a near-optimal solution in reasonable running time.

作者

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

评论

主要评分

4.6
评分不足

次要评分

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

推荐

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, 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 Mathematics

The strong convergence of a proximal point algorithm in complete CAT(0) metric spaces

Mohsen Tahernia, Sirous Moradi, Somaye Jafari

HACETTEPE JOURNAL OF MATHEMATICS AND STATISTICS (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 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 Operations Research & Management Science

Local dense solutions for equilibrium problems with applications to noncooperative games

S. Moradi, S. Jafari

Summary: This work establishes results regarding the existence of solutions for set-valued and single-valued equilibrium problems in real Hausdorff topological vector spaces. Generalizations of convexity and continuity conditions for set-valued mappings are introduced and applied to special dense subsets of the domain, leading to the existence of local dense solutions. The existence of global solutions is then proven under a condition weaker than semistrict quasiconvexity, specifically for noncooperative n-person games with assumptions on locally segment-dense subsets of each player's strategy set.

OPTIMIZATION (2021)

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)

暂无数据