Optimal location query in road networks is a basic operation in the location intelligence applications. Given a set of clients and servers on a road network, the purpose of optimal location query is to obtain a location for a new server, so that a certain objective function calculated based on the locations of clients and servers is optimal. Existing works assume no labels for servers and that a client only visits the nearest server. These assumptions are not realistic and it renders the existing work not useful in many cases. In this paper, we relax these assumptions and consider the k nearest neighbours (KNN) of clients. We introduce the problem of KNN-based optimal location query (KOLQ) which considers the k nearest servers of clients and labeled servers. We also introduce a variant problem called relocation KOLQ (RKOLQ) which aims at relocating an existing server to an optimal location. Two main analysis algorithms are proposed for these problems. Extensive experiments on the real road networks illustrate the efficiency of our proposed solutions.

道路网络中的最佳位置查询是位置智能应用程序中的基本操作。给定道路网络上的一组客户端和服务器，最佳位置查询的目的是获取新服务器的位置，以便基于客户端和服务器的位置计算出的某个目标函数是最佳的。现有作品假定没有服务器标签，并且客户端仅访问最近的服务器。这些假设是不现实的，并且使现有工作在许多情况下没有用。在本文中，我们放宽了这些假设，并考虑了客户的k个最近邻居（KNN）。我们介绍了考虑K的基于KNN的最佳位置查询（KOLQ）问题客户端最近的服务器和带有标签的服务器。我们还介绍了一个称为重定位KOLQ（RKOLQ）的变体问题，该问题旨在将现有服务器重定位到最佳位置。针对这些问题，提出了两种主要的分析算法。在真实道路网络上的大量实验说明了我们提出的解决方案的效率。