Data-driven optimization and statistical modeling to improve meter reading for utility companies
From MaRDI portal
Publication:2147136
DOI10.1016/J.COR.2022.105844OpenAlexW4225995453MaRDI QIDQ2147136FDOQ2147136
Edward Wasil, Bruce Golden, Christof Defryn, Debdatta Sinha Roy
Publication date: 22 June 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.105844
Recommendations
- Advances in meter Reading: heuristic solution of the close enough traveling salesman problem over a street network
- The balanced billing cycle vehicle routing problem
- Effect of mobility of smart meters on performance of advanced metering infrastructure
- The Stochastic Close-Enough Arc Routing Problem
- VEHICLE ROUTE OPTIMIZATION FOR RFID INTEGRATED WASTE COLLECTION SYSTEM
Cites Work
- Bayesian Analysis of Binary and Polychotomous Response Data
- A note on two problems in connexion with graphs
- Monte Carlo sampling methods using Markov chains and their applications
- Bayesian Statistics and Marketing
- Equation of State Calculations by Fast Computing Machines
- Bayesian Essentials with R
- Approximation algorithms for TSP with neighborhoods in the plane
- Title not available (Why is that?)
- Estimating the length of the optimal TSP tour: An empirical study using regression and neural networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- The balanced billing cycle vehicle routing problem
- The arc partitioning problem
- Solving the close-enough arc routing problem
- An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem
- A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem
- Heuristic Approaches for a TSP Variant: The Automatic Meter Reading Shortest Tour Problem
- The close enough traveling salesman problem: a discussion of several heuristics
- Title not available (Why is that?)
- The multiple trip vehicle routing problem with backhauls: formulation and a two-level variable neighbourhood search
- A fast two-level variable neighborhood search for the clustered vehicle routing problem
- Variable neighborhood search: basics and variants
- Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network
- The stochastic close-enough arc routing problem
- An Open-Source Desktop Application for Generating Arc-Routing Benchmark Instances
Uses Software
This page was built for publication: Data-driven optimization and statistical modeling to improve meter reading for utility companies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2147136)
