Noncrossover Dither Creeping Mutation-Based Genetic Algorithm for Pipe Network Optimization
Publication: Journal of Water Resources Planning and Management
Volume 140, Issue 4
Abstract
A noncrossover dither creeping mutation-based genetic algorithm (CMBGA) for pipe network optimization has been developed and is analyzed in this paper. This CMBGA differs from the classic genetic algorithm (GA) optimization in that it does not utilize the crossover operator; instead, it only uses selection and a proposed dither creeping mutation operator. The creeping mutation rate in the proposed dither creeping mutation operator is randomly generated in a range throughout a GA run, rather than being set to a fixed value. In addition, the dither mutation rate is applied at an individual chromosome level rather than at the generation level. The dither creeping mutation probability is set to take values from a small range that is centered about (where = number of decision variables of the optimization problem being considered). This is motivated by the fact that a mutation probability of approximately previously has been demonstrated to be an effective value and is commonly used for the GA. Two case studies are used to investigate the effectiveness of the proposed CMBGA. An objective of this paper is to compare the performance of the proposed CMBGA with four other GA variants and other published results. The results show that the proposed CMBGA exhibits considerable improvement over the considered GA variants, and comparable performance with respect to other previously published results. Two big advantages of the CMBGA are its simplicity and the fact that it requires the tuning of fewer parameters compared with other GA variants.
Get full access to this article
View all available purchase options and get full access to this article.
References
Dandy, G. C., Simpson, A. R., and Murphy, L. J. (1996). “An improved genetic algorithm for pipe network optimization.” Water Resour. Res., 32(2), 449–457.
Das, S., Konar, K., and Chakraborty, U. K. (2005). “Two improved differential evolution schemes for faster global search.” Proc., Conf. Genetic Evol. Comp. (GECCO 2005), Association for Computing Machinery (ACM), New York, 991–998.
Deb, K. (2000). “An efficient constraint handling method for genetic algorithms.” Comp. Meth. Appl. Mech. Eng., 186(2–4), 311–338.
Falco, I. D., Ciooppa, A. D., and Tarantino, D. (2002). “Mutation-based genetic algorithm: Performance evaluation.” Appl. Soft Comp., 1(4), 285–299.
Fogel, D. B., and Atmar, J. W. (1990). “Comparing genetic operators with Gaussian mutation in simulated evolutionary process using linear systems.” Bio. Cyber., 63(2), 111–114.
Fogel, L. J., Owens, A. J., and Walsh, M. J. (1966). Artificial intelligence through simulated evolution, Wiley, New York.
Fujiwara, O., and Khang, D. B. (1990). “A two-phase decomposition method for optimal design of looped water distribution networks.” Water Resour. Res., 26(4), 539–549.
Gibbs, M. S., Dandy, G. C., and Maier, H. R. (2008). “A genetic algorithm calibration method based on convergence due to genetic drift.” Inf. Sci., 178(14), 2857–2869.
Maier, H. R., et al. (2003). “Ant colony optimization for the design of water distribution systems.” J. Water Resour. Plann. Manage., 200–209.
Nicklow, J., et al. (2010). “State of the art for genetic algorithms and beyond in water resources planning and management.” J. Water Resour. Plann. Manage., 412–432.
Reca, J., and Martínez, J. (2006). “Genetic algorithms for the design of looped irrigation water distribution networks.” Water Resour. Res., 42(5), W05416.
Rechenberg, I. (1965). “Cybernetic solution path of an experimental problem.” Royal Aircraft Establishment, Library Trans. Number 1122, Farnborough, England.
Simpson, A. R., Dandy, G. C., and Murphy, L. J. (1994). “Genetic algorithms compared to other techniques for pipe optimization.” J. Water Resour. Plann. Manage., 423–443.
Tolson, B. A., Asadzadeh, M., Maier, H. R., and Zecchin, A. (2009). “Hybrid discrete dynamically dimensioned search (HD-DDS) algorithm for water distribution system design optimization.” Water Resour. Res., 45(12), W12416.
Vairavamoorthy, K., and Ali, M. (2000). “Optimal design of water distribution systems using genetic algorithms.” Comput. Aided Civ. Infrastruct. Eng., 15(5), 374–382.
Zecchin, A. C., Maier, H. R., Simpson, A. R., Leonard, M., and Nixon, J. B. (2007). “Ant colony optimization applied to water distribution system design: Comparative study for five algorithms.” J. Water Resour. Plann. Manage., 87–92.
Zheng, F., Simpson, A. R., and Zecchin, A. C. (2011). “Dynamically expanding choice-table approach to genetic algorithm optimization of water distribution systems.” J. Water Resour. Plann. Manage., 547–551.
Information & Authors
Information
Published In
Journal of Water Resources Planning and Management
Volume 140 • Issue 4 • April 2014
Pages: 553 - 557
Copyright
© 2013 American Society of Civil Engineers.
History
Received: Jul 14, 2012
Accepted: Jan 30, 2013
Published online: Feb 1, 2013
Discussion open until: Jul 1, 2013
Published in print: Apr 1, 2014
Authors
Metrics & Citations
Metrics
Citations
Download citation
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.