Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

A parallel implementation of evolutionary divide and conquer for the TSP

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 $31
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)
Valenzuela, C.L. ; Teesside Univ, Middlesbrough, UK ; Jones, A.J.

Evolutionary divide and conquer (EDAC) applied to the geometric travelling salesman problem uses a genetic algorithm to explore the space of problem subdivisions. The underlying techniques for subdivision and patching are based on the cellular dissection algorithms of Richard Karp (1977), but the addition of new repair heuristics as well as the genetic algorithm, appears to have succeeded in lifting the quality of solution way above Karp's algorithms, whilst maintaining almost linear scaling of the algorithm with increased problem size. In this paper we outline a parallel implementation of EDAC and present some preliminary results of this work

Published in:

Genetic Algorithms in Engineering Systems: Innovations and Applications, 1995. GALESIA. First International Conference on (Conf. Publ. No. 414)

Date of Conference:

12-14 Sep 1995