聚类分析
启发式
计算机科学
钥匙(锁)
公共交通
过程(计算)
网络规划与设计
过境(卫星)
流量网络
星团(航天器)
相(物质)
运筹学
运输工程
数据挖掘
数学优化
工程类
人工智能
计算机网络
数学
计算机安全
操作系统
有机化学
化学
作者
Zakaria Boutarfa,Mustafa Gok
标识
DOI:10.1177/03611981231167159
摘要
This paper presents a two-phase method for generating a hub-and-spoke network for a multimodal public transit network (MPTN). The first phase addresses the problem of clustering in MPTNs, which is a key operation in solving the hub location problem (HLP) in MPTN design. However, previous work often oversimplifies or neglects the clustering phase, so this study presents a spatial clustering algorithm that can process real urban MPTNs without reducing their size or dividing them into zones. The algorithm is tested on four large city datasets and compared with popular spatial clustering algorithms. In the second phase, a heuristic algorithm is presented that aims to maximize network coverage. The proposed method is tested using the MPTN of Greater London and the resulting hub-and-spoke network is compared with the Journey API provided by Transport for London. The results show that the total travel time is improved by 16.9% with a strict hubbing policy. Transportation planners can adapt the proposed method to their specific needs by changing the size and number of clusters using the cluster scaling factor ([Formula: see text]) parameter and including or excluding any criteria in the decision equations.
科研通智能强力驱动
Strongly Powered by AbleSci AI