ALGORITHM OF THE INVERSE MINIMUM FLOW PROBLEM WITH TIME-WINDOWS
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولAn Extended Compact Genetic Algorithm for Milk Run Problem with Time Windows and Inventory Uncertainty
In this paper, we introduce a model to optimization of milk run system that is one of VRP problem with time window and uncertainty in inventory. This approach led to the routes with minimum cost of transportation while satisfying all inventory in a given bounded set of uncertainty .The problem is formulated as a robust optimization problem. Since the resulted problem illustrates that grows up ...
متن کاملLocation-Routing Problem with Fuzzy Time Windows and Traffic Time
The location-routing problem is a relatively new branch of logistics system. Its objective is to determine a suitable location for constructing distribution warehouses and proper transportation routing from warehouse to the customer. In this study, the location-routing problem is investigated with considering fuzzy servicing time window for each customer. Another important issue in this regard ...
متن کاملCapacity inverse minimum cost flow problem
Given a directed graph G = (N,A) with arc capacities uij and a minimum cost flow problem defined on G, the capacity inverse minimum cost flow problem is to find a new capacity vector û for the arc set A such that a given feasible flow x̂ is optimal with respect to the modified capacities. Among all capacity vectors û satisfying this condition, we would like to find one with minimum ‖û− u‖ value....
متن کاملCapacity Inverse Minimum Cost Flow Problem under the Weighted Hamming Distances
Given an instance of the minimum cost flow problem, a version of the corresponding inverse problem, called the capacity inverse problem, is to modify the upper and lower bounds on arc flows as little as possible so that a given feasible flow becomes optimal to the modified minimum cost flow problem. The modifications can be measured by different distances. In this article, we consider the capac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Sciences: Advances and Applications
سال: 2017
ISSN: 0974-5750
DOI: 10.18642/jmsaa_7100121736