نتایج جستجو برای: unsplittable multicommodity capacitated network design problem
تعداد نتایج: 2259516 فیلتر نتایج به سال:
A teaching-learning-based optimization (TLBO) algorithm is a new population-based algorithm applied in some applications in the literature successfully. Moreover, a genetic algorithm (GA) is a popular tool employed widely in many disciplines of engineering. In this paper, a hybrid GA-TLBO algorithm is proposed for the capacitated three-stage supply chain network design (SCND) problem. The SCND ...
Decomposition methods are techniques for exploiting the tractable substructures of an integer program in order to obtain improved solution procedures. In particular, the goal is to derive improved methods of bounding the optimal solution value, which can then be used to drive a branch-andbound algorithm. Such methods are the preferred solution approaches for a wide range of important models ari...
In this paper, we present a capacitated multiple allocation hub location problem, which arose from a network design problem in German wagonload traffic. We develop heuristic solution approaches based on local improvements. We solve the problem with the heuristics and CPLEX on test data sets provided by our partner Deutsche Bahn AG. The computational results are presented and compared.
The problem of finding optimal routes in a packetswitched computer network can be formulated as a nonlinear multicommodity flow problem. The application of traditional mathematical programming techniques to the solution of the routing problem for reasonably large networks is computationally inefficient. Satisfactory results have been recently obtained with various heuristic techniques; however,...
MPLS recovery mechanisms are increasing in popularity because they can guarantee fast restoration and high QoS assurance. Their main advantage is that their backup paths are established in advance, before a failure event takes place. Most research on the establishment of primary and backup paths has focused on minimizing the added capacity required by the backup paths in the network. However, t...
Theminimum-cost multicommodity ow problem involves simultaneously shipping multiple commodities through a single network so that the total ow obeys arc capacity constraints and has minimum cost. Multicommodity ow problems can be expressed as linear programs, and most theoretical and practical algorithms use linear-programming algorithms specialized for the problems' structures. Combinatorial ap...
In this paper, a fuzzy random minimum cost flow problem is presented. In this problem, cost parameters and decision variables are fuzzy random variables and fuzzy numbers respectively. The object of the problem is to find optimal flows of a capacitated network. Then, two algorithms are developed to solve the problem based on Er-expected value of fuzzy random variables and chance-constrained pro...
We present a matheuristic, an integer programming based heuristic, for the Liner Shipping Network Design Problem. The heuristic applies a greedy construction heuristic based on an interpretation of the liner shipping network design problem as a multiple quadratic knapsack problem. The construction heuristic is combined with an improvement heuristic with a neighborhood defined by the solution sp...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید