Exploration of Genetic Parameters and Operators through Travelling Salesman Problem

In this paper, we describe the use of advanced statistical design in the screening experiment to configure parameters and operators of genetic algorithm (GA), which applied to find a shortest distance in a classical travelling salesman problem (TSP). Due to the number of GA parameters, operators and its levels considered in the experiment, the total numbers of program executions required by the proposed design (in which an one-ninth fractional factorial experimental design is embedded within a full Latin Square) were dramatically decreased from 6,561 (using full factorial design) to 81 runs for each replication. The analysis of simulation results based on 36 cities TSP in Thailand indicated that all GA parameters and operators except the probability of mutation were statistically significant. Although the mutation operator was significant, the results were however not particularly sensitive to the degree of mutation with 95% confident level. The appropriate settings of these parameters and operators found in the screening experiment were then applied to solve 76 cities travelling problem in the sequential experiment, which aimed to compare the results obtained from the GA using the best setting found in this work and those results with settings suggested in previous research. It was found that the distance obtained from GA using our finding on the parameters' setting outperformed the settings suggested by other research.

[1]  Heinz Mühlenbein,et al.  Evolution algorithms in combinatorial optimization , 1988, Parallel Comput..

[2]  Haldun Aytug,et al.  Use of genetic algorithms to solve production and operations management problems: A review , 2003 .

[3]  Margaret J. Robertson,et al.  Design and Analysis of Experiments , 2006, Handbook of statistics.

[4]  L. Darrell Whitley,et al.  A Comparison of Genetic Sequencing Operators , 1991, ICGA.

[5]  Lawrence Davis,et al.  Job Shop Scheduling with Genetic Algorithms , 1985, ICGA.

[6]  Mitsuo Gen,et al.  Genetic algorithms and engineering design , 1997 .

[7]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[8]  Darrell Whitley,et al.  Scheduling problems and traveling salesman: the genetic edge recombination , 1989 .

[9]  David E. Goldberg,et al.  Alleles, loci and the traveling salesman problem , 1985 .

[10]  Jacek Blazewicz,et al.  The job shop scheduling problem: Conventional and new solution techniques , 1996 .

[11]  Hideo Tanaka,et al.  Genetic algorithms for flowshop scheduling problems , 1996 .

[12]  P. Pongcharoena,et al.  Determining optimum Genetic Algorithm parameters for scheduling the manufacturing and assembly of complex products , 2002 .

[13]  S. S. Chaudhry *,et al.  Application of genetic algorithms in production and operations management: a review , 2005 .

[14]  David S. Todd,et al.  MULTIPLE CRITERIA GENETIC ALGORITHMS IN ENGINEERING DESIGN AND OPERATION , 1997 .

[15]  Pedro Larrañaga,et al.  Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators , 1999, Artificial Intelligence Review.

[16]  Christian Hicks,et al.  Applying designed experiments to optimize the performance of genetic algorithms used for scheduling complex products in the capital goods industry , 2001 .

[17]  Hisao Ishibuchi,et al.  Performance evaluation of genetic algorithms for flowshop scheduling problems , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[18]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[19]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[20]  Andreas C. Nearchou,et al.  The effect of various operators on the genetic search for large scheduling problems , 2004 .

[21]  David E. Goldberg,et al.  AllelesLociand the Traveling Salesman Problem , 1985, ICGA.

[22]  Omar Ghrayeb,et al.  A study of optimizing the performance of genetic algorithms using design-of-experiments in job-shop scheduling application , 2005 .

[23]  M. Gen,et al.  Study on multi-stage logistic chain network: a spanning tree-based genetic algorithm approach , 2002 .