Optimization Model for Sewer Rehabilitation Using Fast Messy Genetic Algorithm

fmGA를 이용한 하수관거정비 최적화 모델

  • Received : 2003.11.17
  • Accepted : 2004.03.22
  • Published : 2004.04.15

Abstract

A long-term sewer rehabilitation project consuming an enormous budget needs to be conducted systematically using an optimization skill. The optimal budgeting and ordering of priority for sewer rehabilitation projects are very important with respect to the effectiveness of investment. In this study, the sewer rehabilitation optimization model using fast-messy genetic algorithm is developed to suggest a schedule for optimal sewer rehabilitation in a subcatchment area by modifying the existing GOOSER$^{(R)}$ model having been developed using simple genetic algorithm. The sewer rehabilitation optimization model using fast-messy genetic algorithm can improve the speed converging to the optimal solution relative to GOOSER$^{(R)}$, suggesting that it is more advantageous to the sewer rehabilitation in a larger-scale subcatchment area than GOOSER.

Keywords

References

  1. 서울시 (2000) 성내, 탄천 배수구역 하수관거조사 및 정비 기본설계
  2. 정철권 (2002) 유전자알고리즘을 이용한 하수관거 청비 우선순위 및 투자비용 최적화, 박사학위논문,연세대학교
  3. 정철권, 박규홍,정연규 (2001) 유전자알고리즘에 의한 소규모 배수유역 하수관거 정비의 최척화, 대한토목학회논문집. 21(3-B). pp.295-304
  4. Burgess, E.H. (1994) Planning Model for Sewer System Rehabilitation. In W.A. Macatics (Ed.), Urban Drainage Rehabilitation Programs and Techniques, New York, ASCE, pp.30-38
  5. Deb,K and Goldberg, D.E. (1991) mGA in C:A Messy Genetic Algorithm in C, llliGAL Rep. No. 91008, Illinois Genetic Algorithms Lab., Univ. of lllinois at Urbana-Champaign, Urbana, Ill
  6. DeMonsabert, S. and Thornton, P. (1997) A Bender Decomposition Model for Sewer Rehabilitation Planning for Infiltration and Inflow Planning, Water Environment Research, 69, pp. 162
  7. DeMonsabert, S., Ong, C. and Thornton, P. (1999) An Integer Program for Optimizing Sanitary Sewer Rehabilitation Over a Planning Horizon, Water Environment Research, 71(7), pp. 1292-1297
  8. Goldberg, D.E. (1989) Genetic Algorithms in Search, OptimizatWn, and Machine Learning, Addison Wesley Longman, Ind
  9. Goldberg, D.E., Deb, K. and Korb, B. (1989) Messygenetic algorithms revisited: studies in mixed size and scale, Cumplex Systems, 4, pp.415-444
  10. Goldberg, D.E., Deb, K and Korb, B. (1990) Messygenetic algorithms: motivation, analysis, and first results, Cumplex Systems, 3,pp.493-530
  11. Goldberg, D.E., Deb, K, Kargupta, H. and Harik, G. (1993), Rapid, accurate optimization of difficuJt problems using fastmessy genetic algorithms, llliGAL Rep. No. 93004, lllinois Genetic Algorithms Lab., University of Illinois at UrbanaChampaign, Urbana, Ill
  12. Kargupta, H. (1995), SEARCH, Polynumial Cumplexity, And The Fast Messy Genetic Algorithm, IlliGAL Rep. No. 95008, lllinois Genetic Algorithms Lab., University of Illinois at Urbana-Champaign, Urbana, Ill
  13. Knjazew, D. (2000), Application of the Fast Messy Genetic Algorithm to Permutation and Scheduling Problems, Dimitri Knjazew, IlliGAL Rep. No. 2000022, Illinois Genetic Algorithms Lab., University of lllinois at Urbana-Champaign, Urbana,Ill
  14. Monganathansnan, V. and McDermott, G.E. (1998), Optimisation Model for Wastewater Strategic Planning, Proceeding of the Sixth International Conference on Hydraulic; in Civil Engineering, and Third International Symposium on Stormwater Management; HydraStorm 98, September, Adelaide, Austrailia, pp.27-30, 323-328
  15. Reyna, S.M. (1993), Optimal Planning of Sewer Systems Rehabilitation, Ph.D. Dissertation, Purdue University, USA
  16. Wu, Z.Y. and Simpson, A.R. (2001), Competent GeneticEvolutionary Optimization of Water Distribution Systems, Journal of Cumputing in Civil Engineering, pp.89-101