Show simple item record

contributor authorYang Wen-Ii
contributor authorYang Yun
contributor authorLiu Hong-wei
date accessioned2017-05-08T22:09:36Z
date available2017-05-08T22:09:36Z
date copyrightMarch 2014
date issued2014
identifier other35704444.pdf
identifier urihttp://yetl.yabesh.ir/yetl/handle/yetl/72543
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.
publisherAmerican Society of Civil Engineers
titleResearch of Highway Transportation Path Planning Based on a Fast Traveler Demand Clustering Algorithm
typeJournal Paper
journal volume8
journal issue1
journal titleJournal of Highway and Transportation Research and Development (English Edition)
identifier doi10.1061/JHTRCQ.0000368
treeJournal of Highway and Transportation Research and Development (English Edition):;2014:;Volume ( 008 ):;issue: 001
contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record