A Lagrangian decomposition approach for the pump scheduling problem in water networks

Dynamic pricing has become a common form of electricity tariff, where the price of electricity varies in real time based on the realized electricity supply and demand. Hence, optimizing industrial operations to benefit from periods with low electricity prices is vital to maximizing the benefits of d...

Descripción completa

Detalles Bibliográficos
Autores: Ghaddar, Bissan, Naoum-Sawaya, Joe, Kishimoto, Akihiro, Taheri, Nicole, Eck, Bradley
Tipo de recurso: artículo
Fecha de publicación:2015
País:España
Institución:IE
Repositorio:Repositorio IE
OAI Identifier:oai:repositorio.ie.edu:20.500.14417/4116
Acceso en línea:https://doi.org/10.1016/j.ejor.2014.08.033
https://hdl.handle.net/20.500.14417/4116
https://www.sciencedirect.com/science/article/abs/pii/S0377221714007103
Access Level:acceso abierto
Palabra clave:33 Ciencias Tecnológicas::3307 Tecnología electrónica
ODS 9 - Industria, innovación e infraestructura
id ES_e905b48ffd286bffe2222a925c28bf20
oai_identifier_str oai:repositorio.ie.edu:20.500.14417/4116
network_acronym_str ES
network_name_str España
repository_id_str
spelling A Lagrangian decomposition approach for the pump scheduling problem in water networksGhaddar, BissanNaoum-Sawaya, JoeKishimoto, AkihiroTaheri, NicoleEck, Bradley33 Ciencias Tecnológicas::3307 Tecnología electrónicaODS 9 - Industria, innovación e infraestructuraDynamic pricing has become a common form of electricity tariff, where the price of electricity varies in real time based on the realized electricity supply and demand. Hence, optimizing industrial operations to benefit from periods with low electricity prices is vital to maximizing the benefits of dynamic pricing. In the case of water networks, energy consumed by pumping is a substantial cost for water utilities, and optimizing pump schedules to accommodate for the changing price of energy while ensuring a continuous supply of water is essential. In this paper, a Mixed-Integer Non-linear Programming (MINLP) formulation of the optimal pump scheduling problem is presented. Due to the non-linearities, the typical size of water networks, and the discretization of the planning horizon, the problem is not solvable within reasonable time using standard optimization software. We present a Lagrangian decomposition approach that exploits the structure of the problem leading to smaller problems that are solved independently. The Lagrangian decomposition is coupled with a simulation-based, improved limited discrepancy search algorithm that is capable of finding high quality feasible solutions. The proposed approach finds solutions with guaranteed upper and lower bounds. These solutions are compared to those found by a mixed-integer linear programming approach, which uses a piecewise-linearization of the non-linear constraints to find a global optimal solution of the relaxation. Numerical testing is conducted on two real water networks and the results illustrate the significant costs savings due to optimizing pump schedules.YesPublishedElsevierhttps://ror.org/02jjdwm7520262015info:eu-repo/semantics/articleapplication/pdfapplication/pdfhttps://doi.org/10.1016/j.ejor.2014.08.033https://hdl.handle.net/20.500.14417/4116https://www.sciencedirect.com/science/article/abs/pii/S0377221714007103reponame:Repositorio IEinstname:IEInglésIE School of Science & TechnologyIE UniversityAttribution-NonCommercial-NoDerivatives 4.0 Internationalhttp://creativecommons.org/licenses/by-nc-nd/4.0/info:eu-repo/semantics/openAccessoai:repositorio.ie.edu:20.500.14417/41162026-06-15T12:40:57Z
dc.title.none.fl_str_mv A Lagrangian decomposition approach for the pump scheduling problem in water networks
title A Lagrangian decomposition approach for the pump scheduling problem in water networks
spellingShingle A Lagrangian decomposition approach for the pump scheduling problem in water networks
Ghaddar, Bissan
33 Ciencias Tecnológicas::3307 Tecnología electrónica
ODS 9 - Industria, innovación e infraestructura
title_short A Lagrangian decomposition approach for the pump scheduling problem in water networks
title_full A Lagrangian decomposition approach for the pump scheduling problem in water networks
title_fullStr A Lagrangian decomposition approach for the pump scheduling problem in water networks
title_full_unstemmed A Lagrangian decomposition approach for the pump scheduling problem in water networks
title_sort A Lagrangian decomposition approach for the pump scheduling problem in water networks
dc.creator.none.fl_str_mv Ghaddar, Bissan
Naoum-Sawaya, Joe
Kishimoto, Akihiro
Taheri, Nicole
Eck, Bradley
author Ghaddar, Bissan
author_facet Ghaddar, Bissan
Naoum-Sawaya, Joe
Kishimoto, Akihiro
Taheri, Nicole
Eck, Bradley
author_role author
author2 Naoum-Sawaya, Joe
Kishimoto, Akihiro
Taheri, Nicole
Eck, Bradley
author2_role author
author
author
author
dc.contributor.none.fl_str_mv https://ror.org/02jjdwm75
dc.subject.none.fl_str_mv 33 Ciencias Tecnológicas::3307 Tecnología electrónica
ODS 9 - Industria, innovación e infraestructura
topic 33 Ciencias Tecnológicas::3307 Tecnología electrónica
ODS 9 - Industria, innovación e infraestructura
description Dynamic pricing has become a common form of electricity tariff, where the price of electricity varies in real time based on the realized electricity supply and demand. Hence, optimizing industrial operations to benefit from periods with low electricity prices is vital to maximizing the benefits of dynamic pricing. In the case of water networks, energy consumed by pumping is a substantial cost for water utilities, and optimizing pump schedules to accommodate for the changing price of energy while ensuring a continuous supply of water is essential. In this paper, a Mixed-Integer Non-linear Programming (MINLP) formulation of the optimal pump scheduling problem is presented. Due to the non-linearities, the typical size of water networks, and the discretization of the planning horizon, the problem is not solvable within reasonable time using standard optimization software. We present a Lagrangian decomposition approach that exploits the structure of the problem leading to smaller problems that are solved independently. The Lagrangian decomposition is coupled with a simulation-based, improved limited discrepancy search algorithm that is capable of finding high quality feasible solutions. The proposed approach finds solutions with guaranteed upper and lower bounds. These solutions are compared to those found by a mixed-integer linear programming approach, which uses a piecewise-linearization of the non-linear constraints to find a global optimal solution of the relaxation. Numerical testing is conducted on two real water networks and the results illustrate the significant costs savings due to optimizing pump schedules.
publishDate 2015
dc.date.none.fl_str_mv 2015
2026
dc.type.none.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://doi.org/10.1016/j.ejor.2014.08.033
https://hdl.handle.net/20.500.14417/4116
https://www.sciencedirect.com/science/article/abs/pii/S0377221714007103
url https://doi.org/10.1016/j.ejor.2014.08.033
https://hdl.handle.net/20.500.14417/4116
https://www.sciencedirect.com/science/article/abs/pii/S0377221714007103
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv IE School of Science & Technology
IE University
dc.rights.none.fl_str_mv Attribution-NonCommercial-NoDerivatives 4.0 International
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
rights_invalid_str_mv Attribution-NonCommercial-NoDerivatives 4.0 International
http://creativecommons.org/licenses/by-nc-nd/4.0/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:Repositorio IE
instname:IE
instname_str IE
reponame_str Repositorio IE
collection Repositorio IE
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869422992083124224
score 15,812429

Similares en LA Referencia