Showing papers on "Network planning and design published in 1975"

An Algorithm for the Discrete Network Design Problem

Abstract: This paper addresses the problem of determining which links should be improved in an urban road network so that total congestion in the city is minimized. A nonlinear mixed integer programming model is developed, and strategies for a branch-and-bound algorithm are presented. Particular attention is paid to the computational aspects of large-scale problems, and numerical results are reported.

Introduction to transportation planning

Abstract: Transport and society an introduction to travel demand forecasting and transportation planning collection of basic data trip generation trip distribution network planning and traffic assignment modal split computers in transportation planning evaluation of transportation proposals.

Issues in packet switching network design

Abstract: The goals of this paper are to identify several of the key design choices that must be made in specifying a packetswitching network and to provide some insight in each area. Through our involvement in the design, evolution, and operation of the ARPA Network over the last five years (and our consulting in the design of several other networks), we have learned to appreciate both the opportunities and the hazards of this new technical domain.

Network planning by the extended metra potential method (EMPM)

Abstract: • A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers.

Framework of route selection in bus network design

Abstract: The purpose of this study is to establish a framework of route selection in bus network design, based on the proposed functional description and evaluation system. In the proposed framework, the network is classified into residential, activity, and transfer nodes. Routes connecting the transfer nodes serve as the regional system, and other routes constitute the local systems. The evaluation system designed is capable of reflecting both the connectivity of transfer nodes and the accessibility of the residential and activity nodes. To establish the priority of route selection, several attributes were tested against transit use at the neighborhood level. The level of transit service was the sole dominant factor in the traveler's determination of mode choice. Furthermore, the employment activity nodes were significantly correlated with route performance. If the work trips and route performance are given prior consideration, employment serves as a good index during the process of network development. If the provision of accesses to other activities is taken into consideration, employment can also serve as a good indication by connecting those activity nodes to the other elements of the network. This framework will be especially useful when it is integrated in a heuristic algorithm for optimization of network design. A case study was carried out to demonstrate the use of this framework in four stages of bus network development in the Denver area.

Digital data system: Network planning

Abstract: Network design methods are described which determine the multiplexing and digital transmission facilities required to serve a given data-circuit demand. The long-haul network design is based on the definition of a three-level network routing hierarchy, the derivation of intercity bit-stream requirements, and a technique for selecting digital transmission facilities to carry the bit streams. The distribution network design within metropolitan areas makes use of different multiplexing combinations best suited to anticipated demands and techniques for using short-haul digital facilities in an efficient manner.

Applications of the perturbation matrix in network design problems

Abstract: The concept of the perturbation matrix is used to develop a set of simultaneous equations relating the shifts in the eigen-values of the state matrix to variations in either the resistive or reactive elements. A powerful and versatile computer programs based on these equations has been developed and applied to a wide range of network design problems.

Network Planning Methods

Abstract: The construction industry has been slow to take up a wide range of operational research techniques, but one area that has become widely developed is the use and application of network planning methods. There is no generally accepted name for these methods but they are variously called network planning, CPM (critical path method), PERT (programming evaluation and revue technique) and other similar names. There have been many useful books published on this subject, some of which are referred to at the end of this chapter,1,2,3,4 and it may be superfluous to go over this material yet again in this book. The use of the methods has however become very widespread in the industry and it is therefore felt that no book on the use of quantitative methods in the construction industry would be complete without a chapter on network planning methods. This chapter sets out to explain the fundamentals of network planning methods and to discuss the advantages, disadvantages and practical applications of the methods. It is not possible within a single chapter to cover the whole ground and therefore the more sophisticated and advanced aspects of network planning methods have been omitted, but the reader is directed towards other books on the subject.5,6