Computational & Technology Resources
an online resource for computational,
engineering & technology publications
Civil-Comp Proceedings
ISSN 1759-3433
CCP: 76
PROCEEDINGS OF THE THIRD INTERNATIONAL CONFERENCE ON ENGINEERING COMPUTATIONAL TECHNOLOGY
Edited by: B.H.V. Topping and Z. Bittnar
Paper 75

Optimal Construction Management using an Improved Genetic Algorithm

H. Furuta+, K. Nakatsu* and T. Matsumoto$

+Department of Informatics,
*Graduate School of Informatics,
$Department of Informatics, Kansai University, Japan

Full Bibliographic Reference for this paper
H. Furuta, K. Nakatsu, T. Matsumoto, "Optimal Construction Management using an Improved Genetic Algorithm", in B.H.V. Topping, Z. Bittnar, (Editors), "Proceedings of the Third International Conference on Engineering Computational Technology", Civil-Comp Press, Stirlingshire, UK, Paper 75, 2002. doi:10.4203/ccp.76.75
Keywords: genetic algorithm, dynamic environment, construction management, learning, multi-agent system.

Summary
Generally, in optimization problems in the real world, it is rare to require the strict solution in all domains. Therefore, two or more realistic solutions are desired in many cases. Furthermore, in the real world, the optimal solution under not static environment but the dynamic environment where it continues changing intricately is required. In recent years, many researches have been made, which are applied to the combinatorial optimization problems and multi-objective optimization problem using Genetic Algorithm (GA). GA frequently loses the diversity of solutions, due to the characteristics of searching process.

In this paper, an optimal construction management is dealt with for such a case that a lot of constructions works. Attention is paid to the optimal allocation of workers who are inexperienced or experienced. For conditions to be considered, the experience of individuals, the importance of the construction stage, and cost are taken into account. In order to follow the change of environments, GA is improved by introducing the concept of multi-agent system. Applying the improved GA , it is possible to obtain robust and meaningful solutions even for the problem with objective functions and constraints that may vary time to time. A numerical example is presented to illustrate the proposed method and to compare with the simple GA.

Since the ordinal GA is based on the Darwin theory of evolution, only individuals with the highest fitness to the environment can survive through the natural selection. This implies that the population loses the diversity of solution candidates while converging to the optimal solution. Then, when the environment changes complicatedly, the ordinal GA can't correspond to the change. There arise such problems as the convergence to a local optimum or the stagnation of evolution.

In this paper, an attempt in made to introduce the concept of multi-agent into the GA operation. Multi-agent system uses the cooperative process of solving the problem. The processing results by each agent are integrated by taking their mutual influences in to consideration. In the communication between the agents, the black board model is employed, which can provide the same knowledge for each agent. In the implementation of GA calculation, each individual is an agent and gene manipulation is a black board. The agent can learns the rule by using the effective- ness of gene manipulation, in order to solve the problem regardless of the drastic changes of environment.

In order to illustrate the proposed method, a numerical example is presented, in which the optimal construction management for completing a lot of construction works by the shortest days. As constraints, restriction on experience of construction work, the number of the minimum staffs necessary for each construction work, the maximum days, etc. are prescribed. Moreover, changes of the maximum days, the data of experience, and the number of the minimum staffs are made here as dynamic environment. Figure 75.1 shows the convergence of the both methods. The problem is solved by both the simple GA and the improved GA.

Figure 75.1: The Convergence of two kinds of GA(s) for dynamic environment.

From Figure 75.1, it can be seen that before the environment changes, both GAs provide the result that seldom changes. However, a remarkable difference in two kinds of GAs is seen after the environmental change. In dynamic environment, the validity of the Improved GA using a multi-agent's concept has been proved. However, in the real world, more complicated environmental changes frequently occur, the system that can flexibly respond to such environmental changes is desired.

References
1
Hiroaki Kitano, "Genetic Algorithm", Sangyo Tosho Publishing Co., Ltd., Inc., Japan, 1993
2
Akihiko Osuga, Masahiro Tanaka, "Agent technology", Kyoritsu shuppan Co., Ltd., Japan, 1999
3
Yuka Yamamoto, Takahiro Sasaki and Mario Tokoro, "Adaptation of Evolutionary Agents toward Changing Environment", Sony Computer Science Laboratory, Department of computer Science, Faculty of science and Technology, Keio University, Japan, 1999

purchase the full-text of this paper (price £20)

go to the previous paper
go to the next paper
return to the table of contents
return to the book description
purchase this book (price £85 +P&P)