Evolutionary boundary constraint handling scheme
Full text is not in this repository.
The performance of an optimization tool is largely determined by the efficiency of the search algorithms used in the process as well as the proper handling of complex constraints. From the implementation point of view, an important part of task ensuring an efficient algorithm to work to its best capability is to handle the boundary constraints properly and effectively. Asmost studies in the literature have focused on the development of algorithms and performance evaluation and comparison of optimization algorithms, this crucial step has not been explored very well, and consequently only limited studies have been carried out in this field. This paper intends to propose a simple and yet efficient evolutionary scheme for handling boundary constraints. The simplicity of this approach means that the proposed scheme is very easy to implement and thus can be suitable for many applications. We demonstrate this approach with an efficient algorithm, differential evolution, and we also compare it with other boundary constraint handling approaches for a wide set of benchmark problems. Based on statistical parameters and especially mean values, the results obtained by the evolutionary scheme are better than the best known solutions obtained by the existing methods.
From the issue entitled "Special Issue on LSMS2010 and ICSEE 2010"
|Keywords (uncontrolled):||Evolutionary scheme Boundary constraint Differential evolution Benchmark|
|Research Areas:||Science & Technology > Algorithms, Architecture & Networks|
|Deposited On:||15 Nov 2012 15:16|
|Last Modified:||15 May 2013 13:47|
Repository Staff Only: item control page
Full text downloads (NB count will be zero if no full text documents are attached to the record)
Downloads per month over the past year