Penalty-Free Self-adaptive Search Space Reduction Method for Multi-objective Evolutionary Design Optimization of Water Distribution Networks

Author(s):  
Tiku T. Tanyimboh
Author(s):  
Tiku T. Tanyimboh

Abstract Genetic algorithms have been shown to be highly effective for optimization problems in various disciplines, and binary coding is generally adopted as it is straightforward to implement and lends itself to problems with discrete-valued decision variables. However, a difficulty associated with binary coding is the existence of redundant codes that do not correspond to any element in the finite discrete set that the encoded parameter belongs to. A common technique used to address redundant binary codes is to discard the chromosomes in which they occur. Effective alternatives to the outright removal of redundant codes are lacking in the literature. This article presents illustrative examples based on the problem of optimizing the design of water distribution networks. Two benchmark networks in the literature and two different multi-objective design optimization models were considered. Different fixed mapping schemes gave significantly different solutions in the search space. The main inference from the results is that mapping schemes that improved diversity in the population of solutions achieved better results, which may pave the way for the development of practical and effective mapping schemes.


2017 ◽  
Author(s):  
Dagnachew Aklog ◽  
Yoshihiko Hosoi

Abstract. This paper discusses development of an easy-to-use, all-in-one model for designing optimal water distribution networks. The model combines different optimization techniques into a single package in which a user can easily choose what optimizer to use and can compare results of different optimizers to gain confidence on the performances of the models. At present, three optimization techniques are included in the model: linear programming (LP), genetic algorithm (GA), and a heuristic one by one reduction method (OBORM) which was previously developed by the authors. The optimizers were tested on a number of benchmark problems and performed very well in terms of finding optimal or near-optimal solutions with a reasonable computation effort. The results indicate that the model effectively addresses the issues of complexity and limited performance trust associated with previous models and thus can be used for practical purposes.


Sign in / Sign up

Export Citation Format

Share Document