Professional Documents
Culture Documents
NETWORK OPTIMIZATION
MODELS
Prototype example
163
164
Typical networks
Nodes
Arcs
165
Terminology of networks
Network is a set of points (nodes or vertices) and a set
of lines (arcs or links or edges or branches)
connecting certain pairs of the nodes.
Flow
Intersections
Roads
Vehicles
Airports
Air lanes
Aircraft
Switching points
Wires, channels
Messages
Pumping stations
Pipes
Fluids
Work centers
Material-handling sources
Jobs
167
Terminology of networks
Example
168
169
Terminology of networks
A path that begins and ends at the same node is a
cycle.
Two nodes are connected if the network contains at
least one undirected path between them.
A connected network is a network where every pair
of nodes is connected.
A tree is a connected network (for some subset of the
n nodes of the original network) that contains no
undirected cycles.
170
Terminology of networks
171
172
a)
b)
c)
d)
e)
173
Shortest-path problem
174
n
1
2,3
176
Closest
connected
unsolved node
Total
distance
involved
nth
nearest
node
Minimum
distance
Last
connection
OA
2,3
OC
2+2=4
AB
2+7=9
E
BE
5
6
4+3=7
4+4=8
2+7=9
4+4=8
BD
7+1=8
ED
8 + 5 = 13
13
DT
7 + 7 = 14
Solved nodes
directly connected
to unsolved nodes
Closest
connected
unsolved node
Total
distance
involved
nth
nearest
node
Minimum
distance
Last
connection
OA
OC
2+2=4
AB
2+7=9
E
BE
4+3=7
4+4=8
177
Solution
175
178
179
180
Applications of shortest-path
181
Main applications:
1. Minimize the total distance traveled.
2. Minimize the total cost of a sequence of activities.
3. Minimize the total time of a sequence of activities.
4. Combination of the previous three.
What happens if the network is directed?
How to optimize from the source to all other nodes?
How to find the shortest path from every node to
every other node?
182
Properties
Definition:
1. Nodes of the network are given, as well as potential
links and positive length for each if it is inserted in
the network.
2. Design network inserting links in order to have a
path between each pair of nodes.
3. These links must minimize the total length of the
links inserted into the network.
A network with n
nodes requires n 1
links to provide a path
between each pair of
nodes.
The n 1 links form a
spanning tree.
Which are spanning
trees?
184
183
185
Applications
186
187
188
Feasible solution
189
190
191
Applications
Some applications
192
194
195
196
197
Iteration 1
Iteration 2
Iteration 2: assign a flow of 3 to the augmenting path
OADT
3
5
2
3
2
5
0
5
1
198
Iterations 3 and 4
0
0
11
0
1
7
199
Iterations 5 and 6
3
1
11
1
7
1
0
13
3
1
2
5
5
1
200
Iteration 7
0
0
13
201
Optimal solution
After iteration 7 there are no more augmenting paths. Optimal
flow pattern is:
0
1
7
1
0
14
3
0
14
1
4
0
0
3
1
202
203
Find all nodes that can be reached from the source along a
single arc with strictly positive residual capacity.
For each reached node, find all new nodes from this node
that can be reached along an arc with strictly positive
residual capacity.
Repeat this successively with the new nodes as they are
reached.
204
205
206
207
208
209
210
212
211
Applications
Kind of application
Supply nodes
Transshipment nodes
Demand nodes
Operation of a
distributed network
Sources of goods
Intermediate storage
facilities
Customers
Solid waste
management
Sources of solid
waste
Processing facilities
Landfill locations
Operation of a supply
network
Vendors
Intermediate warehouses
Processing
facilities
Coordinating product
mixes at plants
Plants
Production of a specific
product
Market for a
specific product
Cash flow
management
Sources of cash
at a specific time
Short-term investment
options
Minimize Z = c ij x ij ,
i =1 j =1
subject to
Given information:
Node
x x
bi > 0
bi < 0
bi = 0
213
ij
j =1
ji
j =1
214
215
Example
i =1
216
Example
217
218
219
Special cases
Transportation problem. A supply node is provided
for each source and a demand node for each
destination. No transshipment nodes are included.
Also, uij = .
Assignment problem. As in the transportation
problem and
Number of supply nodes equal to number of demand nodes.
bi = 1 for supply nodes and bi = 1 for demand nodes.
220
221
10
Special cases
Shortest-path problem
A supply node with the supply of 1 is provided for the
origin.
A demand node with the demand of 1 is provided for the
destination.
Rest of nodes are transshipment nodes.
Each undirected link is replaced by a pair of directed arcs in
opposite directions (cij = cji), except arcs into supply node or
out of demand node.
No arc capacities are imposed: uij = .
Joo Miguel da Costa Sousa / Alexandra Moutinho
222
Special cases
223
224
225
Final comments
Except for transshipment problem, each of these
special cases was seen in this or the previous lesson
(Chap.8 and 9).
For these, we already saw special-purpose
algorithms.
When a computer code is not readily available for the
special-purpose algorithm, it is reasonable to use the
network simplex method, a highly streamlined
version of the simplex method for solving minimum
cost flow problems.
Joo Miguel da Costa Sousa
226
11