Self-organizing feature maps to solve the undirected rural postman problem

Authors:
M. L. Pérez-Delgado;J. C. Matos-Franco
Affiliations:
Universidad de Salamanca, Zamora, Spain;Universidad de Salamanca, Zamora, Spain
Venue:
EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
Year:
2007

Citing 3
Cited 1

Self-organization and associative memory: 3rd edition

Self-organization and associative memory: 3rd edition
New insertion and postoptimization procedures for the traveling salesman problem

Operations Research
Approximation Algorithms for Some Postman Problems

Journal of the ACM (JACM)

Rank-Based Ant System to Solve the Undirected Rural Postman Problem

IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part II: Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Rural Postman Problem consists of finding a shortest tour containing all edges in a subset, in the subgraph induced by some subset of nodes. In general, the problem is NP-hard, since the Traveling Salesman Problem can be easily transformed into it. The Traveling Salesman Problem consist of finding a shortest closed tour which visits all the cities in a given set. Artificial Neural Networks have been applied to solve the Traveling Salesman Problem in the last years. In this work we propose to apply self-organizing feature maps to solve the first problem, transforming it previously into the second.