12 research outputs found

    Optimisation approaches for supply chain planning and scheduling under demand uncertainty

    Get PDF
    This work presents efficient MILP-based approaches for the planning and scheduling of multiproduct multistage continuous plants with sequence-dependent changeovers in a supply chain network under demand uncertainty and price elasticity of demand. This problem considers multiproduct plants, where several products must be produced and delivered to supply the distribution centres (DCs), while DCs are in charge of storing and delivering these products to the final markets to be sold. A hybrid discrete/continuous model is proposed for this problem by using the ideas of the Travelling Salesman Problem (TSP) and global precedence representation. In order to deal with the uncertainty, we proposed a Hierarchical Model Predictive Control (HMPC) approach for this particular problem. Despite of its efficiency, the final solution reported still could be far from the global optimum. Due to this, Local Search (LS) algorithms are developed to improve the solution of HMPC by rescheduling successive products in the current schedule. The effectiveness of the proposed solution techniques is demonstrated by solving a large-scale instance and comparing the solution with the original MPC and a classic Cutting Plane approach adapted for this work

    Global optimisation of large-scale quadratic programs: application to short-term planning of industrial refinery-petrochemical complexes

    Get PDF
    This thesis is driven by an industrial problem arising in the short-term planning of an integrated refinery-petrochemical complex (IRPC) in Colombia. The IRPC of interest is composed of 60 industrial plants and a tank farm for crude mixing and fuel blending consisting of 30 additional units. It considers both domestic and imported crude oil supply, as well as refined product imports such as low sulphur diesel and alkylate. This gives rise to a large-scale mixed-integer quadratically constrained quadratic program (MIQCQP) comprising about 7,000 equality constraints with over 35,000 bilinear terms and 280 binary variables describing operating modes for the process units. Four realistic planning scenarios are recreated to study the performance of the algorithms developed through the thesis and compare them to commercial solvers. Local solvers such as SBB and DICOPT cannot reliably solve such large-scale MIQCQPs. Usually, it is challenging to even reach a feasible solution with these solvers, and a heuristic procedure is required to initialize the search. On the other hand, global solvers such as ANTIGONE and BARON determine a feasible solution for all the scenarios analysed, but they are unable to close the relaxation gap to less than 40% on average after 10h of CPU runtime. Overall, this industrial-size problem is thus intractable to global optimality in a monolithic way. The first main contribution of the thesis is a deterministic global optimisation algorithm based on cluster decomposition (CL) that divides the network into groups of process units according to their functionality. The algorithm runs through the sequences of clusters and proceeds by alternating between: (i) the (global) solution of a mixed-integer linear program (MILP), obtained by relaxing the bilinear terms based on their piecewise McCormick envelopes and a dynamic partition of their variable ranges, in order to determine an upper bound on the maximal profit; and (ii) the local solution of a quadratically-constrained quadratic program (QCQP), after fixing the binary variables and initializing the continuous variables to the relaxed MILP solution point, in order to determine a feasible solution (lower bound on the maximal profit). Applied to the base case scenario, the CL approach reaches a best solution of 2.964 MMUSD/day and a relaxation gap of 7.5%, a remarkable result for such challenging MIQCQP problem. The CL approach also vastly outperforms both ANTIGONE (2.634 MMUSD/day, 32% optimality gap) and BARON (2.687 MMUSD/day, 40% optimality gap). The second main contribution is a spatial Lagrangean decomposition, which entails decomposing the IRPC short-term planning problem into a collection of smaller subproblems that can be solved independently to determine an upper bound on the maximal profit. One advantage of this strategy is that each sub-problem can be solved to global optimality, potentially providing good initial points for the monolithic problem itself. It furthermore creates a virtual market for trading crude blends and intermediate refined–petrochemical streams and seeks an optimal trade-off in such a market, with the Lagrange multipliers acting as transfer prices. A decomposition over two to four is considered, which matches the crude management, refinery, petrochemical operations, and fuel blending sections of the IRPC. An optimality gap below 4% is achieved in all four scenarios considered, which is a significant improvement over the cluster decomposition algorithm.Open Acces

    Enterprise-wide optimization for the fast moving consumer goods industry

    Get PDF

    Water Network Optimization with Wastewater Regeneration Models

    Get PDF
    The conventional water network synthesis approach greatly simplifies wastewater treatment units by using fixed recoveries, creating a gap for their applicability to industrial processes. This work describes a unifying approach combining various technologies capable of removing all the major types of contaminants through the use of more realistic models. The following improvements are made over the typical superstructure-based water network models. First, unit-specific shortcut models are developed in place of the fixed contaminant removal model to describe contaminant mass transfer in wastewater treatment units. Shortcut wastewater treatment cost functions are also incorporated into the model. In addition, uncertainty in mass load of contaminants is considered to account for the range of operating conditions. Furthermore, the superstructure is modified to accommodate realistic potential structures. We present a modified Lagrangean-based decomposition algorithm in order to solve the resulting nonconvex mixed-integer nonlinear programming (MINLP) problem efficiently. Several examples are presented to illustrate the effectiveness and limitations of the algorithm for obtaining the global optimal solutions.The authors would like to acknowledge financial support from the National Science Foundation for financial support under grant CBET-1437668, the program “Estancias de movilidad en el extranjero “Jose Castillejo” para jóvenes doctores” (JC2011-0051) of the Spanish Ministerio de Educación, and from the University of Alicante (GRE11-19)

    Lagrangean Relaxation of the Hull-Reformulation of Linear Generalized Disjunctive Programs and its use in Disjunctive Branch and Bound

    Get PDF
    Abstract In this work, we present a Lagrangean relaxation of the hull-reformulation of discrete-continuous optimization problems formulated as linear generalized disjunctive programs (GDP). The proposed Lagrangean relaxation has three important properties. The first property is that it can be applied to any linear GDP. The second property is that the solution to its continuous relaxation always yields 0-1 values for the binary variables of the hull-reformulation. Finally, it is simpler to solve than the continuous relaxation of the hull-reformulation. The proposed Lagrangean relaxation can be used in different GDP solution methods. In this work, we explore its use as primal heuristic to find feasible solutions in a disjunctive branch and bound algorithm. The modified disjunctive branch and bound is tested with several instances. The results show that the proposed disjunctive branch and bound performs better than other versions of the algorithm that do not include this primal heuristic

    A contribution to support decision making in energy/water sypply chain optimisation

    Get PDF
    The seeking of process sustainability forces enterprises to change their operations. Additionally, the industrial globalization implies a very dynamic market that, among other issues, promotes the enterprises competition. Therefore, the efficient control and use of their Key Performance Indicators, including profitability, cost reduction, demand satisfaction and environmental impact associated to the development of new products, is a significant challenge. All the above indicators can be efficiently controlled through the Supply Chain Management. Thus, companies work towards the optimization of their individual operations under competitive environments taking advantage of the flexibility provided by the virtually inexistent world market restrictions. This is achieved by the coordination of the resource flows, across all the entities and echelons belonging to the system network. Nevertheless, such coordination is significantly complicated if considering the presence of uncertainty and even more if seeking for a win-win outcome. The purpose of this thesis is extending the current decision making strategies to expedite these tasks in industrial processes. Such a contribution is based on the development of efficient mathematical models that allows coordinating large amount of information synchronizing the production and distribution tasks in terms of economic, environmental and social criteria. This thesis starts presents an overview of the requirements of sustainable production processes, describing and analyzing the current methods and tools used and identifying the most relevant open issues. All the above is always within the framework of Process System Engineering literature. The second part of this thesis is focused in stressing the current Multi-Objective solution strategies. During this part, first explores how the profitability of the Supply Chain can be enhanced by considering simultaneously multiple objectives under demand uncertainties. Particularly, solution frameworks have been proposed in which different multi-criteria decision making strategies have been combined with stochastic approaches. Furthermore, additional performance indicators (including financial and operational ones) have been included in the same solution framework to evaluate its capabilities. This framework was also applied to decentralized supply chains problems in order to explore its capabilities to produce solution that improves the performances of each one of the SC entities simultaneously. Consequently, a new generalized mathematical formulation which integrates many performance indicators in the production process within a supply chain is efficiently solved. Afterwards, the third part of the thesis extends the proposed solution framework to address the uncertainty management. Particularly, the consideration of different types and sources of uncertainty (e.g. external and internal ones) where considered, through the implementation of preventive approaches. This part also explores the use of solution strategies that efficiently selects the number of scenarios that represent the uncertainty conditions. Finally, the importance and effect of each uncertainty source over the process performance is detailed analyzed through the use of surrogate models that promote the sensitivity analysis of those uncertainties. The third part of this thesis is focused on the integration of the above multi-objective and uncertainty approaches for the optimization of a sustainable Supply Chain. Besides the integration of different solution approaches, this part also considers the integration of hierarchical decision levels, by the exploitation of mathematical models that assess the consequences of considering simultaneously design and planning decisions under centralized and decentralized Supply Chains. Finally, the last part of this thesis provides the final conclusions and further work to be developed.La globalización industrial genera un ambiente dinámico en los mercados que, entre otras cosas, promueve la competencia entre corporaciones. Por lo tanto, el uso eficiente de las los indicadores de rendimiento, incluyendo rentabilidad, satisfacción de la demanda y en general el impacto ambiental, representa un area de oportunidad importante. El control de estos indicadores tiene un efecto positivo si se combinan con la gestión de cadena de suministro. Por lo tanto, las compañías buscan definir sus operaciones para permanecer activas dentro de un ambiente competitivo, tomando en cuenta las restricciones en el mercado mundial. Lo anterior puede ser logrado mediante la coordinación de los flujos de recursos a través de todas las entidades y escalones pertenecientes a la red del sistema. Sin embargo, dicha coordinación se complica significativamente si se quiere considerar la presencia de incertidumbre, y aún más, si se busca exclusivamente un ganar-ganar. El propósito de esta tesis es extender el alcance de las estrategias de toma de decisiones con el fin de facilitar estas tareas dentro de procesos industriales. Estas contribuciones se basan en el desarrollo de modelos matemáticos eficientes que permitan coordinar grandes cantidades de información sincronizando las tareas de producción y distribución en términos económicos, ambientales y sociales. Esta tesis inicia presentando una visión global de los requerimientos de un proceso de producción sostenible, describiendo y analizando los métodos y herramientas actuales así como identificando las áreas de oportunidad más relevantes dentro del marco de ingeniería de procesos La segunda parte se enfoca en enfatizar las capacidades de las estrategias de solución multi-objetivo, durante la cual, se explora el mejoramiento de la rentabilidad de la cadena de suministro considerando múltiples objetivos bajo incertidumbres en la demanda. Particularmente, diferentes marcos de solución han sido propuestos en los que varias estrategias de toma de decisión multi-criterio han sido combinadas con aproximaciones estocásticas. Por otra parte, indicadores de rendimiento (incluyendo financiero y operacional) han sido incluidos en el mismo marco de solución para evaluar sus capacidades. Este marco fue aplicado también a problemas de cadenas de suministro descentralizados con el fin de explorar sus capacidades de producir soluciones que mejoran simultáneamente el rendimiento para cada uno de las entidades dentro de la cadena de suministro. Consecuentemente, una nueva formulación que integra varios indicadores de rendimiento en los procesos de producción fue propuesta y validada. La tercera parte de la tesis extiende el marco de solución propuesto para abordar el manejo de incertidumbres. Particularmente, la consideración de diferentes tipos y fuentes de incertidumbre (p.ej. externos e internos) fueron considerados, mediante la implementación de aproximaciones preventivas. Esta parte también explora el uso de estrategias de solución que elige eficientemente el número de escenarios necesario que representan las condiciones inciertas. Finalmente, la importancia y efecto de cada una de las fuentes de incertidumbre sobre el rendimiento del proceso es analizado en detalle mediante el uso de meta modelos que promueven el análisis de sensibilidad de dichas incertidumbres. La tercera parte de esta tesis se enfoca en la integración de las metodologías de multi-objetivo e incertidumbre anteriormente expuestas para la optimización de cadenas de suministro sostenibles. Además de la integración de diferentes métodos. Esta parte también considera la integración de diferentes niveles jerárquicos de decisión, mediante el aprovechamiento de modelos matemáticos que evalúan lasconsecuencias de considerar simultáneamente las decisiones de diseño y planeación de una cadena de suministro centralizada y descentralizada. La parte final de la tesis detalla las conclusiones y el trabajo a futuro necesario sobre esta línea de investigaciónPostprint (published version
    corecore