AI 中文总结
该研究分析公交线路规划问题的复杂度，发现智能体成本模型、是否允许智能体选择步行等因素会影响问题难度，相关结果还证明了其NP-hard性与参数化难解性。
AI 中文摘要
在公交线路规划问题中，任务是在包含多个智能体的网络中规划公交线路，每个智能体都希望从起点前往目的地。公交线路规划需考虑多种因素，包括智能体到达公交站点的成本、出行时间，以及公交车的能耗等。本研究探讨了该问题多个变体的复杂度，重点关注目标函数和智能体步行成本模型如何影响问题复杂度。在观察到即使是最简单的智能体成本模型也会导致一般网络上的问题难解后，我们研究了树状结构网络的情况。主要研究发现如下：第一，允许使用智能体特定的成本模型，即使是在星型这类极其受限的树结构上也会导致问题难解；第二，一致的智能体模型（其中智能体仅在起点和目的地方面存在差异）在某些情况下会降低问题复杂度；第三，允许智能体在乘坐公交与直接步行之间做出选择，会使问题的难度显著提升。我们的大部分难解性结果不仅证明了经典的NP-hard性，还针对自然参数k（即公交站点的数量）证明了参数化难解性。
英文摘要
In bus routing, the task is to plan a bus route in a network with several agents, each of whom wants to travel from a starting point to a destination. A bus route should account for several factors, including agents' cost for reaching the bus stops, their travel time, or the energy consumption of the buses. We study the complexity of several variants of this problem, focusing on how the objective function and the models for agents' walking costs influence the problem complexity. After observing that even the simplest agent cost model leads to hardness on general networks, we consider networks with tree structure. Our main findings are as follows. First, allowing agent-specific cost models leads to hardness even on extremely limited trees such as stars. Second, consistent agent models (where agents differ only in their starting points and destinations) make the problem easier in some cases. Finally, allowing agents to choose between using the bus and walking directly can make the problem considerably harder. Most of our hardness results show not only classical NP-hardness but also parameterized intractability for the natural parameter $k$, the number of bus stops.
