首页 | 本学科首页   官方微博 | 高级检索  
     


Evolutionary algorithms for constrained engineering problems
Authors:Zbigniew Michalewicz  Dipankar Dasgupta  Rodolphe G Le Riche  Marc Schoenauer
Affiliation:

a Dept of Computer Science, University of North Carolina, Charlotte, NC 28223, U.S.A. and Institute of Computer Science, Polish Academy of Sciences, ul. Ofdona 21, 01-237, Warsaw, Poland

b Department of Mathematics and Computer Science, University of Missouri, St Louis, MO 63121, U.S.A.

c Université de Technologie de Compiègne, LG2mS Laboratory, Division MNM, Compiègne 60200, France

d Ecole Polytechnique, CNRS-CMAP, Palaiseau 91128, France

Abstract:Evolutionary computation techniques have been receiving increasing attention regarding their potential as optimization techniques for complex problems. Recently these techniques were applied in the area of industrial engineering; the most-known applications include scheduling and sequencing in manufacturing systems, computer-aided design, facility layout and location problems, distribution and transportation problems, and many others. Industrial engineering problems usually are quite hard to solve due to a high complexity of the objective functions and a significant number of problem-specific constraints; often an algorithm to solve such problems requires incorporation of some heuristic methods. In this paper we concentrate on constraint handling heuristics for evolutionary computation techniques. This general discussion is followed by three test case studies: truss structure optimization problem, design of a composite laminated plate, and the unit commitment problem. These are typical highly constrained engineering problems and the methods discussed here are directly transferrable to industrial engineering problems.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号