A simulated annealing genetic algorithm for the electrical power districting problem
From MaRDI portal
Publication:1812144
DOI10.1023/A:1023347000978zbMath1053.90061OpenAlexW121774301MaRDI QIDQ1812144
Mangesh Hoskote, Paul K. Bergey, Cliff T. Ragsdale
Publication date: 18 June 2003
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1023347000978
Management decision making, including multiple objectives (90B50) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (13)
Towards a stochastic programming modeling framework for districting ⋮ Inequity averse optimization in operational research ⋮ A multi-criteria police districting problem for the efficient and effective design of patrol sector ⋮ Modularity maximization to design contiguous policy zones for pandemic response ⋮ Districting for Arc Routing ⋮ Primal and dual bounds for the vertex \(p\)-median problem with balance constraints ⋮ A multi‐period multi‐criteria districting problem applied to primary care scheme with gradual assignment ⋮ Hybrid evolutionary algorithms in a SVR traffic flow forecasting model ⋮ Redistricting without gerrymandering, utilizing the convexity ratio, and other applications to business and industry ⋮ A robust optimization approach to assess the effect of delays in the connection-to-the-grid time of new generation power plants over transmission expansion planning ⋮ Multiple criteria districting problemsthe public transportation network pricing system of the Paris region ⋮ A location-allocation-improvement heuristic for districting with multiple-activity balancing constraints and \(p\)-median-based dispersion minimization ⋮ Towards a unified territorial design approach - applications, algorithms and GIS integration. (With comments and rejoinder)
This page was built for publication: A simulated annealing genetic algorithm for the electrical power districting problem
