PofoliaShared via Pofolia

Scientific Reports· 2026Q1

Data-driven discrete geofence design using binary quadratic programming

Keisuke Otaki, A. Okada, Tadayoshi MATSUMORI, Hiroaki Yoshida

Short summary

This study introduces a novel discrete geofence design method using binary quadratic programming, enabling the creation of non-circular geofences that better align with real-world mobility patterns and boundaries than traditional circular geofences.

AI-generated from the title and abstract; the full text is not read.

Key points

  • Proposes a discrete geofence design using binary quadratic programming, representing geofences as selected spatial cells.
  • Enables the creation of non-circular geofences that better align with mobility patterns and urban boundaries than circular designs.
  • Validated using real-world GeoLife data and synthetic scenarios, comparing against circular and density-based baselines.
  • Evaluation metrics include coverage ratios, shape connectivity, POI-aware separation, and runtime.

AI-generated from the title and abstract; the full text is not read.

Abstract

Abstract Geofences have attracted significant attention in the design of spatial and virtual regions for managing and triggering spatiotemporal events; for example, content providers can trigger spatiotemporal events through mobile devices. Traditionally, geofences were hand-crafted by providers. In addition to the hand-crafted approach, recent advances in collecting human mobility data through mobile devices can accelerate the automated, data-driven design of geofences, also known as the geofence design problem. Previous approaches assume circular shapes; thus, their flexibility is insufficient, and they are mainly suited to geofence-based applications over large areas at coarse resolutions. A challenge with using circular geofences in urban and high-resolution areas is that they often overlap and fail to align with political district boundaries and road segments, such as one-way streets and median barriers. This study proposes a discrete geofence design formulation that represents a geofence as selected spatial cells and optimizes the selection by binary quadratic programming. Although binary quadratic programming problems are computationally hard, modern optimization solvers can often find practical solutions. Furthermore, expressing the model in a quadratic binary form provides a computational interface to specialized quadratic and heuristic solvers, including annealing-based approaches. We then develop and compare different formulation methods to extract discrete geofences. In our numerical evaluation, we validate the formulation using a real-world GeoLife case study and synthetic multiple-POI scenarios, and compare it with circular geofences and density-based top- k , connected top- k , and DBSCAN + alpha-shape baselines. The evaluation uses user-level coverage ratio, user-point-level coverage ratio, shape connectivity, POI-aware separation, and runtime and scalability. The results show that the proposed formulation can generate area-controlled, non-circular geofences that better reflect mobility patterns than circular baselines, while the computational cost and the choice of discretization level remain important practical limitations.

The authors' abstract, as published at the source. Scientific Reports, 2026 · DOI ↗

TakeawaysPremium
Ask the paperFree account

Continue with a free account

Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.

Continue free on the web

Sign in with Google or Apple; no card needed. You come back to this paper.

On your phone:

Field: Transportation

TransportationSocial Sciences