Clustering and Differential Evolution Algorithm for Solving Multi-objectives IPPS Problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولDifferential Evolution Algorithm for Solving Multi-objective Optimization Problems
This paper presents a modified Differential Evolution (DE) algorithm called OCMODE for solving multi-objective optimization problems. First, the initialization phase is improved by using the opposition based learning. Further, a time varying scale factor F employing chaotic sequence is used which helps to get a well distributed Pareto front by the help of non dominated and crowding distance sor...
متن کاملIntegrating Differential Evolution Algorithm with Modified Hybrid GA for Solving Nonlinear Optimal Control Problems
‎Here‎, ‎we give a two phases algorithm based on integrating differential evolution (DE) algorithm with modified hybrid genetic algorithm (MHGA) for solving the associated nonlinear programming problem of a nonlinear optimal control problem‎. ‎In the first phase‎, ‎DE starts with a completely random initial population where each individual‎, ‎or solution‎...
متن کاملMulti-objective Differential Evolution for the Flow shop Scheduling Problem with a Modified Learning Effect
This paper proposes an effective multi-objective differential evolution algorithm (MDES) to solve a permutation flow shop scheduling problem (PFSSP) with modified Dejong's learning effect. The proposed algorithm combines the basic differential evolution (DE) with local search and borrows the selection operator from NSGA-II to improve the general performance. First the problem is encoded with a...
متن کاملHybrid differential evolution algorithm for optimal clustering
The problem of optimal non-hierarchical clustering is addressed. A new algorithm combining differential evolution and k-means is proposed and tested on eight well-known real-world data sets. Two criteria (clustering validity indexes), namely TRW and VCR, were used in the optimization of classification. The classification of objects to be optimized is encoded by the cluster centers in differenti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DEStech Transactions on Computer Science and Engineering
سال: 2018
ISSN: 2475-8841
DOI: 10.12783/dtcse/iceiti2017/18846