A heuristic for the periodic rural postman problem

Gianpaolo Ghiani*, Roberto Musmanno, Giuseppe Paletta, Chefi Triki

*المؤلف المقابل لهذا العمل

نتاج البحث: المساهمة في مجلةArticleمراجعة النظراء

20 اقتباسات (Scopus)


The periodic rural postman problem (PRPP) is variant of the classical rural postman problem whose applications arise in garbage collection and street sweeping. In the PRPP each required arc/edge of a graph must be visited a given number of times over an m-day planning period in such a way that service days are equally spaced. The PRPP amounts to select a service day combination for each required arc/edge and to determine a postman tour for each day of the planning period. The objective is to minimize the total distance travelled. In this paper a simple but effective heuristic for the undirected PRPP is presented. Extensive computational results indicate that the algorithm is capable of providing high quality solutions. To our knowledge this is the first methodological paper devoted to a periodic arc routing problem.

اللغة الأصليةEnglish
الصفحات (من إلى)219-228
عدد الصفحات10
دوريةComputers and Operations Research
مستوى الصوت32
رقم الإصدار2
المعرِّفات الرقمية للأشياء
حالة النشرPublished - فبراير 2005

ASJC Scopus subject areas

  • ???subjectarea.asjc.1700???
  • ???subjectarea.asjc.2600.2611???
  • ???subjectarea.asjc.1800.1803???


أدرس بدقة موضوعات البحث “A heuristic for the periodic rural postman problem'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا