Genetic operators for combinatorial optimization in TSP and microarray gene ordering
- 9 November 2006
- journal article
- Published by Springer Nature in Applied Intelligence
- Vol. 26 (3), 183-195
- https://doi.org/10.1007/s10489-006-0018-y
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- An new self-organizing maps strategy for solving the traveling salesman problemChaos, Solitons, and Fractals, 2006
- Implementation analysis of efficient heuristic algorithms for the traveling salesman problemComputers & Operations Research, 2006
- Finding the Optimal Gene Order in Displaying Microarray DataLecture Notes in Computer Science, 2003
- An effective implementation of the Lin–Kernighan traveling salesman heuristicEuropean Journal of Operational Research, 2000
- A novel genetic algorithm based on immunityIEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 2000
- Comprehensive Identification of Cell Cycle–regulated Genes of the YeastSaccharomyces cerevisiaeby Microarray HybridizationMolecular Biology of the Cell, 1998
- Tabu Search on the Geometric Traveling Salesman ProblemPublished by Springer Nature ,1996
- State-of-the-Art Survey—The Traveling Salesman Problem: A Neural Network PerspectiveINFORMS Journal on Computing, 1993
- Fast Algorithms for Geometric Traveling Salesman ProblemsINFORMS Journal on Computing, 1992
- An Effective Heuristic Algorithm for the Traveling-Salesman ProblemOperations Research, 1973