Integrated building design is inherently a multi-objective optimization problem where two or more conflicting objectives must be minimized and/or maximized concurrently.Many multi-objective optimization algorithms hav...Integrated building design is inherently a multi-objective optimization problem where two or more conflicting objectives must be minimized and/or maximized concurrently.Many multi-objective optimization algorithms have been developed;however few of them are tested in solving building design problems.This paper compares performance of seven commonly-used multi-objective evolutionary optimization algorithms in solving the design problem of a nearly zero energy building(n ZEB) where more than 1.610 solutions would be possible.The compared algorithms include a controlled non-dominated sorting genetic algorithm witha passive archive(p NSGA-II),a multi-objective particle swarm optimization(MOPSO),a two-phase optimization using the genetic algorithm(PR_GA),an elitist non-dominated sorting evolution strategy(ENSES),a multi-objective evolutionary algorithm based on the concept of epsilon dominance(ev MOGA),a multi-objective differential evolution algorithm(sp MODE-II),and a multi-objective dragonfly algorithm(MODA).Several criteria was used to compare performance of these algorithms.In most cases,the quality of the obtained solutions was improved when the number of generations was increased.The optimization results of running each algorithm20 times with gradually increasing number of evaluations indicated that the PR_GA algorithm had a high repeatability to explore a large area of the solution-space and achieved close-to-optimal solutions with a good diversity,followed by the p NSGA-II,ev MOGA and sp MODE-II.Uncompetitive results were achieved by the ENSES,MOPSO and MODA in most running cases.The study also found that 1400-1800 were minimum required number of evaluations to stabilize optimization results of the building energy model.展开更多
A more effective and accurate improved Sobel algorithm has been developed to detect surface defects on heavy rails. The proposed method can make up for the mere sensitivity to X and Y directions of the Sobel algorithm...A more effective and accurate improved Sobel algorithm has been developed to detect surface defects on heavy rails. The proposed method can make up for the mere sensitivity to X and Y directions of the Sobel algorithm by adding six templates at different directions. Meanwhile, an experimental platform for detecting surface defects consisting of the bed-jig, image-forming system with CCD cameras and light sources, parallel computer system and cable system has been constructed. The detection results of the backfin defects show that the improved Sobel algorithm can achieve an accurate and efficient positioning with decreasing interference noises to the defect edge. It can also extract more precise features and characteristic parameters of the backfin defect. Furthermore, the BP neural network adopted for defects classification with the inputting characteristic parameters of improved Sobel algorithm can obtain the optimal training precision of 0.0095827 with 106 iterative steps and time of 3 s less than Sobel algorithm with 146 steps and 5 s. Finally, an enhanced identification rate of 10% for the defects is also confirmed after the Sobel algorithm is improved.展开更多
A quadratic bilevel programming problem is transformed into a single level complementarity slackness problem by applying Karush-Kuhn-Tucker（KKT） conditions.To cope with the complementarity constraints,a binary encod...A quadratic bilevel programming problem is transformed into a single level complementarity slackness problem by applying Karush-Kuhn-Tucker（KKT） conditions.To cope with the complementarity constraints,a binary encoding scheme is adopted for KKT multipliers,and then the complementarity slackness problem is simplified to successive quadratic programming problems,which can be solved by many algorithms available.Based on 0-1 binary encoding,an orthogonal genetic algorithm,in which the orthogonal experimental design with both two-level orthogonal array and factor analysis is used as crossover operator,is proposed.Numerical experiments on 10 benchmark examples show that the orthogonal genetic algorithm can find global optimal solutions of quadratic bilevel programming problems with high accuracy in a small number of iterations.展开更多
文摘Integrated building design is inherently a multi-objective optimization problem where two or more conflicting objectives must be minimized and/or maximized concurrently.Many multi-objective optimization algorithms have been developed;however few of them are tested in solving building design problems.This paper compares performance of seven commonly-used multi-objective evolutionary optimization algorithms in solving the design problem of a nearly zero energy building(n ZEB) where more than 1.610 solutions would be possible.The compared algorithms include a controlled non-dominated sorting genetic algorithm witha passive archive(p NSGA-II),a multi-objective particle swarm optimization(MOPSO),a two-phase optimization using the genetic algorithm(PR_GA),an elitist non-dominated sorting evolution strategy(ENSES),a multi-objective evolutionary algorithm based on the concept of epsilon dominance(ev MOGA),a multi-objective differential evolution algorithm(sp MODE-II),and a multi-objective dragonfly algorithm(MODA).Several criteria was used to compare performance of these algorithms.In most cases,the quality of the obtained solutions was improved when the number of generations was increased.The optimization results of running each algorithm20 times with gradually increasing number of evaluations indicated that the PR_GA algorithm had a high repeatability to explore a large area of the solution-space and achieved close-to-optimal solutions with a good diversity,followed by the p NSGA-II,ev MOGA and sp MODE-II.Uncompetitive results were achieved by the ENSES,MOPSO and MODA in most running cases.The study also found that 1400-1800 were minimum required number of evaluations to stabilize optimization results of the building energy model.
基金Project(51174151)supported by the National Natural Science Foundation of ChinaProject(2010Z19003)supported by the Major Scientific Research Program of Hubei Provincial Department of Education,ChinaProject(2010CDB03403)supported by the Natural Science Foundation of Science and Technology Department of Hubei Province,China
文摘A more effective and accurate improved Sobel algorithm has been developed to detect surface defects on heavy rails. The proposed method can make up for the mere sensitivity to X and Y directions of the Sobel algorithm by adding six templates at different directions. Meanwhile, an experimental platform for detecting surface defects consisting of the bed-jig, image-forming system with CCD cameras and light sources, parallel computer system and cable system has been constructed. The detection results of the backfin defects show that the improved Sobel algorithm can achieve an accurate and efficient positioning with decreasing interference noises to the defect edge. It can also extract more precise features and characteristic parameters of the backfin defect. Furthermore, the BP neural network adopted for defects classification with the inputting characteristic parameters of improved Sobel algorithm can obtain the optimal training precision of 0.0095827 with 106 iterative steps and time of 3 s less than Sobel algorithm with 146 steps and 5 s. Finally, an enhanced identification rate of 10% for the defects is also confirmed after the Sobel algorithm is improved.
基金supported by the National Natural Science Foundation of China (60873099)
文摘A quadratic bilevel programming problem is transformed into a single level complementarity slackness problem by applying Karush-Kuhn-Tucker（KKT） conditions.To cope with the complementarity constraints,a binary encoding scheme is adopted for KKT multipliers,and then the complementarity slackness problem is simplified to successive quadratic programming problems,which can be solved by many algorithms available.Based on 0-1 binary encoding,an orthogonal genetic algorithm,in which the orthogonal experimental design with both two-level orthogonal array and factor analysis is used as crossover operator,is proposed.Numerical experiments on 10 benchmark examples show that the orthogonal genetic algorithm can find global optimal solutions of quadratic bilevel programming problems with high accuracy in a small number of iterations.
