• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.10 no.4
• /
• pp.128-134
• /
• 2011

Note that k-anonymity algorithm has been widely discussed in the area of privacy protection. In this paper, a new search algorithm to achieve k-anonymity for database application is introduced. A lattice is introduced to form a solution space for a k-anonymity problem and then a hybrid search method composed of tabu search and genetic algorithm is proposed. In this algorithm, the tabu search plays the role of mutation in the genetic algorithm. The hybrid method with independent tabu search and genetic algorithm is compared, and the hybrid approach performs the best in average case.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.4 no.3
• /
• pp.259-265
• /
• 2004

In this study, a hybrid genetic algorithm merged with simulated annealing is presented to solve nonlinear channel blind equalization problems. The equalization of nonlinear channels is more complicated one, but it is of more practical use in real world environments. The proposed hybrid genetic algorithm with simulated annealing is used to estimate the output states of nonlinear channel, based on the Bayesian likelihood fitness function, instead of the channel parameters. By using the desired channel states derived from these estimated output states of the nonlinear channel, the Bayesian equalizer is implemented to reconstruct transmitted symbols. In the simulations, binary signals are generated at random with Gaussian noise. The performance of the proposed method is compared with those of a conventional genetic algorithm(GA) and a simplex GA. In particular, we observe a relatively high accuracy and fast convergence of the method.

• ETRI Journal
• /
• v.43 no.2
• /
• pp.260-271
• /
• 2021

This paper addresses Very large-scale integration (VLSI) placement optimization, which is important because of the rapid development of VLSI design technologies. The goal of this study is to develop a hybrid algorithm for VLSI placement. The proposed algorithm includes a sequential combination of a genetic algorithm and an evolutionary algorithm. It is commonly known that local search algorithms, such as random forest, hill climbing, and variable neighborhoods, can be effectively applied to NP-hard problem-solving. They provide improved solutions, which are obtained after a global search. The scientific novelty of this research is based on the development of systems, principles, and methods for creating a hybrid (combined) placement algorithm. The principal difference in the proposed algorithm is that it obtains a set of alternative solutions in parallel and then selects the best one. Nonstandard genetic operators, based on problem knowledge, are used in the proposed algorithm. An investigational study shows an objective-function improvement of 13%. The time complexity of the hybrid placement algorithm is O(N2).

• Journal of Computational Design and Engineering
• /
• v.2 no.3
• /
• pp.137-147
• /
• 2015

In this study, a new methodology in predicting a system output has been investigated by applying a data mining technique and a hybrid type II fuzzy system in CNC turning operations. The purpose was to generate a supplemental control function under the dynamic machining environment, where unforeseeable changes may occur frequently. Two different types of membership functions were developed for the fuzzy logic systems and also by combining the two types, a hybrid system was generated. Genetic algorithm was used for fuzzy adaptation in the control system. Fuzzy rules are automatically modified in the process of genetic algorithm training. The computational results showed that the hybrid system with a genetic adaptation generated a far better accuracy. The hybrid fuzzy system with genetic algorithm training demonstrated more effective prediction capability and a strong potential for the implementation into existing control functions.

• Journal of the Korea Safety Management & Science
• /
• v.13 no.3
• /
• pp.107-114
• /
• 2011

Traveling salesman problem is to minimize the total cost for a traveling salesman who wants to make a tour given finite number of cities along with the cost of travel between each pair them, visiting each cities exactly once before returning home. Traveling salesman problem is known to be NP-hard, and it needs a lot of computing time to get the optimal solution, so that heuristics are more frequently developed than optimal algorithms. This study suggests a hybrid parallel genetic algorithm(HPGA) for traveling salesman problem The suggested algorithm combines parallel genetic algorithm, nearest neighbor search, and 2-opt. The suggested algorithm has been tested on 7 problems in TSPLIB and compared the results of existing methods(heuristics, meta-heuristics, hybrid, and parallel). Experimental results shows that HPGA could obtain good solution in total travel distance minimization.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.18 no.33
• /
• pp.111-118
• /
• 1995

This paper suggests a hybrid genetic algorithm for asymmetric traveling salesman problem(TSP). The TSP was proved to be NP-complete, so it is difficult to find optimal solution in reasonable time. Therefore it is important to develope an algorithm satisfying robustness. The algorithm applies dynamic programming to find initial solution. The genetic operator is uniform order crossover and scramble sublist mutation. And experiment of parameterization has been performed.

• The KIPS Transactions:PartB
• /
• v.14B no.5
• /
• pp.369-376
• /
• 2007

This paper proposes a hybrid genetic algorithm(HGA) for the classifier ensemble selection. HGA is added a local search operation for increasing the fine-turning of local area. This paper apply hybrid and simple genetic algorithms(SGA) to the classifier ensemble selection problem in order to show the superiority of HGA. And this paper propose two methods(SSO: Sequential Search Operations, CSO: Combinational Search Operations) of local search operation of hybrid genetic algorithm. Experimental results show that the HGA has better searching capability than SGA. The experiments show that the CSO considering the correlation among classifiers is better than the SSO.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.2
• /
• pp.59-68
• /
• 2001

The job shop scheduling problem is not only NP-hard, but is one of the well known hardest combinatorial optimization problems. The goal of this research is to develop an efficient scheduling method based on hybrid genetic algorithm to address job shop scheduling problem. In this scheduling method, generating method of initial population, new genetic operator, selection method are developed. The scheduling method based on genetic algorithm are tested on standard benchmark job shop scheduling problem. The results were compared with another genetic algorithm0-based scheduling method. Compared to traditional genetic, algorithm, the proposed approach yields significant improvement at a solution.

• The Journal of Information Systems
• /
• v.17 no.3
• /
• pp.39-58
• /
• 2008

Mixed Chinese Postman Problem (MCPP) is a practical generalization of the classical Chinese Postman Problem (CPP) and it could be applied in many real world. Although MCPP is useful in terms of reality, MCPP has been proved to be a NP-complete problem. To find optimal solutions efficiently in MCPP, we can reduce searching space to be small effective searching space containing optimal solutions. We propose GENIIS methodology, which is a kind of hybrid algorithm combines the approximate algorithms and genetic algorithm. To get good solutions in the effective searching space, GENIIS uses approximate algorithm and genetic algorithm. This paper validates the usefulness of the proposed approach in a simulation. The results of our paper could be utilized to increase the efficiencies of network and transportation in business.

• Proceedings of the KSME Conference
• /
• 2003.04a
• /
• pp.1639-1644
• /
• 2003

A hybrid genetic algorithm is developed for estimating the wall emissivities for an absorbing, emitting, and scattering media in a two-dimensional irregular geometry with diffusely emitting and reflecting opaque boundaries by minimizing an objective function, which is expressed by the sum of square errors between estimated and measured temperatures at only four data positions. The finite-volume method was employed to solve the radiative transfer equation for a two-dimensional irregular geometry. The results show that a developed hybrid genetic algorithms reduce the effect of genetic parameters on the performance of genetic algorithm and that the wall emissivities are estimated accurately without measurement errors.