skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: The Balanced Billing Cycle Vehicle Routing Problem

Abstract

Utility companies typically send their meter readers out each day of the billing cycle in order to determine each customer s usage for the period. Customer churn requires the utility company to periodically remove some customer locations from its meter-reading routes. On the other hand, the addition of new customers and locations requires the utility company to add newstops to the existing routes. A utility that does not adjust its meter-reading routes over time can find itself with inefficient routes and, subsequently, higher meter-reading costs. Furthermore, the utility can end up with certain billing days that require substantially larger meter-reading resources than others. However, remedying this problem is not as simple as it may initially seem. Certain regulatory and customer service considerations can prevent the utility from shifting a customer s billing day by more than a few days in either direction. Thus, the problem of reducing the meterreading costs and balancing the workload can become quite difficult. We describe this Balanced Billing Cycle Vehicle Routing Problem in more detail and develop an algorithm for providing solutions to a slightly simplified version of the problem. Our algorithm uses a combination of heuristics and integer programming via a three-stage algorithm. Wemore » discuss the performance of our procedure on a real-world data set.« less

Authors:
 [1];  [2];  [3]
  1. ORNL
  2. University of Maryland
  3. American University
Publication Date:
Research Org.:
Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
Sponsoring Org.:
USDOE
OSTI Identifier:
967992
DOE Contract Number:  
DE-AC05-00OR22725
Resource Type:
Journal Article
Journal Name:
Networks
Additional Journal Information:
Journal Volume: 54; Journal Issue: 4
Country of Publication:
United States
Language:
English
Subject:
24 POWER TRANSMISSION AND DISTRIBUTION; 32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATION; ALGORITHMS; PERFORMANCE; ELECTRIC UTILITIES; VEHICLES; ROUTING; POWER METERS; DATA ACQUISITION

Citation Formats

Groer, Christopher S, Golden, Bruce, and Edward, Wasil. The Balanced Billing Cycle Vehicle Routing Problem. United States: N. p., 2009. Web. doi:10.1002/net.20336.
Groer, Christopher S, Golden, Bruce, & Edward, Wasil. The Balanced Billing Cycle Vehicle Routing Problem. United States. https://doi.org/10.1002/net.20336
Groer, Christopher S, Golden, Bruce, and Edward, Wasil. 2009. "The Balanced Billing Cycle Vehicle Routing Problem". United States. https://doi.org/10.1002/net.20336.
@article{osti_967992,
title = {The Balanced Billing Cycle Vehicle Routing Problem},
author = {Groer, Christopher S and Golden, Bruce and Edward, Wasil},
abstractNote = {Utility companies typically send their meter readers out each day of the billing cycle in order to determine each customer s usage for the period. Customer churn requires the utility company to periodically remove some customer locations from its meter-reading routes. On the other hand, the addition of new customers and locations requires the utility company to add newstops to the existing routes. A utility that does not adjust its meter-reading routes over time can find itself with inefficient routes and, subsequently, higher meter-reading costs. Furthermore, the utility can end up with certain billing days that require substantially larger meter-reading resources than others. However, remedying this problem is not as simple as it may initially seem. Certain regulatory and customer service considerations can prevent the utility from shifting a customer s billing day by more than a few days in either direction. Thus, the problem of reducing the meterreading costs and balancing the workload can become quite difficult. We describe this Balanced Billing Cycle Vehicle Routing Problem in more detail and develop an algorithm for providing solutions to a slightly simplified version of the problem. Our algorithm uses a combination of heuristics and integer programming via a three-stage algorithm. We discuss the performance of our procedure on a real-world data set.},
doi = {10.1002/net.20336},
url = {https://www.osti.gov/biblio/967992}, journal = {Networks},
number = 4,
volume = 54,
place = {United States},
year = {Thu Jan 01 00:00:00 EST 2009},
month = {Thu Jan 01 00:00:00 EST 2009}
}