1 |
S. Lin and B. W. Kernighan, 'An Effective Heuristic algorithm for the traveling salesman problem,' Operations Research, Vol.21, pp.498-516, 1973
DOI
ScienceOn
|
2 |
A. Colorni, M. Dorigo and V. Maniezzo, An inverstigation of some properties of an ant algorithm, Proceedings of the Parallel Parallel Problem Solving from Nature Conference(PPSn 92), R. Manner and B. Manderick (Eds.), Elsevier Publishing, pp.509-520, 1992
|
3 |
B. Freisleben and P. Merz, 'Genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems,' Proceedings of IEEE International Conference of Evolutionary Computation, IEEE-EC'96, IEEE Press, pp.616-621, 1996
DOI
|
4 |
L. M. Gambardella, E. Taillard and M. Dorigo, 'Ant Colonies for QAP,' IDSIA, Lugano, Switzerland, Tech. Rep. IDSIA 97-4, 1997
|
5 |
A. Colorni, M. Dorigo and V. Maniezzo, 'Distributed optimization by ant colonies,' Proceedings of ECAL '91-European Conference of Artificial Life, Paris, France, F. Varela and P. Bourgine(Eds.), Elsevier Publishing, pp.134-144, 1991
|
6 |
L. M. Gambardalla and M. Dorigo, 'Ant Colony System : A Cooperative Learning approach to the Traveling Salesman Problem,' IEEE Transactions on Evolutionary Computation, Vol.1, No.1, 1997
DOI
|
7 |
L. M. Gambardalla and M. Dorigo, 'Ant-Q : a reinforcement learning approach to the traveling salesman problem,' Proceedings of ML-95, Twelfth International Conference on Machine Learning, A. Prieditis and S. Russell (Eds.), Morgan Kaufmann, pp.252-260, 1995
|
8 |
D. S. Johnson and L. A. McGeoch, 'The travelling salesman problem : a case study in local optimization,' in Local Search in Combinational Optimization, E. H. L. Arts and J. K. Lenstra(Eds.), New York : Wiley and Sons, 1997
|
9 |
M. Dorigo and G. D. Caro, 'Ant Algorithme for Discrete optimization,' Artificial Life, Vol.5, No.3, pp.137-172, 1999
DOI
ScienceOn
|
10 |
M. Dorigo, V. Maniezzo and A. Colorni, 'The ant system : optimization by a colony of cooperation agents,' IEEE Transactions of Systems, Man and Cybernetics-Part B, Vol.26, No.2, pp.29-41, 1996
DOI
|
11 |
L. M. Gambardalla and M. Dorigo, 'Solving symmetric and asymmetric TSPs by ant colonies,' Proceedings of IEEE International Conference of Evolutionary Computation, IEEE-EC'96, IEEE Press, pp.622-627, 1996
DOI
|
12 |
P.-C. Kanellakis and C. H. Papadimitriou, 'Local search for the asymmetric traveling salesman problem,' Operations Research, Vol.28, No.5, pp.1087-1099, 1980
|
13 |
T. Stuzle and H. Hoos, 'The ant system and local search for the traveling salesman problem,' Proceedings of ICEC'97 IEEE 4th International Conference of Evolutionary, 1997
|
14 |
M. Dorigo & L. M. Gambardalla, 'Ant Colonies for the Traveling Salesman Problem,' BioSystems, 43, pp.73-81, 1997
DOI
ScienceOn
|
15 |
S. Lin and B. W. Kernighan, 'An Effective Heuristic algorithm for the Traveling Salesman Problem,' Bell Telephone Laboratories, Incorporated, Murray Hill, N. J., 1997
|
16 |
SeungGwan Lee, TaeUng Jung and TaeChoong Chung, 'Improved Ant Agents System by the Dynamic Parameter Decision,' Proceedings of IEEE International Conference on FUZZ-IEEE '01, IEEE Press, pp.666-669, 2001
|
17 |
T. Sttzle and M. Dorigo, 'ACO algorithm for the Traveling Salesman Problem,' In K. Miettinen, M. Makela, P. Neittaanmaki, J. Periaux, editors, Evolutionary Algorithm in Engineering and Computer Science, Wiley, 1999
|