Optimal Scheduling of Multiproduct Pipeline System Using MILP Continuous Approach

Part 5: Planning and Scheduling; International audience; To date, the multiproduct pipeline transportation mode has nationally and internationally considerably evolved thanks to his efficiently and effectively of transporting several products. In this paper, we focus our study on the scheduling of a multiproduct pipeline system that receives a number of petroleum products (fuels) from a single refinery source in order to be distributed to several storage and distribution centers (depots). Mixed Integer Linear Programming (MILP) continuous mathematical approach is presented to solve this problem. The sequence of injected products in the same pipeline should be carefully studied, in order to meet market demands and ensure storage autonomy of the marketable pure products in the fuels depots on the one hand and to minimize the number of interfaces; Birth zone of mixture between two products in contact and in sequential flow, which may hinder the continuous operation of the pipeline system, by the necessity of additional storage capacity for this last mixture, that is in no way marketable and requires special processing operations. This work is applied on a real case of a multiproduct pipeline that feeds the western and southwestern region of Algeria with fuels. The obtained results based on the MILP continuous approach give an optimal scheduling of the multiproduct transport system with a minimized number of interfaces. Document type: Conference objec

Multiobjective strategies for New Product Development in the pharmaceutical industry

New Product Development (NPD) constitutes a challenging problem in the pharmaceutical industry, due to the characteristics of the development pipeline. Formally, the NPD problem can be stated as follows: select a set of R&D projects from a pool of candidate projects in order to satisfy several criteria (economic profitability, time to market) while coping with the uncertain nature of the projects. More precisely, the recurrent key issues are to determine the projects to develop once target molecules have been identified, their order and the level of resources to assign. In this context, the proposed approach combines discrete event stochastic simulation (Monte Carlo approach) with multiobjective genetic algorithms (NSGAII type, Non-Sorted Genetic Algorithm II) to optimize the highly combinatorial portfolio management problem. In that context, Genetic Algorithms (GAs) are particularly attractive for treating this kind of problem, due to their ability to directly lead to the so-called Pareto front and to account for the combinatorial aspect. This work is illustrated with a study case involving nine interdependent new product candidates targeting three diseases. An analysis is performed for this test bench on the different pairs of criteria both for the bi- and tricriteria optimization: large portfolios cause resource queues and delays time to launch and are eliminated by the bi- and tricriteria optimization strategy. The optimization strategy is thus interesting to detect the sequence candidates. Time is an important criterion to consider simultaneously with NPV and risk criteria. The order in which drugs are released in the pipeline is of great importance as with scheduling problems

Multiobjective strategies for New Product Development in the pharmaceutical industry

New Product Development (NPD) constitutes a challenging problem in the pharmaceutical industry, due to the characteristics of the development pipeline. Formally, the NPD problem can be stated as follows: select a set of R&D projects from a pool of candidate projects in order to satisfy several criteria (economic profitability, time to market) while coping with the uncertain nature of the projects. More precisely, the recurrent key issues are to determine the projects to develop once target molecules have been identified, their order and the level of resources to assign. In this context, the proposed approach combines discrete event stochastic simulation (Monte Carlo approach) with multiobjective genetic algorithms (NSGAII type, Non-Sorted Genetic Algorithm II) to optimize the highly combinatorial portfolio management problem. In that context, Genetic Algorithms (GAs) are particularly attractive for treating this kind of problem, due to their ability to directly lead to the so-called Pareto front and to account for the combinatorial aspect. This work is illustrated with a study case involving nine interdependent new product candidates targeting three diseases. An analysis is performed for this test bench on the different pairs of criteria both for the bi- and tricriteria optimization: large portfolios cause resource queues and delays time to launch and are eliminated by the bi- and tricriteria optimization strategy. The optimization strategy is thus interesting to detect the sequence candidates. Time is an important criterion to consider simultaneously with NPV and risk criteria. The order in which drugs are released in the pipeline is of great importance as with scheduling problems

A MULTI-COMMODITY NETWORK FLOW APPROACH FOR SEQUENCING REFINED PRODUCTS IN PIPELINE SYSTEMS

In the oil industry, there is a special class of pipelines used for the transportation of refined products. The problem of sequencing the inputs to be pumped through this type of pipeline seeks to generate the optimal sequence of batches of products and their destination as well as the amount of product to be pumped such that the total operational cost of the system, or another operational objective, is optimized while satisfying the product demands according to the requirements set by the customers. This dissertation introduces a new modeling approach and proposes a solution methodology for this problem capable of dealing with the topology of all the scenarios reported in the literature so far. The system representation is based on a 1-0 multi commodity network flow formulation that models the dynamics of the system, including aspects such as conservation of product flow constraints at the depots, travel time of products from the refinery to their depot destination and what happens upstream and downstream the line whenever a product is being received at a given depot while another one is being injected into the line at the refinery. It is assumed that the products are already available at the refinery and their demand at each depot is deterministic and known beforehand. The model provides the sequence, the amounts, the destination and the trazability of the shipped batches of different products from their sources to their destinations during the entire horizon planning period while seeking the optimization of pumping and inventory holding costs satisfying the time window constraints. A survey for the available literature is presented. Given the problem structure, a decomposition based solution procedure is explored with the intention of exploiting the network structure using the network simplex method. A branch and bound algorithm that exploits the dynamics of the system assigning priorities for branching to a selected set of variables is proposed and its computational results for the solution, obtained via GAMS/CPLEX, of the formulation for random instances of the problem of different sizes are presented. Future research directions on this field are proposed

Improving the mathematical formulation for the detailed scheduling of refined products pipelines by accounting for flow rate dependent pumping costs

This work presents a continuous-time mixed-integer linear programming (MILP) formulation to find the best detailed schedule for single-source multi-product pipelines, minimizing the total operating costs. By knowing the aggregate plan including pumping and delivery tasks, the best detailed solution tends to minimize pump stoppage/restart costs as well as pumping energy charges associated to the head loss inside the pipeline, which are strongly dependent on the flow rate at every pipeline segment. Pumping costs for transporting products into the pipeline are estimated by introducing a novel piecewise linear calculation of the energy loss. The proposed approach is applied to find the optimal detailed schedule for a real-world case study consisting of a single source pipeline with multiple offtake stations. Important reductions in the operational costs with regards to previous contributions are obtained.Fil: Cafaro, Vanina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Santa Fe. Instituto de Desarrollo Tecnológico Para la Industria Química (i); ArgentinaFil: Cafaro, Diego Carlos. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Santa Fe. Instituto de Desarrollo Tecnológico Para la Industria Química (i); ArgentinaFil: Cerda, Jaime. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Santa Fe. Instituto de Desarrollo Tecnológico Para la Industria Química (i); Argentin

Improving the mathematical formulation for the detailed scheduling of refined products pipelines by acconting for flow rate dependent pumping costs

This work presents a continuous-time mixed-integer linear programming (MILP) formulation to find the best detailed schedule for single-source multi-product pipelines, minimizing the total operating costs. By knowing the aggregate plan including pumping and delivery tasks, the best detailed solution tends to minimize pump stoppage/restart costs as well as pumping energy charges associated to the head loss inside the pipeline, which are strongly dependent on the flow rate at every pipeline segment. Pumping costs for transporting products into the pipeline are estimated by introducing a novel piecewise linear calculation of the energy loss. The proposed approach is applied to find the optimal detailed schedule for a real-world case study consisting of a single source pipeline with multiple offtake stations. Important reductions in the operational costs with regards to previous contributions are obtained.Sociedad Argentina de Informática e Investigación Operativ