Best Individuals Of Population Research Articles

An enhanced hybrid genetic algorithm for solving traveling salesman problem

<span>Robust known the exceedingly famed NP-hard problem in combinatorial optimization is the Traveling Salesman Problem (TSP), promoting the skillful algorithms to get the solution of TSP have been the burden for several scholars. For inquiring global optimal solution, the presented algorithm hybridizes genetic and local search algorithm to take out the uplifted quality results. The genetic algorithm gives the best individual of population by enhancing both cross over and mutation operators while local search gives the best local solutions by testing all neighbor solution. By comparing with the conventional genetic algorithm, the numerical outcomes acts that the presented algorithm is more adequate to attain optimal or very near to it. Problems arrested from the TSP library strongly trial the algorithm and shows that the proposed algorithm can reap outcomes within reach optimal. For more details, please download TEMPLATE HELP FILE from the website.</span>

Analysis of New Distributed Differential Evolution Algorithm with Best Determination Method and Species Evolution

This is a new semi-distributed differential evolution algorithm with best determination method and species evolution (DESBS). This algorithm is based on fact- evolution of species around niche. In DESBS, the best determination method determines the best individuals of population. These best individuals act as niches and the species are evolved around these best individuals. Over the period of time, each species evolved separately, using standard differential evolution algorithm. The evolving efficiency of each species evaluated separately and inefficient species are merge to nearby species. The scale-up study is performed to find out best parameter setting and the results are compared with other state-of-art algorithms like CoDE, EPSDE and standard differential evolution algorithm. The results show that the DESBS perform better than SDE in multimodal functions and CoDE, EPSDE in rotating optimization function