Scribd
Upload
20 views20 pages

NETWORK+MODELS

Uploaded by

sammush79
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
20 views20 pages

NETWORK+MODELS

Uploaded by

sammush79
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 20

NETWORK

MODELS
An Introduction to
Concepts and Model
Structures
The Real-Life Settings
 Networks arise in numerous settings and in a
variety of guises. Transportation, electrical, and
communications networks pervade our daily lives.
 Network representations also are widely used for
problems in such diverse areas as production,
distribution, project planning, facilities location,
resource management, and financial planning, to
name just a few examples.
 In fact, a network representation provides such a
powerful visual and conceptual aid for portraying
the relationships between the components of
systems that it is used in every field of scientific,
social, and economic endeavor.
Recent Advances in
Network Models
 One of the most exciting developments in OR
in recent years has been the unusually rapid
advance in both the methodology and the
application of network optimization models.
 A number of algorithmic breakthroughs have
had a major impact, as have ideas from
computer science concerning data structures
and efficient data manipulation.
Consequently, algorithms and software now
are available and are being used to solve
huge problems on a routine basis.
A Prototype Example
 SEERVADA PARK has recently been set aside
for a limited amount of sightseeing and
backpack hiking. Cars are not allowed into the
park, but there is a narrow, winding road system
(shown in the figure without curves), where
location O is the entrance into the park; other
letters designate the locations of ranger stations
(and other limited facilities). The numbers give
the distances of these winding roads in miles.
 The park contains a scenic wonder at station T.
A small number of trams are used to transport
sightseers from the park entrance to station T
and back.
Decision Problems for the
Management
 The park management currently
faces three problems:
1. One is to determine which route from
the park entrance to station T has the
smallest total distance for the
operation of the trams.
2. Continued next slide….
Decision Problems for the
Management cont.
2. A second problem is that telephone lines
must be installed under the roads to
establish telephone communication among
all the stations (including the park
entrance).
 Because the installation is both expensive and
disruptive to the natural environment, lines will
be installed under just enough roads to provide
some connection between every pair of stations.
 The question is where the lines should be laid
to accomplish this with a minimum total
number of miles of lines installed.
Decision Problems for the
Management cont.
3. The third problem is that more people want to
take the tram ride from the park entrance to
station T than can be accommodated during the
peak season. To avoid unduly disturbing the
ecology and wildlife of the region, a strict ration
has been placed on the number of tram trips
that can be made on each of the roads per day.
(These limits differ for the different routes).
 During the peak season, therefore, various routes
might be followed regardless of distance to increase
the number of tram trips that can be made each day.
 The question pertains to how to route the various trips
to maximize the number of trips that can be made
per day without violating the limits on any individual
road.
The Shortest Route
Algorithm
 The shortest-route problem is to
determine the shortest path from a
specified node to another node.
 The algorithm assumes that the distance
cij separating nodes i and j is non-
negative.
 The algorithm is also iterative in nature.
If a network consists of n nodes, n-1
iterations will be required to reach the
optimal solution.
The Shortest Route
Algorithm cont.
 The algorithm consists of two parts.
 A labeling procedure is used to
determine the shortest distance from
one specified node to each of the other
nodes.
 The second part of the algorithm is a

backtracking procedure used to


define the actual shortest-distance
route to each node.
Shortest Route Problem
(An Equipment Replacement
Example)
 NED University is developing a replacement
plan for its car fleet for a 5-year (2006 to 2010)
planning horizon.
 At the start of each year, a decision is made as to
whether a car should be kept in operation or
replaced.
 A car must be in service at least 1 year but must
be replaced after 3 years.
 The table in the following slide provides the
replacement cost as a function of the year a
car is acquired and the number of years in
operation.
An Equipment Replacement
Example

Replacement cost ($) for given


years
in operation
Year 1 2 3
acquired
2006 4000 5400 9800
2007 4300 6200 8700
2008 4800 7100 -
2009 4900 - -
The Minimal Spanning Tree
Algorithm
 The minimal spanning tree is that set of branches in
a network that connects all nodes in such a way as
to give a minimum total length for the set. Such a
problem occurs in transportation or distribution
networks and in situations involving the
establishment of efficient communications networks.
The Minimal Spanning Tree
Algorithm cont.
 The logic for solution of a minimal
spanning tree problem is completely
straightforward. In fact, such a
problem offers one of the few
opportunities in an operations
setting to make a decision that is
immediately optimal without having
to worry about its subsequent effect
on other decisions.
Steps in the algorithm
 Steps in an algorithm for determining
the minimal spanning tree are listed as
follows:
1. Arbitrarily choose any node.
2. Find the node nearest that node and
connect the two.
3. Find the unconnected node nearest any
connected node and connect those two.
4. Repeat step 3 until all nodes are
connected.
A Tabular Approach for the
Minimal Spanning Tree Algorithm
SEREVADA PARK
TO
FROM
O A B C D E T
O - 2 5 4 - - -
(Origin) 2 - 2 - 7 - -
A 5 2 - 1 4 3 -
B 4 - 1 - - 4 -
C - 7 4 - - 1 5
D - - 3 4 1 - 7
E - - - - 5 7 -
T
(Scenic
Wonder
)
A Cellular Machine-Shop
Layout Example
 Electro produces 15 electronic parts on 10
machines. The company wants to group the
machines into cells designed to minimize the
“dissimilarities” among the parts processed
in each cell. A measure of “dissimilarity,” dij,
among the parts processed on machines i
and j can be expressed as:
 dij,= 1 – (nij, / nij, + mij, )
Where nij, is the number of parts shared between
machines i and j, and mij, is the number of parts
that are used by either machine i or j only.
A Cellular Machine-Shop
Layout Example cont.
Machine Assigned parts
1 1, 6
2 2, 3, 7, 8, 9, 12, 13, 15
3 3, 5, 10, 14
4 2, 7, 8, 11, 12, 13
5 3, 5, 10, 11, 14
6 1, 4, 5, 9, 10
7 2, 5, 7, 8, 9, 10
8 3, 4, 15
9 4, 10
10 3, 8, 10, 14, 15
Maximum Flow Through a
Network
 When flows are scheduled through a
network (traffic along roads, gas or oil
through pipelines, telephone calls
along conductors, goods through lines
in a factory, etc.) there may be an
upper limit on the capacity of the links.
 A problem, then, is to determine the
maximum possible flow between two
points in a network.
The Maximal Flow
Algorithm
 The basic maximum flow problem assumes a
network of links each with a finite capacity and an
objective of determining the maximum amount
which can flow between two points.
 The approach to this is similar to the shortest path
labeling algorithm in that labels are put on nodes
until a continuous flow through the network is
achieved. The algorithm is also iterative, as once a
flow is identified it is subtracted from the available
capacities and the process is repeated.
 In this case the labels put on nodes are the flow into
a node and the previous node from which this flow
comes. Thus the label [F,n] represents a node with a
flow of F coming from node n.
The Maximal Flow Capacity
Network for Serevada Park

A D

O B T

C E

You might also like