This note deals with how to position bricks so that m aximizing the numbers of whole brick in a given area. A method by genetic algori thm is given to solve this problem. By this method, the numbers of whole brick a n...This note deals with how to position bricks so that m aximizing the numbers of whole brick in a given area. A method by genetic algori thm is given to solve this problem. By this method, the numbers of whole brick a nd their position are gained when given areas are convex polygon and brick is re ctangular, and you can easily design a CAD soft to optimize the scheme of positi oning bricks. It is huge advantage by this method when given areas are nonregula r. Some rules of parameter’s influence to algorithm are pointed out by computer simulation. The first section states the problem and the math model of problem is given out. The second section gives out the solution by genetic algorithm, in cluding description of genetic algorithm and steps of algorithm about proble m of positioning bricks. The third section gives a computer simulation example. The last section is some discussions about this algorithm, including the influen ce of parameter to algorithm and optimizing parameter. Some rule is gained.展开更多
文摘This note deals with how to position bricks so that m aximizing the numbers of whole brick in a given area. A method by genetic algori thm is given to solve this problem. By this method, the numbers of whole brick a nd their position are gained when given areas are convex polygon and brick is re ctangular, and you can easily design a CAD soft to optimize the scheme of positi oning bricks. It is huge advantage by this method when given areas are nonregula r. Some rules of parameter’s influence to algorithm are pointed out by computer simulation. The first section states the problem and the math model of problem is given out. The second section gives out the solution by genetic algorithm, in cluding description of genetic algorithm and steps of algorithm about proble m of positioning bricks. The third section gives a computer simulation example. The last section is some discussions about this algorithm, including the influen ce of parameter to algorithm and optimizing parameter. Some rule is gained.
