Road‐Maintenance Planning Using Genetic Algorithms. I: Formulation
This article has a reply.
VIEW THE REPLYPublication: Journal of Transportation Engineering
Volume 120, Issue 5
Abstract
The present paper demonstrates the applicability of genetic algorithms, as an optimization tool capable of overcoming combinatorial explosion, to the road‐maintenance planning problem at the network level. Genetic algorithms are search algorithms based upon the principles of Darwinian evolution. The concept of the survival of the fittest is used in a structured, yet randomized, information exchange to form a robust search algorithm. Genetic algorithms efficiently exploit historical information to locate search points with improved performance. The theoretical basis and operations of genetic algorithms are presented. A computer model, PAVENET, formulated on the operating principles of genetic algorithms to serve as an analytical aid for pavement maintenance engineers, is introduced. The formulation of the PAVENET model is described in detail. Analyses are conducted to show the characteristics of important operating parameters of the PAVENET program. These parameters include: (1) Parent pool size; (2) mutation rate in offspring generation; and (3) ranking system for offspring selection. The convergence process of a sample problem as analyzed by the PAVENET program is studied and recommendations on the choice of operating parameters are made.
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
Antoisse, H. J., and Keller, K. S. (1987). “Genetic operators for high‐level knowledge representations.” Genetic algorithms and their applications: Proc., Second Int. Conf. on Genetic Algorithms, J. J. Grefenstette, ed., Massachusetts Institute of Technology, Cambridge, Mass., 69–77.
2.
Baker, J. E. (1985). “Adaptive selection methods for genetic algorithms.” Proc., Int. Conf. on Genetic Algorithms, J. J. Grefenstette, ed., Carnegie‐Mellon University, Pittsburgh, Pa. 101–111.
3.
Baker, J. E. (1987). “Reducing bias and inefficiency in the selection algorithm.” Genetic algorithms and their applications: Proc., Second Int. Conf. on Genetic Algorithms, J. J. Grefenstette, ed., Massachusetts Institute of Technology, Cambridge, Mass., 14–21.
4.
Bethke, A. D. (1981). “Genetic algorithms as function optimizers.” Tech. Rep. No. 212, Logic of Computers Group, Univ. of Michigan, Ann Arbor, Mich.
5.
David, J. S., and Paul, T. W. (1987). “Towards a unified thermodynamic genetic operator.” Genetic algorithms and their applications: Proc., Second Int. Conf. on Genetic Algorithms, J. J. Grefenstette, ed., Massachusetts Institute of Technology, Cambridge, Mass. 116–122.
6.
Davis, L. (1985). “Job shop scheduling with genetic algorithms.” Proc., Int. Conf. on Genetic Algorithms, J. J. Grefenstette, ed., Carnegie‐Mellon University, Pittsburgh, Pa., 136–153.
7.
De Jong, K. A. (1975). “An analysis of the behavior of a class of genetic adaptive systems,” PhD thesis, University of Michigan, Ann Arbor, Mich.
8.
Feighan, K. J., Shahin, M. Y., and Sinha, K. C. (1987). “A dynamic programming approach to optimization for pavement management systems.” Proc., 2nd North Am. Conf. on Managing Pavements, Canadian Ministry of Transportation and U.S. Federal Highway Administration, 2.195–2.206.
9.
Fwa, T. F., Sinha, K. C., and Riverson, J. D. N. (1988). “Highway routine maintenance programming at network level.” J. Transp. Engrg., ASCE, 114(5) 539–554.
10.
Fwa, T. F., Tan, C. Y., and Chan, W. T. (1994). “Road maintenance planning using genetic algorithm. II.: Analysis.” J. Transp. Engrg., ASCE, 120(5), 710–722.
11.
Goldberg, D. E. (1983). “Computer‐aided gas pipeline operation using genetic algorithms and rule learning,” Phd thesis, University of Michigan, Ann Arbor, Mich.
12.
Goldberg, D. E. (1987). “A note on the disruption due to crossover in a binary‐coded genetic algorithm.” TCGA Rep. No. 87001, Tuscolovsa: University of Alabama, The Clearinghouse for Genetic Algorithms (TCGA), Univ. of Alabama,Tuscaloosa, Ala.
13.
Goldberg, D. E. (1989). Genetic algorithms in search, optimization and machine learning. Addison‐Wesley Publishing Company, Reading, Mass.
14.
Grefenstette, J. J., Gopal, R., Rosmaita B. J., and Gucht, D. V. (1985). “Genetic algorithms for the traveling salesman problem.” Proc., Int. Conf. on Genetic Algorithms, J. J. Grefenstette, ed., Carnegie‐Mellon University, Pittsburgh, Pa.
15.
Holland, J. H. (1968). “Hierarchical descriptions of universal spaces and adaptive systems.” Tech. Rep. ORA Projects 01252 and 08226, Dept. of Computer and Communication Sci., Univ. of Michigan, Ann Arbor, Mich.
16.
Holland, J. H. (1975). Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor, Mich.
17.
Lawrence, D. (1991). Handbook on genetic algorithms, Van Hostrand Reinhold, New York, N.Y.
18.
Lytton, R. L. (1985). “From ranking to true optimization.” Proc., North Am. Pavement Mgmt. Conf., Ontario Ministry of Transportation and Communications, and U.S. Federal Highway Administration, 5.3–5.18.
19.
Markow, M. J., Brademeyer, B. D., Sherwood, J., and Kenis, W. J. (1987). “The economic optimization of pavement maintenance and rehabilitation policy.” Proc., 2nd North Am. Conf. on Managing Pavements, Canadian Ministry of Transportation and U.S. Federal Highway Administration, 2.169–2.182.
20.
Pavement management systems. (1987). Organisation for Economic Cooperation and Development (OECD), Paris, France.
21.
Syswerda, G. (1989). “Uniform crossover in genetic algorithms.” Proc., Third Int. Conf. on Genetic Algorithms, J. D. Schaffer, ed., Morgan Kaufmann Publishers, San Mateo, Calif., 2–9.
Information & Authors
Information
Published In
Journal of Transportation Engineering
Volume 120 • Issue 5 • September 1994
Pages: 693 - 709
Copyright
Copyright © 1994 American Society of Civil Engineers.
History
Received: Jan 25, 1993
Published online: Sep 1, 1994
Published in print: Sep 1994
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.