Selection of Initial Solutions for Local Search in Multiobjective Genetic Local Search
نویسندگان
چکیده
منابع مشابه
A novel local search method for microaggregation
In this paper, we propose an effective microaggregation algorithm to produce a more useful protected data for publishing. Microaggregation is mapped to a clustering problem with known minimum and maximum group size constraints. In this scheme, the goal is to cluster n records into groups of at least k and at most 2k_1 records, such that the sum of the within-group squ...
متن کاملA Hybrid Algorithm using Firefly, Genetic, and Local Search Algorithms
In this paper, a hybrid multi-objective algorithm consisting of features of genetic and firefly algorithms is presented. The algorithm starts with a set of fireflies (particles) that are randomly distributed in the solution space; these particles converge to the optimal solution of the problem during the evolutionary stages. Then, a local search plan is presented and implemented for searching s...
متن کاملBalance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling
This paper shows how the performance of evolutionary multiobjective optimization (EMO) algorithms can be improved by hybridization with local search. The main positive effect of the hybridization is the improvement in the convergence speed to the Pareto front. On the other hand, the main negative effect is the increase in the computation time per generation. Thus, the number of generations is d...
متن کاملController Placement in Software Defined Network using Iterated Local Search
Software defined network is a new computer network architecture who separates controller and data layer in network devices such as switches and routers. By the emerge of software defined networks, a class of location problems, called controller placement problem, has attracted much more research attention. The task in the problem is to simultaneously find optimal number and location of controll...
متن کاملLocal Search for Multiobjective Optimization of Steel Frames
A single-point local search method is presented as a simplification of the multiobjective tabu search. Some improvements are made to reach the Pareto front within small number of function evaluations. The performance of the proposed method is first verified by a small mathematical problem. It is shown that accurate Pareto optimal solutions with good diversity are obtained by using the proposed ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Institute of Systems, Control and Information Engineers
سال: 2010
ISSN: 1342-5668,2185-811X
DOI: 10.5687/iscie.23.178