A Hybrid Method for Solving Traveling Salesman Problem

Zarei, Bager; Meybodi, M. R.; Abbaszadeh, Mortaza

doi:10.1109/icis.2007.24

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2009

2010

Publication Types

Select...

Other4

Book2

Relationship

Self Cite0

Independent6

Authors

Journals

Cited by 9 publications

(1 citation statement)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Due to the meagerness of this cost, it is considered zero). In this paper the used automata is an Object Migration Automata (OMA) [16]. The rest of the paper will be as follows:…”

Section: Introductionmentioning

confidence: 99%

Static task graph scheduling using learner Genetic Algorithm

Ghader

Fakhr

Javadi

et al. 2010

2010 International Conference of Soft Computing and Pattern Recognition

View full text Add to dashboard Cite

Task graph scheduling is one of the NP-Hard problems. So many classic and non-classic methods are proposed for solution of this problem. One of the crucial methods that, applied for solving this problem is Genetic Algorithm. In this paper we propose a new algorithm that named Learner Genetic Algorithm (LGA). Our proposed algorithm based on Genetic Algorithm, but in new proposed algorithm the Learning Process is attached for Genetic Algorithm. The scheduling resulted from applying our proposed algorithm to some benchmark task graphs are compared with the existing ones.

show abstract

“…Due to the meagerness of this cost, it is considered zero). In this paper the used automata is an Object Migration Automata (OMA) [16]. The rest of the paper will be as follows:…”

Section: Introductionmentioning

confidence: 99%