A Memetic Algorithm for the Generalized Traveling Salesman Problem

Details A Memetic Algorithm for the Generalized Traveling Salesman Problem A Memetic Algorithm for the Generalized Traveling Salesman Problem

2008-04-04

arxiv.org/abs/0804.0722v3

Natural Computing 9(1) (2010) 47-60

Computer Science

Data Structures and Algorithms

15 pages, to appear in Natural Computing, Springer, available online: http://www.springerlink.com/content/5v4568l492272865/?p=

Scientific paper

10.1007/s11047-009-9111-6

The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are required to find a minimum length tour that includes exactly one city from each group. The recent studies on this subject consider different variations of a memetic algorithm approach to the GTSP. The aim of this paper is to present a new memetic algorithm for GTSP with a powerful local search procedure. The experiments show that the proposed algorithm clearly outperforms all of the known heuristics with respect to both solution quality and running time. While the other memetic algorithms were designed only for the symmetric GTSP, our algorithm can solve both symmetric and asymmetric instances.

Affiliated with

Also associated with

No associations

Rating

A Memetic Algorithm for the Generalized Traveling Salesman Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Memetic Algorithm for the Generalized Traveling Salesman Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Memetic Algorithm for the Generalized Traveling Salesman Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-190935