Cohort Intelligence for Solving Travelling Salesman Problems

As demonstrated previously, the performance of the Cohort Intelligence Algorithm (CI) algorithm was quite satisfactory for solving combinatorial problem such as Knapsack Problem (KP) (Int J Mach Learn Cybern, 2014 [1]).

Saved in:
Bibliographic Details
Published inCohort Intelligence: A Socio-inspired Optimization Method Vol. 114; pp. 75 - 86
Main Authors Krishnasamy, Ganesh, Kulkarni, Anand Jayant, Abraham, Ajith
Format Book Chapter
LanguageEnglish
Published Switzerland Springer International Publishing AG 01.01.2017
Springer International Publishing
SeriesIntelligent Systems Reference Library
Subjects
Artificial intelligence
Online AccessGet full text
ISBN3319442538
9783319442532
ISSN1868-4394
1868-4408
DOI10.1007/978-3-319-44254-9_6

Cover

More Information
Summary:As demonstrated previously, the performance of the Cohort Intelligence Algorithm (CI) algorithm was quite satisfactory for solving combinatorial problem such as Knapsack Problem (KP) (Int J Mach Learn Cybern, 2014 [1]).
ISBN:3319442538
9783319442532
ISSN:1868-4394
1868-4408
DOI:10.1007/978-3-319-44254-9_6