Optimization Drilling Sequence by Genetic Algorithm

In this paper, a Genetic Algorithm (GA) is used for the travelling salesman problem (TSP) to reduced total time and distance of tool travel for drilling sequence. By using Traveling salesman problem, it become a little bit simple and less time consuming. But there are many possible sequences in TSP. So there is need to find out the best possible solution so that the process becomes more efficient and less time consumer. By using GENETIC ALGORITHM in MTLAB software, I got best possible sequence in TSP.

[1]  S. Chatterjee,et al.  Genetic algorithms and traveling salesman problems , 1996 .

[2]  Ángel Goñi Moreno,et al.  SOLVING TRAVELLING SALESMAN PROBLEM IN A SIMULATION OF GENETIC ALGORITHMS WITH DNA , 2008 .

[3]  R. Storn,et al.  Differential Evolution - A simple and efficient adaptive scheme for global optimization over continuous spaces , 2004 .

[4]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[5]  Vassil Smarkov,et al.  Genetic operators crossover and mutation in solving the TSP problem , 2005 .

[6]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

[7]  Gregory Gutin,et al.  The traveling salesman problem , 2006, Discret. Optim..

[8]  Sanghamitra Bandyopadhyay,et al.  Genetic operators for combinatorial optimization in TSP and microarray gene ordering , 2007, Applied Intelligence.

[9]  K. Deb,et al.  Optimal Scheduling of Casting Sequence Using Genetic Algorithms , 2003 .

[10]  Karan Bhatia,et al.  Genetic Algorithms and the Traveling Salesman Problem , 1994 .

[11]  E. Aarts,et al.  Boltzmann machines for travelling salesman problems , 1989 .

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

[13]  Arthur E. Carter,et al.  Design and Application of Genetic Algorithms for the Multiple Traveling Salesperson Assignment Problem , 2003 .

[14]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[15]  Annamalai Murugappan.  Total completion time minimization in a drilling sequence problem considering tool wear:an Ant algorithms approach , 2005 .

[16]  Fanggeng Zhao,et al.  A hybrid genetic algorithm for the traveling salesman problem with pickup and delivery , 2009, Int. J. Autom. Comput..

[17]  Rainer Storn,et al.  Differential Evolution-A simple evolution strategy for fast optimization , 1997 .

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

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

[20]  William J. Cook,et al.  Solution of a Large-Scale Traveling-Salesman Problem , 1954, 50 Years of Integer Programming.

[21]  Jaafar Abouchabaka,et al.  A Comparative Study of Adaptive Crossover Operators for Genetic Algorithms to Resolve the Traveling Salesman Problem , 2011, ArXiv.

[22]  Hamdy A. Taha,et al.  Operations Research: An Introduction, 8/e , 2008 .