Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Multi-objective optimisation of the pump scheduling problem using SPEA2

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Lopez-Ibanez, M. ; Centre for Emergent Comput., Napier Univ., Edinburgh ; Devi Prasad, T. ; Paechter, B.

Significant operational cost and energy savings can be achieved by optimising the schedules of pumps, which pump water from source reservoirs to storage tanks, in water distribution networks. Despite the fact that pump scheduling problem involves several conflictive objectives, few studies have considered multi-objective optimisation in terms of Pareto optimality. Our approach links a well-known multi-objective optimiser, SPEA2, with a hydraulic simulator, EPANET, in order to provide a Pareto set of explicit schedules. Since only fixed speed pumps and fixed time intervals are considered, we use a natural binary representation and simple and straightforward initialisation and recombination operators. Unlike earlier studies, feasibility constraints are handled by a methodology based on the dominance relation rather than using penalty functions or reparation mechanisms. We test the proposed approach using a network instance and an assessment of the results is carried out by means of empirical attainment surfaces. The results show that the proposed approach is able to obtain better schedules than the state-of-the-art single-objective algorithm for this network instance and within the same number of function evaluations

Published in:

Evolutionary Computation, 2005. The 2005 IEEE Congress on  (Volume:1 )

Date of Conference:

5-5 Sept. 2005