메뉴 건너뛰기




Volumn 5484 LNCS, Issue , 2009, Pages 117-122

Discrete particle swarm optimization for multiple destination routing problems

Author keywords

Multiple destination routing problems; Particle swarm optimization (PSO); Steiner tree problem.

Indexed keywords

COMPLEX PROBLEMS; DISCRETE PARTICLE SWARM OPTIMIZATION; FAST CONVERGENCE; FASTER CONVERGENCE; GA-BASED ALGORITHM; GLOBAL SEARCH ABILITY; GLOBAL SEARCH ALGORITHM; MULTIPLE DESTINATION ROUTING PROBLEMS; MULTIPLE DESTINATIONS; NP COMPLETE; STEINER TREE PROBLEM.;

EID: 67650685261     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-01129-0_15     Document Type: Conference Paper
Times cited : (19)

References (7)
  • 1
    • 0032208708 scopus 로고    scopus 로고
    • A genetic algorithm for the multiple destination routing problems
    • PII S1089778X98094260
    • Leung, Y., Li, G., Xu, Z.B.: A genetic algorithm for the multiple destination routing problems. J. IEEE Trans. Evol. Comput. 2, 150-161 (1998) (Pubitemid 128748411)
    • (1998) IEEE Transactions on Evolutionary Computation , vol.2 , Issue.4 , pp. 150-161
    • Leung, Y.1    Li, G.2    Xu, Z.-B.3
  • 2
    • 52449147871 scopus 로고
    • Path-distance heuristics for the steiner problem in undirected networks
    • Winter, P., Smith, J.M.: Path-Distance heuristics for the Steiner problem in undirected networks. J. Algorithmica 7, 309-327 (1992)
    • (1992) J. Algorithmica , vol.7 , pp. 309-327
    • Winter, P.1    Smith, J.M.2
  • 7
    • 84911584312 scopus 로고
    • Shortest connection networks and some generalizations
    • Prim, R.C.: Shortest connection networks and some generalizations. J. Bell System Technical Journal 36, 1389-1401 (1957)
    • (1957) J.Bell System Technical Journal , vol.36 , pp. 1389-1401
    • Prim, R.C.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.