References

Alba, E., 2005. Parallel Metaheuristics: A New Class of Algorithms. John Wiley and Sons, New Jersey, USA., ISBN-13: 9780471678069, pp: 554.

Back, T., 1996. Evolutionary Algorithms in Theory and Practice. 1st Edn., Oxford University Press, New York, USA., ISBN-13: 978-0195099713, pp: 328.

Bezdek, J.C., 1981. Pattern Recognition with Fuzzy Objective Function Algorithms. 1st Edn., Kluwer Academic Publishers, Norwell, MA, USA.

Bouroumi, A., M. Limouri and A. Essaid, 2000. Unsupervised fuzzy learning and cluster seeking. Intell. Data Anal., 4: 241-253.
Direct Link  |  

Bryant, K., 2000. Genetic algorithms and the traveling salesman problem. Ph.D. Thesis, Department of Mathematics, Harvey Mudd College, Claremont, California, USA.

Burke, I.L. and J.P. Ignizio, 1992. Neural networks and operations research: An overview. Comput. Oper. Res., 19: 179-189.
CrossRef  |  

Chen, S.M. and C.Y. Chien, 2010. Parallelized genetic ant colony systems for solving the traveling salesman problem. Expert Syst. Appl., 38: 3873-3883.
CrossRef  |  

Dorigo, M. and L.M. Gambardella, 1997. Ant colonies for the travelling salesman problem. Biosystems, 43: 73-81.
CrossRef  |  Direct Link  |  

Durbin, R., R. Szeliski and A. Yuille, 1989. An analysis of the elastic net approach to the traveling salesman problem. Neural Comput., 1: 348-358.
CrossRef  |  

Fiechter, C.N., 1994. A parallel tabu search algorithm for large traveling salesman problems. Discrete Applied Math., 51: 243-267.
CrossRef  |  

Fogel, D.B., 1988. An evolutionary approach to the traveling salesman problem. Biol. Cybern., 60: 139-144.
Direct Link  |  

Fogel, D.B., 1993. Applying evolutionary programming to selected traveling salesman problems. Int. J. Cybernet. Syst., 24: 27-36.

Freisleben, B. and P. Merz, 1996. New genetic local search operators for the traveling salesman problem. Proceedings of the 4th Conference on Parallel Problem Solving fron Nature, (PPSN'96), Springer-Verlag, Berlin, Germany, pp: 890-899.

Geist, A., A. Beguelin, J. Dongarra, W. Jiang, R. Manchek and V.S. Sunderam, 1994. PVM: Parallel Virtual Machine: A Users Guide and Tutorial for Networked Parallel Computing. MIT Press, Massachusetts, Cambridge, ISBN: 0-262-57108-0.

Goldberg, D.E., 1989. Genetic Algorithms in Search, Optimization and Machine Learning. 1st Edn., Addison-Wesley Professional, Boston, MA., USA., ISBN-13: 9780201157673, Pages: 412.

Greco, F., 2008. Travelling Salesman Problem. I-Tech Education and Publishing, Croatia, pp: 75-115.

Gutin, G. and A.P. Punnen, 2002. The Traveling Salesman Problem and its Variations. 1st Edn., Kluwer Academic, Dordrecht, ISBN: 1-4020-0664-0.

Johnson, D.S., 1990. Local optimization and the traveling salesman problem. Proc. Colloquium Automata, Languages Program., 433: 446-461.
CrossRef  |  

Kargupta, H., K. Deb and D.E. Goldberg, 1992. Ordering Genetic Algorithms and Deception. In: Parallel Problem Solving from Nature, Manner, R. and B. Manderick (Eds.). Elsevier Science Publishers B.V., Berlin, Germany, pp: 47-56.

Katayama, K. and H. Narihisa, 1999. Iterated local search approach using genetic transformation to the traveling salesman problem. Proceedings of the Genetic and Evolutionary Computation Conference, July 13-17, Morgan Kaufmann, New York, USA., pp: 321-328.

Laporte, G. and U. Palekar, 2002. Some applications of the clustered travelling salesman problem. J. Operat. Res. Soc., 53: 972-976.
Direct Link  |  

Larranaga, P., C. Kuijpers, R. Murga, I. Inza and S. Dizdarevic, 1999. Genetic algorithms for the travelling salesman problem: A review of representations and operators. Artif. Intell. Rev., 13: 129-170.
CrossRef  |  

Lin, S. and B.W. Kernighan, 1973. An effective heuristic algorithm for the traveling-salesman problem. Operat. Res., 21: 495-516.
Direct Link  |  

Martin, O.C. and S.W. Otto, 1996. Combining Simulated annealing with local search heuristics. Ann. Operat. Res., 63: 57-75.
CrossRef  |  

Merz, P. and B. Freisleben, 1997. Genetic local search for the TSP: New results. Proceedings of the IEEE International Conference on Evolutionary Computation, April 13-16, IEEE Xplore Press, Indianapolis, USA., pp: 159-164.

Nedjah, N., E. Alba and L.D.M. Mourelle, 2006. Parallel Evolutionary Computations. Springer-Verlag, Berlin Heidelberg, ISBN-13: 9783540328377, pp: 200.

Reinelt, G., 1994. The Traveling Salesman: Computational Solutions for TSP Applications. Springer-Verlag, Berling, Germany, ISBN-13: 9783540583349, Pages: 223.

Van Laarhoven, P.I.M. and E.H.L. Aarts 1988. Simulated Annealing: Theory and Application. Kluwer Academic Publishers, Boston, New York, ISBN: 9789027725134.

Wang, Y., L. Han, L. Yinghua and S. Zhao, 2006. A new encoding based genetic algorithm for the traveling salesman problem. Eng. Optim., 38: 1-13.
CrossRef  |