如何能在最短时间将煤炭运送到目的地是煤炭运输问题研究的一个重要内容。在道路网络环境中,该问题可以转化为找到查询点的k个最近邻。在带线段障碍的城市Voronoi图基础上,给出k最近邻查询算法,能有效解决该问题。 How to transport coal to its destination in the shortest time is an important part of the research on coal transportation. In a road network environment, this problem can be translated into the k nearest neighbors that find the query point. Based on the Voronoi diagram of city with line segment barrier, we give k nearest neighbor query algorithm, which can effectively solve this problem.