Sciweavers

Share
52 search results - page 1 / 11
» An Improved Greedy Genetic Algorithm for Solving Travelling ...
Sort
View
ICNC
2009
Springer
9 years 10 months ago
An Improved Greedy Genetic Algorithm for Solving Travelling Salesman Problem
—Genetic algorithm (GA) is too dependent on the initial population and a lack of local search ability. In this paper, an improved greedy genetic algorithm (IGAA) is proposed to o...
Zhenchao Wang, Haibin Duan, Xiangyin Zhang
GECCO
2007
Springer
289views Optimization» more  GECCO 2007»
9 years 10 months ago
A discrete particle swarm optimization algorithm for the generalized traveling salesman problem
Dividing the set of nodes into clusters in the well-known traveling salesman problem results in the generalized traveling salesman problem which seeking a tour with minimum cost p...
Mehmet Fatih Tasgetiren, Ponnuthurai N. Suganthan,...
EAAI
2016
4 years 7 days ago
An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems
Bat algorithm is a population metaheuristic proposed in 2010 which is based on the echolocation or bio-sonar characteristics of microbats. Since its first implementation, the bat...
Eneko Osaba, Xin-She Yang, Fernando Díaz, P...
EVOW
2004
Springer
9 years 9 months ago
Improving Edge Recombination through Alternate Inheritance and Greedy Manner
Genetic Algorithms (GAs) are well-known heuristic algorithms and have been widely applied to solve combinatorial problems. Edge recombination is one of the famous crossovers design...
Chuan-Kang Ting
books