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

DOI10.1016/J.EJOR.2014.08.033zbMath1339.90135OpenAlexW1996118534MaRDI QIDQ2629691

Bissan Ghaddar, Akihiro Kishimoto, Joe Naoum-Sawaya, Nicole Taheri, Bradley J. Eck

Publication date: 6 July 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2014.08.033

zbMATH Keywords

integer programmingLagrangian relaxationlarge scale optimizationpump scheduling

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)

Related Items (11)

Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound ⋮ Mathematical programming techniques in water network optimization ⋮ Simulation-optimization approaches for water pump scheduling and pipe replacement problems ⋮ A mixed integer programming model and solution method for the operation of an integrated water supply system ⋮ A polynomial-time algorithm with tight error bounds for single-period unit commitment problem ⋮ Role of specific energy in decomposition of time-invariant least-cost reservoir filling problem ⋮ A stabilised scenario decomposition algorithm applied to stochastic unit commitment problems ⋮ Polynomial optimization for water networks: global solutions for the valve setting problem ⋮ Optimal control of water distribution networks without storage ⋮ Optimizing drinking water distribution system operations ⋮ Resilient layout, design and operation of energy-efficient water distribution networks for high-rise buildings using MINLP

Uses Software

• AMPL
• Bonmin
• Ipopt
• EPANET

Cites Work

• Unnamed Item
• A closed-loop location-inventory problem with spare parts consideration
• On the optimal design of water distribution networks: a practical MINLP approach
• An algorithmic framework for convex mixed integer nonlinear programs
• A Lagrangian relaxation approach to large-scale flow interception problems
• Optimized pump scheduling in water distribution systems
• Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
• A global optimization approach to a water distribution network design problem
• Effective relaxations and partitioning schemes for solving water distribution network design problems to global optimality
• Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs
• Towards globally optimal operation of water supply networks
• A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints
• A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts
• Lagrangian Relaxation for Integer Programming
• Derivation of near-optimal pump schedules for water distribution by simulated annealing

This page was built for publication: A Lagrangian decomposition approach for the pump scheduling problem in water networks