Self-Adaptive Penalty Approach Compared with Other Constraint-Handling Techniques for Pipeline Optimization
Publication: Journal of Water Resources Planning and Management
Volume 131, Issue 3
Abstract
Optimal design and rehabilitation of a water distribution system is a constrained nonlinear optimization problem. A penalty function is often employed to transform a constrained into a nonconstrained optimization problem within the framework of a genetic algorithm search. A penalty factor is used for defining the penalty function and calculating the penalty cost for the solutions with constraint violation. Effective penalty factors vary from one optimization model to another. This paper introduces a self-adaptive penalty approach to artificially evolve both the penalty factor and the design solutions. Solution robustness is proposed and quantified, along with solution fitness, for representing the boundary between the infeasible and feasible solutions of a high-dimension optimization problem. The solution space of multiple dimensions is mapped onto a 2D space, providing significant insight into the self-adaptive penalty approach, which is compared with other constraint-handling techniques tested on a benchmark example. The results show that this approach is more effective than other penalty methods used for searching for optimal and near-optimal solutions. The self-adaptive penalty approach relieves modelers from tuning the penalty function and facilitates a practical optimization modeling for water distribution design.
Get full access to this article
View all available purchase options and get full access to this article.
References
Bäck, T., Hoffmeister, F., and Schwefel, H.-P. (1991). “A survey of evolution strategies.” R. K. Belew and L. B. Booker, eds., Proc. 4th Int. Conf. on Genetic Algorithms, Morgan Kaufmann, San Mateo, Calif., 2–9.
Coello Coello, C. A., and Mezura-Montez, E. (2002). “Handling constraints in genetic algorithms using dominance-based tournaments.” Adaptive computing in design and manufacture, Ian C. Parmee, ed., Springer, London, 273–284.
Deb, K., and Agrawal, S. (1999). “A niched-penalty approach for constraint handling in genetic algorithms.” Proc. of Int. Conf. on Artificial Neural Networks and Genetic Algorithims, Control Theory and Applications Centre, Country Univ., U.K.
Goldberg, D. E., Korb, B., and Deb, K. (1989). “Messy genetic algorithms: Motivation, analysis, and first results.” Complex Syst., 3, 493–530.
Goldberg, D. E., Deb, K., Kargupta, H., and Harik, G. (1993). “Rapid, accurate optimization of difficult problems using fast messy genetic algorithms.” IlliGAL Report No. 93004, Illinois Genetic Algorithms Laboratory, Univ. of Illinois at Urbana-Champaign, Urbana, Ill.
Haestad, Methods (2003). WaterCAD user’s manual, Waterbury, Conn.
Homaifar, A., Lai, S. H.-Y., and Qi, X. (1994). “Constrained optimization via genetic algorithms.” Simulation, 62(4), 242–254.
Joins, J. and Houck, C., and (1994). “On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with GAs.” Z. Michalewicz, J. D. Schaffer, H.-P. Schwefel, D. B. Fogel, and H. Kitano, eds., Proc., 1st IEEE Int. Conf. on Evolutionary Computing, IEEE Press, Piscataway, N.J. 579–584.
Lin, L.-Y., and Wu, W.-H. (2004). “Self-organizing adaptive penalty strategy in constrained genetic search.” Journal of Structural and Multidisciplinary Optimization, 26, 417–428.
Michalewicz, Z. (1995). “Genetic algorithms, numerical optimization and constraints.” L. J. Eshelman, ed., Proc. 6th Int. Conf. on Genetic Algorithms, Morgan Kaufmann, San Mateo, Calif., 151–158.
Michalewicz, Z., and Attia, N. (1994). “Evolutionary optimization of constrained problems.” A. V. Sebald, and L. J. Fogel, eds., Proc., 3rd Annual Conf. on Genetic Programming, World Scientific, River Edge, N.J., 98–108.
Michalewicz, Z., and Schoenauer, M. (1996). “Evolutionary algorithms for constrained parameter optimization problems.” Evol. Comput., 7(1), 19–44.
Prasad, T. D., and Park, N.-S. (2004). “Multiobjective genetic algorithms for design of water distribution networks.” J. Archit. Eng., 130(1), 73–82.
Savic, D. A., and Walters, G. A. (1997). “Genetic algorithms for the least-cost design of water distribution networks.” J. Water Resour. Plan. Manage., 123(2), 67–77.
Simpson, A. R., Dandy, G. C., and Murphy, L. J. (1994). “Genetic algorithms compared to other techniques for pipe optimization.” J. Water Resour. Plan. Manage., 120(4), 423–443.
Walski, T., Baranowski, T., Wu, Z. Y., Mankowski, R., and Hartell, W. (2003). “Trading off reliability in cost in optimal water distribution system design.” World Water and Environmental Resource Congress 2003 and Related Symposia, P. Bizier and P. DeBarry, eds., ASCE, Reston, Va.
Wu, Z. Y. (1998). “Messy genetic algorithm for optimization of water distribution system including water hammer. Ph.D. dissertation, Dept. of Civil and Environmental Engineering, Univ. of Adelaide, Australia.
Wu, Z. Y., and Simpson, A. R. (2001). “Competent genetic algorithm optimization of water distribution systems.” J. Comput. Civ. Eng., 15(2), 89–101.
Wu, Z. Y., and Simpson, A. R. (2002). “Self-adaptive boundary search of genetic algorithms and application to water distribution systems.” J. Hydraul. Res., 40(2), 191–203.
Wu, Z. Y., Boulos, P. F., Orr, C.-H., and Ro, J. J. (2001). “Rehabilitation of water distribution system using genetic algorithm.” J. Am. Water Works Assoc., November, 74–85.
Wu, Z. Y, Walski, T., Mankowski, R., Cook, J., Tryby, M., and Herrin, G. (2002). “Optimal capacity of water distribution systems.” Proc. 1st Annual Environmental and Water Resources Systems Analysis (EWRSA) Symp., ASCE, Reston, Va.
Information & Authors
Information
Published In
Copyright
© 2005 ASCE.
History
Received: Aug 31, 2004
Accepted: Dec 23, 2004
Published online: May 1, 2005
Published in print: May 2005
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.