A continuous districting model focusing on intra‐ and inter‐zonal squared distances and its Voronoi‐based heuristic

DOI10.1111/itor.12893OpenAlexW3097337074MaRDI QIDQ6070495

Unnamed Author, Ken-ichi Tanaka

Publication date: 21 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12893

zbMATH Keywords

Voronoi tessellationsquared distancecontinuous districting problemintra- and inter-zonal trips

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• A redistricting problem applied to meter reading in power distribution networks
• Approximate formulas of average distances associated with regions and their applications to location problems
• The facility layout problem
• Optimal facility layout design
• Combining Wang-Landau sampling algorithm and heuristics for solving the unequal-area dynamic facility layout problem
• The equitable location problem on the plane
• The minimum equitable radius location problem with continuous demand
• A Computational Method for Optimizing the Shape and Location of a Polygon on a Plane
• The Quadratic Assignment Problem
• Exact solution of emerging quadratic assignment problems
• Equity-Efficiency Bicriteria Location with Squared Euclidean Distances
• Structural Properties of Voronoi Diagrams in Facility Location Problems with Continuous Demand
• Near-Optimal Solutions to a 2-Dimensional Placement Problem
• The p-center location problem in an area
• Solving a home-care districting problem in an urban setting
• District design for arc-routing applications
• A multi‐period multi‐criteria districting problem applied to primary care scheme with gradual assignment

This page was built for publication: A continuous districting model focusing on intra‐ and inter‐zonal squared distances and its Voronoi‐based heuristic