政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/69782
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 113318/144297 (79%)
Visitors : 51026377      Online Users : 921
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/69782


    Title: Methods for path and service planning under route constraints
    Authors: 劉昭麟
    Liu,Chao-Lin;Pai,Tun-Wen
    Contributors: 資科系
    Date: 2006-01
    Issue Date: 2014-09-11 10:44:45 (UTC+8)
    Abstract: We examine methods for a special class of path-planning problems in which the routes are constrained. The scenario could happen, for instance, in transit systems where passengers cannot order drivers to change the routes of public buses to meet individual travel needs. General search algorithms are applicable to this class of problems, but may not find the desired solution as efficiently as possible. This paper reports three different strategies that capture the route constraints for improving efficiency of path planning algorithms. The first strategy applies hierarchical planning, and the rest employs matrices for encoding route constraints. We propose and prove that the Q matrix is instrumental for capturing route constraints and measuring quality of service of the transportation network. Moreover, we discuss how we may apply the Q matrix in designing admissible heuristic functions that are crucial for applying the A* algorithm for best-path planning under route constraints.
    Relation: Int. J. of Computer Applications in Technology,25(1),40-49
    Data Type: article
    DOI link: http://dx.doi.org/10.1504/IJCAT.2006.008668
    DOI: 10.1504/IJCAT.2006.008668
    Appears in Collections:[Department of Computer Science ] Periodical Articles

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML21079View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback