版权说明:本文档由用户提供并上传,收益归属内容提供方,若内容存在侵权,请进行举报或认领
文档简介
PAGE
32
7-
PAGE
32
Chapter7
NetworkOptimizationProblems
ReviewQuestions
7.1-1 Asupplynodeisanodewherethenetamountofflowgeneratedisafixedpositivenumber.Ademandnodeisanodewherethenetamountofflowgeneratedisafixednegativenumber.Atransshipmentnodeisanodewherethenetamountofflowgeneratedisfixedatzero.
7.1-2 Themaximumamountofflowallowedthroughanarcisreferredtoasthecapacityofthatarc.
7.1-3 Theobjectiveistominimizethetotalcostofsendingtheavailablesupplythroughthenetworktosatisfythegivendemand.
7.1-4 Thefeasiblesolutionspropertyisnecessary.Itstatesthataminimumcostflowproblemwillhaveafeasiblesolutionifandonlyifthesumofthesuppliesfromitssupplynodesequalsthesumofthedemandsatitsdemandnodes.
7.1-5 Aslongasallitssuppliesanddemandshaveintegervalues,anyminimumcostflowproblemwithfeasiblesolutionsisguaranteedtohaveanoptimalsolutionwithintegervaluesforallitsflowquantities.
7.1-6 Networksimplexmethod.
7.1-7 Applicationsofminimumcostflowproblemsincludeoperationofadistributionnetwork,solidwastemanagement,operationofasupplynetwork,coordinatingproductmixesatplants,andcashflowmanagement.
7.1-8 Transportationproblems,assignmentproblems,transshipmentproblems,maximumflowproblems,andshortestpathproblemsarespecialtypesofminimumcostflowproblems.
7.2-1 Oneofthecompany’smostimportantdistributioncenters(LosAngeles)urgentlyneedsanincreasedflowofshipmentsfromthecompany.
7.2-2 Autoreplacementpartsareflowingthroughthenetworkfromthecompany’smainfactoryinEuropetoitsdistributioncenterinLA.
7.2-3 TheobjectiveistomaximizetheflowofreplacementpartsfromthefactorytotheLAdistributioncenter.
7.3-1 Ratherthanminimizingthecostoftheflow,theobjectiveistofindaflowplanthatmaximizestheamountflowingthroughthenetworkfromthesourcetothesink.
7.3-2 Thesourceisthenodeatwhichallflowthroughthenetworkoriginates.Thesinkisthenodeatwhichallflowthroughthenetworkterminates.Atthesource,allarcspointawayfromthenode.Atthesink,allarcspointintothenode.
7.3-3 Theamountismeasuredbyeithertheamountleavingthesourceortheamountenteringthesink.
7.3-4 1.Whereassupplynodeshavefixedsuppliesanddemandnodeshavefixeddemands,thesourceandsinkdonot.
2.Whereasthenumberofsupplynodesandthenumberofdemandnodesinaminimumcostflowproblemmaybemorethanone,therecanbeonlyonesourceandonlyonesinkinastandardmaximumflowproblem.
7.3-5 Applicationsofmaximumflowproblemsincludemaximizingtheflowthroughadistributionnetwork,maximizingtheflowthroughasupplynetwork,maximizingtheflowofoilthroughasystemofpipelines,maximizingtheflowofwaterthroughasystemofaqueducts,andmaximizingtheflowofvehiclesthroughatransportationnetwork.
7.4-1 Theoriginisthefirestationandthedestinationisthefarmcommunity.
7.4-2 Flowcangoineitherdirectionbetweenthenodesconnectedbylinksasopposedtoonlyonedirectionwithanarc.
7.4-3 Theoriginnowistheonesupplynode,withasupplyofone.Thedestinationnowistheonedemandnode,withademandofone.
7.4-4 Thelengthofalinkcanmeasuredistance,cost,ortime.
7.4-5 Sarahwantstominimizehertotalcostofpurchasing,operating,andmaintainingthecarsoverherfouryearsofcollege.
7.4-6 When“realtravel”throughanetworkcanendatmorethatonenode,adummydestinationneedstobeaddedsothatthenetworkwillhavejustasingledestination.
7.4-7 Quick’smanagementmustconsidertrade-offsbetweentimeandcostinmakingitsfinaldecision.
7.5-1 Thenodesaregiven,butthelinksneedtobedesigned.
7.5-2 Astate-of-the-artfiber-opticnetworkisbeingdesigned.
7.5-3 Atreeisanetworkthatdoesnothaveanypathsthatbeginandendatthesamenodewithoutbacktracking.Aspanningtreeisatreethatprovidesapathbetweeneverypairofnodes.Aminimumspanningtreeisthespanningtreethatminimizestotalcost.
7.5-4 Thenumberoflinksinaspanningtreealwaysisonelessthanthenumberofnodes.Furthermore,eachnodeisdirectlyconnectedbyasinglelinktoatleastoneothernode.
7.5-5 Todesignanetworksothatthereisapathbetweeneverypairofnodesattheminimumpossiblecost.
7.5-6 No,itisnotaspecialtypeofaminimumcostflowproblem.
7.5-7 Agreedyalgorithmwillsolveaminimumspanningtreeproblem.
7.5-8 Applicationsofminimumspanningtreeproblemsincludedesignoftelecommunicationnetworks,designofalightlyusedtransportationnetwork,designofanetworkofhigh-voltagepowerlines,designofanetworkofwiringonelectricalequipment,anddesignofanetworkofpipelines.
Problems
7.1 a)
b)
c)
7.2 a)
b)
c)
7.3 a)
b)
c)
7.4 a)
b)
c) Thetotalshippingcostis$2,187,000.
7.5 a)
b)
c)
d)
e)
f) $1,618,000+$583,000=$2,201,000whichishigherthanthetotalinProblem7.5($2,187,000).
7.6
ThereareonlytwoarcsintoLA,withacombinedcapacityof150(80+70).Becauseofthisbottleneck,itisnotpossibletoshipanymorethan150fromSTtoLA.Since150actuallyarebeingshippedinthissolution,itmustbeoptimal.
7.7
7.8 a)
b)
7.9 a)
b)
c)
d)
7.10
Shortestpath:FireStation–C–E–F–FarmingCommunity
7.11 a)
b)
c) Shortestroute:Origin–A–B–D–Destination
d) Yes
e) Yes
7.12 a)
b)
7.13 a) Timesplaytheroleofdistances.
b)
7.14
1. CD:Cost=1 4. EG:Cost=5
EF:Cost=1 *choosearbitrarily DA:Cost=4
2. EG:Cost=5 EB:Cost=7
EB:Cost=7 FG:Cost=7
EC:Cost=4 CA:Cost=5
FG:Cost=7 CB:Cost=2 *lowest
FC:Cost=3 *lowest 5. EG:Cost=5
FD:Cost=4 DA:Cost=4
3. EG:Cost=5 BA:Cost=2 *lowest
EB:Cost=7 FG:Cost=7
FG:Cost=7 CA:Cost=5
FD:Cost=4 6. EG:Cost=5 *lowest
CD:Cost=1 *lowest FG:Cost=7
CA:Cost=5
CB:Cost=2 Total=$14million
7.15
1. BC:Cost=1 *lowest 4. BE:Cost=7
2. BA:Cost=4 CF:Cost=4 *lowest
BE:Cost=7 CE:Cost=5
CA:Cost=6 DF:Cost=5
CD:Cost=2 *lowest 5. BE:Cost=7
CF:Cost=4 CE:Cost=5
CE:Cost=5 FE:Cost=1 *lowest
3. BA:Cost=4 *lowest FG:Cost=8
BE:Cost=7 6. EG:Cost=6 *lowest
CA:Cost=6 FG:Cost=8
CF:Cost=4
CE:Cost=5
DA:Cost=5 Total=$18,000
DF:Cost=5
7.16
1. FG:Cost=1 *lowest 6. DA:Cost=6
2. FC:Cost=6 DB:Cost=5
FD:Cost=5 DC:Cost=4
FI:Cost=2 *lowest EB:Cost=3 *lowest
FJ:Cost=5 FC:Cost=6
GD:Cost=2 FJ:Cost=5
GE:Cost=2 HK:Cost=7
GH:Cost=2 IK:Cost=8
GI:Cost=5 IJ:Cost=3
3. FC:Cost=6 7. BA:Cost=4
FD:Cost=5 DA:Cost=6
FJ:Cost=5 DC:Cost=4
GD:Cost=2 *lowest FC:Cost=6
GE:Cost=2 FJ:Cost=5
GH:Cost=2 HK:Cost=7
IH:Cost=2 IK:Cost=8
IK:Cost=8 IJ:Cost=3 *lowest
IJ:Cost=3 8. BA:Cost=4 *lowest
4. DA:Cost=6 DA:Cost=6
DB:Cost=5 DC:Cost=4
DE:Cost=2 *lowest FC:Cost=6
DC:Cost=4 HK:Cost=7
FC:Cost=6 IK:Cost=8
FJ:Cost=5 JK:Cost=4
GE:Cost=2 9. AC:Cost=3 *lowest
GH:Cost=2 DC:Cost=4
IH:Cost=2 FC:Cost=6
IK:Cost=8 HK:Cost=7
IJ:Cost=3 IK:Cost=8
5. DA:Cost=6 JK:Cost=4
DB:Cost=5 10. HK:Cost=7
DC:Cost=4 IK:Cost=8
EB:Cost=3 JK:Cost=4 *lowest
EH:Cost=4
FC:Cost=6
FJ:Cost=5
GH:Cost=2 *lowest Total=$26million
IH:Cost=2
IK:Cost=8
IJ:Cost=3
7.17 a) Thecompanywantsapathbetweeneachpairofnodes(groves)thatminimizescost(lengthofroad).
b) 78:Distance=0.5
76:Distance=0.6
65:Distance=0.9
51:Distance=0.7
54:Distance=0.7
83:Distance=1.0
32:Distance=0.9
Total=5.3miles
7.18 a) Thebankwantsapathbetweeneachpairofnodes(offices)thatminimizescost(distance).
b) B1B5:Distance=50
B5B3:Distance=80
B1B2:Distance=100
B2M:Distance=70
B2B4:Distance=120
Total=420miles
Cases
7.1 a) ThenetworkshowingthedifferentroutestroopsandsuppliesmayfollowtoreachtheRussianFederationappearsbelow.
b) ThePresidentisonlyconcernedabouthowtomostquicklymovetroopsandsuppliesfromtheUnitedStatestothethreestrategicRussiancities.Obviously,thebestwaytoachievethisgoalistofindthefastestconnectionbetweentheUSandthethreecities.WethereforeneedtofindtheshortestpathbetweentheUScitiesandeachofthethreeRussiancities.
ThePresidentonlycaresaboutthetimeittakestogetthetroopsandsuppliestoRussia.Itdoesnotmatterhowgreatadistancethetroopsandsuppliescover.Thereforewedefinethearclengthbetweentwonodesinthenetworktobethetimeittakestotravelbetweentherespectivecities.Forexample,thedistancebetweenBostonandLondonequals6,200km.ThemodeoftransportationbetweenthecitiesisaStarliftertravelingataspeedof400milesperhour*1.609kmpermile=643.6kmperhour.ThetimeistakestobringtroopsandsuppliesfromBostontoLondonequals6,200km/643.6kmperhour=9.6333hours.Usingthisapproachwecancomputethetimeoftravelalongallarcsinthenetwork.
Bysimpleinspectionandcommonsenseitisapparentthatthefastesttransportationinvolvesusingonlyairplanes.Wethereforecanrestrictourselvestoonlythosearcsinthenetworkwherethemodeoftransportationisairtravel.Wecanomitthethreeportcitiesandallarcsenteringandleavingthesenodes.
ThefollowingsixspreadsheetsfindtheshortestpathbetweeneachUScity(BostonandJacksonville)andeachRussiancity(St.Petersburg,Moscow,andRostov).
BostontoSt.Petersburg:
BostontoMoscow:
BostontoRostov:
JacksonvilletoSt.Petersburg:
JacksonvilletoMoscow:
JacksonvilletoRostov:
Thespreadsheetscontainthefollowingformulas:
ComparingallsixsolutionsweseethattheshortestpathfromtheUStoSaintPetersburgisBostonLondonSaintPetersburgwithatotaltraveltimeof12.71hours.TheshortestpathfromtheUStoMoscowisBostonLondonMoscowwithatotaltraveltimeof13.21hours.TheshortestpathfromtheUStoRostovisBostonBerlinRostovwithatotaltraveltimeof13.95hours.Thefollowingnetworkdiagramhighlightstheseshortestpaths.
c) ThePresidentmustsatisfyeachRussiancity’smilitaryrequirementsatminimumcost.Therefore,thisproblemcanbesolvedasaminimum-costnetworkflowproblem.ThetwonodesrepresentingUScitiesaresupplynodeswithasupplyof500each(wemeasureallweightsin1000tons).ThethreenodesrepresentingSaintPetersburg,Moscow,andRostovaredemandnodeswithdemandsof–320,-440,and–240,respectively.AllnodesrepresentingEuropeanairfieldsandportsaretransshipmentnodes.Wemeasuretheflowalongthearcsin1000tons.Forsomearcs,capacityconstraintsaregiven.AllarcsfromtheEuropeanportsintoSaintPetersburghavezerocapacity.AlltruckroutesfromtheEuropeanportsintoRostovhaveatransportationlimitof2,500*16=40,000tons.Sincewemeasurethearcflowsin1000tons,thecorrespondingarccapacitiesequal40.Ananalogouscomputationyieldsarccapacitiesof30forboththearcsconnectingthenodesLondonandBerlintoRostov.Forallothernodeswedeterminenaturalarccapacitiesbasedonthesuppliesanddemandsatthenodes.Wedefinetheunitcostsalongthearcsinthenetworkin$1000per1000tons(or,equivalently,$/ton).Forexample,thecostoftransporting1tonofmaterialfromBostontoHamburgequals$30,000/240=$125,sothecostsoftransporting1000tonsfromBostontoHamburgequals$125,000.
Theobjectiveistosatisfyalldemandsinthenetworkatminimumcost.Thefollowingspreadsheetshowstheentirelinearprogrammingmodel.
Thetotalcostoftheoperationequals$412.867million.TheentiresupplyforSaintPetersburgissuppliedfromJacksonvilleviaLondon.TheentiresupplyforMoscowissuppliedfromBostonviaHamburg.Ofthe240(=240,000tons)demandedbyRostov,60areshippedfromBostonviaIstanbul,150areshippedfromJacksonvilleviaIstanbul,and30areshippedfromJacksonvilleviaLondon.ThepathsusedtoshipsuppliestoSaintPetersburg,Moscow,andRostovarehighlightedonthefollowingnetworkdiagram.
d) NowthePresidentwantstomaximizetheamountofcargotransportedfromtheUStotheRussiancities.Inotherwords,thePresidentwantstomaximizetheflowfromthetwoUScitiestothethreeRussiancities.AllthenodesrepresentingtheEuropeanportsandairfieldsareonceagaintransshipmentnodes.Theflowalonganarcisagainmeasuredinthousandsoftons.Thenewrestrictionscanbetransformedintoarccapacitiesusingthesameapproachthatwasusedinpart(c).TheobjectiveisnowtomaximizethecombinedflowintothethreeRussiancities.
Thelinearprogrammingspreadsheetmodeldescribingthemaximumflowproblemappearsasfollows.
Thespreadsheetshowsalltheamountsthatareshippedbetweenthevariouscities.ThetotalsupplyforSaintPetersburg,Moscow,andRostovequals225,000tons,104,800tons,and192,400tons,respectively.ThefollowingnetworkdiagramhighlightsthepathsusedtoshipsuppliesbetweentheUSandtheRussianFederation.
e) Thecreationofthenewcommunicationsnetworkisaminimumspanningtreeproblem.Asusual,agreedyalgorithmsolvesthistypeofproblem.
Arcsareaddedtothenetworkinthefollowingorder(oneofseveraloptimalsolutions):
Rostov-Orenburg
120
Ufa-Orenburg
75
Saratov-Orenburg
95
Saratov-Samara
100
Samara-Kazan
95
Ufa–Yekaterinburg
125
Perm–Yekaterinburg
85
Theminimumcostofreestablishingthecommunicationlinesis$695,000.
7.2 a) Therearethreesupplynodes–theYennode,theRupiahnode,andtheRinggitnode.Thereisonedemandnode–theUS$node.Below,wedrawthenetworkoriginatingfromonlytheYensupplynodetoillustratetheoveralldesignofthenetwork.Inthisnetwork,weexcludeboththeRupiahandRinggitnodesforsimplicity.
b) Sincealltransactionlimitsaregivenintheequivalentof$1000wedefinetheflowvariablesastheamountinthousandsofdollarsthatJakeconvertsfromonecurrencyintoanotherone.HistotalholdingsinYen,Rupiah,andRinggitareequivalentto$9.6million,$1.68million,and$5.6million,respectively(ascalculatedincellsI16:K18inthespreadsheet).So,thesuppliesatthesupplynodesYen,Rupiah,andRinggitare-$9.6million,-$1.68million,and-$5.6million,respectively.ThedemandattheonlydemandnodeUS$equals$16.88million(thesumoftheoutflowsfromthesourcenodes).ThetransactionlimitsarecapacityconstraintsforallarcsleavingfromthenodesYen,Rupiah,andRinggit.Theunitcostforeveryarcisgivenbythetransactioncostforthecurrencyconversion.
Jakeshouldconverttheequivalentof$2millionfromYentoeachUS$,Can$,Euro,andPound.Heshouldconvert$1.6millionfromYentoPeso.Moreover,
温馨提示
- 1. 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。图纸软件为CAD,CAXA,PROE,UG,SolidWorks等.压缩文件请下载最新的WinRAR软件解压。
- 2. 本站的文档不包含任何第三方提供的附件图纸等,如果需要附件,请联系上传者。文件的所有权益归上传用户所有。
- 3. 本站RAR压缩包中若带图纸,网页内容里面会有图纸预览,若没有图纸预览就没有图纸。
- 4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
- 5. 人人文库网仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对用户上传分享的文档内容本身不做任何修改或编辑,并不能对任何下载内容负责。
- 6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
- 7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。
最新文档
- 2024-2029年中国镜面唇釉行业市场现状分析及竞争格局与投资发展研究报告
- 2024-2029年中国铝板幕墙行业发展分析及发展前景与投资研究报告
- 2024-2029年中国钨酸铅行业市场现状分析及竞争格局与投资发展研究报告
- 2024-2029年中国钛矿砂行业市场现状分析及竞争格局与投资发展研究报告
- 2024-2029年中国酱腌菜行业发展分析及发展前景与投资研究报告
- 2024-2029年中国过滤站行业市场现状分析及竞争格局与投资发展研究报告
- 2024-2029年中国轻奢品行业市场现状分析及竞争格局与投资发展研究报告
- 2024-2029年中国超导带材行业市场现状分析及竞争格局与投资发展研究报告
- 2024-2029年中国负压称量室行业市场现状分析及竞争格局与投资发展研究报告
- 2024-2029年中国计算机辅助类工具软件行业市场现状分析及竞争格局与投资发展研究报告
- 小学三年级成语故事《程门立雪》课件
- 挂牌合作协议书(通用)
- 代替父亲让妈妈高兴
- 实用美术基础试题
- 幼儿园课程领导力在生长
- 重症医学科利用PDCA循环降低护士床头交接班缺陷率品管圈QCC成果汇报
- 《护理查房百日咳》课件
- 火龙罐综合灸疗法
- 新风机组的维护与保养
- 2023春国家开放大学《人文英语4》机考题库
- 小学四年级心理健康教育 第九课 《在挫折中成长》
评论
0/150
提交评论