Sciweavers

Share
89 search results - page 1 / 18
» A random-key genetic algorithm for the generalized traveling...
Sort
View
EOR
2006
118views more  EOR 2006»
9 years 2 months ago
A random-key genetic algorithm for the generalized traveling salesman problem
The Generalized Traveling Salesman Problem is a variation of the well known Traveling Salesman Problem in which the set of nodes is divided into clusters; the objective is to find...
Lawrence V. Snyder, Mark S. Daskin
PPSN
2010
Springer
9 years 25 days ago
A Hybrid Genetic Algorithm for the Traveling Salesman Problem Using Generalized Partition Crossover
We present a hybrid Genetic Algorithm that incorporates the Generalized Partition Crossover (GPX) operator to produce an algorithm that is competitive with the state of the art for...
Darrell Whitley, Doug Hains, Adele E. Howe
CORR
2008
Springer
139views Education» more  CORR 2008»
9 years 2 months ago
Generalized Traveling Salesman Problem Reduction Algorithms
The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are ...
Gregory Gutin, Daniel Karapetyan
ICNC
2009
Springer
9 years 9 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
CEC
2003
IEEE
9 years 7 months ago
Adaptive temperature schedule determined by genetic algorithm for parallel simulated annealing
Abstract- Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is ...
Mitsunori Miki, Tomoyuki Hiroyasu, Jun'ya Wako, Ta...
books