论文信息 - Cohort Intelligence for Solving Travelling Salesman Problems

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]).

Ajith Abraham | Anand J. Kulkarni | Ganesh Krishnasamy

[1] Anand Jayant Kulkarni,et al. Solving 0–1 Knapsack Problem using Cohort Intelligence Algorithm , 2016, Int. J. Mach. Learn. Cybern..

[2] Kang Tai,et al. A Probability Collectives Approach with a Feasibility-Based Rule for Constrained Optimization , 2011, Appl. Comput. Intell. Soft Comput..

[3] Takao Enkawa,et al. Competition-based neural network for the multiple travelling salesmen problem with minmax objective , 1999, Comput. Oper. Res..

[4] Roberto Cordone,et al. A heuristic approach to the overnight security service problem , 2003, Comput. Oper. Res..

[5] Anand Jayant Kulkarni,et al. Cohort Intelligence: A Self Supervised Learning Behavior , 2013, 2013 IEEE International Conference on Systems, Man, and Cybernetics.

[6] Anand J. Kulkarni,et al. A Probability Collectives Approach for Multi-Agent Distributed and Cooperative Optimization with Tolerance for Agent Failure , 2013, Agent-Based Optimization.

[7] Nicos Christofides,et al. An Algorithm for the Vehicle-dispatching Problem , 1969 .

[8] Pablo Moscato,et al. A New Memetic Algorithm for the Asymmetric Traveling Salesman Problem , 2004, J. Heuristics.

[9] Gerhard Reinelt,et al. TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..