The Laying Line Optimal Design And Load Calculation For High-rise Buildings Of Basing On The Ant Colony

With the development of modern times society, enlarge of building's scale, more and more electrical equipment is applied to buildings. Especially, with the popularization of computer network information technology, more and more information electrical equipment is applied to buildings; it brings a few new questions.In order to improve the reliability of power distribution system of high building, choice capacity of power distribution device rightly, it is necessary to calculate charge rightly, the author analyses and investigates relative question with charge calculation, expatiates particularly capacity choice of important equipment, puts forward these measure being used to improve the reliability of power distribution system, makes charge calculation combination to project example, the result shows that these means is right and reasonable, these means are can guide project practice.Optimization design of laying line of high buildings is that the investment and running rate are minimal, at the case of satisfying the relative restriction and security. This is a discrete and nonlinear assembled optimal problem. And the conventional optimal method doesn't work well in optimization designing the laying line. The ant colony optimization algorithm is selected to finish the optimization designing the laying line in numerous optimization algorithms. The ant colony optimization algorithm is a kind of stochastic explorative algorithms, and is a relatively new class of meta-heuristic search techniques for optimization problems. As it is a swarm intelligence technique, this algorithm finds the best solution of optimization problem by making uses of the evolutionary procedure of a set of cooperating agents of ant colony unit. It has showed a great deal of salient character and performed great value in its application.From the aspect of biological principle and basic model of ant colony algorithm, the model of ant colony has been improved in the optimization problem of continuous space. In this new algorithm model, the proposed algorithm requires no prerequisites of differentiation or even continuation of objective function, and can effectively overcome the commonly seen disadvantage of getting into local optimum by classical algorithm. Furthermore, The program flow that describes above problems is programmed in Fortran90.