Particle Swarm Optimization Algorithm In The Glass Typesetting Problems

The algorithm of particle swarm optimization is an evolutionary algorithm. The algorithm of particle swarm optimization find optimal regions of complex search space through the interaction of individuals in a population of particles. The rapid speed of calculation and simple realization are its excellent performance.A multi-object combinatorial optimal problem----glass—block typesetting optimal problem solved by particle swarm optimization is studied in this paper. The data related with this study on the optimization of glass-block typesetting based on PSO has not been found at home. The glass-block typesetting optimization algorithm are designed and realized in this paper.In order to lessen the difficulty, the multi-object problem is disassembled into several single object problems, and these problems are solved one by one by applying PSO. In terms of the particularity of each problem, the modification is necessary on PSO. In the layout problem of glass-block typesetting, we use the structure of B*—tree to describe the relation among the glass-blocks and the assembling value between two glass-blocks to construct a layout gradually. In the TSP of glass-block typesetting, we redefine the formula of PSO in order to find the shortest route. The result of the layout problem has great influence to that of the TSP. The rational layout is not exclusive, and different layout will lead different result of TSP. Therefore, the better layout is gained, the better result of TSP we can get.In chapter 1 we introduce the work of the paper, its background and the problem we will solve. In chapter 2 we introduced PSO systematically, which include the algorithm background, the theory of PSO and basic...