Individual items of flow in a telecommunications or a transportation network may need to be separated by a minimum distance or time, called a “headway”. If link dependent, such restrictions in general have the effect that the minimum time path for a “convoy” of items to travel from a given origin to a given destination will depend on the size of the convoy. The Quickest Path problem seeks a pat...

We describe an approach to the economic dispatch problem that combines both time-separated constraints (e.g., demand and network flow) and inter-temporal constraints (e.g., ramping) into a single optimization problem that can be solved efficiently by interior point methods. By including generator ramping limits as well as network line flow constraints, both economic and security issues are trea...

An ad-hoc network of wireless static nodes is considered as it arises in a rapidly deployed, sensor based, monitoring system. Information is generated in certain nodes and needs to reach a set of designated gateway nodes. Each node may adjust its power within a certain range that determines the set of possible one hop away neighbors. Traffic forwarding through multiple hops is employed when the...

Directional antenna offers a variety of benefits forwireless networks, one of which is the increased spatial reuse ratio. This feature gives rise to the improved throughput in resource limited wireless ad hoc networks. In this paper, we formulate the maximum flow problem as an optimization problem in wireless ad hoc networks with switched beam directional antennas constrained by interference. W...

the spatial distribution of petrophysical properties within the reservoirs is one of the most importantfactors in reservoir characterization. flow units are the continuous body over a specific reservoirvolume within which the geological and petrophysical properties are the same. accordingly, anaccurate prediction of flow units is a major task to achieve a reliable petrophysical description of a...

When solving hard multicommodity network flow problems using an LP-based approach, the number of commodities is a driving factor in speed at which LP can be solved, as it linear constraints and variables. The conventional approach to improve solve time relaxation Mixed Integer Programming (MIP) model that encodes such instance aggregate all have same origin or destination. However, bound result...

The maximum flow problem is a type of network optimization problem in the flow graph theory. Many important applications used the maximum flow problem and thus it has been studied by many researchers using different methods. Ford Fulkerson algorithm is the most popular algorithm that used to solve the maximum flow problem, but its complexity is high. In this paper, a parallel Genetic algorithm ...

In this paper the concept of the Minimum Universal Cost Flow (MUCF) for an infeasible flow network is introduced. A new mathematical model in which the objective function includes the total costs of changing arc capacities and sending flow is built and analyzed. A polynomial time algorithm is presented to find the MUCF.