Genetic operators for combinatorial optimization in TSP and microarray gene ordering

@article{Ray2006GeneticOF,
  title={Genetic operators for combinatorial optimization in TSP and microarray gene ordering},
  author={Shubhra Sankar Ray and Sanghamitra Bandyopadhyay and Sankar K. Pal},
  journal={Applied Intelligence},
  year={2006},
  volume={26},
  pages={183-195}
}
This paper deals with some new operators of genetic algorithms and demonstrates their effectiveness to the traveling salesman problem (TSP) and microarray gene ordering. The new operators developed are nearest fragment operator based on the concept of nearest neighbor heuristic, and a modified version of order crossover operator. While these result in faster convergence of Genetic Algorithm (GAs) in finding the optimal order of genes in microarray and cities in TSP, the nearest fragment… 
Best-order crossover for permutation-based evolutionary algorithms
TLDR
The best-order recombination operator for permutation-based encoding using genetic information from the two parents and from the best individual obtained up to the current generation is described and analyzed.
A novel ODV crossover operator-based genetic algorithms for traveling salesman problem
TLDR
An ordered distance vector-based crossover operator is proposed that exclusively exploits the advantages of individuals’ generated using the same initialization methods to attain the complete convergence, particularly for most of the large-sized test instances considered.
An Efficient Hybrid Genetic Algorithm for Performance Enhancement in solving Travelling Salesman Problem
This paper, proposes a solution for Travelling Salesman Problem (TSP) (1), using Genetic Algorithm (GA). The proposed algorithm works on data sets of latitude and longitude coordinates of cities and
Dynamic Reduction-Expansion Operator to Improve Performance of Genetic Algorithms for the Traveling Salesman Problem
TLDR
Experiments performed on TSP instances with more than 150 nodes provided evidence that RedExp can improve convergence of the GA and provide more suitable solutions than other approaches focused on the GA’s initial population.
A New Approach to Solve Traveling Salesman Problem Using Genetic Algorithm Based on Heuristic Crossover and Mutation Operator
TLDR
Experimental results demonstrate that proposed algorithm due to the heuristic performance is not easily getting stuck in local optima and has a reasonable convergent speed to reach the global optimal solution.
A New Hybrid Genetic and Simulated Annealing Algorithm to Solve the Traveling Salesman Problem
The Traveling Salesman Problem (TSP) is one of the most widely known nondeterministic polynomial (NPhard) problems. It is used to check the efficacy of any combinatorial optimization method, and is
Genetic algorithm and a double-chromosome implementation to the traveling salesman problem
  • Amin Riazi
  • Computer Science
    SN Applied Sciences
  • 2019
TLDR
The double-chromosome approach has been tested with a variety of traveling salesman problems, and the results indicated that the proposed method has a high rate of convergence toward the shortest tour.
Introducing Gene Clusters into a P2P Based TSP Solving Algorithm
TLDR
A P2P based TSP genetic algorithm P2PTSPGA which make use of gene clusters is presented which has a high performance in solving such TSPs that number of cities is less than 5000.
Introducing Gene Clusters into a P2P Based TSP Solving Algorithm
TLDR
A P2P based TSP genetic algorithm P2PTSPGA which make use of gene clusters is presented which has a high performance in solving such TSPs that number of cities is less than 5000.
Performance Evaluation of Population Seeding Techniques of Permutation-Coded GA Traveling Salesman Problems Based Assessment
Genetic algorithms (GAs) are a population-based meta-heuristic global optimization technique for dealing with complex problems with a very large search space. The population initialization is a
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 44 REFERENCES
An evolutionary algorithm for large traveling salesman problems
TLDR
Findings imply that the proposed method can find tours robustly with a fixed small population and a limited family competition length in reasonable time, when used to solve large TSPs.
A Comparison of Genetic Sequencing Operators
TLDR
This work compares six sequencing operators that have been developed for use with genetic algorithms and indicates that the eeective-ness of diierent operators is dependent on the problem domain.
Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators
TLDR
This paper presents crossover and mutation operators, developed to tackle the Travelling Salesman Problem with Genetic Algorithms with different representations such as: binary representation, path representation, adjacency representation, ordinal representation and matrix representation.
A modified multiple-searching method to genetic algorithms for solving traveling salesman problem
This paper proposes a new method of a modified multiple-searching genetic algorithm (MMGA) for solving traveling salesman problems (TSPs). The proposed approach can find the optimal solutions quickly
The Traveling Salesman Problem: A Case Study in Local Optimization
TLDR
This chapter discusses how various approaches to combinatorial optimization have been adapted to the TSP and evaluates their relative success in this perhaps atypical domain from both a theoretical and an experimental point of view.
A Parallel Tabu Search Algorithm for Large Traveling Salesman Problems
  • C. Fiechter
  • Computer Science, Mathematics
    Discret. Appl. Math.
  • 1994
Finding the Optimal Gene Order in Displaying Microarray Data
TLDR
A hybrid genetic algorithm for finding the optimal order of microarray data, or gene expression profiles, is proposed, formulated as a new type of traveling salesman problem and applied to the problem.
Applying Genetic Algorithms To Finding The Optimal Gene Order In Displaying The Microarray Data
TLDR
Using FCGA, the Family Competition Genetic Algorithm is applied to analyze DNA-microarray data and results indicate that FCGA performs very robustly and is very competitive with other approaches.
...
1
2
3
4
5
...