IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v89y2024i2d10.1007_s10898-023-01363-z.html
   My bibliography  Save this article

A strong P-formulation for global optimization of industrial water-using and treatment networks

Author

Listed:
  • Xin Cheng

    (Queen’s University)

  • Xiang Li

    (Queen’s University
    Zhejiang University)

Abstract

The problem of finding the optimal flow allocation within an industrial water-using and treatment network can be formulated into nonconvex nonlinear program or nonconvex mixed-integer nonlinear program. The efficiency of global optimization of the nonconvex program relies heavily on the strength of the problem formulation. In this paper, we propose a variant of the commonly used P-formulation, called the P $$^*$$ ∗ -formulation, for the water treatment network (WTN) and the total water network (TWN) that includes water-using and water treatment units. For either type of networks, we prove that the P $$^*$$ ∗ -formulation is at least as strong as the P-formulation under mild bound consistency conditions. We also prove for either type of networks that the P $$^*$$ ∗ -formulation is at least as strong as the split-fraction based formulation (called SF-formulation) under certain bound consistency conditions. The computational study shows that the P $$^*$$ ∗ -formulation significantly outperforms the P- and the SF-formulations. For some problem instances, the P $$^*$$ ∗ -formulation is faster than the other two formulations by several orders of magnitudes.

Suggested Citation

  • Xin Cheng & Xiang Li, 2024. "A strong P-formulation for global optimization of industrial water-using and treatment networks," Journal of Global Optimization, Springer, vol. 89(2), pages 477-507, June.
  • Handle: RePEc:spr:jglopt:v:89:y:2024:i:2:d:10.1007_s10898-023-01363-z
    DOI: 10.1007/s10898-023-01363-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-023-01363-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10898-023-01363-z?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. Charles Audet & Jack Brimberg & Pierre Hansen & Sébastien Le Digabel & Nenad Mladenovi'{c}, 2004. "Pooling Problem: Alternate Formulations and Solution Methods," Management Science, INFORMS, vol. 50(6), pages 761-776, June.
    2. Castro, Pedro M. & Matos, Henrique A. & Novais, Augusto Q., 2007. "An efficient heuristic procedure for the optimal design of wastewater treatment systems," Resources, Conservation & Recycling, Elsevier, vol. 50(2), pages 158-185.
    Full references (including those not matched with items on IDEAS)

    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. Mohammed Alfaki & Dag Haugland, 2013. "Strong formulations for the pooling problem," Journal of Global Optimization, Springer, vol. 56(3), pages 897-916, July.
    2. Guajardo, Mario & Kylinger, Martin & Rönnqvist, Mikael, 2013. "Speciality oils supply chain optimization: From a decoupled to an integrated planning approach," European Journal of Operational Research, Elsevier, vol. 229(2), pages 540-551.
    3. Nats Esquejo & Kevin Miller & Kevin Norwood & Ivan Oliveira & Rob Pratt & Ming Zhao, 2015. "Statistical and Optimization Techniques for Laundry Portfolio Optimization at Procter & Gamble," Interfaces, INFORMS, vol. 45(5), pages 444-461, October.
    4. Gaurav Singh & Rodolfo García-Flores & Andreas Ernst & Palitha Welgama & Meimei Zhang & Kerry Munday, 2014. "Medium-Term Rail Scheduling for an Iron Ore Mining Company," Interfaces, INFORMS, vol. 44(2), pages 222-240, April.
    5. Benhamou, Latifa & Giard, Vincent & Khouloud, Mehdi & Fenies, Pierres & Fontane, Frédéric, 2020. "Reverse Blending: An economically efficient approach to the challenge of fertilizer mass customization," International Journal of Production Economics, Elsevier, vol. 226(C).
    6. Mohammed Alfaki & Dag Haugland, 2013. "A multi-commodity flow formulation for the generalized pooling problem," Journal of Global Optimization, Springer, vol. 56(3), pages 917-937, July.
    7. Pierre Hansen & Nenad Mladenović & José Moreno Pérez, 2010. "Variable neighbourhood search: methods and applications," Annals of Operations Research, Springer, vol. 175(1), pages 367-407, March.
    8. Haonan, Zhou & Samavati, Mehran & Hill, Andrew J., 2021. "Heuristics for integrated blending optimisation in a mining supply chain," Omega, Elsevier, vol. 102(C).
    9. Natashia Boland & Thomas Kalinowski & Fabian Rigterink, 2017. "A polynomially solvable case of the pooling problem," Journal of Global Optimization, Springer, vol. 67(3), pages 621-630, March.
    10. Fischetti, Matteo & Monaci, Michele, 2020. "A branch-and-cut algorithm for Mixed-Integer Bilinear Programming," European Journal of Operational Research, Elsevier, vol. 282(2), pages 506-514.
    11. Boukouvala, Fani & Misener, Ruth & Floudas, Christodoulos A., 2016. "Global optimization advances in Mixed-Integer Nonlinear Programming, MINLP, and Constrained Derivative-Free Optimization, CDFO," European Journal of Operational Research, Elsevier, vol. 252(3), pages 701-727.
    12. Radu Baltean-Lugojan & Ruth Misener, 2018. "Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness," Journal of Global Optimization, Springer, vol. 71(4), pages 655-690, August.
    13. Pierre Hansen & Nenad Mladenović & Raca Todosijević & Saïd Hanafi, 2017. "Variable neighborhood search: basics and variants," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(3), pages 423-454, September.
    14. Michelle L. Blom & Christina N. Burt & Adrian R. Pearce & Peter J. Stuckey, 2014. "A Decomposition-Based Heuristic for Collaborative Scheduling in a Network of Open-Pit Mines," INFORMS Journal on Computing, INFORMS, vol. 26(4), pages 658-676, November.
    15. Leo Liberti, 2015. "Optimization and sustainable development," Computational Management Science, Springer, vol. 12(3), pages 371-395, July.
    16. Kazda, Kody & Li, Xiang, 2024. "A linear programming approach to difference-of-convex piecewise linear approximation," European Journal of Operational Research, Elsevier, vol. 312(2), pages 493-511.
    17. Lars Hellemo & Asgeir Tomasgard, 2016. "A generalized global optimization formulation of the pooling problem with processing facilities and composite quality constraints," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 24(2), pages 409-444, July.
    18. Mohammed Alfaki & Dag Haugland, 2014. "A cost minimization heuristic for the pooling problem," Annals of Operations Research, Springer, vol. 222(1), pages 73-87, November.
    19. Perron, Sylvain & Hansen, Pierre & Le Digabel, Sébastien & Mladenovic, Nenad, 2010. "Exact and heuristic solutions of the global supply chain problem with transfer pricing," European Journal of Operational Research, Elsevier, vol. 202(3), pages 864-879, May.
    20. James C. Spall, 2012. "Cyclic Seesaw Process for Optimization and Identification," Journal of Optimization Theory and Applications, Springer, vol. 154(1), pages 187-208, July.

    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:jglopt:v:89:y:2024:i:2:d:10.1007_s10898-023-01363-z. 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.