The use of dynamic programming in genetic algorithms for permutation problems

Abstract To deal with computationally hard problems, approximate algorithms are used to provide reasonably good solutions in practical time. Genetic algorithms are an example of the meta-heuristics which were recently introduced and which have been successfully applied to a variety of problems. We propose to use dynamic programming in the process of obtaining new generation solutions in the genetic algorithm, and call it a genetic DP algorithm. To evaluate the effectiveness of this approach, we choose three representative combinatorial optimization problems, the single machine scheduling problem, the optimal linear arrangement problem and the traveling salesman problem, all of which ask to compute optimum permutations of n objects and are known to be NP-hard. Computational results for randomly generated problem instances exhibit encouraging features of genetic DP algorithms.

[1]  Sungho Kang,et al.  Linear Ordering and Application to Placement , 1983, 20th Design Automation Conference Proceedings.

[2]  N. Biggs.  THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .

[3]  Ernst G. Ulrich,et al.  Clustering and linear placement , 1972, DAC '72.

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

[5]  S. Sahni,et al.  Optional linear arrangement of circuit components , 1987 .

[6]  J. David Schaffer,et al.  Proceedings of the third international conference on Genetic algorithms , 1989 .

[7]  Chris N. Potts,et al.  A decomposition algorithm for the single machine total tardiness problem , 1982, Oper. Res. Lett..

[8]  Dirk Van Gucht,et al.  The effects of population size, heuristic crossover and local improvement on a genetic algorithm for the traveling salesman problem , 1989 .

[9]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[10]  Linus Schrage,et al.  Dynamic Programming Solution of Sequencing Problems with Precedence Constraints , 1978, Oper. Res..

[11]  Daniel J. Rosenkrantz,et al.  An Analysis of Several Heuristics for the Traveling Salesman Problem , 1977, SIAM J. Comput..

[12]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[13]  Chris N. Potts,et al.  A Branch and Bound Algorithm for the Total Weighted Tardiness Problem , 1985, Oper. Res..

[14]  D. Adolphson.  Optimal linear-ordering. , 1973 .

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[17]  Emile H. L. Aarts,et al.  Genetic Local Search Algorithms for the Travelling Salesman Problem , 1990, PPSN.

[18]  T. Ibaraki,et al.  A dynamic programming method for single machine scheduling , 1994 .

[19]  D. J. Smith,et al.  A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.

[20]  George Steiner,et al.  Single Machine Scheduling with Precedence Constraints of Dimension 2 , 1984, Math. Oper. Res..

[21]  Giovanni Rinaldi,et al.  A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

[22]  Donald L. Miller,et al.  Exact Solution of Large Asymmetric Traveling Salesman Problems , 1991, Science.

[23]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[24]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[25]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[26]  George Steiner,et al.  On estimating the number of order ideals in partial orders, with some applications , 1993 .

[27]  Martin Grötschel,et al.  Solution of large-scale symmetric travelling salesman problems , 1991, Math. Program..

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