English  |  正體中文  |  简体中文  |  Items with full text/Total items : 50122/85141 (59%)
Visitors : 7885452      Online Users : 81
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU 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: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/20498


    Title: A heuristic algorithm for solving the discrete network design problem
    Authors: Chang, Chia-juch;Chang, Sheng-hsiung
    Contributors: 淡江大學運輸管理學系
    Keywords: Network design;investment decision model;heuristic algorithm
    Date: 1993-01
    Issue Date: 2013-06-07 10:35:57 (UTC+8)
    Publisher: Abingdon: Taylor & Francis Ltd.
    Abstract: 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.
    Relation: Transportation Planning and Technology 17(1), pp.39-50
    DOI: 10.1080/03081069308717498
    Appears in Collections:[運輸管理學系暨研究所] 期刊論文

    Files in This Item:

    File SizeFormat
    index.html0KbHTML178View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


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