The Academic Perspective Procedia publishes Academic Platform symposiums papers as three volumes in a year. DOI number is given to all of our papers.
Publisher : Academic Perspective

Journal DOI : 10.33793/acperpro
Journal eISSN : 2667-5862

Year :2019, Volume 2, Issue 3, Pages: 446-453
22.11.2019
A New Approach Based on K-means Clustering and Shuffled Frog Leaping Algorithm to Solve Travelling Salesman Problem
Murat Karakoyun,
79
23
Keywords: Shuffled Frog Leaping Algorithm, K-means Clustering, Travelling Salesman Problem
Cite
  • BIBTEX
    @article{acperproISITES2019ID31, author={Karakoyun, Murat}, title={A New Approach Based on K-means Clustering and Shuffled Frog Leaping Algorithm to Solve Travelling Salesman Problem}, journal={Academic Perspective Procedia}, eissn={2667-5862}, volume={2}, year=2019, pages={446-453}}
  • APA
    Karakoyun, M.. (2019). A New Approach Based on K-means Clustering and Shuffled Frog Leaping Algorithm to Solve Travelling Salesman Problem. Academic Perspective Procedia, 2 (3), 446-453. DOI: 10.33793/acperpro.02.03.31
  • ENDNOTE
    %0 Academic Perspective Procedia (ACPERPRO) A New Approach Based on K-means Clustering and Shuffled Frog Leaping Algorithm to Solve Travelling Salesman Problem% A Murat Karakoyun% T A New Approach Based on K-means Clustering and Shuffled Frog Leaping Algorithm to Solve Travelling Salesman Problem% D 22.11.2019% J Academic Perspective Procedia (ACPERPRO)% P 446-453% V 2% N 3% R doi: 10.33793/acperpro.02.03.31% U 10.33793/acperpro.02.03.31
© Academic Perspective 2018. All rights reserved.