scispace - formally typeset
Search or ask a question
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
More filters
Journal ArticleDOI
TL;DR: In this paper, the authors introduce a network planning problem called the hub network design problem with stopovers and feeders, and develop a mixed-integer program to design the least-cost single-hub air network assuming that the hub location is already determined.
Abstract: This paper introduces a network planning problem called the hub network design problem with stopovers and feeders. Most, if not all, of the recent logistics research on hub-and-spokes networks has assumed that all nodes in the network are connected by direct flights to the hub. However, in the network used by the Federal Express Co., most flights to and from the hub make one or more stopovers, and many smaller cities are served by feeder aircraft which connect to other nonhub cities. This paper explores the tradeoffs and savings involved with stopovers and feeders, and develops a mixed-integer program to design the least-cost single-hub air network assuming that the hub location is already determined. The model is then applied to the western U.S. portion of the Federal Express package collection system. Comparing the optimal results to the pure hub-and-spokes network proves that substantial improvements in cost, miles flown, load factor and number of aircraft can be achieved by using stopovers and feeders in a hub network, and that it is unrealistic to assume a network with only direct flights. Comparison with the actual Federal Express network shows many similarities (which suggest that the model is capturing the important design criteria), and several differences (which indicate the model's potential for improving efficiency). The usefulness of the model for a company's comprehensive network planning and for hub location modeling is discussed.

184 citations

Proceedings ArticleDOI
01 Dec 2015
TL;DR: In this paper, the authors present pHost, a new transport design aimed at achieving both: the near-optimal performance of pFabric and the commodity network design of Fastpass.
Abstract: The importance of minimizing flow completion times (FCT) in datacenters has led to a growing literature on new network transport designs. Of particular note is pFabric, a protocol that achieves near-optimal FCTs. However, pFabric's performance comes at the cost of generality, since pFabric requires specialized hardware that embeds a specific scheduling policy within the network fabric, making it hard to meet diverse policy goals. Aiming for generality, the recent Fastpass proposal returns to a design based on commodity network hardware and instead relies on a centralized scheduler. Fastpass achieves generality, but (as we show) loses many of pFabric's performance benefits.We present pHost, a new transport design aimed at achieving both: the near-optimal performance of pFabric and the commodity network design of Fastpass. Similar to Fastpass, pHost keeps the network simple by decoupling the network fabric from scheduling decisions. However, pHost introduces a new distributed protocol that allows end-hosts to directly make scheduling decisions, thus avoiding the overheads of Fastpass's centralized scheduler architecture. We show that pHost achieves performance on par with pFabric (within 4% for typical conditions) and significantly outperforms Fastpass (by a factor of 3.8×) while relying only on commodity network hardware.

183 citations

Journal ArticleDOI
TL;DR: In this article, a cycle-based neighbourhood structure for metaheuristics aimed at the fixed-charge capacitated multicommodity network design formulation is proposed, which defines moves that explicitly take into account the impact on the total design cost of potential modifications to the flow distribution of several commodities simultaneously.
Abstract: We propose new cycle-based neighbourhood structures for metaheuristics aimed at the fixed-charge capacitated multicommodity network design formulation. The neighbourhood defines moves that explicitly take into account the impact on the total design cost of potential modifications to the flow distribution of several commodities simultaneously. Moves are identified through a shortest-pathlike network optimization procedure and proceed by redirecting flow around cycles and closing and opening design arcs accordingly. These neighbourhoods are evaluated and tested within a simple tabu search algorithm. Experimental results show that the proposed approach is quite powerful and outperforms existing methods reported in the literature.

183 citations

Journal ArticleDOI
TL;DR: This paper attempts to hybridize this concept with other meta-heuristic concepts such as genetic algorithm, simulated annealing, and tabu search to solve the network design problem in transportation.

182 citations

Journal ArticleDOI
TL;DR: In this paper, a methodology combining an optimal ground-water-quality monitoring network design and an optimal source-identification model is presented, where an embedded nonlinear optimization model is utilized for preliminary identification of pollutant sources based on observed concentration data from arbitrarily located existing wells.
Abstract: A methodology combining an optimal ground-water–quality monitoring network design and an optimal source-identification model is presented. In the first step of the three-step methodology, an embedded nonlinear optimization model is utilized for preliminary identification of pollutant sources (magnitude, location, and duration of activity) based on observed concentration data from arbitrarily located existing wells. The second step utilizes these preliminary identification results and a simulation optimization approach to design an optimal monitoring network that can be implemented in the subsequent time periods. In the third step, the observed concentration data at the designed monitoring well locations are utilized for more accurate identification of the pollutant sources. The design of the monitoring network can be dynamic in nature, with sequential installation of monitoring wells during subsequent time periods. The monitoring network can be implemented in stages, in order to utilize the updated information in the form of observed concentration data from a time-varying (dynamic) network. The performance evaluation of the proposed methodology demonstrates the potential applicability of this methodology and shows significant improvement in the identification of unknown ground-water–pollution sources with limited observation data.

181 citations


Network Information
Related Topics (5)
Optimization problem
96.4K papers, 2.1M citations
85% related
Network packet
159.7K papers, 2.2M citations
84% related
Wireless network
122.5K papers, 2.1M citations
84% related
Node (networking)
158.3K papers, 1.7M citations
83% related
Wireless
133.4K papers, 1.9M citations
82% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202390
2022195
2021432
2020493
2019570
2018573