A context-based geoprocessing framework for optimizing meetup location of multiple moving objects along road networks

by   Shaohua Wang, et al.

Given different types of constraints on human life, people must make decisions that satisfy social activity needs. Minimizing costs (i.e., distance, time, or money) associated with travel plays an important role in perceived and realized social quality of life. Identifying optimal interaction locations on road networks when there are multiple moving objects (MMO) with space-time constraints remains a challenge. In this research, we formalize the problem of finding dynamic ideal interaction locations for MMO as a spatial optimization model and introduce a context-based geoprocessing heuristic framework to address this problem. As a proof of concept, a case study involving identification of a meetup location for multiple people under traffic conditions is used to validate the proposed geoprocessing framework. Five heuristic methods with regard to efficient shortest-path search space have been tested. We find that the R* tree-based algorithm performs the best with high quality solutions and low computation time. This framework is implemented in a GIS environment to facilitate integration with external geographic contextual information, e.g., temporary road barriers, points of interest (POI), and real-time traffic information, when dynamically searching for ideal meetup sites. The proposed method can be applied in trip planning, carpooling services, collaborative interaction, and logistics management.


page 18

page 25


Distributed Processing of k Shortest Path Queries over Dynamic Road Networks

The problem of identifying the k-shortest paths (KSPs for short) in a dy...

A Social Distancing-Based Facility Location Approach for Combating COVID-19

In this paper, we introduce and study the problem of facility location a...

Typical Snapshots Selection for Shortest Path Query in Dynamic Road Networks

Finding the shortest paths in road network is an important query in our ...

PHA*: Finding the Shortest Path with A* in An Unknown Physical Environment

We address the problem of finding the shortest path between two points i...

Safest Nearby Neighbor Queries in Road Networks (Full Version)

Traditional route planning and k nearest neighbors queries only consider...

Search-based optimal motion planning for automated driving

This paper presents a framework for fast and robust motion planning desi...

A bi-level encoding scheme for the clustered shortest-path tree problem in multifactorial optimization

The Clustered Shortest-Path Tree Problem (CluSPT) plays an important rol...

Please sign up or login with your details

Forgot password? Click here to reset