Cart (Loading....) | Create Account
Close category search window

A 2opt-DPX genetic local search for solving symmetric traveling salesman problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ghoseiri, K. ; Iran Univ. of Sci. & Technol., Tehran ; Sarhadi, H.

The combination of genetic algorithm and local search is a promising approach that attempts to benefit the advantageous of both approaches in solving the traveling salesman problem. In this paper we present a 2opt-DPX genetic local search algorithm for solving symmetric TSP instances. The main idea of this approach is to use a local search heuristic to create population of local optimum solutions and then applying genetic algorithm to find global optimum in the population of local optima. We describe its performance on some standard symmetric TSP instances and finally put forward some suggestions to improve its capability and efficiency.

Published in:

Industrial Engineering and Engineering Management, 2007 IEEE International Conference on

Date of Conference:

2-4 Dec. 2007

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.