A novel globally convergent hybrid evolutionary algorithm for traveling salesman problems

Proceedings of 2004 International Conference on Machine Learning and Cybernetics

Volumn 4, Issue , 2004, Pages 2485-2489

  Wang, Yu Ping ^a   Li, Ying Hua ^a   Dang, Chuang Yin ^b  

^a XIDIAN UNIVERSITY   (China)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Evolutionary computation; Global optimization; TSP

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; CONVERGENCE OF NUMERICAL METHODS; EVOLUTIONARY ALGORITHMS; GLOBAL OPTIMIZATION; INTEGER PROGRAMMING; MATHEMATICAL OPERATORS; POLYNOMIALS; PROBLEM SOLVING;

ENCODING SCHEMES; MUTATION OPERATORS; PERMUTATION; VEHICLE ROUTING;

TRAVELING SALESMAN PROBLEM;

EID: 6344249184     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. D. Applexgate, R, Bixby, etal., "Implementing the Dantzig-Fulkerman-Johnson Algorithm for Large Traveling Salesman Problems", Mathematical Programming, Vol. 97, No.3, pp.91-153, Aug. 2003.
2. S.Jung and B.R.Moon, "Toward Minimal Restriction of Genetic Coding and Crossovers for the 2-D Eunclidean TSP", IEEE Trans. On Evolutionary Computation, Vol. 6, No.6, pp.557-565, Dec. 2002.
3. R.Baraglia, J.I.Hidalgo and R.Perego, "A hybrid Heuristic for the Traveling Salesman Problem", IEEE Trans. on Evolutionary Computation, Vol. 5, No., pp.613-622, 2001.
4. M.R.Garey, R.L.Graham and D.S.Johnson, "Some NP-complete geometric problems", Proc. 8th Annu. ACM Symp. Theory of Computing. pp. 10-22, 1976.
5. S.Arora, C.Lund, R.Motwani, et al, "Proof verification and intractability of approximation problems", Proc. 33th IEEE Symp. Foundations of Computer Science, pp. 13-22, 1992.
6. K.Katayama and H.Narihisa, "Iterated local search approach using genetic transformation to the traveling salesman ptoblem", Proc. Genetic and Evolutionary Computation, pp.321-328, 1999.
7. D.S.Johnson, "Local optimization and the traveling salesman problem", Proc. 17th Automata, Languages, and Programming, pp.446-461, 1990.
8. B.Freisleben and P.Merz, "New genetic local search operators for the traveling salesman problem", Proc. 4th Conf. Parallel Problem solving from Nature, pp.616-621, 1996.
9. P.Merz and B.Freisleben, "Genetic local search for the TSP:New results", Proc. of the 1997 International Conference on Evolutionary Computation, Piscataway. pp.159-163, 1997.
10. T.N.Bui and B.R.Moon, "Graph partitioning and genetic algorithms", IEEE Trans. Computers. Vol. 45, No. 3, pp. 841-855, 1996.
11. T.N.Bui and B.R.Moon, "On multi-dimensional encoding/crossover", Proc. 6th Int. Conf. Genetic algorithms, pp.49-56, 1995.
12. S.Lin and B.W.Kernighan, "An effective heuristic algorithm for the traveling salesman problem", Operations Research. Vol. 21, pp.495-516, 1973.
13. Thomas Bäck, Evolutionary algorithms in theory and practice. New York: Oxford University Press, 1996.
14. G.Reinelt, "TSPLIB - A traveling salesman library", ORSA J. Comput. Vol. 3, pp.376-384, 1991.