TY - GEN
T1 - Research on Transfer Method of Highway Toll Card
AU - Yu, Haiyang
AU - Wu, Chao
AU - Ren, Yilong
N1 - Publisher Copyright:
© ASCE.
PY - 2020
Y1 - 2020
N2 - With the continuous development of expressways, traditional toll models cannot meet current demand. CPCs (compound pass cards) have replaced ICCs (integrated circuit cards), which can solve the problem of charging for ambiguous road segments. In order to solve the higher cost problem, this paper proposes a feasible CPC allocation method. The results of ant colony algorithm and tabu search algorithm are compared to verify superiority of tabu. First, we determine the profit and loss of each station after determining the allocation period and calculate the initial card-carrying amount accordingly. Secondly, the shortest circuit problem is regarded as a TSP (traveling salesman problem), and tabu is used to obtain the shortest circuit connecting all stations and number of vehicles required. Finally, the vehicle starts from the dispatching center, carries a certain number of cards, supplements a company lacking the card, and the company collects the card, completing the whole dispatching process.
AB - With the continuous development of expressways, traditional toll models cannot meet current demand. CPCs (compound pass cards) have replaced ICCs (integrated circuit cards), which can solve the problem of charging for ambiguous road segments. In order to solve the higher cost problem, this paper proposes a feasible CPC allocation method. The results of ant colony algorithm and tabu search algorithm are compared to verify superiority of tabu. First, we determine the profit and loss of each station after determining the allocation period and calculate the initial card-carrying amount accordingly. Secondly, the shortest circuit problem is regarded as a TSP (traveling salesman problem), and tabu is used to obtain the shortest circuit connecting all stations and number of vehicles required. Finally, the vehicle starts from the dispatching center, carries a certain number of cards, supplements a company lacking the card, and the company collects the card, completing the whole dispatching process.
KW - Allocation problem
KW - Ant colony algorithm
KW - CPC card
KW - Expressways
KW - Tabu search algorithm
UR - https://www.scopus.com/pages/publications/85107172220
U2 - 10.1061/9780784482933.019
DO - 10.1061/9780784482933.019
M3 - 会议稿件
AN - SCOPUS:85107172220
T3 - CICTP 2020: Advanced Transportation Technologies and Development-Enhancing Connections - Proceedings of the 20th COTA International Conference of Transportation Professionals
SP - 215
EP - 226
BT - CICTP 2020
A2 - Wang, Haizhong
A2 - Wei, Heng
A2 - Zhang, Lei
A2 - An, Yisheng
PB - American Society of Civil Engineers (ASCE)
T2 - 20th COTA International Conference of Transportation Professionals: Advanced Transportation Technologies and Development-Enhancing Connections, CICTP 2020
Y2 - 14 August 2020 through 16 August 2020
ER -