메뉴 건너뛰기




Volumn 1, Issue , 2010, Pages 295-299

Biogeography-based optimization for the traveling salesman problems

Author keywords

Biogeography based optimization; Global optimization; Immigration; Traveling salesman problem

Indexed keywords

BIOGEOGRAPHY-BASED OPTIMIZATIONS; IMMIGRATION; OPTIMAL SOLUTIONS; TRAVELING SALESMAN;

EID: 77956445612     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSO.2010.79     Document Type: Conference Paper
Times cited : (45)

References (14)
  • 5
    • 0024663931 scopus 로고
    • A distributed implementation of simulated annealing for the travelling salesman problem
    • J. R. A. Allwright, and D. B. Carpenter, "A distributed implementation of simulated annealing for the travelling salesman problem," Parallel Computing, vol.10, no.3, pp. 335-338, 1989.
    • (1989) Parallel Computing , vol.10 , Issue.3 , pp. 335-338
    • Allwright, J.R.A.1    Carpenter, D.B.2
  • 6
    • 8644248210 scopus 로고    scopus 로고
    • An expanding self-organizing neural network for the traveling salesman problem
    • K.S. Leung, H.D. Jin, and Z.B. Xu, "An expanding self-organizing neural network for the traveling salesman problem," Neurocomputing, vol.62, pp. 267-292, 2004.
    • (2004) Neurocomputing , vol.62 , pp. 267-292
    • Leung, K.S.1    Jin, H.D.2    Xu, Z.B.3
  • 7
    • 0031122887 scopus 로고    scopus 로고
    • Ant colony system: A cooperative learning approach to the traveling salesman problem
    • M. Dorigo, and L. M. Gambardella, "Ant colony system: a cooperative learning approach to the traveling salesman problem," IEEE Transactions on Evolutionary Computation, vol.1, no.1, pp. 53-66, 1997.
    • (1997) IEEE Transactions on Evolutionary Computation , vol.1 , Issue.1 , pp. 53-66
    • Dorigo, M.1    Gambardella, L.M.2
  • 9
    • 0039397863 scopus 로고    scopus 로고
    • Genetic algorithm for the traveling salesman problem: A review of representations and operators
    • P. Larranaga, C. M. H. Kuijpers, R. H. Murga, and I. Inza, "Genetic algorithm for the traveling salesman problem: a review of representations and operators," Artificial Intelligence Review, vol.13, no.2, pp. 129-170, 1999.
    • (1999) Artificial Intelligence Review , vol.13 , Issue.2 , pp. 129-170
    • Larranaga, P.1    Kuijpers, C.M.H.2    Murga, R.H.3    Inza, I.4
  • 10
    • 34250187782 scopus 로고    scopus 로고
    • Particle swarm optimization-based algorithms for TSP and generalized TSP
    • X. H. Shi, Y. C. Liang, H. P. Lee, and C. Lu, "Particle swarm optimization-based algorithms for TSP and generalized TSP," Information Processing Letters, vol.103, no.5, pp. 169-176, 2007.
    • (2007) Information Processing Letters , vol.103 , Issue.5 , pp. 169-176
    • Shi, X.H.1    Liang, Y.C.2    Lee, H.P.3    Lu, C.4
  • 11
    • 8344231581 scopus 로고    scopus 로고
    • Local search for the probabilistic traveling salesman problem: Correction to the 2-p-opt and 1-shift algorithms
    • L. Bianchi, J. Knowles, and J. Bowler, "Local search for the probabilistic traveling salesman problem: Correction to the 2-p-opt and 1-shift algorithms," European Journal of Operational Research, vol.162, no.1, pp. 206-219, 2005.
    • (2005) European Journal of Operational Research , vol.162 , Issue.1 , pp. 206-219
    • Bianchi, L.1    Knowles, J.2    Bowler, J.3
  • 13
    • 0026225350 scopus 로고
    • TSPLIB- A traveling salesman problem library
    • available online
    • G. Reinelt, "TSPLIB-a traveling salesman problem library," ORSA Journal on Computing, vol.3, pp. 376-384, 1991. (available online www.iwr.uniheidelberg.de/groups/compopt/ software/TSPLIB95)
    • (1991) ORSA Journal on Computing , vol.3 , pp. 376-384
    • Reinelt, G.1


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