Log in to save to my catalogue

A High-Performance Genetic Algorithm: Using Traveling Salesman Problem as a Case

A High-Performance Genetic Algorithm: Using Traveling Salesman Problem as a Case

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_doaj_primary_oai_doaj_org_article_8ab01e916a124287bd3b1e45735278c6

A High-Performance Genetic Algorithm: Using Traveling Salesman Problem as a Case

About this item

Full title

A High-Performance Genetic Algorithm: Using Traveling Salesman Problem as a Case

Publisher

Cairo, Egypt: Hindawi Publishing Corporation

Journal title

TheScientificWorld, 2014-01, Vol.2014 (2014), p.1-14

Language

English

Formats

Publication information

Publisher

Cairo, Egypt: Hindawi Publishing Corporation

More information

Scope and Contents

Contents

This paper presents a simple but efficient algorithm for reducing the computation time of genetic algorithm (GA) and its variants. The proposed algorithm is motivated by the observation that genes common to all the individuals of a GA have a high probability of surviving the evolution and ending up being part of the final solution; as such, they ca...

Alternative Titles

Full title

A High-Performance Genetic Algorithm: Using Traveling Salesman Problem as a Case

Identifiers

Primary Identifiers

Record Identifier

TN_cdi_doaj_primary_oai_doaj_org_article_8ab01e916a124287bd3b1e45735278c6

Permalink

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_doaj_primary_oai_doaj_org_article_8ab01e916a124287bd3b1e45735278c6

Other Identifiers

ISSN

2356-6140,1537-744X

E-ISSN

1537-744X

DOI

10.1155/2014/178621

How to access this item