A Memetic Algorithm with a large neighborhood crossover operator for the Generalized Traveling Salesman Problem

Authors:
Boris Bontoux;Christian Artigues;Dominique Feillet
Affiliations:
Université d'Avignon et des Pays de Vaucluse, Laboratoire d'Informatique d'Avignon, F-84911 Avignon Cedex 9, France;LAAS CNRS, Université de Toulouse, 7 avenue du Colonel Roche, 31077 Toulouse CEDEX 4, France;Ecole des Mines de Saint-Etienne, CMP Georges Charpak, F-13541 Gardanne, France
Venue:
Computers and Operations Research
Year:
2010

Citing 12
Cited 7

Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem

Information Sciences: an International Journal
An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs

Information Sciences: an International Journal
A polylogarithmic approximation algorithm for the group Steiner tree problem

Journal of Algorithms
The Simple Genetic Algorithm: Foundations and Theory

The Simple Genetic Algorithm: Foundations and Theory
Genetic Algorithms in Engineering and Computer Science

Genetic Algorithms in Engineering and Computer Science
Genetic Algorithms: Concepts and Designs with Disk

Genetic Algorithms: Concepts and Designs with Disk
A survey of very large-scale neighborhood search techniques

Discrete Applied Mathematics
Some issues of designing genetic algorithms for traveling salesman problems

Soft Computing - A Fusion of Foundations, Methodologies and Applications
An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems

Networks
Particle swarm optimization-based algorithms for TSP and generalized TSP

Information Processing Letters
Ant colony optimization for the traveling purchaser problem

Computers and Operations Research
Transformations of generalized ATSP into ATSP

Operations Research Letters

A new approach for solving the generalized traveling salesman problem

HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
A hybrid heuristic approach for solving the generalized traveling salesman problem

Proceedings of the 13th annual conference on Genetic and evolutionary computation
A novel approach for automated music composition using memetic algorithms

Proceedings of the 49th Annual Southeast Regional Conference
The effect of the asymmetry of road transportation networks on the traveling salesman problem

Computers and Operations Research
Memetic Algorithm based on Improved Inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem

Computers & Mathematics with Applications
DOE-based parameter tuning for local branching algorithm

International Journal of Metaheuristics
DIMMA-Implemented Metaheuristics for Finding Shortest Hamiltonian Path Between Iranian Cities Using Sequential DOE Approach for Parameters Tuning

International Journal of Applied Metaheuristic Computing

Quantified Score

Hi-index	0.03

Visualization

Abstract

The Generalized Traveling Salesman Problem (GTSP) is a generalization of the well-known Traveling Salesman Problem (TSP), in which the set of cities is divided into mutually exclusive clusters. The objective of the GTSP consists in visiting each cluster exactly once in a tour, while minimizing the sum of the routing costs. This paper addresses the solution of the GTSP using a Memetic Algorithm. The originality of our approach rests on the crossover procedure that uses a large neighborhood search. This algorithm is compared with other algorithms on a set of 54 standard test problems with up to 217 clusters and 1084 cities. Results demonstrate the efficiency of our algorithm in both solution quality and computation time.