메뉴 건너뛰기




Volumn 4247 LNCS, Issue , 2006, Pages 181-188

A hybrid discrete particle swarm optimization for the traveling salesman problem

Author keywords

[No Author keywords available]

Indexed keywords

BINARY CODES; EMBEDDED SYSTEMS; ONLINE SEARCHING; OPTIMIZATION; PROBLEM SOLVING; VELOCITY;

EID: 33751369494     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11903697_24     Document Type: Conference Paper
Times cited : (29)

References (10)
  • 4
    • 33751365067 scopus 로고    scopus 로고
    • A modified particle swarm optimization for multiple traveling salesmen problem
    • Incheon, South Korea, Harbin Institute Technology Publisher
    • Li, X., Tian, P., Kong, M.: A modified particle swarm optimization for multiple traveling salesmen problem. In: Proceedings of 2005 International Conference on Management Science & Engineering, Incheon, South Korea, Harbin Institute Technology Publisher (2005) 475-480
    • (2005) Proceedings of 2005 International Conference on Management Science & Engineering , pp. 475-480
    • Li, X.1    Tian, P.2    Kong, M.3
  • 8
    • 0001193147 scopus 로고    scopus 로고
    • The travelling salesman problem: A case study in local optimization
    • Aarts, E.&Lenstra, J., ed. Chichester, UK, John Wiley & Sons
    • Johnson, D.S., McGeoch, L.A.: The travelling salesman problem: A case study in local optimization. In Aarts, E.&Lenstra, J., ed.: Local Search in Combinatorial Optimization. Chichester, UK, John Wiley & Sons (1997) 215-310
    • (1997) Local Search in Combinatorial Optimization , pp. 215-310
    • Johnson, D.S.1    McGeoch, L.A.2


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