A heuristic for the periodic rural postman problem

Gianpaolo Ghiani, Roberto Musmanno, Giuseppe Paletta, Chefi Triki

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)219-228
Number of pages10
JournalComputers and Operations Research
Volume32
Issue number2
DOIs
Publication statusPublished - Feb 2005

Fingerprint

heuristics
Heuristics
Arc of a curve
Planning
Arc Routing
Garbage Collection
Sweeping
Routing Problem
planning
Computational Results
Minimise
Graph in graph theory

Keywords

  • Arc routing problems
  • Periodic routing problems

ASJC Scopus subject areas

  • Information Systems and Management
  • Management Science and Operations Research
  • Applied Mathematics
  • Modelling and Simulation
  • Transportation

Cite this

A heuristic for the periodic rural postman problem. / Ghiani, Gianpaolo; Musmanno, Roberto; Paletta, Giuseppe; Triki, Chefi.

In: Computers and Operations Research, Vol. 32, No. 2, 02.2005, p. 219-228.

Research output: Contribution to journalArticle

Ghiani, Gianpaolo ; Musmanno, Roberto ; Paletta, Giuseppe ; Triki, Chefi. / A heuristic for the periodic rural postman problem. In: Computers and Operations Research. 2005 ; Vol. 32, No. 2. pp. 219-228.
@article{0beac893863047dbb69a9f0425dd107e,
title = "A heuristic for the periodic rural postman problem",
abstract = "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.",
keywords = "Arc routing problems, Periodic routing problems",
author = "Gianpaolo Ghiani and Roberto Musmanno and Giuseppe Paletta and Chefi Triki",
year = "2005",
month = "2",
doi = "10.1016/S0305-0548(03)00213-2",
language = "English",
volume = "32",
pages = "219--228",
journal = "Surveys in Operations Research and Management Science",
issn = "0305-0548",
publisher = "Elsevier Limited",
number = "2",

}

TY - JOUR

T1 - A heuristic for the periodic rural postman problem

AU - Ghiani, Gianpaolo

AU - Musmanno, Roberto

AU - Paletta, Giuseppe

AU - Triki, Chefi

PY - 2005/2

Y1 - 2005/2

N2 - 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.

AB - 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.

KW - Arc routing problems

KW - Periodic routing problems

UR - http://www.scopus.com/inward/record.url?scp=4544340741&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=4544340741&partnerID=8YFLogxK

U2 - 10.1016/S0305-0548(03)00213-2

DO - 10.1016/S0305-0548(03)00213-2

M3 - Article

VL - 32

SP - 219

EP - 228

JO - Surveys in Operations Research and Management Science

JF - Surveys in Operations Research and Management Science

SN - 0305-0548

IS - 2

ER -