• Login
    View Item 
    •   DSpace Home
    • ASCE
    • Journal of Highway and Transportation Research and Development (English Edition)
    • View Item
    •   DSpace Home
    • ASCE
    • Journal of Highway and Transportation Research and Development (English Edition)
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Research of Highway Transportation Path Planning Based on a Fast Traveler Demand Clustering Algorithm

    Thumbnail
    View/Open
    35704444.pdf (306.5Kb)
    Date
    2014
    Author
    Yang Wen-Ii
    Yang Yun
    Liu Hong-wei
    Metadata
    Show full item record
    Abstract
    To 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.
    URI
    http://yetl.yabesh.ir/yetl/handle/yetl/72543
    Collections
    • Journal of Highway and Transportation Research and Development (English Edition)

    DSpace software copyright © 2002-2015  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    @mire NV
     

     

    Browse

    All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    Statistics

    View Usage Statistics

    DSpace software copyright © 2002-2015  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    @mire NV