A redistricting problem applied to meter reading in power distribution networks

DOI10.1016/J.COR.2013.08.002zbMath1348.90565OpenAlexW2051764358MaRDI QIDQ336759

Paulo Morelato França, Laura Silva de Assis, Fábio Luiz Usberti

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.08.002

zbMATH Keywords

GRASPmulticriteria optimizationcapacitated clusteringredistricting problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Deterministic network models in operations research (90B10) Case-oriented studies in operations research (90B90)

Related Items (14)

Towards a stochastic programming modeling framework for districting ⋮ Visual attractiveness in routing problems: a review ⋮ The mixed capacitated arc routing problem with non-overlapping routes ⋮ Local search heuristics for sectoring routing in a household waste collection context ⋮ Integrating territory design and routing problems ⋮ Districting for Arc Routing ⋮ A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution ⋮ A continuous districting model focusing on intra‐ and inter‐zonal squared distances and its Voronoi‐based heuristic ⋮ The Capacitated and Economic Districting Problem ⋮ Approximation schemes for districting problems with probabilistic constraints ⋮ Exact approaches for solving a covering problem with capacitated subtrees ⋮ A location-allocation-improvement heuristic for districting with multiple-activity balancing constraints and \(p\)-median-based dispersion minimization ⋮ Simultaneous node and link districting in transportation networks: model, algorithms and railway application ⋮ A novel model for arc territory design: promoting Eulerian districts

Cites Work

• Unnamed Item
• Unnamed Item
• Political districting: From classical models to recent approaches
• Greedy random adaptive memory programming search for the capacitated clustering problem
• The open capacitated arc routing problem
• The arc partitioning problem
• A reactive GRASP for a commercial territory design problem with multiple balancing requirements
• Solving a large scale districting problem: A case report
• Multicriteria analysis: Survey and new directions
• Optimal political districting
• Greedy randomized adaptive search procedures
• A tabu search heuristic and adaptive memory procedure for political districting
• A survey of recent developments in multiobjective optimization
• Multiple criteria districting problemsthe public transportation network pricing system of the Paris region
• Local search algorithms for political districting
• Fast Approximation Methods for Sales Force Deployment
• Multicriteria Optimization
• Optimal Political Districting by Implicit Enumeration Techniques

This page was built for publication: A redistricting problem applied to meter reading in power distribution networks