A redistricting problem applied to meter reading in power distribution networks

DOI10.1016/J.COR.2013.08.002zbMATH Open1348.90565OpenAlexW2051764358MaRDI QIDQ336759FDOQ336759

Authors: Laura Silva de Assis, P. M. França, 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

Recommendations

• Multiple criteria districting problemsthe public transportation network pricing system of the Paris region
• Districting for arc routing
• Optimal political districting
• School redistricting: embedding GIS tools with integer programming
• Optimal districting and territory design

zbMATH Keywords

multicriteria optimizationGRASPcapacitated clusteringredistricting problems

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (14)

• Towards a stochastic programming modeling framework for districting
• The Capacitated and Economic Districting Problem
• Integrating territory design and routing problems
• Visual attractiveness in routing problems: a review
• 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
• The mixed capacitated arc routing problem with non-overlapping routes
• A novel model for arc territory design: promoting Eulerian districts
• Local search heuristics for sectoring routing in a household waste collection context
• A continuous districting model focusing on intra‐ and inter‐zonal squared distances and its Voronoi‐based heuristic
• A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution
• Approximation schemes for districting problems with probabilistic constraints
• Exact approaches for solving a covering problem with capacitated subtrees
• Districting for arc routing

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336759)