Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Parallel genetic algorithms for a hypercube
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Parallel Computer Architecture: A Hardware/Software Approach
Parallel Computer Architecture: A Hardware/Software Approach
Genetic Algorithms for the Traveling Salesman Problem
Proceedings of the 1st International Conference on Genetic Algorithms
Distributed Genetic Algorithms
Proceedings of the 3rd International Conference on Genetic Algorithms
Proceedings of the 5th International Conference on Genetic Algorithms
On Solving Travelling Salesman Problems by Genetic Algorithms
PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature
Computer simulations of genetic adaptation: parallel subcomponent interaction in a multilocus model
Computer simulations of genetic adaptation: parallel subcomponent interaction in a multilocus model
Paper: The parallel genetic algorithm as function optimizer
Parallel Computing
IEEE Transactions on Evolutionary Computation
Solving traveling salesman problem on high performance computing using message passing interface
CIMMACS'08 Proceedings of the 7th WSEAS international conference on Computational intelligence, man-machine systems and cybernetics
Solving traveling salesman problem on cluster compute nodes
WSEAS Transactions on Computers
Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times
Journal of Computational and Applied Mathematics
Using graphical information systems to improve vehicle routing problem instances
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
| Hi-index | 0.00 |
In this paper we investigate the design of a coarse-grained parallel implementation of Cga-LK, a hybrid heuristic for the Traveling Salesman Problem (TSP). Cga-LK exploits a compact genetic algorithm in order to generate high-quality tours which are then refined by means of an efficient implementation of the Lin-Kernighan local search heuristic. The results of several experiments conducted on a cluster of workstations with different TSP instances show the efficacy of the parallelism exploitation.