IDEAS home Printed from https://ideas.repec.org/a/eee/eneeco/v120y2023ics0140988322006090.html
   My bibliography  Save this article

Optimal design of exchange water networks with control inputs in Eco-Industrial Parks

Author

Listed:
  • Aussel, Didier
  • Cao Van, Kien
  • Salas, David

Abstract

Industrial water conservation is an important adaptation to preserve the environment. Eco-Industrial Parks (EIPs) have been designed to encourage the establishment of water exchange networks between enterprises in order to minimize freshwater consumption and wastewater discharge by maximizing wastewater reuse. In this paper, a mathematical programming model for designing and optimizing industrial water networks in EIPs is studied by formulating and solving Single-Leader–Multi-Follower (SLMF) game problems. Enterprises (followers) aim to minimize their operating costs by reusing wastewater from other enterprises, while the designer (leader) aims to minimize the consumption of natural resources within the ecopark. Moreover, when participating in the ecopark, enterprises can control all their input fluxes and the designer guarantees a minimal relative improvement in comparison with the stand-alone operation of each enterprise. The SLMF game is transformed into a single mixed-integer optimization problem. The obtained results are compared with the results of the blind-input model (Salas et al., 2020).

Suggested Citation

  • Aussel, Didier & Cao Van, Kien & Salas, David, 2023. "Optimal design of exchange water networks with control inputs in Eco-Industrial Parks," Energy Economics, Elsevier, vol. 120(C).
    • Handle: RePEc:eee:eneeco:v:120:y:2023:i:c:s0140988322006090
    DOI: 10.1016/j.eneco.2022.106480
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0140988322006090
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.eneco.2022.106480?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. Roger A McCain, 2010. "GAME THEORY:A Nontechnical Introduction to the Analysis of Strategy(Revised Edition)," World Scientific Books, World Scientific Publishing Co. Pte. Ltd., number 7517, February.
    2. Francisco Facchinei & Christian Kanzow, 2010. "Generalized Nash Equilibrium Problems," Annals of Operations Research, Springer, vol. 175(1), pages 177-211, March.
    3. Didier Aussel & Anton Svensson, 2019. "Towards Tractable Constraint Qualifications for Parametric Optimisation Problems and Applications to Generalised Nash Games," Journal of Optimization Theory and Applications, Springer, vol. 182(1), pages 404-416, July.
    4. Didier Aussel & Anton Svensson, 2020. "A Short State of the Art on Multi-Leader-Follower Games," Springer Optimization and Its Applications, in: Stephan Dempe & Alain Zemkoho (ed.), Bilevel Optimization, chapter 0, pages 53-76, Springer.
    5. Ider Tseveendorj, 2013. "Mathematical Programs with Equilibrium Constraints: A Brief Survey of Methods and Optimality Conditions," Springer Optimization and Its Applications, in: Altannar Chinchuluun & Panos M. Pardalos & Rentsen Enkhbat & E. N. Pistikopoulos (ed.), Optimization, Simulation, and Control, edition 127, pages 49-61, Springer.
    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. Elisabetta Allevi & Didier Aussel & Rossana Riccardi & Domenico Scopelliti, 2024. "Single-Leader-Radner-Equilibrium: A New Approach for a Class of Bilevel Problems Under Uncertainty," Journal of Optimization Theory and Applications, Springer, vol. 200(1), pages 344-370, January.

    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. Xi, Haoning & Aussel, Didier & Liu, Wei & Waller, S.Travis. & Rey, David, 2024. "Single-leader multi-follower games for the regulation of two-sided mobility-as-a-service markets," European Journal of Operational Research, Elsevier, vol. 317(3), pages 718-736.
    2. Oliver Stein & Nathan Sudermann-Merx, 2016. "The Cone Condition and Nonsmoothness in Linear Generalized Nash Games," Journal of Optimization Theory and Applications, Springer, vol. 170(2), pages 687-709, August.
    3. Tiago Roux Oliveira & Victor Hugo Pereira Rodrigues & Miroslav Krstić & Tamer Başar, 2021. "Nash Equilibrium Seeking in Quadratic Noncooperative Games Under Two Delayed Information-Sharing Schemes," Journal of Optimization Theory and Applications, Springer, vol. 191(2), pages 700-735, December.
    4. Nadja Harms & Tim Hoheisel & Christian Kanzow, 2015. "On a Smooth Dual Gap Function for a Class of Player Convex Generalized Nash Equilibrium Problems," Journal of Optimization Theory and Applications, Springer, vol. 166(2), pages 659-685, August.
    5. Lorenzo Lampariello & Simone Sagratella, 2015. "It is a matter of hierarchy: a Nash equilibrium problem perspective on bilevel programming," DIAG Technical Reports 2015-07, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
    6. Didier Aussel & Parin Chaipunya, 2024. "Variational and Quasi-Variational Inequalities Under Local Reproducibility: Solution Concept and Applications," Journal of Optimization Theory and Applications, Springer, vol. 203(2), pages 1531-1563, November.
    7. Alexey Izmailov & Mikhail Solodov, 2014. "On error bounds and Newton-type methods for generalized Nash equilibrium problems," Computational Optimization and Applications, Springer, vol. 59(1), pages 201-218, October.
    8. R. Cambini & R. Riccardi & D. Scopelliti, 2023. "Solving linear multiplicative programs via branch-and-bound: a computational experience," Computational Management Science, Springer, vol. 20(1), pages 1-32, December.
    9. Leonardo Galli & Christian Kanzow & Marco Sciandrone, 2018. "A nonmonotone trust-region method for generalized Nash equilibrium and related problems with strong convergence properties," Computational Optimization and Applications, Springer, vol. 69(3), pages 629-652, April.
    10. Nagurney, Anna, 2021. "Supply chain game theory network modeling under labor constraints: Applications to the Covid-19 pandemic," European Journal of Operational Research, Elsevier, vol. 293(3), pages 880-891.
    11. Otgochuluu, Ch. & Altangerel, L. & Battur, G. & Khashchuluun, Ch. & Dorjsundui, G., 2021. "A game theory application in the copper market," Resources Policy, Elsevier, vol. 70(C).
    12. Migot, Tangi & Cojocaru, Monica-G., 2020. "A parametrized variational inequality approach to track the solution set of a generalized nash equilibrium problem," European Journal of Operational Research, Elsevier, vol. 283(3), pages 1136-1147.
    13. Denizalp Goktas & Jiayi Zhao & Amy Greenwald, 2023. "T\^atonnement in Homothetic Fisher Markets," Papers 2306.04890, arXiv.org.
    14. Simone Sagratella, 2017. "Algorithms for generalized potential games with mixed-integer variables," Computational Optimization and Applications, Springer, vol. 68(3), pages 689-717, December.
    15. Kai (Kyle) Lin, 2014. "Applying Game Theory to Volleyball Strategy," International Journal of Performance Analysis in Sport, Taylor & Francis Journals, vol. 14(3), pages 761-774, December.
    16. Amir Gandomi & Amirhossein Bazargan & Saeed Zolfaghari, 2019. "Designing competitive loyalty programs: a stochastic game-theoretic model to guide the choice of reward structure," Annals of Operations Research, Springer, vol. 280(1), pages 267-298, September.
    17. Vladimir Shikhman, 2022. "On local uniqueness of normalized Nash equilibria," Papers 2205.13878, arXiv.org.
    18. Stein, Oliver & Sudermann-Merx, Nathan, 2018. "The noncooperative transportation problem and linear generalized Nash games," European Journal of Operational Research, Elsevier, vol. 266(2), pages 543-553.
    19. Shahrul Affendi Ishak & Rosseni Din & Nabilah Othman & Serge Gabarre & Umi Azmah Hasran, 2022. "Rethinking the Ideology of Using Digital Games to Increase Individual Interest in STEM," Sustainability, MDPI, vol. 14(8), pages 1-18, April.
    20. A. Izmailov & M. Solodov, 2015. "Rejoinder on: Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 23(1), pages 48-52, April.

    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:eee:eneeco:v:120:y:2023:i:c:s0140988322006090. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eneco .

    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.