Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound
From MaRDI portal
Publication:2129196
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Mixed integer programming (90C11)
Recommendations
- Optimized pump scheduling in water distribution systems
- Towards globally optimal operation of water supply networks
- Derivation of near-optimal pump schedules for water distribution by simulated annealing
- Nonlinear programming techniques for operative planning in large drinking water networks
- Optimization of pumping energy and maintenance costs in water supply systems
Cites work
- scientific article; zbMATH DE number 2084694 (Why is no real title available?)
- A Lagrangian decomposition approach for the pump scheduling problem in water networks
- An algorithmic framework for convex mixed integer nonlinear programs
- An exact algorithmic framework for a class of mixed-integer programs with equilibrium constraints
- Canonical Cuts on the Unit Hypercube
- Convex reformulations for solving a nonlinear network design problem
- Derivation of near-optimal pump schedules for water distribution by simulated annealing
- Global optimization of nonlinear network design
- Mathematical programming techniques in water network optimization
- Mixed integer linear models for the optimization of dynamical transport networks
- Mixed integer nonlinear programming tools: an updated practical overview
- Mixed integer optimization of water supply networks
- Mixed-integer nonlinear optimization
- Nonlinear programming techniques for operative planning in large drinking water networks
- On interval-subgradient and no-good cuts
- On the optimal design of water distribution networks: a practical MINLP approach
- Optimization models for operative planning in drinking water networks
- Penalty and relaxation methods for the optimal placement and operation of control valves in water supply networks
- Pyomo -- optimization modeling in Python
- Simulation-optimization approaches for water pump scheduling and pipe replacement problems
- Sufficient pruning conditions for MINLP in gas network design
- Three enhancements for optimization-based bound tightening
- Towards globally optimal operation of water supply networks
Cited in
(9)- Derivation of near-optimal pump schedules for water distribution by simulated annealing
- Polyhedral relaxations for optimal pump scheduling of potable water distribution networks
- Optimization of pumping energy and maintenance costs in water supply systems
- Simulation-optimization approaches for water pump scheduling and pipe replacement problems
- A continuous approach to combinatorial optimization: application of water system pump operations
- Continuous and discrete operation of water distribution networks
- Optimizing drinking water distribution system operations
- Optimized pump scheduling in water distribution systems
- A Lagrangian decomposition approach for the pump scheduling problem in water networks
This page was built for publication: Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2129196)
