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.
翻译:鉴于人类生活受到不同种类的限制,人们必须作出符合社会活动需要的决定; 尽量减少与旅行有关的费用(即距离、时间或金钱)在人们的感知和实现社会生活质量方面发挥着重要作用; 确定道路网络中具有多种移动物体(MMO)且时间有限的最佳互动地点仍然是一项挑战; 在这项研究中,我们正式确定为MMO寻找动态理想互动地点作为空间优化模式的问题,并引入一个基于背景的地质处理超速框架来解决这一问题; 作为概念的证明,在动态搜索理想匹配地点时,使用涉及为交通条件下的多个人员确定一个会合地点的案例研究来验证拟议的地理处理框架; 测试了高效最短路途搜索空间的五种超常方法; 我们发现,基于树木的算法以高质量解决方案和低计算时间为最佳表现; 在地理信息系统环境中实施这一框架,以促进与外部地理背景信息(例如临时道路障碍、兴趣点)的融合; 实时交通信息,作为概念的证明; 在动态搜索理想匹配地点时,可以使用拟议的方法,用于旅行规划、汽车管理方面的合作。