2011 IEEE Workshop on Merging Fields of Computational Intelligence and Sensor Technology 2011
DOI: 10.1109/mfcist.2011.5949511
|View full text |Cite
|
Sign up to set email alerts
|

Robot routing using clustering-based parallel genetic algorithm with migration

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 28 publications
0
3
0
Order By: Relevance
“…A clustering algorithm based on common intersection area of SNs is proposed in [7], it groups the nodes having common intersection are in a cluster. Order of to be visited by ME is obtained by using GA. A genetic algorithm based cluster was proposed for reducing latency in [12].…”
Section: Clusteringmentioning
confidence: 99%
See 1 more Smart Citation
“…A clustering algorithm based on common intersection area of SNs is proposed in [7], it groups the nodes having common intersection are in a cluster. Order of to be visited by ME is obtained by using GA. A genetic algorithm based cluster was proposed for reducing latency in [12].…”
Section: Clusteringmentioning
confidence: 99%
“…In literature various approaches makes use of heuristic approaches like Travelling Salesmen Problem (TSP) and Genetic Algorithms (GA) for defining ME's optimal tour [7,12,20].…”
Section: Introductionmentioning
confidence: 99%
“…A bunch of studies has focused on the parallel genetic algorithms to increase the speed of the convergence as well as appropriate management of huge amounts of data and heavy computations [2][3][4][5]. However, a group of researchers has concentrated on the hybrid approaches to overcome the limitations of simple GA.…”
Section: Introductionmentioning
confidence: 99%