Chapter Contents |
Previous |
Next |
The NETFLOW Procedure |
A network consists of a collection of nodes joined by a collection of arcs. The arcs connect nodes and convey flow of one or more commodities that are supplied at supply nodes and demanded at demand nodes in the network. Each arc has a cost per unit of flow, a flow capacity, and a lower flow bound associated with it. An important concept in network modeling is conservation of flow. Conservation of flow means that the total flow in arcs directed toward a node, plus the supply at the node, minus the demand at the node, equals the total flow in arcs directed away from the node.
A network and its associated data can be described in SAS data sets. PROC NETFLOW uses this description and finds the flow through each arc in the network that minimizes the total cost of flow, meets the demand at demand nodes using the supply at supply nodes so that the flow through each arc is on or between the arc's lower flow bound and its capacity, and satisfies the conservation of flow.
One class of network model is the production-inventory-distribution problem. The diagram in Figure 4.1 illustrates this problem. The subscript on the PROD, INVNTRY, and SALES nodes indicates the time period. Notice that if you by replicate sections of the model, the notion of time can be included.
In this type of model, the nodes can represent a wide variety of facilities. Several examples are are suppliers, spot markets, importers, farmers, manufacturers, factories, parts of plant, production lines, waste disposal facilities, workstations, warehouses, coolstores, depots, wholesalers, export markets, ports, rail junctions, airports, road intersections, cities, regions, shops, customers, and consumers. The diversity of this selection demonstrates the richness of potential applications of this model.
Depending upon the interpretation of the nodes, the objectives of the modeling exercise can vary widely. Some common types of objectives are:
Some specific applications are
Chapter Contents |
Previous |
Next |
Top |
Copyright © 1999 by SAS Institute Inc., Cary, NC, USA. All rights reserved.