Show simple item record

dc.contributor.authorYang Wen-Ii
dc.contributor.authorYang Yun
dc.contributor.authorLiu Hong-wei
dc.date.accessioned2017-05-08T22:09:36Z
dc.date.available2017-05-08T22:09:36Z
dc.date.copyrightMarch 2014
dc.date.issued2014
dc.identifier.other35704444.pdf
dc.identifier.urihttp://yetl.yabesh.ir/yetl/handle/yetl/72543
dc.description.abstractTo realize real–time and reliable transportation path planning for improving the efficiency of a traveler in a highway transportation network, this paper presents a fast traveler demand clustering algorithm based on simulated annealing particle swarm optimization (SAPSO). First, we apply fast clustering according to the traveler demand obtained by a cooperative vehicle system, and then integrate the results with the planning destination target and traveling vehicle information to realize the optimized highway transportation path. Based on an experiment and comparison results, this method has better performance than two algorithms and has high effectiveness and should increase traveler satisfaction.
dc.publisherAmerican Society of Civil Engineers
dc.titleResearch of Highway Transportation Path Planning Based on a Fast Traveler Demand Clustering Algorithm
dc.typeJournal Paper
dc.journal.volume8
dc.journal.issue1
dc.journal.titleJournal of Highway and Transportation Research and Development (English Edition)
dc.identifier.doi10.1061/JHTRCQ.0000368
dc.treeJournal of Highway and Transportation Research and Development (English Edition):;2014:;Volume ( 008 ):;issue: 001
dc.contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record