Multiobjective Optimization Based on Rough Set Theory

Multiobjective Optimization Based on Rough Set Theory

EnglishPaperback / softbackPrint on demand
Abd Elsameea Hussein, Mohamed
LAP Lambert Academic Publishing
EAN: 9783659846854
Print on demand
Delivery on Friday, 28. of August 2026
CZK 1,453
Common price CZK 1,614
Discount 10%
pc
Do you want this product today?
Megabooks Praha Korunní
not available
Librairie Francophone Praha Štěpánská
not available
Megabooks Ostrava
not available
Megabooks Olomouc
not available
Megabooks Plzeň
not available
Megabooks Brno
not available
Megabooks Hradec Králové
not available
Megabooks České Budějovice
not available
Megabooks Liberec
not available

Detailed information

In this book we present a new optimization algorithm, the proposed algorithm operates in two phases: in the first one, multiobjective version of genetic algorithm is used as search engine in order to generate approximate true Pareto front. This algorithm based on concept of co-evolution and repair algorithm for handling nonlinear constraints. Also it maintains a finite-sized archive of non-dominated solutions which gets iteratively updated in the presence of new solutions based on the concept of -dominance. Then, in the second stage, rough set theory is adopted as local search engine in order to improve the spread of the solutions found so far. The results, provided by the proposed algorithm for benchmark problems, are promising when compared with exiting well-known algorithms. Also, our results suggest that our algorithm is better applicable for solving real-world application problems (Economic Environmental Dispatch of Power Systems).
EAN 9783659846854
ISBN 3659846856
Binding Paperback / softback
Publisher LAP Lambert Academic Publishing
Pages 128
Language English
Dimensions 220 x 150
Authors Abd Elsameea Hussein, Mohamed; Allah A. Mousa, Abd; Elsawy, Ahmed A.
Manufacturer information
The manufacturer's contact information is currently not available online, we are working intensively on the axle. If you need information, write us on [email protected], we will be happy to provide it.