A method to simplify network representation in transportation planning-Reference-Cited by-同舟云学术

A method to simplify network representation in transportation planning

Published:1976-06 Issue:3 Volume:10 Page:179-191
ISSN:0041-1647
Container-title:Transportation Research
language:en
Short-container-title:Transportation Research

Author:

Chan Yupo

Publisher

Elsevier BV

Reference15 articles.

1. Solution of large scale transportation problems through aggregation;Balas;Operations Research,1965

2. Aggregation in transport networks: An Application of Hierarchical Structure;Chan;M.I.T. Dept. Civil Engng Res. Report No. R68-47,1968

3. Optimal travel time reduction in a transit network: An Application of Network Aggregation and Branch-and-Bound Techniques;Chan;Research Report R69-39, M.I.T. Dept. of Civil Engng,1969

4. An appraisal of some shortest-path algorithms;Dreyfus,1968

5. Flows in Networks;Ford,1962

Cited by 20 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Spatial Aggregation Issues in Traffic Assignment Models;Networks and Spatial Economics;2020-11-09

2. Aggregation, disaggregation and decomposition methods in traffic assignment: historical perspectives and new trends;Transportation Research Part B: Methodological;2020-09

3. STUDY ON A CHOICE OF HUB NODES IN A ROAD NETWORK AND ITS PARTITIONING BASED ON THE EXTENDED CONCEPT OF EIGENVECTOR CENTRALITY;Journal of Japan Society of Civil Engineers, Ser. D3 (Infrastructure Planning and Management);2018

4. A decomposition approach to the static traffic assignment problem;Transportation Research Part B: Methodological;2017-11

5. A SIMPLIFIED CALCULATION PROCEDURE TO EVALUATE A CONNECTIVITY RELIABILITY OF A ROAD NETWORK;Journal of Japan Society of Civil Engineers, Ser. A2 (Applied Mechanics (AM));2017