z-logo
open-access-imgOpen Access
Automated construction of evolutionary algorithm operators for the bi-objective water distribution network design problem using a genetic programming based hyper-heuristic approach
Author(s) -
Kent McClymont,
Edward Keedwell,
Dragan Savić,
Mark Randall-Smith
Publication year - 2013
Publication title -
journal of hydroinformatics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.654
H-Index - 50
eISSN - 1465-1734
pISSN - 1464-7141
DOI - 10.2166/hydro.2013.226
Subject(s) - genetic programming , heuristic , mathematical optimization , operator (biology) , computer science , set (abstract data type) , evolutionary algorithm , hyper heuristic , domain (mathematical analysis) , genetic algorithm , artificial intelligence , mathematics , mathematical analysis , biochemistry , chemistry , robot learning , repressor , mobile robot , transcription factor , robot , gene , programming language
The water distribution network (WDN) design problem is primarily concerned with finding the optimal pipe sizes that provide the best service for minimal cost; a problem of continuing importance both in the UK and internationally. Consequently, many methods for solving this problem have been proposed in the literature, often using tailored, hand-crafted approaches to more effectively optimise this difficult problem. In this paper we investigate a novel hyper-heuristic approach that uses genetic programming (GP) to evolve mutation operators for evolutionary algorithms (EAs) which are specialised for a bi-objective formulation of the WDN design problem (minimising WDN cost and head deficit). Once generated, the evolved operators can then be used ad infinitum in any EA on any WDN to improve performance. A novel multi-objective method is demonstrated that evolves a set of mutation operators for one training WDN. The best operators are evaluated in detail by applying them to three test networks of varying complexity. An experiment is conducted in which 83 operators are evolved. The best 10 are examined in detail. One operator, GP1, is shown to be especially effective and incorporates interesting domain-specific learning (pipe smoothing) while GP5 demonstrates the ability of the method to find known, well-used operators like a Gaussian. © IWA Publishing 2014J.Engineering and Physical Sciences Research Council (EPSRC)Mouchel Ltd

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom