Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/2839
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMcCormick, G-
dc.contributor.authorPowell, R S-
dc.coverage.spatial9en
dc.date.accessioned2008-11-20T09:16:56Z-
dc.date.available2008-11-20T09:16:56Z-
dc.date.issued2004-
dc.identifier.citationJournal of the Operational Research Society. 55, 728—736.en
dc.identifier.urihttp://bura.brunel.ac.uk/handle/2438/2839-
dc.description.abstractThe scheduling of pumps for clean water distribution is a partially discrete non-linear problem with many variables. The scheduling method described in this paper typically produces costs within 1% of a linear program-based solution, and can incorporate realistic non-linear costs that may be hard to incorporate in linear programming formulations. These costs include pump switching and maximum demand charges. A simplified model is derived from a standard hydraulic simulator. An initial schedule is produced by a descent method. Two-stage simulated annealing then produces solutions in a few minutes. Iterative recalibration ensures that the solution agrees closely with the results from a full hydraulic simulation.en
dc.format.extent395230 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoen-
dc.publisherPalgraveen
dc.subjectsimulated annealingen
dc.subjectschedulingen
dc.subjectoptimizationen
dc.subjectwater networksen
dc.titleDerivation of near-optimal pump schedules for water distribution by simulated annealingen
dc.typeResearch Paperen
Appears in Collections:Electronic and Computer Engineering
Dept of Electronic and Electrical Engineering Research Papers

Files in This Item:
File Description SizeFormat 
Article.pdf385.97 kBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.