نتایج جستجو برای: unsplittable multicommodity capacitated network design problem
تعداد نتایج: 2259516 فیلتر نتایج به سال:
Freight transport has undesirable effects on the environment. The most prominent of these is greenhouse gas emissions. Intermodal freight transport, where freight is shipped from origin to destination by a sequence of at least two transportation modes, offers the possibility of shifting freight (either partially or in full) from one mode to another in the hope of reducing the greenhouse emissio...
This paper proposes an immediately efficient method, based on Benders Decomposition (BD), for solving the survivable capacitated network design problem. This problem involves selecting a set of arcs for building a survivable network at a minimum cost and within a satisfied flow. The system is subject to failure and capacity restriction. To solve this problem, the BD was initially proposed with ...
Whenever an edge failure occurs in a telecommunications network, the amount of traac using the faulty edge has to be rerouted on some other paths through the network thus requiring the presence of reserve capacity in the network. This leads to the design of a network of extra capacities suucient to independently reroute the ow on each arc and having minimum cost. This problem is known as a netw...
We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source and multiple sinks, and demands that have known values but unknown sizes. We assume that the sizes of demands are governed by independent distributions, and that we know only the means of these distributions and an upper bound on...
We present an algorithm to solve a deterministic form of a routing problem in delay tolerant networking, in which contact possibilities are known in advance. The algorithm starts with a finite set of contacts with time-varying capacities and transit delays. The output is an optimal schedule assigning messages to edges and times, that respects message priority and minimizes the overall delivery ...
there are many approaches for solving variety combinatorial optimization problems (np-compelete) that devided to exact solutions and approximate solutions. exact methods can only be used for very small size instances due to their expontional search space. for real-world problems, we have to employ approximate methods such as evolutionary algorithms (eas) that find a near-optimal solution in a r...
In this paper, we present a mathematical formulation for saving energy in fixed broadband wireless networks by selectively turning off idle communication devices in low-demand scenarios. This problem relies on a fixed-charge capacitated network design (FCCND), which is very hard to optimize. We then propose heuristic algorithms to produce feasible solutions in a short time.
This paper proposes important performance metrics for characterizing the quality of service of multicommodity ows in multi-channel, multi-radio, multi-rate (MC-MR) wireless mesh networks. The term multicommodity implies different types of applications like audio, video, text etc. being serviced simultaneously by the network. Traditionally, the capacity of the links in a mesh network is assu...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید