Routing electric meter readers

Helman I. Stern, Moshe Dror

Research output: Contribution to journalArticle

51 Citations (Scopus)

Abstract

Electric utility companies employ a crew of workers who periodically visit and read the electric meters of each customer in their service area. Each reader is transported by auto from a central office to the first customer on his work list. At the end of his work shift time limit the reader is free to leave the area possibly returning home or to the central office by public bus. Taking a graph that corresponds to the city network of streets meter readers must traverse each street while moving from house to house. It is possible that dead heading may be required-back tracking over a street that has already been covered. A working tour is an open path whose reading time plus deadheading time does not exceed the work limit. The problem is to find the minimum number of working tours. Stating the problem in this manner gives us an optimization problem closely related to the M-Chinese postman problem-an edge oriented routing problem. After presenting some background on this type of problem a heuristic procedure is used to solve an example from the City of Beersheva. The solution provides a 40% reduction in the number of working tours. The paper ends with a discussion of the solution, and provides conditions under which the algorithm should have practical utility.

Original languageEnglish (US)
Pages (from-to)209-223
Number of pages15
JournalComputers and Operations Research
Volume6
Issue number4
DOIs
StatePublished - 1979
Externally publishedYes

Fingerprint

Electric measuring instruments
Routing
Customers
Chinese Postman Problem
Backtracking
Electric utilities
Routing Problem
Exceed
customer
Heuristics
Optimization Problem
shift work
Path
Graph in graph theory
heuristics
Industry
worker

ASJC Scopus subject areas

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

Cite this

Routing electric meter readers. / Stern, Helman I.; Dror, Moshe.

In: Computers and Operations Research, Vol. 6, No. 4, 1979, p. 209-223.

Research output: Contribution to journalArticle

Stern, Helman I. ; Dror, Moshe. / Routing electric meter readers. In: Computers and Operations Research. 1979 ; Vol. 6, No. 4. pp. 209-223.
@article{859358874af2459ea43f6b5edd417acb,
title = "Routing electric meter readers",
abstract = "Electric utility companies employ a crew of workers who periodically visit and read the electric meters of each customer in their service area. Each reader is transported by auto from a central office to the first customer on his work list. At the end of his work shift time limit the reader is free to leave the area possibly returning home or to the central office by public bus. Taking a graph that corresponds to the city network of streets meter readers must traverse each street while moving from house to house. It is possible that dead heading may be required-back tracking over a street that has already been covered. A working tour is an open path whose reading time plus deadheading time does not exceed the work limit. The problem is to find the minimum number of working tours. Stating the problem in this manner gives us an optimization problem closely related to the M-Chinese postman problem-an edge oriented routing problem. After presenting some background on this type of problem a heuristic procedure is used to solve an example from the City of Beersheva. The solution provides a 40{\%} reduction in the number of working tours. The paper ends with a discussion of the solution, and provides conditions under which the algorithm should have practical utility.",
author = "Stern, {Helman I.} and Moshe Dror",
year = "1979",
doi = "10.1016/0305-0548(79)90005-4",
language = "English (US)",
volume = "6",
pages = "209--223",
journal = "Surveys in Operations Research and Management Science",
issn = "0305-0548",
publisher = "Elsevier Limited",
number = "4",

}

TY - JOUR

T1 - Routing electric meter readers

AU - Stern, Helman I.

AU - Dror, Moshe

PY - 1979

Y1 - 1979

N2 - Electric utility companies employ a crew of workers who periodically visit and read the electric meters of each customer in their service area. Each reader is transported by auto from a central office to the first customer on his work list. At the end of his work shift time limit the reader is free to leave the area possibly returning home or to the central office by public bus. Taking a graph that corresponds to the city network of streets meter readers must traverse each street while moving from house to house. It is possible that dead heading may be required-back tracking over a street that has already been covered. A working tour is an open path whose reading time plus deadheading time does not exceed the work limit. The problem is to find the minimum number of working tours. Stating the problem in this manner gives us an optimization problem closely related to the M-Chinese postman problem-an edge oriented routing problem. After presenting some background on this type of problem a heuristic procedure is used to solve an example from the City of Beersheva. The solution provides a 40% reduction in the number of working tours. The paper ends with a discussion of the solution, and provides conditions under which the algorithm should have practical utility.

AB - Electric utility companies employ a crew of workers who periodically visit and read the electric meters of each customer in their service area. Each reader is transported by auto from a central office to the first customer on his work list. At the end of his work shift time limit the reader is free to leave the area possibly returning home or to the central office by public bus. Taking a graph that corresponds to the city network of streets meter readers must traverse each street while moving from house to house. It is possible that dead heading may be required-back tracking over a street that has already been covered. A working tour is an open path whose reading time plus deadheading time does not exceed the work limit. The problem is to find the minimum number of working tours. Stating the problem in this manner gives us an optimization problem closely related to the M-Chinese postman problem-an edge oriented routing problem. After presenting some background on this type of problem a heuristic procedure is used to solve an example from the City of Beersheva. The solution provides a 40% reduction in the number of working tours. The paper ends with a discussion of the solution, and provides conditions under which the algorithm should have practical utility.

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

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

U2 - 10.1016/0305-0548(79)90005-4

DO - 10.1016/0305-0548(79)90005-4

M3 - Article

AN - SCOPUS:0018683270

VL - 6

SP - 209

EP - 223

JO - Surveys in Operations Research and Management Science

JF - Surveys in Operations Research and Management Science

SN - 0305-0548

IS - 4

ER -