Efficient heuristics for the rural postman problem

Efficient heuristics for the rural postman problem

0.00 Avg rating0 Votes
Article ID: iaor20061361
Country: South Africa
Volume: 21
Issue: 1
Start Page Number: 33
End Page Number: 51
Publication Date: Jan 2005
Journal: Orion
Authors: ,
Keywords: heuristics, programming: travelling salesman
Abstract:

A local search framework for the (undirected) Rural Postman Problem (RPP) is presented in this paper. The framework allows local search approaches that have been applied successfully to the well known Travelling Salesman Problem also to be applied to the RPP. New heuristics for the RPP, based on this framework, are introduced and these are capable of solving significantly larger instances of the RPP than have been reported in the literature. Test results are presented for a number of benchmark RPP instances in a bid to compare efficiency and solution quality against known methods.

Reviews

Required fields are marked *. Your email address will not be published.