Memetic Algorithms for the Traveling Salesman Problem

First Page		Document Content
Date: 2012-09-20 14:36:39 Travelling salesman problem Mathematical optimization Operations research Cybernetics Genetic algorithms Memetic algorithm Lin–Kernighan heuristic Greedy algorithm Christofides algorithm Mathematics Applied mathematics Theoretical computer science		Memetic Algorithms for the Traveling Salesman Problem Add to Reading List Source URL: www.complex-systems.com Download Document from Source Website File Size: 1,76 MB Share Document on Facebook

	An Effective Implementation of the Lin-Kernighan Traveling Salesman Heuristic Keld Helsgaun E-mail: Department of Computer Science Roskilde University DocID: 1uC4Z - View Document
	Network Analysis and Modeling CSCI 5352, Fall 2013 Prof. Aaron Clauset Problem Set 6, duepts total) Recall that the Kernighan-Lin heuristic begins with a random partition of the DocID: 1rIRc - View Document
	Revisiting Elitism in Ant Colony Optimization Tony White, Simon Kaegi, Terri Oda School of Computer Science, Carleton University 1125 Colonel By Drive, Ottawa, Ontario, Canada K1S 5B6 , skaegi@sym DocID: 18ST2 - View Document
	Memetic Algorithms for the Traveling Salesman Problem DocID: 18F7U - View Document
	An Improved Adaptive Multi-Start Approach to Finding Near-Optimal Solutions to the Euclidean TSP Dan Bonachea Computer Science Dept. University of California DocID: RENC - View Document