Genetic operators for combinatorial optimization in TSP and microarray gene ordering
DOI10.1007/s10489-006-0018-yzbMath1189.90216DBLPjournals/apin/RayBP07OpenAlexW2089962093WikidataQ56067390 ScholiaQ56067390MaRDI QIDQ2383954
Sanghamitra Bandyopadhyay, Shubhra Sankar Ray, Sankar Kumar Pal
Publication date: 20 September 2007
Published in: Applied Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10489-006-0018-y
Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Neural networks for/in biological studies, artificial life and related topics (92B20) Protein sequences, DNA sequences (92D20)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A parallel tabu search algorithm for large traveling salesman problems
- The traveling salesman. Computational solutions for RSP applications
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- An new self-organizing maps strategy for solving the traveling salesman problem
- Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
- Chained Lin-Kernighan for Large Traveling Salesman Problems
- TSPLIB—A Traveling Salesman Problem Library
- Fast Algorithms for Geometric Traveling Salesman Problems
- State-of-the-Art Survey—The Traveling Salesman Problem: A Neural Network Perspective
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This page was built for publication: Genetic operators for combinatorial optimization in TSP and microarray gene ordering