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
01 Mar 2011
TL;DR: Using Monte Carlo simulation and shuffled frog leaping algorithm optimisation, the authors in this article analyzed the efficiency of a designed network based on nodal demand uncertainty during the operational period, and showed that a network design that does not consider nodal demands uncertainty decreases network efficiency.
Abstract: Water distribution network (WDN) design problems generally consider minimising network costs while meeting minimum allowable pressure under specified demand patterns. However, extension and renovation of networks based on assessment of demand uncertainty causes an increase in efficiency of the system and monetary savings. Attention to uncertain changes in pattern and the value of nodal demands in an operational period can thus show the effect of uncertainties in the network's efficiency. Using Monte Carlo simulation and shuffled frog leaping algorithm optimisation, this paper analyses the efficiency of a designed network based on nodal demand uncertainty during the operational period. Assessment of a network efficiency index according to a probabilistic normal distribution for nodal demand in an operational period shows that a network design that does not consider nodal demand uncertainty decreases network efficiency, especially at the end of the operational period. Moreover, an increase in demand uncerta...
61 citations
TL;DR: This paper motivates the use of dynamic voltage scaling for links, where the frequency and voltage of links are dynamicallyadjusted to minimize power consumption, in the first study that targets dynamic power optimization of interconnection networks.
Abstract: Power consumption is a key issue in highperformanceinterconnection network design. Communicationlinks, already a aignificant consumer of power now,will take up an ever larger portion of the power budgetas demand for network bandwidth increases. In this paper,we motivate the use of dynamic voltage scaling (DVS)for links, where the frequency and voltage of links are dynamicallyadjusted to minimize power consumption. Wepropose a history-based DYS algorithm that jjlidiciously adjustsDVS poIicies based on past link utilization. Despitevery conservative assumptions about DVS link characteristics,our approach realizes up to 4.5X power savings (3.2Xaverage), with just an average 27.4% Iatency increase and2.5% throughput reduction. To the best of our knowledge,this is the first study that targets dynamic power optimizationof interconnection networks.
61 citations
TL;DR: In this article, two mixed-integer linear programming models are proposed that differ in the type of performance measure that is adopted to design the supply chain, under a cost minimization objective, the network configuration with the least total cost is to be determined.
61 citations
TL;DR: This paper focuses on the unit-demand case, known as the capacitated spanning tree problem, for which it presents computational experience on a range of instances with up to 200 nodes, and considers the general- demand case, based on a cutting plane algorithm.
Abstract: A basic problem in telecommunications network design is that of designing a capacitated centralized processing network. Such a network has a central processor that must be linked via a tree topology to several remote terminals that have specified demands. Each subtree off of the root is constrained to have at most a fixed, limited demand, represented by the sum of the demands of the nodes of the subtree. Finding provably optimal solutions to this class of problems has been surprisingly difficult, particularly for certain types of instances and choices of parameters. This paper presents computational results for the problem, based on a cutting plane algorithm. We first focus on the unit-demand case, known as the capacitated spanning tree problem, for which we present computational experience on a range of instances with up to 200 nodes. We then consider the general-demand case and report on branch-and-cut as well as cutting plane computations on a range of instances, including some from the vehicle routing...
61 citations
TL;DR: In this paper, the authors present integer programming models of the service network design problem faced by less-than-truckload LTL freight transportation carriers and a solution approach for the large-scale instances that result in practical applications.
Abstract: We present integer programming models of the service network design problem faced by less-than-truckload LTL freight transportation carriers and a solution approach for the large-scale instances that result in practical applications. To accurately represent freight consolidation opportunities, the models use a fine discretization of time. Furthermore, the models simultaneously route freight and empty trailers and thus explicitly recognize the efficiencies presented by backhaul lanes. The solution approach can generate the traditional service network designs commonly used by LTL carriers but also enables the construction of designs that allow more flexibility, e.g., that allow freight routes to vary by day of week. An iterative improvement scheme is employed that searches a large neighborhood, each iteration using an integer program. Computational experiments using data from a large U.S. carrier demonstrate that the proposed modeling and solution approach has the potential to generate significant cost savings.
61 citations