IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v140y2005i1p339-37310.1007-s10479-005-3976-2.html
   My bibliography  Save this article

Solving Planning and Design Problems in the Process Industry Using Mixed Integer and Global Optimization

Author

Listed:
  • Josef Kallrath

Abstract

This contribution gives an overview on the state-of-the-art and recent advances in mixed integer optimization to solve planning and design problems in the process industry. In some case studies specific aspects are stressed and the typical difficulties of real world problems are addressed. Mixed integer linear optimization is widely used to solve supply chain planning problems. Some of the complicating features such as origin tracing and shelf life constraints are discussed in more detail. If properly done the planning models can also be used to do product and customer portfolio analysis. We also stress the importance of multi-criteria optimization and correct modeling for optimization under uncertainty. Stochastic programming for continuous LP problems is now part of most optimization packages, and there is encouraging progress in the field of stochastic MILP and robust MILP. Process and network design problems often lead to nonconvex mixed integer nonlinear programming models. If the time to compute the solution is not bounded, there are already a commercial solvers available which can compute the global optima of such problems within hours. If time is more restricted, then tailored solution techniques are required. Copyright Springer Science + Business Media, Inc. 2005

Suggested Citation

  • Josef Kallrath, 2005. "Solving Planning and Design Problems in the Process Industry Using Mixed Integer and Global Optimization," Annals of Operations Research, Springer, vol. 140(1), pages 339-373, November.
    • Handle: RePEc:spr:annopr:v:140:y:2005:i:1:p:339-373:10.1007/s10479-005-3976-2
    DOI: 10.1007/s10479-005-3976-2
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-005-3976-2
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-005-3976-2?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. C Lucas & S A MirHassani & G Mitra & C A Poojari, 2001. "An application of Lagrangian relaxation to a capacity planning problem under uncertainty," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(11), pages 1256-1266, November.
    2. Timpe, Christian H. & Kallrath, Josef, 2000. "Optimal planning in large multi-site production networks," European Journal of Operational Research, Elsevier, vol. 126(2), pages 422-435, October.
    3. Young M. Lee & E. Jack Chen, 2002. "BASF Uses a Framework for Developing Web-Based Production-Planning-Optimization Tools," Interfaces, INFORMS, vol. 32(6), pages 15-24, December.
    4. Alonso, Antonio & Escudero, Laureano F. & Teresa Ortuno, M., 2000. "A stochastic 0-1 program based approach for the air traffic flow management problem," European Journal of Operational Research, Elsevier, vol. 120(1), pages 47-62, January.
    5. Stein W. Wallace, 2000. "Decision Making Under Uncertainty: Is Sensitivity Analysis of Any Use?," Operations Research, INFORMS, vol. 48(1), pages 20-25, February.
    6. John R. Birge, 1997. "State-of-the-Art-Survey---Stochastic Programming: Computation and Applications," INFORMS Journal on Computing, INFORMS, vol. 9(2), pages 111-133, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Steffen Rebennack & Josef Kallrath, 2012. "Continuous Piecewise Linear δ-Approximations for MINLP Problems. II. Bivariate and Multivariate Functions," Working Papers 2012-13, Colorado School of Mines, Division of Economics and Business.
    2. Steffen Rebennack & Josef Kallrath, 2015. "Continuous Piecewise Linear Delta-Approximations for Bivariate and Multivariate Functions," Journal of Optimization Theory and Applications, Springer, vol. 167(1), pages 102-117, October.
    3. Akshay Gupte & Shabbir Ahmed & Santanu S. Dey & Myun Seok Cheon, 2017. "Relaxations and discretizations for the pooling problem," Journal of Global Optimization, Springer, vol. 67(3), pages 631-669, March.
    4. Wang, X. & Li, D. & O'brien, C. & Li, Y., 2010. "A production planning model to reduce risk and improve operations management," International Journal of Production Economics, Elsevier, vol. 124(2), pages 463-474, April.
    5. Minner, Stefan, 2009. "A comparison of simple heuristics for multi-product dynamic demand lot-sizing with limited warehouse capacity," International Journal of Production Economics, Elsevier, vol. 118(1), pages 305-310, March.
    6. Waldemarsson, Martin & Lidestam, Helene & Karlsson, Magnus, 2017. "How energy price changes can affect production- and supply chain planning – A case study at a pulp company," Applied Energy, Elsevier, vol. 203(C), pages 333-347.
    7. Timo Berthold & Jakob Witzig, 2021. "Conflict Analysis for MINLP," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 421-435, May.
    8. Flapper, Simme Douwe P. & González-Velarde, José Luis & Smith, Neale R. & Escobar-Saldívar, Luis Jacob, 2010. "On the optimal product assortment: Comparing product and customer based strategies," International Journal of Production Economics, Elsevier, vol. 125(1), pages 167-172, May.
    9. Dag Haugland & Eligius M. T. Hendrix, 2016. "Pooling Problems with Polynomial-Time Algorithms," Journal of Optimization Theory and Applications, Springer, vol. 170(2), pages 591-615, August.
    10. Dirk Briskorn & Philipp Zeise, 2019. "A cyclic production scheme for the synchronized and integrated two-level lot-sizing and scheduling problem with no-wait restrictions and stochastic demand," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(4), pages 895-942, December.
    11. Reza Roozbahani & Babak Abbasi & Sergei Schreider & Zahra Hosseinifard, 2020. "A basin-wide approach for water allocation and dams location-allocation," Annals of Operations Research, Springer, vol. 287(1), pages 323-349, April.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. João Flávio de Freitas Almeida & Samuel Vieira Conceição & Luiz Ricardo Pinto & Ricardo Saraiva de Camargo & Gilberto de Miranda Júnior, 2018. "Flexibility evaluation of multiechelon supply chains," PLOS ONE, Public Library of Science, vol. 13(3), pages 1-27, March.
    2. Onur Tavaslıoğlu & Oleg A. Prokopyev & Andrew J. Schaefer, 2019. "Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function," Operations Research, INFORMS, vol. 67(6), pages 1659-1677, November.
    3. Rastogi, Aditya P. & Fowler, John W. & Matthew Carlyle, W. & Araz, Ozgur M. & Maltz, Arnold & Büke, Burak, 2011. "Supply network capacity planning for semiconductor manufacturing with uncertain demand and correlation in demand considerations," International Journal of Production Economics, Elsevier, vol. 134(2), pages 322-332, December.
    4. Becker, Tristan & Lier, Stefan & Werners, Brigitte, 2019. "Value of modular production concepts in future chemical industry production networks," European Journal of Operational Research, Elsevier, vol. 276(3), pages 957-970.
    5. Baker, Erin & Bosetti, Valentina & Salo, Ahti, 2016. "Finding Common Ground when Experts Disagree: Belief Dominance over Portfolios of Alternatives," MITP: Mitigation, Innovation and Transformation Pathways 243147, Fondazione Eni Enrico Mattei (FEEM).
    6. Lars M. Hvattum & Arne Løkketangen & Gilbert Laporte, 2006. "Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic," Transportation Science, INFORMS, vol. 40(4), pages 421-438, November.
    7. Borgonovo, E., 2010. "Sensitivity analysis with finite changes: An application to modified EOQ models," European Journal of Operational Research, Elsevier, vol. 200(1), pages 127-138, January.
    8. Andreatta, Giovanni & Dell'Olmo, Paolo & Lulli, Guglielmo, 2011. "An aggregate stochastic programming model for air traffic flow management," European Journal of Operational Research, Elsevier, vol. 215(3), pages 697-704, December.
    9. Jonathan D Linton & Julian Scott Yeomans & Reena Yoogalingam, 2002. "Policy Planning Using Genetic Algorithms Combined with Simulation: The Case of Municipal Solid Waste," Environment and Planning B, , vol. 29(5), pages 757-778, October.
    10. van Riessen, B. & Negenborn, R.R. & Dekker, R., 2016. "Real-time Container Transport Planning with Decision Trees based on Offline Obtained Optimal Solutions," Econometric Institute Research Papers EI2016-14, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    11. Thapalia, Biju K. & Crainic, Teodor Gabriel & Kaut, Michal & Wallace, Stein W., 2012. "Single-commodity network design with random edge capacities," European Journal of Operational Research, Elsevier, vol. 220(2), pages 394-403.
    12. Aikaterini Papapostolou & Charikleia Karakosta & Kalliopi-Anastasia Kourti & Haris Doukas & John Psarras, 2019. "Supporting Europe’s Energy Policy Towards a Decarbonised Energy System: A Comparative Assessment," Sustainability, MDPI, vol. 11(15), pages 1-26, July.
    13. Steffen Rebennack & Josef Kallrath, 2015. "Continuous Piecewise Linear Delta-Approximations for Bivariate and Multivariate Functions," Journal of Optimization Theory and Applications, Springer, vol. 167(1), pages 102-117, October.
    14. Eric Larsen & Sébastien Lachapelle & Yoshua Bengio & Emma Frejinger & Simon Lacoste-Julien & Andrea Lodi, 2022. "Predicting Tactical Solutions to Operational Planning Problems Under Imperfect Information," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 227-242, January.
    15. Tsai, Kune-muh & Wang, Shan-chi, 2009. "Multi-site available-to-promise modeling for assemble-to-order manufacturing: An illustration on TFT-LCD manufacturing," International Journal of Production Economics, Elsevier, vol. 117(1), pages 174-184, January.
    16. Bastian, Nathaniel D. & Lunday, Brian J. & Fisher, Christopher B. & Hall, Andrew O., 2020. "Models and methods for workforce planning under uncertainty: Optimizing U.S. Army cyber branch readiness and manning," Omega, Elsevier, vol. 92(C).
    17. Kristin Uggen & Marte Fodstad & Vibeke Nørstebø, 2013. "Using and extending fix-and-relax to solve maritime inventory routing problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(2), pages 355-377, July.
    18. Nasreddine Saadouli, 2021. "Stochastic programming model for production planning with stochastic aggregate demand and spreadsheet-based solution heuristics," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 31(4), pages 117-127.
    19. Murwan Siddig & Yongjia Song, 2022. "Adaptive partition-based SDDP algorithms for multistage stochastic linear programming with fixed recourse," Computational Optimization and Applications, Springer, vol. 81(1), pages 201-250, January.
    20. Šárka Štádlerová & Sanjay Dominik Jena & Peter Schütz, 2023. "Using Lagrangian relaxation to locate hydrogen production facilities under uncertain demand: a case study from Norway," Computational Management Science, Springer, vol. 20(1), pages 1-32, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:140:y:2005:i:1:p:339-373:10.1007/s10479-005-3976-2. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.