教師資料查詢 | 類別: 期刊論文 | 教師: 張勝雄 Chang Sheng-hsiung (瀏覽個人網頁)

標題:A heuristic algorithm for solving the discrete network design problem
學年81
學期1
出版(發表)日期1993/01/01
作品名稱A heuristic algorithm for solving the discrete network design problem
作品名稱(其他語言)
著者Chang, Chia-juch; Chang, Sheng-hsiung
單位淡江大學運輸管理學系
出版者Abingdon: Taylor & Francis Ltd.
著錄名稱、卷期、頁數Transportation Planning and Technology 17(1), pp.39-50
摘要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.
關鍵字Network design;investment decision model;heuristic algorithm
語言英文
ISSN0308-1060
期刊性質國外
收錄於SCI;EI
產學合作
通訊作者
審稿制度
國別英國
公開徵稿
出版型式紙本
相關連結
Google+ 推薦功能,讓全世界都能看到您的推薦!