A novel genetic algorithm to solve travelling salesman problem and blocking flow shop scheduling problem

This paper presents a novel genetic algorithm GA to address a wide range of sequencing and scheduling optimisation problems. As for the performance analysis we have applied our algorithm on travelling salesman problems TSPs and flow shop scheduling problems FSPs. Our main objective is to develop an adaptive method which is equally applicable to all kind of optimisation problems with discrete decision variables. Keeping that view in mind we present some new crossover and mutation operators to tackle TSP as well as FSP with GA with path representation. We have also used a new ring parent topology to generate offspring. A new selection procedure, trio-selection procedure is applied to avoid undesirable clustering before reaching the optima. Faster convergence is assured by applying some modified mutation schemes in finding optimal order of cities in TSP and minimising the maximum completion time i.e., makespan for blocking flow shop scheduling problems. This novel GA variant ensures much better results compared to other heuristics, which is apparent from the experimental results and comparisons with other existing algorithms provided below.

[1]  Jen-Shiang Chen,et al.  Minimizing tardiness in a two-machine flow-shop , 2002, Comput. Oper. Res..

[2]  Cheng-Fa Tsai,et al.  A modified multiple-searching method to genetic algorithms for solving traveling salesman problem , 2002, IEEE International Conference on Systems, Man and Cybernetics.

[3]  Fred W. Glover,et al.  Implementation analysis of efficient heuristic algorithms for the traveling salesman problem , 2006, Comput. Oper. Res..

[4]  Lawrence Davis,et al.  Applying Adaptive Algorithms to Epistatic Domains , 1985, IJCAI.

[5]  Chandrasekharan Rajendran,et al.  Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date , 2001, Eur. J. Oper. Res..

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

[7]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

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

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

[10]  Keld Helsgaun,et al.  An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..

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

[12]  Kenji Itoh,et al.  Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge , 1995 .

[13]  Umar Al-Turki,et al.  Tabu search for a class of single-machine scheduling problems , 2001, Comput. Oper. Res..

[14]  W. Banzhaf,et al.  The “molecular” traveling salesman , 1990, Biological Cybernetics.

[15]  Colin R. Reeves,et al.  Permutation flowshop scheduling by genetic local search , 1997 .

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

[17]  Zhen Jin,et al.  An new self-organizing maps strategy for solving the traveling salesman problem , 2006 .

[18]  Anirban Mukhopadhyay,et al.  An application of genetic algorithm method for solving patrol manpower deployment problems through fuzzy goal programming in traffic management system: a case study , 2012, Int. J. Bio Inspired Comput..

[19]  D. Fogel An evolutionary approach to the traveling salesman problem , 1988, Biological Cybernetics.

[20]  Sanghamitra Bandyopadhyay,et al.  New operators of genetic algorithms for traveling salesman problem , 2004, ICPR 2004.

[21]  Jean-Yves Potvin,et al.  THE TRAVELING SALESMAN PROBLEM: A NEURAL NETWORK PERSPECTIVE , 1993 .

[22]  Claude-Nicolas Fiechter,et al.  A Parallel Tabu Search Algorithm for Large Traveling Salesman Problems , 1994, Discret. Appl. Math..

[23]  Licheng Jiao,et al.  A novel genetic algorithm based on immunity , 2000, IEEE Trans. Syst. Man Cybern. Part A.

[24]  G. Reinelt The traveling salesman: computational solutions for TSP applications , 1994 .

[25]  Débora P. Ronconi,et al.  A note on constructive heuristics for the flowshop problem with blocking , 2004 .

[26]  Rainer Leisten,et al.  Flowshop sequencing problems with limited buffer storage , 1990 .

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

[28]  Michael Pinedo,et al.  Sequencing in an Assembly Line with Blocking to Minimize Cycle Time , 1989, Oper. Res..

[29]  Tapan P. Bagchi,et al.  Minimizing makespan in a blocking flowshop using genetic algorithms , 2001 .

[30]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[31]  David S. Johnson,et al.  The Traveling Salesman Problem: A Case Study in Local Optimization , 2008 .

[32]  Hideo Tanaka,et al.  Modified simulated annealing algorithms for the flow shop sequencing problem , 1995 .

[33]  Débora P. Ronconi,et al.  A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking , 2005, Ann. Oper. Res..

[34]  Ponnuthurai N. Suganthan,et al.  A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems , 2010, Comput. Oper. Res..

[35]  Chris D. Nugent,et al.  Genetic algorithm and pure random search for exosensor distribution optimisation , 2012, Int. J. Bio Inspired Comput..

[36]  J. Grabowski,et al.  The permutation flow shop problem with blocking. A tabu search approach , 2007 .

[37]  Klaus H. Ecker,et al.  Scheduling Computer and Manufacturing Processes , 2001 .

[38]  Débora P. Ronconi,et al.  Some heuristic algorithms for total tardiness minimization in a flowshop with blocking , 2009 .

[39]  Uday Kumar Chakraborty,et al.  Floating-point to integer mapping schemes in differential evolution for permutation flow shop scheduling , 2010, Int. J. Bio Inspired Comput..

[40]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[41]  Jon Jouis Bentley,et al.  Fast Algorithms for Geometric Traveling Salesman Problems , 1992, INFORMS J. Comput..

[42]  Christos Koulamas,et al.  A new constructive heuristic for the flowshop scheduling problem , 1998, Eur. J. Oper. Res..

[43]  Cheng-Yan Kao,et al.  An evolutionary algorithm for large traveling salesman problems , 2004, IEEE Trans. Syst. Man Cybern. Part B.

[44]  Martin Zachariasen,et al.  Tabu Search on the Geometric Traveling Salesman Problem , 1996 .

[45]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.