GPEM 20(4) is now available

The fourth issue of Volume 20 of Genetic Programming and Evolvable Machines is now available for download.It contains:A survey of evolutionary algorithms using metameric representationsby Matt Ryerkerk, Ron Averill, Kalyanmoy Deb & Erik GoodmanA co…

The fourth issue of Volume 20 of Genetic Programming and Evolvable Machines is now available for download.

It contains:

A survey of evolutionary algorithms using metameric representations
by Matt Ryerkerk, Ron Averill, Kalyanmoy Deb & Erik Goodman

A covariance matrix adaptation evolution strategy in reproducing kernel Hilbert space
by iet-Hung Dang, Ngo Anh Vien & TaeChoong Chung

A novel multi-swarm particle swarm optimization for feature selection
by Chenye Qiu

A journey among Java neutral program variants
by Nicolas Harrand, Simon Allier, Marcelino Rodriguez-Cancio, Martin Monperrus & Benoit Baudry

A Cooperative Co-Evolutionary Approach to Large-Scale Multisource Water Distribution Network Optimization

Potable water distribution networks (WDNs) are important infrastructures of modern cities. A good design of the network can not only reduce the construction expenditure but also provide reliable service. Nowadays, the scale of the WDN of a city grows d…

Potable water distribution networks (WDNs) are important infrastructures of modern cities. A good design of the network can not only reduce the construction expenditure but also provide reliable service. Nowadays, the scale of the WDN of a city grows dramatically along with the city expansion, which brings heavy pressure to its optimal design. In order to solve the large-scale WDN optimization problem, a cooperative co-evolutionary algorithm is proposed in this paper. First, an iterative trace-based decomposition method is specially designed by utilizing the information of water tracing to divide a large-scale network into small subnetworks. Since little domain knowledge is required, the decomposition method has great adaptability to multiform networks. Meanwhile, during optimization, the proposed algorithm can gradually refine the decomposition to make it more accurate. Second, a new fitness function is devised to handle the pressure constraint of the problem. The function transforms the constraint into a part of the objective to punish the infeasible solutions. Finally, a new suite of benchmark networks are created with both balanced and imbalanced cases. Experimental results on a widely used real network and the benchmark networks show that the proposed algorithm is promising.