scispace - formally typeset
Search or ask a question

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


Journal ArticleDOI
TL;DR: In this paper, the authors derived a related adjoint network representation and sensitivity coefficients for networks containing a very broad class of elements: those that admit a parametric representation, and a brief discussion is given as to how these results may be exploited in a general automated network design scheme.
Abstract: It has been established that the adjoint network and network sensitivities play important roles in automated network design algorithms. The present paper derives a related adjoint network representation and sensitivity coefficients for networks containing a very broad class of elements: those that admit a parametric representation. A brief discussion is given as to how these results may be exploited in a general automated network design scheme.

503 citations


Journal ArticleDOI
TL;DR: The reinterpretation of this sensitivity of any associated network function with respect to scalar indices of network performance provides an automated frequency-domain network design principle of far-reaching consquences.
Abstract: Application of Tellegen's theorem to an originally specified network leads to a simple computation of the unnormalized sensitivity of any associated network function with respect to all pertinent network parameters in terms of analysis of it and its topologically equivalent adjoint network. The reinterpretation of this sensitivity to scalar indices of network performance provides an automated frequency-domain network design principle of far-reaching consquences. A computer program has been written to implement the design algorithm. Preliminary results show this program to be highly effective.

202 citations


Journal ArticleDOI
TL;DR: In this article, a network of road links is constructed and the traffic demand is modeled as a relation between two nodes in the network, and the overall system is decomposed into a NET OF NETWORK PROBLEMS, where each node will represent the road system in one time period.

20 citations



Journal ArticleDOI
TL;DR: The project planning diagrams illustrate the system for scheduling of project activities and the relation of each activity to the others.
Abstract: A simplification of the two most commonly used methods of network planning and scheduling is ideally suited to the planning and evaluation of both water resources studies and construction projects. The project planning diagrams illustrate the system for scheduling of project activities and the relation of each activity to the others.

1 citations


01 Dec 1969
TL;DR: The filter design problem is considered as an optimization problem, which uses the circuit designer's experience and knowledge to set up the problem but relieves him of the tedious labor now performed by the high-speed digital computer.
Abstract: : The filter design problem is considered as an optimization problem. An iterative search technique is employed to adjust the variable network element values to approximate some desired network response, with a minimum of error. Explicit constraints are employed to ensure physical realizability. The design process uses a combination of a modified version of Calahan's network analysis program with a direct search method of minimization developed by Hooke and Jeeves. The result is a procedure which uses the circuit designer's experience and knowledge to set up the problem but relieves him of the tedious labor now performed by the high-speed digital computer.

1 citations


Journal Article
TL;DR: In this article, the authors report on the results of the DAHomey LAND TRANSPORT STUDY, which was conducted by the Canadian Group under the AUSPICES of the United Nations Development Program and the World Bank.
Abstract: METHODOLOGICAL ADVANCES ACHIEVED BY THE DAHOMEY LAND TRANSPORT STUDY ARE REPORTED WHICH WERE RECENTLY CARRIED OUT BY A CANADIAN GROUP UNDER THE AUSPICES OF THE UNITED NATIONS DEVELOPMENT PROGRAM AND THE WORLD BANK. THE STUDY EMPLOYED AN ENGINEERING-ECONOMIC SYSTEMS ANALYSIS AIMED AT THE ACCOMPLISHMENT OF DESIRABLE FUTURE TRANSPORT TASKS AT MINIMUM TRUE COSTS TO SOCIETY. THERE WAS FULL INTEGRATION BETWEEN TRANSPORT PLANNING PER SE, AND SOCIOECONOMIC DEVELOPMENTS, ESPECIALLY IN THE CRUCIAL AGRICULTURAL SECTOR, TO THE TARGET YEAR 1990. GIVEN POPULATION ESTIMATES, PRODUCTION AND CONSUMPTION QUANTITIES, BOTH PRESENT AND FUTURE, FOR EACH NODE, THE 'TRANS' MODEL CALCULATED INDIVIDUAL COMMODITY SURPLUSES AND DEFICIENCIES THROUGHOUT THE COUNTRY. IT THEN SIMULATED FREIGHT AND PASSENGER MOVEMENTS THROUGH THE LAND TRANSPORT NETWORK BY APPLYING A 'MINIMUM COST PATH' CRITERION. THESE CALCULATED TRAFFIC FLOWS FOR THE CURRENT YEAR WERE THEN COMPARED WITH ACTUAL MOVEMENTS, OBTAINED THROUGH O-D STUDIES AND COUNTS, AND THE TRANS MODEL CALIBRATED. THE TRANS MODEL OUTPUT, LINK INVENTORY INFORMATION, AND NEW PROPOSAL COAST WERE ALL FED INTO THE 'OPT' MODEL. ITS CHIEF PURPOSE WAS TO CONFRONT VARIOUS TRAFFIC LOADS GENERATED BY THE TRANS MODEL WITH DIFFERENT TECHNICAL NETWORK DESIGNS. IT SELECTED FROM THOSE THE ONE COMBINATION THAT PROMISED TO HANDLE THE TOTAL LOGISTICS TASK AT MINIMUM TOTAL COSTS, THE COST STREAMS BEING DISCOUNTED AT RELEVANT TRIAL INTEREST RATES OVER THE PLANNING PERIOD 1969 TO 1990. INHERENT IN THE OPT MODEL WERE ECONOMIC-TECHNICAL INTERACTIONS BETWEEN VEHICLE AND ROAD, AS ANALYZED BY ROBLEY WINFREY AND JAN DE WEILLE; TAX CONTENT AND FOREIGN EXCHANGE ADJUSTMENTS; AND CONVERGENT ITERATIVE TRAFFIC ASSIGNMENT VERSUS NETWORK DESIGN CALCULATIONS. /AUTHOR/

1 citations