A hybrid algorithm applied to traveling salesman problem

Lee, Zne-Jung

doi:10.1109/icnsc.2004.1297441

Search citation statements

Order By: Relevance

Paper Sections

Select...

The Traveling Salesman Problem (Tsp)1

Citation Types

Supporting

Mentioning

Contrasting

Publication Types

Select...

Article3

Other2

Relationship

Self Cite0

Independent5

Authors

Journals

Cited by 7 publications

(1 citation statement)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Traveling Salesman Problem (TSP) is considered to be an important combinatorial problem, because of its simplicity to define [23][24][25][26] . It is stated as an NP-hard optimization problem.…”

Section: The Traveling Salesman Problem (Tsp)mentioning

confidence: 99%

The Traveling Salesman Problem as a Benchmark Test for a Social-Based Genetic Algorithm

AL-Madi¹,

Khader²

2008

J. of Computer Science

View full text Add to dashboard Cite

Present research, showed Traveling Salesman Problem (TSP) to compare values and results concerning the averages and best fits of both, Simple Standard Genetic Algorithm (SGA) and a new approach of Genetic Algorithms named Social-Based Genetic Algorithm (SBGA). Results from TSP test on Social-Based Genetic Algorithms (SBGA) were presented. Results were encouraging in SocialBased Genetic Algorithms (SBGA) performs better in finding best fit solutions of generations in different populations than the Simple Standard Genetic Algorithm.

show abstract

Section: The Traveling Salesman Problem (Tsp)mentioning

confidence: 99%