Back to Results
First PageMeta Content
Genetic algorithms / Microarrays / Operations research / Travelling salesman problem / NP-complete problems / Concorde TSP Solver / Crossover / DNA microarray / Tabu search / Theoretical computer science / Applied mathematics / Mathematics


Appl Intell[removed]:183–195 DOI[removed]s10489[removed]y Genetic operators for combinatorial optimization in TSP and microarray gene ordering Shubhra Sankar Ray · Sanghamitra Bandyopadhyay ·
Add to Reading List

Document Date: 2010-02-25 01:56:48


Open Document

File Size: 436,77 KB

Share Result on Facebook

City

FRAG / /

Company

Pearson / Business Media LLC / KBNS / Silicon Graphics / MOC / /

Country

India / /

Currency

pence / /

/

Facility

Indian Statistical Institute / TSP library / /

IndustryTerm

order crossover operator / Soft computing / genetic algorithm / nearest fragment operator / local search heuristics / modified multiple-searching genetic algorithm / crossover site / genetic algorithms / neural networks / multimodal search / heuristic algorithms / Data mining / Evolutionary algorithm / tabu search / near optimal solutions / stronger local search methods / search space / deterministic operator / search methods / /

MarketIndex

TSP / /

MedicalTreatment

vaccination / /

Organization

S. K. Pal Center for Soft Computing Research / S. Bandyopadhyay Machine Intelligence Unit / Indian Statistical Institute / /

/

Position

Introduction The Traveling Salesman / traveling salesman / representative / salesman / /

Product

Pseudo / fragmin / /

ProgrammingLanguage

E / TSP / /

ProvinceOrState

Newfoundland / Georgia / /

Technology

neural network / DNA Chip / MGO Genetic algorithms / hybridization / gene expression / genetic algorithm / Data mining / 3 Genetic algorithms / Gene analysis / /

SocialTag