淡江大學機構典藏:Item 987654321/20498
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 62822/95882 (66%)
造访人次 : 4024376      在线人数 : 1287
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧：
  • 您可在西文检索词汇前后加上"双引号"，以获取较精准的检索结果
  • 若欲以作者姓名搜寻，建议至进阶搜寻限定作者字段，可获得较完整数据
    •  进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/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.html0KbHTML348检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

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