ROAD-MAINTENANCE PLANNING USING GENETIC ALGORITHMS .1. FORMULATION

被引：79

作者：

CHAN, WT

FWA, TF

TAN, CY

机构：

[1] Dept, of Civ. Engrg., Nat. Univ. Of Singapore, 0511

来源：

JOURNAL OF TRANSPORTATION ENGINEERING-ASCE | 1994年 / 120卷 / 05期

关键词：

D O I：

10.1061/(ASCE)0733-947X(1994)120:5(693)

中图分类号：

TU [建筑科学];

学科分类号：

0813 ;

摘要：

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.

引用

页码：693 / 709

页数：17

共 21 条

[1]

Antoisse H.J., Keller K.S., 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, pp. 69-77, (1987)

[2]

Baker J.E., Adaptive selection methods for genetic algorithms, Proc., Int. Conf. On Genetic Algorithms, J. J. Grefenstette, Ed Carnegie-Mellon University, Pittsburgh, Pa, pp. 101-111, (1985)

[3]

Baker J.E., 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, pp. 14-21, (1987)

[4]

Bethke A.D., Genetic algorithms as function optimizers. Tech. Rep, Logic Of Computers Group, Univ. Of Michigan, Ann Arbor, Mich, (1981)

[5]

David J.S., Paul T.W., 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, pp. 116-122, (1987)

[6]

Davis L., Job shop scheduling with genetic algorithms. Proc Int. Conf. On Genetic Algorithms, J. J. Grefenstette, Ed., Carnegie-Mellon University, Pittsburgh, Pa, pp. 136-153, (1985)

[7]

De Jong K.A., An analysis of the behavior of a class of genetic adaptive systems, Phd Thesis, University of Michigan, Ann Arbor, Mich, (1975)

[8]

Feighan K.J., Shahin M.Y., Sinha K.C., 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, pp. 195-206, (1987)

[9]

Fwa T.F., Sinha K.C., Riverson J., Highway routine maintenance programming at network level, J. Transp. Engrg., ASCE, 114, 5, pp. 539-554, (1988)

[10]

Fwa T.F., Tan C.Y., Chan W.T., Road maintenance planning using genetic algorithm. II.: Analysis, J. Transp. Engrg., ASCE, 120, 5, pp. 710-722, (1994)

← 1 2 3 →