BahasaMelayuMalaysiaEnglish (UK)

Ant Colony Optimization For Very Large Scale Traveling Salesman Problem With Evaluation Constraints

Authors: Connie Liew and Jason Teo Tze Wi


Although the so-called Traveling Salesman Problem (TSP) is one of the most intensively

studied problems in computational mathematics myriad studies exist in the literature

which attempt to solve TSP as a generalization of NP-hard problems in combinatorial

optimization, relatively few studies have attempted to solve very large scale TSP

problems with problem instances having 1000 cities or more.


Download: pdf