Shortest Route Algorithm and Replacement

problem
Find the shortest route between nodes 1 and 8 in the following network:
4
1
2
3
4
5
6
8
7
5
3
4
3
2
5
2
6
5
2
3
3
2
A major hotel chain is constructing a new resort hotel complex in Greenbranch Springs
!est "irginia# $he resort is in a hea%il& wooded area and the de%elopers want to
preser%e as much of the natural beaut& as possible# $o do so the de%elopers want to
connect all the %arious facilities in the complex with a combination walking'riding path
that will minimi(e the amount of pathwa& that will ha%e to be cut through the woods# $he
following network shows possible connecting paths and corresponding distances )in
&ards* between the facilities:
+etermine the path that will connect all the facilities with the minimum amount of
construction and indicate the total length of the pathwa&#
8
,-# Gi%en the following network with the indicated .ow capacities along each branch
determine the maximum .ow from source node 1 to destination node / and the .ow
along each branch:
Also formulate the linear programming model of the problem#
012314
A de%eloper is planning a de%elopment that includes subdi%isions of houses cluster
houses town'houses apartment complexes shopping areas a da&care center and
pla&ground a communit& center and a school among other facilities# $he de%eloper
wants to connect the facilities and areas in the de%elopment with the minimum number
of streets possible# $he following network shows the possible street routes and distances
)in thousands of feet* between 15 areas in the de%elopment that must be connected:
+etermine a minimal spanning tree network of streets to connect the 15 areas and
indicate the total streets )in thousands of feet* needed#
2
6ne of the opposing forces in a simulated arm& battle wishes to set up a communications
s&stem that will connect the eight camps in its command# $he following network
indicates the distances )in hundreds of &ards* between the camps and the di7erent paths
o%er which a communications line can be constructed:
8sing the minimal spanning tree approach determine the minimum distance
communication s&stem that will connect all eight camps#
$he management of the +&naco manufacturing plant wants to connect the eight major
manufacturing areas of its plant with a forklift route# 9ecause the construction of such a
route will take a considerable amount of plant space and disrupt normal acti%ities
management wants to minimi(e the total length of the route# $he following network
shows the distance in &ards between the manufacturing areas )denoted b& nodes 1
through 8*:
+etermine the minimal spanning tree forklift route for the plant and indicate the total
&ards the route will re:uire#
Suppose it costs ;15555 to purchase a new car# $he annual operating cost and resale
%alue of a used car are shown in the following table# Assuming that one now has a new
car determine a replacement polic& that minimi(es the net costs of owning and
operating a car for the next six &ears#
Also formulate the linear programming model of the problem#
Rent <ar is de%eloping a replacement plan for its car
.eet for a four &ears planning hori(on that starts
=anuar& 1 4558 and terminates +ecember -1 4511# At
the start of each &ear a decision is made as to whether
a car should be kept in operation or replaced# A car
must be in ser%ice for a minimum of 1 &ear and a
maximum of - &ears# $he following table pro%ides the
replacement cost as a function of the &ear a car is
ac:uired and the number of &ears in operation#
>:uipment
ac:uired
at start of
Replacement cost for gi%en &ears in
operation
1 4 -
4558 ?555 2?55 @855
455@ ?-55 /455 8055
4515 ?855 0155 '''
4511 ?@55 ''' '''
Formulate as a shortest route problem and sol%e#
Rent <ar is de%eloping a replacement plan for its car
.eet for a A%e &ears planning hori(on that starts
=anuar& 1 4558 and terminates +ecember -1 4514# At
the start of each &ear a decision is made as to whether
a car should be kept in operation or replaced# A car
must be in ser%ice for a minimum of 4 &ears and a
maximum of ? &ears# $he following table pro%ides the
replacement cost as a function of the &ear a car is
ac:uired and the number of &ears in operation#
>:uipment
ac:uired
at start of
Replacement cost for gi%en &ears in
operation
4 - ?
4558 -855 ?155 /855
455@ ?555 ?855 0555
4515 ?455 2-55 0455
4511 ?@55 2055 '''
4514 2-55 ''' '''
Formulate as a shortest route problem and sol%e#
A compan& has just recei%ed a contract for
producing a new product for four &ears# $he
production of this new product re:uires that the
purchase of a new machiner& that can onl& be used
for this product $he cost of this machine is
$k#45555 now# Bowe%er the compan& estimates
that after two &ears the price will increase to
$k#42555 for the same piece of machine# $he
sal%age %alue depends on the numbers of &ears it
has been used and the operating cost depends on
the age of the machine as shown below:
Co# of
&ears used
Sal%age %alue at
the end of the
&ear
Annual operating
cost during the
&ear
1 $k#15555 $k#1555
4 8555 ?555
- -555 8555
? 5 @555
Formulate the problem as shortest route problem
and sol%e#
+irect <o# sells an item whose demand o%er the
next ? month is 1551?5415185 units respecti%el&#
$he compan& can stock just enough suppl& to meet
each monthDs demand or it can o%erstock to meet
the demand for two or more successi%e months# En
the later case a holding cost of $k#1#45 is charged
per o%erstock unit per month# +irect <o# estimates
the unit purchase prices for the next ? months to be
$k#12 $k#14 $k#15 and $k#1? respecti%el&# A setup
cost of $k#455 is incurred each time a purchased
order is placed# $he compan& wants to de%elop a
purchasing plan that will minimi(e the total cost of
ordering purchasing and holding the item in stock#
Et costs ;?5 to bu& a telephone from the department
store# Assume that E can keep a telephone for at
most A%e &ears and that the estimated maintenance
cost each &ear of operation is as follows: &ear 1
;45F &ear 4 ;-5F &ear - ;?5F &ear ? ;/5F &ear 2
;05# E ha%e just purchased a new
telephone# Assuming that a telephone has no
sal%age %alue determine how to minimi(e the total
cost of purchasing and operating a telephone for the
next six &ears#
A new police car costs the 9a& <it& Golice
+epartment ;4/555# $he annual maintenance cost
for a car depends on the age of the car at the
beginning of the &ear# )All cars accumulate
approximatel& the same mileage each &ear#* $he
maintenance costs increase as a car ages as shown
in the following table:
<ar Age
)&r#*
Annual Haintenance
<ost
8sed Selling
Grice
5 ; -555 ;
1 ?255 12555
4 /555 14555
- 8555 8555
? 11555 ?555
2 1?555 4555
/ 5
En order to a%oid the increasingl& high maintenance
costs the police department can sell a car and
purchase a new car at the end of an& &ear# $he
selling price for a car at the end of each &ear of use
is also shown in the table# Et is assumed that the
price of a new car will increase ;255 each &ear# $he
departmentIs objecti%e is to de%elop a car
replacement schedule that will minimi(e total cost
)i#e# the purchase cost of a new car plus
maintenance costs minus the mone& recei%ed for
selling a used car* during the next / &ears# +e%elop
a car replacement schedule using the shortest
route method#
$he north south highwa& s&stem of <it& of =o& can
accommodate the capacities shown# !hat is the
maximum %ehicle per hour through the s&stemJ
Bow man& %ehicles per hour must tra%el o%er each
road )arc* to obtain this maximum .owJ
+etermine the maximum .ow between nodes 1 and
2 for the network gi%en below:
2
1
3
4
5
6
5
0
3
0
6
0
4
4
2
2
6
0
4 0
3
3
3
0
2
3
2
3
4 5
1
(4,0)
(8, 0)
(4,4)
(6,0)
(4, 6)
(2,0)
(4, 0)
(0. 2)
$he +&naco <ompan& manufactures a product in
A%e stages# >ach stage of the manufacturing
process is conducted at a di7erent plant# $he
following network shows the A%e di7erent stages
and the routes o%er which the partiall& completed
products are shipped to the %arious plants at the
di7erent stages:
Stage 2 )at node 15* is the distribution center in which
Anal products are stored# Although each node
represents a di7erent plant plants at the same stage
perform the same operation# )For example at stage 4
of the manufacturing process plants 4 - and ? all
perform the same manufacturing operation#* $he
%alues accompan&ing the branches emanating from
each node indicate the maximum number of units )in
thousands* that a particular plant can produce and ship
to another plant at the next stage# )For example plant
- has the capacit& to process and ship 0555 units of
the product to plant 2#* +etermine the maximum
number of units that can be processed through the A%e'
stage manufacturing process and the number of units
processed at each plant#