English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 58237/91808 (63%)
造訪人次 : 13785516      線上人數 : 64
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/20498


    題名: A heuristic algorithm for solving the discrete network design problem
    作者: Chang, Chia-juch;Chang, Sheng-hsiung
    貢獻者: 淡江大學運輸管理學系
    關鍵詞: Network design;investment decision model;heuristic algorithm
    日期: 1993-01
    上傳時間: 2013-06-07 10:35:57 (UTC+8)
    出版者: Abingdon: Taylor & Francis Ltd.
    摘要: Transportation investment is a difficult decision, especially in developing countries where numerous improvements are needed but only limited resources are available. Although many studies have suggested that the network design approach be used to solve the investment decision problem, yet the problem solving algorithms previously developed are still not sufficient to provide optimal solutions with reasonable computing cost, especially when working with large networks. In this paper we suggest a new heuristic algorithm which can be used by general planners to deal with medium and large network design problems. This algorithm is based on the concept of expected generalized travel cost, and is developed by incorporating the Poorzahedy's modified model (a previous study) in an iterative optimization‐assignment procedure. A small network which was used in other studies is chosen to test the efficiency and effectiveness of the algorithm. In addition, a real highway network with 305 links and 135 candidate additions/alternative improvements has also been applied, and the computational efficiency is presented. All the computing work was executed by using simple commercial packages with a PC‐386 machine. The results conclude that their heuristic algorithm is very effective and is much more efficient than those developed in previous studies. An extended applicability of this algorithm for solving the network design problem with variable travel demand is also discussed.
    關聯: Transportation Planning and Technology 17(1), pp.39-50
    DOI: 10.1080/03081069308717498
    顯示於類別:[運輸管理學系暨研究所] 期刊論文

    文件中的檔案:

    檔案 大小格式瀏覽次數
    index.html0KbHTML262檢視/開啟

    在機構典藏中所有的資料項目都受到原著作權保護.

    TAIR相關文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回饋