SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218)
DOI: 10.1109/icsmc.1998.725081
|View full text |Cite
|
Sign up to set email alerts
|

A migration scheme for the genetic adaptive routing algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
43
0

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 53 publications
(44 citation statements)
references
References 3 publications
0
43
0
Order By: Relevance
“…Encoding schemes based on direct representation have been used to encode paths in [15]. Gen et al [16] proposed an indirectrepresentation scheme (priority-based encoding) for solving the shortest path problem using GA.…”
Section: Encoding and Decoding Of Particlesmentioning
confidence: 99%
“…Encoding schemes based on direct representation have been used to encode paths in [15]. Gen et al [16] proposed an indirectrepresentation scheme (priority-based encoding) for solving the shortest path problem using GA.…”
Section: Encoding and Decoding Of Particlesmentioning
confidence: 99%
“…Encoding schemes based on direct representation have been used to encode paths in [23]. Gen et al [24] proposed an indirect-representation scheme (prioritybased encoding) for solving the shortest path problem using genetic algorithms.…”
Section: B Encoding and Decoding Of Particles In The Swarmmentioning
confidence: 99%
“…The genetic algorithm, which was introduced by Holland [27] and was further described by Goldberg [28], is a stochastic optimization technique. The genetic algorithm is characterized by the following steps:…”
Section: Genetic Algorithmmentioning
confidence: 99%