53,197 Hits in 8.7 sec


2015 Anadolu University Journal of Science and Technology. A : Applied Sciences and Engineering  
The minimum vertex cover problem belongs to the class of NP-compl ete graph theoretical problems. This paper presents a hybrid genetic algorithm to solve minimum ver tex cover problem.  ...  In this paper, it has been shown that when local optimization technique is added t o genetic algorithm to form hybrid genetic algorithm, it gives more quality solution than simple genet ic algorithm.  ...  Urfat Nuriyev for many helpful discussions.  ... 
doaj:97aa3e6a063949dd9d94480203f1c57f fatcat:6oxnj5e2ovar3fcdqtjjf556iq

A hybrid mapping algorithm for reconfigurable nanoarchitectures

Hessa K. Al-Mutairi, Imtiaz Ahmad
2015 Maǧallaẗ al-abḥāṯ al-handasiyyaẗ  
An independent set S in a graph G is a subset of nodes that are disconnected. The maximum independent set is an independent set with the maximum number of nodes.  ...  The proposed hybrid method utilizes a new search space by integrating a known fast problem specific heuristic with the genetic algorithm.  ... 
doi:10.7603/s40632-015-0004-9 fatcat:yb7oboucanhy5guclehv42ylea

Page 621 of The Journal of the Operational Research Society Vol. 48, Issue 6 [page]

1997 The Journal of the Operational Research Society  
In this paper, we have proposed a genetic algorithm-based heuristic in order to solve well the weighted maximum independent set and some equivalent problems.  ...  Conclusions Weighted maximum independent set, minimum vertex cover, maximum set packing and maximum clique are classic graph optimization problems that are NP-complete even to approximate well.  ... 

A Hybrid Dual-Population Genetic Algorithm for the Single Machine Maximum Lateness Problem [chapter]

Veronique Sels, Mario Vanhoucke
2011 Lecture Notes in Computer Science  
We developed a hybrid dual-population genetic algorithm and compared its performance with alternative methods on a new diverse data set.  ...  Based on a comprehensive literature study on genetic algorithms in single machine scheduling, a fair comparison of genetic operators was made.  ...  In this paper, we present a hybrid genetic algorithm for the single machine maximum lateness problem with ready times and distinct due dates.  ... 
doi:10.1007/978-3-642-20364-0_2 fatcat:2fy63ufpkbd2tdocu62wawsj4i

A hybrid algorithm for the sum coloring problem

Sidi Mohamed Douiri, Souad El Bernoussi
2011 2011 International Conference on Multimedia Computing and Systems  
Our resolution approach is based on an hybridization of a genetic algorithm and a local heuristic based on an improvement of the maximal independent set algorithm given by F.Glover [4] .  ...  The problem (MSCP) consists in minimizing the sum of colors in a graph.  ...  The independent set problem of maximum cardinality and the graph coloring problem are correlated.  ... 
doi:10.1109/icmcs.2011.5945684 fatcat:3zbaz4n2pvdk5byg22cb64klja

Application Of Hybrid Genetic Algorithm Based On Simulated Annealing In Function Optimization

Panpan Xu, Shulin Sui, Zongjie Du
2015 Zenodo  
A hybrid genetic algorithm based on simulated annealing is designed by combining the advantages of genetic algorithm and simulated annealing algorithm.  ...  Genetic algorithm is widely used in optimization problems for its excellent global search capabilities and highly parallel processing capabilities; but, it converges prematurely and has a poor local optimization  ...  In order to solve the problem, designing a hybrid genetic algorithm is one of the effective ways.  ... 
doi:10.5281/zenodo.1110709 fatcat:2dodysps4jacxfm63ww5h2enze

Application of Hybrid Genetic Algorithm Routine in Optimizing Food and Bioengineering Processes

Jaya Tumuluru, Richard McCulloch
2016 Foods  
For each case study, the hybrid genetic algorithm found a better optimum candidate than reported by the sources.  ...  The new hybrid genetic algorithm developed is applied to the Ackley benchmark function as well as case studies in food, biofuel, and biotechnology processes.  ...  Abbreviations The following abbreviations are used in this manuscript: GA Genetic Algorithm HGA Hybrid Genetic Algorithm RSM Response Surface Methodology FAME Fatty Acid Methyl Ester  ... 
doi:10.3390/foods5040076 pmid:28231171 pmcid:PMC5302424 fatcat:wp5tcyn6ojbjxiv76ula2kzosm

A Hybridized Chemotactic Genetic Algorithm for Optimization

Prabhash Kr Singh, Shyamal Kr Mondal
2016 Journal of computer science and systems biology  
This paper presents a new hybridized genetic algorithm for optimization of a function with several variables.  ...  Citation: Singh PK, Mondal SK, Maiti M (2016) A Hybridized Chemotactic Genetic Algorithm for Optimization. J Comput Sci Syst Biol 9: 045-050.  ...  a new hybridized Chemotactic Genetic Algorithm.  ... 
doi:10.4172/jcsb.1000220 fatcat:wumgmty3tzghbhi2qn66nozl6y

Estimation of Multilevel Simultaneous Equation Models through Genetic Algorithms

Rocío Hernández-Sanjaime, Martín González, Jose J. López-Espín
2020 Mathematics  
A hybrid metaheuristic that combines a genetic algorithm and an optimization method has been developed to overcome both technical and analytical limitations in the general case when the covariance structure  ...  The maximum likelihood estimation of the parameters of an MSEM has been set forth.  ...  The authors would like to thank the anonymous reviewers for their constructive comments and useful suggestions. Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/math8122098 fatcat:omi3jiohbfhobg6sljx4sesxiu

Hybrid Genetic Algorithms Are Better for Spatial Clustering [chapter]

Vladimir Estivill-Castro
2000 Lecture Notes in Computer Science  
We can then construct hybrids (genetic algorithms with a mutation operation that performs few gradient descent steps) for all three clustering approaches.  ...  We can then construct hybrids (genetic algorithms with a mutation operation that performs few gradient descent steps) for all three clustering approaches.  ...  Our approach to hybrid algorithms is a tightly coupled approach rather than a serialisation of iterative methods with genetic algorithms.  ... 
doi:10.1007/3-540-44533-1_44 fatcat:ps7xd5223zg4jkfqje3tu7g45q

A low-level hybridization between memetic algorithm and VNS for the max-cut problem

Abraham Duarte, Ángel Sánchez, Felipe Fernández, Raúl Cabido
2005 Proceedings of the 2005 conference on Genetic and evolutionary computation - GECCO '05  
Moreover, on a set of standard test problems, new best known solutions were produced for several instances.  ...  This algorithm is tested and compared with the results, found in the bibliography, obtained by other hybrid metaheuristics for the same problem.  ...  [17] proposes a hybrid genetic algorithm (memetic algorithm) for the Max-Cut problem.  ... 
doi:10.1145/1068009.1068178 dblp:conf/gecco/DuarteSFC05 fatcat:6eczil7zf5bavdtvzgwemejvoy

A new hybrid genetic algorithm for global optimization

D.G. Sotiropoulos, E.C. Stavropoulos, M.N. Vrahatis
1997 Nonlinear Analysis  
Evaluate the new individuals; All genetic algorithms have run for the same set of parameters.  ...  In this paper a Hybrid Interval Genetic algorithm (HIG) is presented.  ... 
doi:10.1016/s0362-546x(96)00367-7 fatcat:zbvamszi5vb6pbwbagboizfgt4

Hybrid Genetic-simulated Annealing Algorithm for Optimal Weapon Allocation in Multilayer Defence Scenario

Sanjay Bisht
2004 Defence Science Journal  
The new hybrid algorithm has been applied to optimal weapon allocation in multilayer defence scenario problem to arrive at a better solution than produced by genetic algorithm or simulated annealing alone  ...  This paper describes a new hybrid optimisation method, named genetic-simulated annealing, that combines the global crossover operators from genetic algorithm and the local stochastic hill-climbing features  ...  APPLICATION OF GENETIC-SIMULATED ALGORITHM The new hybrid algorithm has been applied to optimal weapon allocation in multilayer defence scenario problem to arrive at a better solution than produced by  ... 
doi:10.14429/dsj.54.2054 fatcat:iij4jqjiffgt7bdhrbu6b436oq

A new genetic local search algorithm for graph coloring [chapter]

RaphaËl Dorne, Jin-Kao Hao
1998 Lecture Notes in Computer Science  
This paper presents a new genetic local search algorithm for the graph coloring problem.  ...  The algorithm combines an original crossover based on the notion of union of independent sets and a powerful local search operator (tabu search).  ...  The maximum number of moves (iterations) for our hybrid algorithm is xed to be 10 000 000 moves for an attempt of nding a proper k-coloring.  ... 
doi:10.1007/bfb0056916 fatcat:7b6nrjqumnck7gs5xx3ldmsypu

Direction of Arrival (DOA) Estimation in an Array of Antennas using Derivative-Free Methods

Raees M.Asif, Shahzada Alamgir, Junaid Ali Khan
2015 International Journal of Computer Applications  
A scenario based simulation has been performed by taking different number of antenna elements with varying sources.  ...  In this paper, direction of arrival estimation has been addressed using derivative free methods and their hybrid procedure in antenna array signal processing.  ...  Step 6: Store the results of the hybrid approach for 100 independent runs to see the convergence and robustness of the algorithm.  ... 
doi:10.5120/20285-2841 fatcat:inwdlqjuwbfoncxibgirexijvu
« Previous Showing results 1 — 15 out of 53,197 results