Solving the Uncapacitated Fixed-Charge Network Flow with Metaheuristics
نویسنده
چکیده
The Uncapacitated Fixed-charge Network Flow (UFNF) problem is an instance of the broader class of Network Design (ND) problems. Let G = (S,A) be a digraph where S is the set of nodes and A is the set of arcs. Each arc (i, j) is associated with two costs: a fixed cost ci,j for selecting (i, j) and a variable cost di,j for routing flow on (i, j). The problem is to find a set of arcs that allow a supply node to send resources to a set of demand nodes, such that the sum of structural (ci,j) and operational (di,j) costs is minimized.
منابع مشابه
Solving the Fixed Charge Transportation Problem by New Heuristic Approach
The fixed charge transportation problem (FCTP) is a deployment of the classical transportation problem in which a fixed cost is incurred, independent of the amount transported, along with a variable cost that is proportional to the amount shipped. Since the problem is considered as an NP-hard, the computational time grows exponentially as the size of the problem increases. In this pape...
متن کاملSolving to optimality the uncapacitated fixed-charge network flow problem
Given a directed network, the uncapacitated fixed-charge network flow problem is to find a minimum-cost arc combination that provides flows from the supply nodes to the demand nodes. Associated with all arcs are two costs: the fixed charge of using the arc and the variable cost depending on the amount of flow the arc actually carries. This generic model has applications for problems of distribu...
متن کاملA branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem
We present a branch-and-cut algorithm to solve the single commodity uncapacitated fixed charge network flow problem, which includes the Steiner tree problem, uncapacitated lot-sizing problems, and the fixed charge transportation problem as special cases. The cuts used are simple dicut inequalities and their variants. A crucial problem when separating these inequalities is to find the right cut ...
متن کاملThe Uncapacitated Time-Space Fixed-Charge Network Flow Problem: An Empirical Investigation of Procedures for Arc Capacity Assignment
The nodes and arcs of a network configuration replicated over time is a common structure found in many applications, particularly in the area of logistics. A common cost structure for flows in arcs for such problems involves both a fixed and variable cost. Combining the two concepts results in the uncapacitated time-space fixed-charge network flow problem. These problems can be modeled as mixed...
متن کاملAN ELECTROMAGNETISM-LIKE ALGORITHM FOR FIXED CHARGE SOLID TRANSPORTATION PROBLEM
Fixed charge solid transportation problem (FCSTP) is one of the main and most important problems in transportation and network research areas. To tackle such an NP-hard problem, An Electromagnetism-like algorithm (EM) is employed. To the best of our knowledge, EM has been considered for any kind of transportation problems. Due to the significant role of parameters on the algorithm’s performance...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001