禁止登车：同步提高效率
No-boarding buses: Synchronisation for efficiency
摘要：
我们研究了一个系统中的$N$巴士服务$M$巴士站在一个循环，这是一个夹带机制，以保持巴士同步在一个合理的交错配置的禁止登机政策。公共汽车总是允许下车，但如果符合某些标准，则不允许上车。对于一个易于分析的理论，公共汽车以相同的自然速度移动（适用于可编程的自动驾驶公共汽车），其中可以计算在公共汽车站等待公共汽车到达的乘客所经历的平均等待时间。分析结果表明，禁止登机政策可以显着减少平均等待时间，相比，通常情况下，没有禁止登机政策。随后，我们进行了模拟，以验证这些理论分析，也扩展了模拟典型的人力驱动的巴士与不同的自然速度的基础上的实际数据。最后，一个简单的通用自适应算法实现动态确定何时实现禁登在一个真实的大学穿梭巴士服务的模拟。
英文摘要：
We investigate a no-boarding policy in a system of $N$ buses serving $M$ bus stops in a loop, which is an entrainment mechanism to keep buses synchronised in a reasonably staggered configuration. Buses always allow alighting, but would disallow boarding if certain criteria are met. For an analytically tractable theory, buses move with the same natural speed (applicable to programmable self-driving buses), where the average waiting time experienced by passengers waiting at the bus stop for a bus to arrive can be calculated. The analytical results show that a no-boarding policy can dramatically reduce the average waiting time, as compared to the usual situation without the no-boarding policy. Subsequently, we carry out simulations to verify these theoretical analyses, also extending the simulations to typical human-driven buses with different natural speeds based on real data. Finally, a simple general adaptive algorithm is implemented to dynamically determine when to implement no-boarding in a simulation for a real university shuttle bus service.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
