Please use this identifier to cite or link to this item:
|dc.title||Dynamic resizing for grid-based archiving in evolutionary multi-objective optimization|
|dc.identifier.citation||Rachmawati, L., Srinivasan, D. (2007). Dynamic resizing for grid-based archiving in evolutionary multi-objective optimization. 2007 IEEE Congress on Evolutionary Computation, CEC 2007 : 3975-3982. ScholarBank@NUS Repository. https://doi.org/10.1109/CEC.2007.4424989|
|dc.description.abstract||Archival of elite solutions is widespread practice in Evolutionary Multi-Objective Optimization. Grid-based archiving presents a compromise between accuracy and computational cost. Most grid-based archiving algorithms require apriori knowledge of the span of the Pareto front for pre-setting of the grid length or the associated parameter, grid number. Unfortunately the knowledge is often unavailable beforehand in practice. The quality of the attained non-dominated front can be very sensitive to the dimension of the grids. This paper presents a dynamic grid resizing strategy, capable of shrinking or expanding hyper grids as necessity dictates. Empirical study on two- and three-objective test functions demonstrates robust performance with respect to the initial grid sizes. Applied in the context of PAES, the adaptive archiving strategy performed well for initial grid sizes determined from a uniform random distribution. In comparison to AGA, the dynamic strategy presents improved non-dominated solutions in terms of proximity to the Pareto front and diversity for selected test problems. © 2007 IEEE.|
|dc.contributor.department||ELECTRICAL & COMPUTER ENGINEERING|
|dc.description.sourcetitle||2007 IEEE Congress on Evolutionary Computation, CEC 2007|
|Appears in Collections:||Staff Publications|
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.