Pressure management through pressure-reducing valves (PRVs) is among the most cost-effective leakage-control measures in water distribution networks, and the underlying placement problem is a nonconvex mixed-integer nonlinear programme. This paper revisits the classical 25-node benchmark of Sterling and Bargiela with two independent tools—a spatial branch-and-bound solver applied to the quadratic-friction MINLP of Eck and Mevissen, and a documented reimplementation of a published Harmony Search method—validating every candidate solution by exact EPANET resimulation. Both find placements better than the one published for this benchmark; the best-known placement attains 705.7 m of total nodal pressure against 722.8 m, and supplying the metaheuristic incumbent to the exact solver tightens the optimality gap from 6.4% to 4.5%, so the best-known solution is provably within 4.5% of the global optimum of the quadratic model, with the residual gap traced to the relaxation of the nonconvex energy constraints. The study also isolates, through a dedicated control experiment, a tolerance effect of broader relevance: placements whose settings are optimal for the approximate model violate the minimum-pressure requirement by centimetres in the exact hydraulics, and rankings can shift by metres; sensitivity analyses on tolerances, setting discretization and demands show that all reported rankings are nevertheless stable. On the 445-node Balerma network, re-optimization with a 2 m safety margin yields a strictly feasible three-valve solution reducing the sum of nodal pressures by 19.6%, with pressures reproduced by EPANET within 3.8%. These results imply that exact resimulation and explicit safety margins on the pressure requirement should become standard steps of model-based valve placement, and that pairing metaheuristic incumbents with global solvers offers a practical route to certified pressure-management decisions.
This paper addresses the optimal distribution feeder reconfiguration (DFR) problem with an explicit and practical consideration of switching maneuver limitations. While extensive research has focused on losses minimization by optimizing the network topology, most of the existing formulations overlook the operating cost...
O. Montoya, J. C. Hernández, L. Grisales-Noreña· Energies· 0 citations
This study develops a multiobjective mixed-integer nonlinear programming framework for circular supply chains in the electrical and electronic equipment (EEE) sector under operational disruptions. The formulation integrates strategic network decisions with dynamic material flows, congestion-dependent transit times, del...
Cornel Constantin Tuduriu, L. Milici, O. Grosu· Sustainability· 0 citations
Electric vehicle routing models are typically deterministic. However, stochastic vehicle routing models rarely include a battery constraint. This study addresses that gap with a two-stage stochastic mixed-integer programme for electric vehicle routing with time windows, in which routing, load, and load-dependent energy...
E. Ekanayake, E. M. U. S. B. Ekanayak· Journal of Future Sustainabi...· 0 citations
The growth of e-commerce and the demand for ever shorter delivery lead times put considerable pressure on last-mile logistics operators. This article proposes a unified mixed-integer linear programming (MILP) model for mixed vehicle-drone routing with time windows (VRPTW-D). A conventional vehicle may, at each of its s...
Yao Konan Adrien, Edi Yapi Fiacre Aristide, Godo Houin Marc· International Journal of Adv...· 0 citations
This paper proposes a deterministic bilevel optimization framework for the coordinated operation of Virtual Power Plants (VPPs) embedded in an active distribution network, which retains the full AC Optimal Power Flow equations, producing a bilevel Mixed-Integer Nonlinear Program (MINLP).
Laura M. Barajas-Arguello, R. A. Núñez-Rodríguez, Daniel Gebbran et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.