Topic
Network planning and design
About: Network planning and design is a research topic. Over the lifetime, 12393 publications have been published within this topic receiving 229776 citations. The topic is also known as: network design.
Papers published on a yearly basis
Papers
More filters
TL;DR: A simple methodology for the design of near-optimal heat exchanger networks which systematically takes account of the energy—capital tradeoff is presented, based on setting cost targets, and optimizing these targets prior to design.
272 citations
TL;DR: This review starts with precise examples of decline in hydrometric network density, then highlights the increasing requirement of optimal network design in a context of climate and land use changes.
Abstract: [1] Hydrometric network design for surface water monitoring is employed to address a wide range of environmental and water resources problems. Historical overview of hydrometric network design is provided along with a discussion on new developments and challenges in the design of optimal hydrometric networks. This review starts with precise examples of decline in hydrometric network density, then highlights the increasing requirement of optimal network design in a context of climate and land use changes. An extensive survey of methodological development in hydrometric network design is provided along with discussion on the issue of uncertainty in hydrometric network design and the evolution in data collection techniques and technology. Finally, some conclusions are drawn on the future of hydrometric network design.
272 citations
TL;DR: In this paper, a stochastic programming model for an integrated forward/reverse logistics network design under uncertainty is developed to avoid the sub-optimality caused by the separate design of the forward and reverse networks.
270 citations
TL;DR: A traditional bi-level programming model for the discrete network design problem is introduced, and a new solution algorithm is proposed by using the support function concept to express the relationship between improvement flows and the new additional links in the existing urban network.
Abstract: The discrete network design problem deals with the selection of link additions to an existing road network, with given demand from each origin to each destination. The objective is to make an optimal investment decision in order to minimize the total travel cost in the network, while accounting for the route choice behaviors of network users. Because of the computational difficulties experienced with the solution algorithm of nonlinear bi-level mixed integer programming with a large number of 0–1 variables, the discrete network design problem has been recognized as one of the most difficult yet challenging problems in transport. In this paper, at first a traditional bi-level programming model for the discrete network design problem is introduced, and then a new solution algorithm is proposed by using the support function concept to express the relationship between improvement flows and the new additional links in the existing urban network. Finally, the applications of the new algorithm are illustrated with two numerical examples. Numerical results indicate that the proposed algorithm would be efficient in practice.
269 citations
Book•
IBM1
TL;DR: Overview of networking analysis of loss and delay in networks modelling networks as graphs fundamental graph algorithms centralized network design routing algorithms mesh topology optimization network reliability.
Abstract: Overview of networking analysis of loss and delay in networks modelling networks as graphs fundamental graph algorithms centralized network design routing algorithms mesh topology optimization network reliability.
267 citations