Scholarlink

The user-oriented, demand-driven nature of demand-responsive customized shuttle bus (CSB) services forces operators to pay more attention to service quality. However, the bus route planning of CSB and other similar systems in established studies rarely took service quality into consideration while minimizing operating costs. This chapter proposed an open split-delivery weighted vehicle routing problem with iterated clustering (OSDWVRP-IC) to simultaneously optimize the route of bus and passenger walking distance. A max–min ant system (MMAS)Max-Min Ant System (MMAS) algorithm is developed to solve the OSDWVRP-IC. The effectiveness of the proposed model is validated using a range of classical benchmark instance sets. The simulation results indicate that the algorithm proposed in this chapter sacrifices a very limited in-vehicle distance in exchange for a significant reduction in passenger walking distance.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Iterated Clustering Optimization for DRT Stop Locating and Bus Routing

  • 章节

  • 发表日期：

    2026年

查看全文
  • Jiangbo Wang,
  • Kai Liu

摘要

The user-oriented, demand-driven nature of demand-responsive customized shuttle bus (CSB) services forces operators to pay more attention to service quality. However, the bus route planning of CSB and other similar systems in established studies rarely took service quality into consideration while minimizing operating costs. This chapter proposed an open split-delivery weighted vehicle routing problem with iterated clustering (OSDWVRP-IC) to simultaneously optimize the route of bus and passenger walking distance. A max–min ant system (MMAS)Max-Min Ant System (MMAS) algorithm is developed to solve the OSDWVRP-IC. The effectiveness of the proposed model is validated using a range of classical benchmark instance sets. The simulation results indicate that the algorithm proposed in this chapter sacrifices a very limited in-vehicle distance in exchange for a significant reduction in passenger walking distance.