vert-3 computer program - springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq...

100
APPENDIX: VERT-3 Computer Program

Upload: others

Post on 07-Feb-2020

1 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

APPENDIX: VERT-3 Computer Program

Page 2: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

220 APPENDIX

C

IMPLICIT INTEGER*411-NI OCOMMON EMARKllll,SETUP.FJNT,DJNT,FACTOR,STJME,SCOST,SPERF,CTIME, lCCOST.CPERF,~TIME.BCOST.BPERF.TtMESM.UNFORM.ITRIPI1221,ITRIP212Zi. 2KNTI61.INPT,IOUT,IPNH.IWFl.IWF2.IWF3.IWF4.IBLK,IT~ACE.ICUT,ISEED, 3IRROR,ISAVE,NODESM,MAXTAG,ICOUNT.JCOUNT,NTRIP,ICORR.LCOMP,NWARN, 4NRK,NRKS,SLAK,MODE,INFC,I~FP,DISC,DISP,CRIT.KGEN,MED,SINGLE,DOUBLE

lOGICAL SlAK.MOOE,INFC,INFP.OISC,OISP,CRIT,KGEN,MED,SINGLE,DOUBlE ISEED = 0

C MAIN IS THE QUARTERBACK C

C

1111 CALL lOADF IFIIRROR.GT.OI GO TO 1111 CALL LOADT CALL LOADA IFIIRRUR.GT.CI GO TO 1111 CALL LOAor~R

IFIIRROR.GT.OI GO TO 1111 CALL DONET JFIIRROR.GT.01 GO TO 1111 CALL OUTFLO IFIICORR.GT.OI CALL CORR GO TO 1111 Er-ID SUBROUTINE ERRORII,J,K,LI IMPLICIT I~TEGER*4(I-NI

GCOMMON EM~RK 1111, SETUP, F PH, () INT ,FACTOR ,S T I ME, SCOS T. SPERF, C TIME, lCCOST .CPERF, BTl ME ,BceST ,SPERf, Tl MESM,UNFORM, ITRI PI 1221,ITR IP2 1221. 2KNTI61,INPT,IOUT,IPNH,IWFl,IWF2,IWF3,IWF4.IBlK,IT~ACE,ICUT,ISEED, 3IRROR,ISAvE,NODES~,HAXTAG, ICOUNT,JCOUNT,NTRIP,ICORR,LCOMP,NWARN, 4NRK,NRKS,SLAK,MOOE,I~FC,INFP,OISC.DJSP,CRIT,KGEN,MED,SINGlE,DOUBlE

lOGICAL SLAK,MODE,INFC,INFP,DISC,DISP,CRIT,KGEN,MEO,SINGLE,DOUBlE I NTEGER*21

C THIS suaROUTI~E LISTS ERRJR AND WARNING MESSAGES C

IFIL.EQ.NWARN) GO TO 1144 IRRGR = IRROR + I WRITE"IIOUT,11221 IRRCR, I, J, K

1122 FORMAT IIH,;, 14, 17H. [R R a R r-IO •• 16, 2X. 2A4) IFIL.NE.IBLK) WRITE IIOUT,(133) L

1133 FORMAT (lH+, 37X, (6) RETURN

1144 ~RI1E IICUT,l~55) I, J, K 1155 FORMAT 11110, 7X, i8H .. A R t~ I N G NO., 16, 2X, 2A4)

RETURN END SUdROUTI~c SEcK IJ,E~OXI

IMPLICIT INTEGER*411-NI ('CO/l4HON EMARK 111" SETUP, FI 'liT, OINT, FACTOR, S T IHE, SCOS T, SPERF ,C Tl ME, iCCOST,CPtRF,BTIME,BCCST,BP:RF,TIMESM,UNFORM, ITRIPlll2I,ITRIP21221, 2KNT(6),I~PT.IUUT,IPNH,IWF1,IWF2,IWF3.IWF4,IBLK,ITRICE,ICUT,ISEED,

3IR~OR,IS'VE,NODESM,MAXTIG,ICOUNT,JCOUNT,NTRIP,IeO~R,LCOMP,NwAR~,

4NRK,NRKS,SLIK,MOOE,INFC,INFP,OISC,DISP,CRIT,KGEN,M~n,SINGLE,DOUBLS

OCOMMON/ARCS/ASTOREI 280~I,UTIMEAI 350),TIMEII 3501,UCOSTAI 35e), ICOSTAI 35'::),UPERFAI 35'l).oE?fAl 3501,wORKI 3se),ISTATEI 35C), 2NODEII 35,)I,NOOEO( 35CI,ICI>IT/l,( 35~1.KEEPCI 35C;J,<EEPP( 3501. 3IARCl( 35C'),II<RC21 35C),IPOINTI 35(;),JPOINTI 35J),ISLAKI 35()), 4KARC.LI?C,MAQC,NAQC,ITALC,ITAlP,ISTAq

LOGICAL SLAK,MUDE.INFC, INFP,Dlsc.nISP,CRIT,KGEN,MED,SINGLE,DOU9LE

THIS SUBROUTI~E SPOTS INFORMATION IN VARIABLE ARC STORAGE IASTORE)

Page 3: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM 221

G

C

M = J • ITALC • 1 IT AL P, DO llHtl ·,=..,.K"RC IFIASTDREIN) - E~OX)1177.1166,11~R

1166 ITALI' = ,~ - ITALC - 1 1117 RETURN 1188 IFIASTCRCI~)_LT.EMARKIII)1 ITALC N

RETUR~,

END S UBR OUT HE L CA OF IMPLICIT I~TfGER*4(I-NI

0COMMON EMARKIll',SETUP,FINT,OINT,FACTOR,STIME,SCOST,SPERF,CTIME, 1 C C05 T , C f' E R F , e I I/oiE, BC (5 T • BP oR F, TIM c: SM, UN FOR ~1, I TR I P 1 ( z;> 1 , I TR I P 2 I 22 I , 2KNT ( 61 , I ,'J;> T , L1UT , I PNH, I wF 1, I OiF2, I W F3, lW F4, I RLK, IT~ AC::, I CUT, I SE E [). 3IRROR,ISAVE,NOOESM,MAXTA;,ICDUNT,JCOUNT,NTRIP,ICORR,LCOMP,NWARN, 4NRK, 'IRKS, SL AK. MOD", I NFC, I '1FP,O ISC, D I SP, C PIT, KG EN, MEO, S I.~GLE, DOliflLE uCOMMON/TRIALS/STORETI 1~~],41,T~RM(1~,B),KPCI~TIl ),NODETI lG(Ol, lMTERM, tH ~RM, M (ER, I ER OCOMMON/ARCS/·\STOREI 2Q0(1),UT (MEAl 35,j),TIHEA( 35u) ,UCllSTA( 350), lCOSTA( 35(,) ,UPERFA( 350),PeRFA( 353),WORK( 35"),ISTATEI 3?,,), 2NOOElI 35\.:),~liJOtul 35CI,I:R(TAI 35Cl,KCEPCI 3,/)),KEEPI'I 3501, 31ARCli 35{)),JARC21 35CI'(PDINTI 35DI,JPOINTI 3SCI'(SLAK( 35u). 4KARC,LARC,MA~C,NARC, !TALC, !TALP. ISTM OCDMMON/NOOrS/TlME'l( 2COI,COSTNI 20CJI,PEKFNI 2Civl,NSTOR~( 54,,01, lNOOElI 20ul,t;O[;E2( 2(C),LJGII 2GCI,LOGOI 2001.~~ST4TE( 2'JJI, 2NARC(( 2()n).NARCO( 2.)I)I'(STAT( 2,V:I.INSTAT( 2CCI,ICRITN( 20vl. 3NPOINT( 2U~I,NSLAK( 20GI,JUMPI 20n"KNOOf,LNonE.MNOQE,N~D[)E.MTAC.

4NTAG UCOMMON/INTE~~/XMINI2[,41,(MAXI2J,41,HMINI2~.41,HMAX(20.41,

lHAV~(2G,4I,ICbSI201,~HIST,NHIST

vCOMMON/SLACK IkM IN 120 I, RMAX I 2( I, SMI NI 2 () , SMAX (2 ;.1 • SAVE (2,) I, 1JOBS(201.MSLACK,NSLACK 0CO~MON/CPG'P/Tlllel,T2(1~I,CCNFL(101,CONFSI1[I,CA~E(1JI,CSMIN(10),

lCSMAXI 10), CHMIN I le) ,CHMAX( 1(; I.PAVE I lQ I, PSMI Nil J) ,P~MAXI 111). 2 PHM I N ( 10 I • PHMAX 11 C , ,KCOBS ( 1': I, KPOB S I 1, I , Me PGAP, Ne P GAP, I C P(;AP OIMENSIC:~ IOA(17" ICBII7), IOXI141, NUMB(41 LOGICAL SLAK,MOoE,INFC,I'IFP,Olsc.nISP.CRIT,KGEN,MlD,SINGLE.DOUBLE INTlGER*2LOW.IUP DATA IOA.IOB,IOX/4HM ,4HMTIM,4HMCOS,4HMPER,4HFILT,4HFILT.4HFILT, 14HSLAK,4HDTI~,4HHTIM,4HRTI~,4HOCOS,4HHCOS,4HRCDS.4HOPER,4HHPER,4HR

2PER,IH ,IHE.1HT,IHF,lHl,H2,lH3,IH .lHE,lHE,IHE,lrlT.1HT,lHT,lHF,lH 3F,1HF.4HENDA,4HENoN,4H----.4HHIST.4HSUBT,4HSLAK,4H*N.$,IHK.1HE, 41HN, 1110, lHC, 111 I, lHBI

DATA NUMB/lHl.1H2.1H3, IH41

C IF THE PROGRAM HAS NCT BEfN INITIALIZED, 00 SO AT THIS TIME. C SETUP IS USED FOR INITIALIZING. THE LARGEST FLOAT POINT NUMBER C THE CO~PUT~R BEING USED CAN HANDLE SHOULD BE ASSIGNED TO SETUP. C lERO THE ERROR COU~TER AND ASSIGN BLANK TO IBL(. C

IRRDR = ,J M = 0 N = [SEED INFC .T/{UE. INFP .TRUE. ol'SC .TRUE. DISP .T'~UE.

MED .TRUE. IFIISEfD.GT.OI GO TO 1411 M = 1

Page 4: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

222

IC

SETUP = 1. (.~ 3R EMARKll1 -999991.0 E MARK I 21 -'199992.0 EMARKIJI -999993.0 EMAkKI41 -q~9994.C

EMARKI51 -999995.0 EMARKlol -999996.0 EMARKI71 -g99997.u EMARKI81 -999998.C EMARKI71 -99'199'1.0 EMARKIlu)= -999990.0 EMAKKIll)= -9999CO.C IBLK = IOB(1) NI'iARN = I,)XI71

APPENDIX

IC 110 SET Ui> - I\PT = KEADE~, lOUT = PRINr;:q, IPNrl = PUNCH, IWFI = C MA~TER FILe, IWF2 = I'HEPI'::OIATE FILE, IWF3 = TRANSPORT FILE C ',0. 1, I",Fl, = TRAf\SPOQT FILE NO.2. ITO Ave·IO COMMENT OcLETIQ'l5 C THESE ~SSI~~ME~TS ARE llSTRIBUTED AMONG THE FOLLOWING COMMENT~1 C

IN PT = 5 C C NDTC---THt DIMENSIONS ASSIG'H:D TO THE COMMO,," ~ND CERTAn DIMENSION C ARRAYS AND TH~ VALJES ASSIGNED TO CHECK V'~IABLES MITER, C MT::RM, LARC, ~AQC, MNCOE, LNoor, MTAG ANO MHIST MUST BE C KEPT CUNSISTAf\T WITH THE FOLLOWING Mf\EMCNIC CIMENSICNING C SCHEM2. AN AUXILI_RY PROGRAM CALLED DIM[~ DOES THIS TASK. 'C

lOUT = 6 C C lCOMMON/TRIALS/510RETIMITE~,41,TEAMIMTERM,81,KPOINTIMTERM),

C lNODETIMITERI---ETC. AS ABOVE C C IN SUBKOUTIN~ DUTFLO, MEDIAN AND ~S

C COMMDN/MEDA~/lIMITERI,---ETC. AS SHOW~ IN THOSE SUBROUTI~ES

C IPNH = 7

C C vCOMMON/ARC5/ASTOREILA~CI,UTIMEAIMARCI,TIMEAIMARCI,UCOSTAIMA~Cl,

C lCOSTAIMARCl,urERFAIMARC),~cRFAI"ARCI,WORKIMARC),ISTATEIMARCl,

C 2~ODEIIMARCI,~UDEOIMARCI,ICRITAI"ARCI,KEEPCIMAQCI,KEEPPIMARCl, C 3IARCI1MARCl,IARC2IMA~Cl,IPOINTIMARC1,JPOINTIMARCI,ISL~KIMARCl,---

C 4ETC. AS ABOVE C

IWFI = 8 c C (COMMON/NODES/TIMENIMf\CDEI,COSTNIMNOD~I.PfRFNIMNODEI,NSTOREILNOOE+

C IMTAGl,NODE1IMNODEI,NODE21~NODEI,LOGIIMNODEI,LOGOIMNODEl,

C 2NSTATEIMNOOEI,NARCII~~OOEI,NARCOIMNOOE1,INSTATIMNOOEI, C 31STATlMNODEl ,JCRlTNI~fl:ODEl ,"lPOINTlMNOOEI,NSLAKIMNODEI, C 4JUMPIM~ODEl,---ETC. AS ABJVE C C IN SUBROUTIN~ DONET C DIMENSION SLACKAIMARCl,SLACKNIMNOOEI,IPATHAIMARCI,IPATHNIMNOOEI C

I "F2 = 9 C C uCOMMON/INTERN/XMINIMHIST,~I,X"AXIMHIST,41.HMINI"HISJ,41,

C IHMAXIMHIST,41,HAVEIM~IST,41,IOBSIMHIST1---ETC. AS ABOVE C C OCOMMON/SLACK/RMINIMSlACKI,RMAX(MSLACKI,SMINIMSLACKI,SMAXIHSLACKl, C ISAVEIMSLACKl,JOBSIMSLACKI---ETC. AS ABOVE

Page 5: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM 223

C C UCOMMON/CPGAP/T1IMCPGAP),T2IMCPGAP),CONFLIMCPGAP),CONFSIMCPGAP), C ICAVEIMCPGAPI,lSMIN{MCPGAPI,CSMAXIMCPGAP),CHMIN{MCPGAPI, C 2CHMAXIMCPGAP),PAVeIMCPGAPI,PSMINIMCPGAPI,PSMAXIMCPGAPI, C 3PHMINIMCPGAPI,PHMAXI~CPGAPI,KCCBSIMCPGAPI,KPOBS{MCPGAPI,---ETC. AS C 4ABOVE C

IwF3 = 10 C C IN SUBROUTINE OUTFlO C 00IMENSIO)l HSTCIMHIST,41, HTCSIMHIST,41, IHISTlMH)ST,4,281, C lSSTDIMSlACKI, STOSIMSLACKI, JHISTIMSLACK,281---ETC. C SHOwN IN SUBRGUTI~E OUTFLJ C

C C C C C C C C C C C C C

c

IwF4 = 11

MITER MARC lARC MNODE lNODE MTAG

MHIST MTERM MSLACK= MCPGAP=

MAX. MAX. MAX. MAX. MAX. MAX. RAGE MAX. MAX. MAX. MAX.

MI TER 10C;, MARC J5S LARC 280.1 MNODE 20': LNOLlc 1800 MT AGl60 r . MH[ST 2" MTERM 1':, MSlACK= 2'; MCPGAP= 1G

NO. OF ITERATIONS rW. OF ARCS SPACE J~ GENERAL ARC STORAGE ARRAY ASTORe NO. OF NODES SPACE IN GENE~AL NODE STORAGE ARRAY NSTORE SPACE I~ THE BACK END OF NSTORE ALLOCATED TO THE STO­JF THE SINGLE CCUNTING COST AND PERFORMANCE VECTORS NO. OF INTER~AL NODE HISTOGRAMS ALLOwED NO. OF TERMINAL NODE HISTOGRAM CARDS NO. OF SLACK HISTOGRAMS ALLOWED NO. OF CCST-PEMFORMA~CE INTERVAL HISTOGRAMS ALLONED

C THE CHECK VARIABLES ~UST ~AVE THE FOLLOW[NG MINIMUM SilES TO ~N-C ABLE USING THE ABOVE A~RAYS IN AUXILIARY CAPACITIES. IRROR C COUNTS THE NUMBER CF ERRORS ENCOUNTERFD. C

C

IFIMITLR.LT.15CICALL ERRO~ 1130C,[BLK,[BLK,[BLKI IFIMARC.LT.ICvl CALL ERRO~ 11311,[BLK.IBlK,IBLKI [F{LARC.LT.20~1 CALL ERRO. (1322,IBLK,IBLK,[BLKI IFIMNODE.LT.6C I CALL ERRO~ 11333,IBLK,[BLK,IBLK) IFILNODE.LT .2, OICALL ERRO~ 11344, IBLK, IBLK, IBLKI [F{MTAG.LT.2C~ I CALL ERPOR 11355.I8LK,[BLK,IBLK) IFIMH[ST.LT.1) CALL ERRO~ 113bb,[BLK,IBLK,IBLKI [FIMTERM.LT.11 CALL ERRO~ 11377,IBLK,I~LK,IBLKI

[FIMSL.\CK.LT.lI caLL ERROR 1118B'[8LK.IBLK,[BLKI IFIMCPGAP.LT.l) CALL ERAOR 11399,IBLK,IBLK,IBLKI IFIMCPGAP.GT.MAAC/21 CALL ERROR 1140G,IBLK,IBLK,IBLKI IFClRROR.GT.'1 GO TC 2940

C TH[S SUBROUT[~E MEADS IN AND LOADS DATA ON THE F[LES, LOADS ARC C AND NODE NAMES [N CORE STORAGE, CHECKS FOR ALPHA DATA IN C NUMER[C FI~lDS AND lfROS CUT STORAGE ARRAYS FO~ LOADA C

1411tJREAD IINPT,l4i2,END=2'l441 I, [STAR, ITRACE, ICUT, NTRIP, ICOAR, lICPGAP, 1(, LCiIMP, L8:.ilO, [SEED, ITFR, FINT, OINT, FACHJR, ST[ME,

Page 6: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

224 APPENDIX

C

2SCOST, SPERF, CTIME, CCOST, CPERF, BTIME, BCOST, BPERF 1422 FORMAT ISI1, 12, 11, IS, 15, 2F4.2, lF3.Z, 3F9.01

00 1433 L=1,2C' 1433 NOOETIL) = laLK

IFII.GE.O.AND.I.LE.l) GO TO 1450 CALL ERROR 11444,IBlK,IBlK,IBlKI GO TO 2940

145G IFII.EQ.1) READ IINPT,1455,E~O=292ZI INODETIl), l=l,20) 1455 FORMAT 12v441

vWRITE IIGUT,14661 INCDETll), l=I.201. I, ISTAR. !TRACE, ICUT, INTRIP, ICORR. ICPGAP, K, lCOMP. lBOSO, ISEEO, ITER

l466LFORMAT IIH1, 2CA41135H PRlBLEM IDENTIFICATION CAR) OPTION.Z511H-), 1111112lH TYPE OF INPLT OPTION, 391IH-I, Il11122H TYPE OF OUTPUT OP 2TION, JSI1H-I, Illl/27H :::JSTING AND PRUNING OPTION, BI1H-I, 11111 323H FULL PRINT TRIP CPTID~, 3111H-), 111114CH COR~ElATICN COMPUTAT 41C~ AND PLOT OPTIGN, 2011H-I, 111113SH COST-PERFORMANCE TIME INTER SVAl OPTICN, 2/IlH-I, 1l11153H COMPOSITE TERMINAL NODE MINIMUMS ANO 6 MAXIMUMS OPTION, 7IlH-I, Illll29H TERMINAL NODE LISTING OPTION, 73111H-I. IllIIZ6H SO-80 LIST OF INPUT CARD5, 341IH-I, Illll13H 11'11 BTIAl SeED, 47( IH-I, Ill/I2IH NUMBER OF ITERATICNS, 391IH-I, 111111 w~RITE (IOUT,14771 FINT, DI~T, FACTOR, STIME, SCOST, SPERF, CTIME, ICCOST, CPERF, BTIME, eCOST, BPERF

1477(FORMAT (~2H YfARlY I~TEREST RATE USED FOR INFLATIQN ADJUSTMENTS, 181IH-), fl1.lllS6H YEARLY INTeREST RATE USED FOR PRESENT VALUE DIS 2CCU,HI:,G, 4(11-'-), fll.21157H TIME FACTOR WHICH CO~VERTS PROGRAM TI 3Mc TO ~ YCARlY BASE, 31IH-I, FII.211IH , 36X, 4HTIME, 5X, 4HCDST, 4SX, 4HPERFI13~H TERMINAL ~80E SElFCTION WEIGHTS, 3F9.21132H CRITIC SAL - OPTI"'UM PATH "EIGHTS, 3F9.21115H INITIAL VALl/ES, 17X,3F9.211

C DETERMI~E IF SINGLE (R DO~BLE IMUlTIPlE) COUNTING OF ACTIVITIES C IS ~A~TED.

C

C

C

C

SIN;;lE = .FAlSE. DOUBLE = .FALSE. IF(ICUT.GT.~1 GG TO 148" DCUBlE = .TRl.i:. ICUT = 2 GC TO 14R5

19i1 KARC = K~RC + 2 IF(KARC.GT.U"CI GO TO 1177 ASTORdKARC-ll IADJ ASTQRE(KA~CI = ~MARKI1CI - TIMESM LOGIINI = 1

THIS s[crIO~ ~TORES bISTOGR4~S

3'122 IFI"sr.n::( l-ll.LE.;)1 GO TJ 4,.33 KJlRC = KA~C + 1 IF(KARC.GT.L~rC) GC Ie 3177 ASTDRE(K~RCI = 15. l j

CALL S"Ri:AD (',STtlTE([-II,IEtJE,IAOJI IF(;WDESM.;;T. I GO rr: 3933 KA'{C = KAKC - 1 GC T(] 40B

]933 IF(KARC.GT.L~?CI GC Te 3177 J = (NOD~SMI21'2 IF(NODi:SM.N~.J) GO TC 39~5

CALL ::~RCR (1;44,IE,JE,IBLKI GO TO 4022

3955 IFI~OD~S~.G~.~I GO TC 3977 CALL i":<c·~ 13.'66,[ E, JE ,[flLK I

Page 7: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM 225

GO TO 4022 C C DO PROHABILITY ENTRIES SU~ TO 1 A~D ARE l[FT HAND CEll BOUNDARIES C ~MAllER THAN OR E'UAl TO THE RIGHT HAND CEll BOUNDARIES C

C

3977 UNFoMM = 0.0 DO 399~ J=3,NUDES~,2 IFITIMEAIJ-ll.LT.O.OI CALL ERROR 139R8,IE,JE,IBLKI UNFORM = UNFORM + TI~EAIJ-ll

3999 IFITIM2AIJ-?I.GT.TIMEAIJII CALL ERRO~ 140UO.IE,JE,IBLKI IFIUNFORM.GT .>.99.ANC.UNFoRM.LT .1.011 GO TO 4()22 CALL E~ROR 14~II,IE,JE,IBlKI

C ~NTcR fHC END OF SEG~ENT INDICATOR FOR HISTOGRAM INPUT C

C

4022 KARC = KARC + 2 IFIKARC.GT.LARCI GO TO 3177 ASlORE I KARC-ll I ACJ ASTJREIKA~CI = ~MA~KII01 - TIMESM LOGIINI = 1

C THI~ SECTION STORES ~.THEMATICAL RELATIONSHIPS IN ASTORE C

C

10033 IFINSTATtl I I .Lt..vl GC TO 4388 MAXTAG = c

M = NSTATEI II DO 4l'61> J=I,~

MAXTAG = MAXThG + 2 IFIMAXrAG.LE.MAPCI GC TC 4~44 MAXTAG = 2

4044 NODtSM = MAXr~G - 1 iJREAD IIWF4,4'~51 K, IUTIMEAIU, TIMEAILl, UCOSTAIll, ICRITAIll, lICKITNIll, C~qAIll, ISTHttU, JPOINT(U, UPfRFAILl, KEEPC(Ll, 2KEEPPIll, TI~LNILI, CCSTNCLI. PERF~ILI, l=NOOESM,MAXTAGl, IAOJ

4055 FORMAT IlL, 2CF2.v, 2Al, 2A4, AI, 2110. AI, 2A4. 3F8.01, III 4066 IF(K.NE.JI C~ll ERROR 14G77,IE,JE,IBlKl

C DECUDE SU~-U~IT-BACKUP INnlCITOR, ~ORK CARRIES TH~ BACKUP STATUS C

c

DO 4133 J=l,M4XTAG 0IFIUTIMEAIJI.cQ.O.~.'~0.ICRlrACJI.EC.IRL~.AND.IC~ITNIJl.EQ.IBLK. lAND. IS TA T:: ( J I. E Q. I Rl K. ANO. JPLI NT C J I • L Q. IOLK • AND. K ": PC (J I • EQ. I !lLK • ZA:W.KEPP(JI.HI.IIlLKI GO TO 4133 ~ORKIJI=0.'

IFlTlMfAI JI.~c.B"CKUPI GO TO 41U IF(J.GT.l1 SC TO 4~99 CAll i: .. RO;< 1488,lc,Ji',I~LKl

GC ra I,U3

C INDICATE TO THE PMEVIOUS T".ANSFORMATICN THAT IT HAS A BACK UP. C rHc.:'; PASS If't: SUM··CMlT I~WICo.TOq or THE PRFvllJUS TI\A,~5F(1RMATlG'J

C FO~wARn TC THE PR_SFNT GACkUP T~ANSFO~MATICN C

4099 ~CRK(J-ll = i.G IFCTlWA(J-ll.LT.,'.SI TI~E~CJl =-2.( IF(Tlr~'AlJ-ll.uT.,.CI T1M:=tdJl = ?(

GO TO 41.l3 41'.. Ir(flj>l",A(JI.\.SlJ,~1 GC ro 4;11

T1MeA() I = 1. GC TO 4133

,,111 IF(r!l1.A(JI.~'.UdTI C·\LL ,pr,OR 1412?,IE,JE,IPlKI TIr~lA(11 =-1.

Page 8: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

226 APPENDIX

4133 CONT I:lL:E C C LOAD THE FUNCTIONAL RELATIONSHIPS DATA INTO VAqIA8LE ARC STORAGE C

C

00 4377 J=i,M~XTAG uIFIUTIME~IJI.EQ.O.G.IND.I~RITAIJI.EQ.IBLK.ANO.ICqITNIJ).EQ.IDlK.

lAND.ISTATEIJI.EQ.I8lK.AND.JPCINTIJI.EQ.IBLK.ANO.KfEPCIJI.(Q.IBLK. 2ANO.KE~PPIJI.iQ.IBLKI GO TJ 4317

KARC = KARC + ') IFIKARC.GT.lAPC) GC TC 3177

C CHECK AND ~NT~R IN STORAGE ThE TRANSFORMATION NUMBER, STORE THE C SUM-OMIT AND BACKUP INDICATORS, THEN D£CODE THE RETRIVAL CODE C (T-TIME, C=COST, P=PERFJRMANCE OF THE NCDE DR ARC FOLLOWING C K=CONSTANT AND BlANK=P~lVIOUS TRANSFORMATION. I C

C

x = UTPofEAIJI IFIX.L~.G.O.A1D.X.GT.IJ0.01 CAll ERROR 14155,IE,JE,IBLKI

4166 ASTOREIKARC-b) X ASTOREIKARC-7) = TIMEAIJ) ASTOREIKARC-61 = WORKIJI DO 4366 M5=1" GO TO 14177,4i98,419Q),M5

4177 X = UC~STAIJI 1'11= IC~ITAIJI

M2= ICRIT'lIJI Y = TIME'll J) GO TO 42(;0

4188 X = COSTAIJI 1'11= ISTATEIJI 1'12= JPJINTIJI Y = COSTNIJI GC TO 4200

4199 X = UPERFAIJI 1'11= KE":PCI J) /42= KE":PPIJI Y = PERFf\IJ)

4200 00 4211 144=1,5 IFCX.~E.TYPECM411 GO TO 4211 ASTOREIKARC-7+2*1'I51 = 144 L = 144 GO TO 4233

4211 CONT I~E CALL ERRCR 14222,IE,JE,IBlK) GO TO 4366

C DECODE THE ARC OR NOCE NA~S FROM WHICH DATA WILL 8E RETRIVED C

,C

4233 K = KARC-6+2*M5 JCOUNT = 0 IFIL - 414244.4333,4311

4244 00 4288 M4=I,NARC IFIMI.~E.IARCIIM41.0R.M2.NE.IARC2IM4)1 GO TO 4298 IFIM4.NE.ISAV~1 GO Te 4277 JCOUNT = 1

C CHECK TO SEE IF THIS VARIABLE IS DEPENDENT UPON ITSELF C

IFIN.NE.Ll GO TO 4266 CALL ERROR 14255.IE,JE.IBlKI GC TO 4366

4266 M = I - 3 + L

Page 9: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM

ISTAT(I~I = 1 4271 ASTOREIKI = M4

GC TO 4366 4288 CO'lTINUE

C C IS THIS ~ATHEMATICAlLY RElhTEO VARIABLE A NODE C

C

DO 4299 M4=1,~NODE IFIMl.NE.NODElIM41.0R.Ml.NE.NODE2IM4ll GO TO 4299 ASTOREIKI = -M4 GO TO 4366

4299 CONTINUE CALL ERROR 14.3\;0, IE,JE, IBlKl GO TO 4366

227

C CH~CK AND STORE THE TRANSFORMATION REFERENCE NUMBE~ OR CHECK AND C STORE THE CONSTANT C

C

4311 L = Y + 0.001 IFIL.LT.J.OR.L.GE.JI CALL ERROR 14322,IE,JE,IfllKI GO TO 4355

4333 IF(Y.LT.~MARK(llll CALL ERROR (4344,IE,JE,IBLKI 4355 ASTOREIKI = Y 4366 CONTINUE ',377 CONT INU':

C lOAD THE END OF SEGMENT INDICATOR FOR MATHEMATICAL RELATIONSHIPS C

K4RC = KARC + 2 IFIKARC.GT.lARCl GC TO 3111 ASTOREIKARC-IJ = IADJ ASTOREIKARCI = EMARK!ll - TIMESM IFIJCOUNT.EQ.ll GO TO 43~B lDGIINI = 1

4388 CONTINUE C C SUM, CHECK AND LOAD T~E DEPENDENCY TNOIO_TORS o

o

NSTATEllI = ISTATfll + ISTATl21 + ISTAT(3) NSTATE(2) = ISTATl41 + ISTATl5l + ISTATf61 NSTATEI31 = ISTATI11 + ISTATl81 + ISTATl91 DO 4455 1=1,3

C ANY DEPENDENCIES FOR THIS VARIABLE, IF NOT, WAS A NO'l DEPENDENT o INPUT MADE FOR THIS VARIABLE, IF SO NOTE THIS VIA ASSIGNING o A 1 TO THE FINAL DEPENDENCY VEOTOR o

C

IFINSTATEIII.GT.Ol GC TO 4399 IFILOGIIII.NE.OI LOGCIII = 1 GO TO 4455

o FINO THE INDEPENDENT, IS IT DEPENDENT UPON ANOTHER VARIABLE o

o

4399 N = 1*3 M = N - 2 K = 0 DO 4444 J=M,N K = K + 1 IFIISTATIJI.EO.OI GO TO ~44~ IFINSTATEIKI.GT.OI GO TO 4411

o THIS INDEPENDENT IS NCT DEPENDENT UPON ANOTHER VA~IABLE, OHEOK TO

Page 10: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

228 APPENDIX

C SEE IF A ~ON DEPENDENT INPUT WAS MADE FOR THE VARIABLE, NOTE C THIS SECOND LEVEL DEPE~DENCY VIA ASSIGNING A 2 TO THE FINAL C DEPEND[~CY VECTOR C

C C C C C C C

C C C

4411

4433 4444 4455

4466

IFILOGIIKI.EU.01 CALL ERR~R 144C0,IE,JE,IBLKI LCGOI I I = 2 GC TO 4444

THIS 1-IDEI'E"jD~NT IS OEPEN:JENT UPON ANOTHER VARIABLE, FIND WHICH VAPIABLE IT IS DEPENDENT CN ~ND THEN CHECK TO SEE IF IT IS DEP~NOENT UPON THE VARIABLE BEING EXAMINED, LASTLY NOTE THIS THIRD LEVEL DEPENC~NCY VIA ASSIGNING A 3 TO THE FINAL DEPENDENCY VECTOR

L = K* '3 - 3 DO 4433 NOOES~=1,3 L = L + 1 IFIIST~TILI.E~.CI GC TO 4433 IFINDD[SM.EQ.II CALL ERRO~ 14422,IE,JE,IBlKI LCGOIII = 3 CCI'-" I NUE CONTINUE CONTINU~ M = IPGINTIISAvEI + 1 ASTOREIMI = l~C.lOGClll + 10.l0G0121 + lOGOl31

ENTER THE END OF ~ECCRO I~DICATOR

KARC = KARC + 1 IFIKARC.GT.LlKCI GO TG 3177 ASTOREIKARCI EMARKI91 GO TO jOll END SUBROUTINe SEREAD INCAROS,IE,JE,IADJI IMPLICIT INTEGER*4!1-~1

OCOMMON EMARKIlll,SETUP,FINT,OINT,FACTOR,STIME,SCOST,SPERF,GTIME, IGCOST,CPEPF,BTIME,BCCST,BPERF,TIMESM,UNFORM,ITRIPIlll1,ITRIPlIll', 2KNT!61,INPT,IUUT,IPNh,IWF1,IWFl,IWF3,IWF4,IBlK,IT~ACE,IGUT,ISEED, 3IRROR,ISAVE,NODESM,M~XTAG,ICDUNT,JCOUNT,NTRIP,ICORR,lCOMP,NWARN,

4NRK,NRKS,SlAK,HODE,INFC,I~FP,DISC,DISP,CRIT,KGEN,MED,SINGLE,DDUBLE uCOMMON/ARCS/ASTOREI 28001,UTIMEAI 3501,TIMEAI 3501,UCOSTAI 3501, lCOSTA! HOI,UPERFAI 3501,PERFAI 3501,wORKI 3501, I STATE I 3501, lNODEI( 3501,NODEO( 3501,I:RITAI 3501,KEEPCI 3501,KEEPPI 3501, 31ARC1I 3501,IARClI 3501,IPOINTI 3501,JPOINTI 3501,ISlAKI 3501, 4KARC,LARC,MARC,NARC,ITALC,ITAlP,ISTAR

lOGICAL SLAK,MODE,INFC,INFP,DISC,DISP,CRIT,KGEN,MED,SINGLE,DOUBLE C C THIS SUBROUTINE READS THE MONTE CARLO, FILTI, FllTl, DISTRIBUTION C AND HISTOGRAM SATELLITE ARC CARDS C

MAXTAG = 0 DO 4499 l=l,NCARDS MAXTAG = MAXTAG + 6 IFIMAXTAG.lE.MARCI GO TO 4477 MAXTAG = 6

4477 NODESM = MAXTAG - 5 READ IIWF4,44BBI J, ITIMEAIKI, K=NODESH,MAXTAGI, IADJ, K

4488 FORMAT Ill, 6FlO.O, 11, 151 4499 IFIJ.NE.II CALL ERROR 14500,IE,JE,18LKI

C C DETERMINE HOW MANY ELEMENTS THERE ARE AND STORE THESE ELEMENTS. C

Page 11: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

C

VERT-3 COMPUTER PROGRAM

NOOESM = MAXT~G - 6 + IK+Q)/IO IFINOD~SM.L[.C) RETURN IFIICOUNT.EC.-9999) RETURN DO 4522 l=l,NODESM KARC = K,~RC + 1 IFIKARC.GT.LARC) RET~RN

IFCTIMcAII).LT.EMARKIll)) CALL ERROR 145ll,IE,JE,IBLK) 4522 ASTOREIKARC) = TIMEAII)

RCTURN END SUBROUTINE LGAONR IMPLICIT INTEGER*4( I-N)

229

LCO~MON =~ARKC1I),SETUP,FI~T,DINl,FACTOR,STIME,SCOST,SPERr,CTIME,

lCCO~T,CPERF,BTIME,BC(ST,BPERF,TIMESM,UNFORM,ITRIPI122),ITRIP2122),

2KNT I 6) , I 'lP T , lOUT, I PNH, I WFl , I WF 2, I WF 3, I WF4, I BLK, ITR ACE, I CUT, IS E ED, 3IRROR,ISAVc,NOOESM,MAXTAG,ICDUNT,JCOUNT,NTRIP,ICORR,LCOMP,N~ARN,

4NRK,NRKS,SLAK,MGDE,I~FC,INFP,DISC,OISP,CRIT,KGEN,MEO,SINGLE,DDUBlE

~COMMON/T"IALS/STORETC 10CD,4),TERMII0,R),KPCINTCI0),NODET( lOCO), 1MT~RM,'HcqM,"ITER, ITER ~CO"MON/ARCS/A~TCREI 28CC),UTIMEAI 350),TlMEAI 350),UCOSTAI 350), ICOSTA( 350),UPERFAI 350),PERFAI 350),WORK( 35C),ISTATEC 350), 2NODEI( 35G),:-';ODEO( 35C),JC~ITAI 35l'),KEEPCI 35t:l,KEEPPI 350), 31ARC11 35C),IARC2( 350),IPOINT( 35r),JPOINTI 35G),ISlAKI 35~), 4KARC,L~RC,MARC,NARC,ITALC,ITALP,ISTAR

0CDMMON/NJOES/TIMEN( 2CJ),:OSTN( 20D),PERFN( 2C:),~STDREI 5400), INODEl1 2~~),~ODE21 2CO),LOGII 200),LOGOC 2GO),NSTATEI 2Gu), 2NARCII 2GO) ,NARCO( 2CG),ISTAl( 200),INSTATI 2(0),ICRITN( 200), 3NPOINT( LCV),~SLAKI 2CO),JUMPI 20CI,KNODE,LNOGE,MNOOE,NNODE,MTAG, 4NTAG DCO~MON/INTERN/XMINI2C,4),XMAXI2t,4),HMIN(20,4),HMAXI20,4),

IHA II E I 2 C, 4 ) , lOt) 5 ( 2 ( ) , MH 1ST, NH 1ST OCOMMON/SLACK/RMIN(20),RMAX(2C),S~IN(20),SMAXI2C),SAVE(20),

IJGBSI2:.) ,MSLACK,NSLACK (·COMMON/CPGAP IT 1 I 10), T2 ( 10) ,CGNFU 10) ,CONFS (le) ,CAllE I 10), CSMINI 10), ICSMAXIlO),CHMINIIC),CHMAX( l\i),PAVE( l(.),PSMIN( 10) ,PSMAXI 10), 2PHMIN(10),PH~AXCIC),KC08S(IQ),KPOBSCl0),MCPGAP,NCPGAP,ICPGAP

LOGICAL SLAK,,",ODE,INFC,INFP,OISC,DISP,CRIT,KGEN,MED,SINGLE,DOUBlE DATA IS/1HSI

C THIS SUBROUTI~E LOADS THE NODE DATA, CHECKS THE PROBLEM OVER FOR C ERR0RS AND PRINTS CUT THE STORAGE AREAS IF REQUESTED. C

I SAVE = (] MODE = • TRUE.

4533 ISAVE = ISAVE + 1 IF(ISAVE.GT.NNODE) GC TO 4933

0READ (IWF4,4544) LOGIIISAIIE), LOGOCISAVE), INSTAl(ISAVE), IISTATIISAVE), ITIMEAII), 1=1,3), M, Nl, N2, N3

4544 FORMAT (Il, 13, 212, 3F4.3, AI, 314) LCGII = LOGIIISAVE) LOGOO = LOGOIISAVE) IFCLOGII.GT.4) GO TO 4555 IFCLOGOC.GE.11) LCGCC = 1

4555 I = ISlAT(ISAVE) IF( I.L~.O) GO TO 4566 MOOE = .FALSE. IFCI.GT.NHIST) NHIST = I

4566 NPOINT(ISAVE) = KNOOE + IE = NODEl( ISAVE) JE = NOOE2ClSAVE) IFIINSTATIISAVE).EC.16) I~STATClSAVEI = 17 IF( INSTAl( ISAVE).EC.C) INSTAl( ISAVE) = 16

Page 12: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

230 APPENDIX

v I F I I NS TAT I I" hi E 1. LT .1. OR. I NS HT I IS AVE I. GT • 17 I 1CALl E,ROR 14~77,IE,JE,IBLKI

IFICTIME.NE.I.01 GO TO 4622 IFIM.~E.ISI GS TO 4622 SlAK = .FALSe. ~SLACK = NSLACK • 1 IFI~SLlCK.lE.HSLACKl GO TJ 4600 IFIITR~C~.EC.31 CALL ERROR 14589,IE.J~,~WARNI IFIITRlCE.~c.Jl CALL ERRO, 14599,IE,J[,IBLKI "<SLACK = 1

46~, NSLAKllSAVEl = NSL.CK IFILOGII.LE.~.ANO.LCGCO.EQ.ll CALL ERROR 14611,IE,JE,IBLKl

C C IF PRESE'lT, ~~AD IN 5 HISTOGRAM MIN-MAX CARn C

C

4622 IFI"<1.~Q.(l GO TG 4722 IFllOGII.LE.4.ANn.LOGOO.E~.ll GO TO 46~8

I = ISTATfISWEl IFII.G;:ol.ANn.I.l~."hISTI GO TO 4655 CALL ERRJ~ 14633,IE,JE,IBLKI

4644 I = 1 4655 READ IIWF4,4666l ICCSTAIJI, PERFAIJI. J=1,4l 4666 FORMAT IBF8.Gl

DO 4677 J=1,4 IFICOST'IJl.EC.u.~.A~C.PERFA(Jl.EC.G.01 GO TO 4677 HMINII,Jl = C0STAIJl HMAXII,Jl = PtRFAIJI

4677 CCNTI',UE GO TU '172<-

4688 NTEKM = ~TER~ • 1 IFINTERM.l~."lERMI GC TC 47CL CALL E~ROQ 14699,If,J~,IBlKl

GO TO 4644 4leG READ IIWF4,46661 ICOSTAIJ1, J=1.81

DC 4111 J=2,A,;; 1 = J - 1 IFICOSTAII1.E~.0.r.AND.CDSTAIJI.EQ.C.:1 GO TO 4111 TERMINTERf'I,l 1 COSHI I 1 TERMINTE~~,Jl COSTAIJI

4111 CONTINUE KPOI NTINTER", ISAVE

C IF PRESENT, MCAD IN I SUBTRACT CARD AND FIND THE SUBTRACT NODE NC. C

C

4h2 NCDESM = 0 IFIN2.fQ.01 G8 TO 4777 IF(LOGll.GT.4.0R.LCGCO.NE.41 CALL ERROR 14133,IE.JE,IBlKI READ (!wF4,41441 K. J

4144 FORMAT 116A41 00 4155 I=1.NNODE IFI I .,,::1. ISIIVtl GO TC 4155 NODESM = I IFINOOClIll.EQ.K.ANO.NOOE2111.EQ.JI GO TO 4771

4155 CCNT I NUE CALL E~RCR (4766,JE,JE,IBLKI

C IF PRESENT, ~EAD IN A SlA:K HISTOGRAM MIN-MAX CARD C

4771 IFIN3.lE.OI GO TO 4811 IFINSlAKIISAV[I.EQ.OI CALL ERROR 14788.IE,JE,18LKI IFIN3.NE.11 CALL eRROR 1419?,IE,JE,IBLKI DO 4801, 1=1,N3

Page 13: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM

"EALl (IWF4,46,:'6) x, y SM/:J(;'SL~CK) X

48~0 S~AXI~SL4CK) = Y C C STJ~E I~~UT-GUTPUT AKC An~~ESSES

C

C

4811 DC 4H2. l=l,~~RC

IFUOD'OI I) .Nc. ISAVE) GO TO 4822 ~~CJE = KJOG~ t 1 IFIKNODE.GT.L~CDE) GC TO 4844 ,'lA'l.CIIIS"YEl = NA~CI([SAYE) + 1 NSTORf.IKNOQ') = I

4822 CCNT /l'JL:: DC 4bB I =~ ,II,.,RC IFINODCIII).\~.ISAVE) GC TO 4R33 KNODE = K~or2 + 1 IFIK~OOE.GT.LNODE) GC TO 4R44 NARCO(IS~V~) = NAKCCIISAVCl + 1 NST~REIK~OD~) = I

4833 CCNTi'JUt IFILOGCC.NE.4) GO TC 4q66 KNODE = K~OQE + 1 IFIKNDCE.GT.L~0DE) GC TO 4844 NSTJR[IKNGC[) = NOCES~ GO TO 4966

4844 CALL ERROR 14L~~,I3LK.IBLK,IRLK) KETUR'J

231

C CHECK rH~ FfASIBILITY OF THE NUMB~R OF OUTPUT ARCS INITIATIUN RE-C ~UE~TS OR ~UMB:R CF SE'l.VERS AND TAG ON THE FACTOR WflGHTS C

C C C

C C

4866 IFILOGII.LE.4) GO TC 4533 IF ILOG! I.:O.~) GO TO 49",( K = IAdSILOGeO) IFILOG!I.,~E.f) GO TC 4888 !FIK.L2.~) C~LL ERRCR 14877,IE,JE,IBLK) GO TO 4513

4888 IFIK.c~.~.CR.K.GT.~ARCI(ISAVE)) CALL ERROR (4899,IE,JE,IBLK) IFILOGII.~Q.6) GO Te 45:B

4900 UNFJRM = J.0 CO 4911 1=I,J

4911

4933

4944

4955

4966

UNFORM = UNFCR~ + TI~EA(II K~ODE = KNOD~ + 1 IFIKNODE.GT.LNUDEI GO TO 4844 NST[)RE(K\OI)E) = TI"'EAII)*ll,i~.C + 0.001 IFIABS(UNFOq"').GT.O.~9.AND.ABS(UNFORM).LT.I.01) GO TO 4533 CALL ~~RLlR 14922, IEdE. !BLKI

LIST THE STC~lGE ARRAYS IF q~OUESTED

IFIITRACE.~E.JI GO TC 5DB~

~RITE (IOUT,4944) FORMAT (Itl1, 20X. 29HVARI~BL: ARC STORAGE (ASTORE)) wRITE IICUT,4955) II, 1=1.12) FORMAT 122HG NC. NA~E POINTER.IOII11 IH .21X.2111.9H --- ETC.) DO 50n l=l,~,\RC

IFI IPDIJ'.jTlI) • .;T.U) GC TO 4977 .. RITE (ICUT,4,66) I. IARO([). IARCZ(II FORMAT IIH , I~, IX. 2A4. IX. lb. 10Gl1.5) GO TO 5022

FINO THE END OF BLeCK MARK IEMARK(9'1

Page 14: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

232 APPENDIX

C 4977 M = IPOINTIII

DO 498d l=M,KARC K = l IFIASTOREIKI.EQ.EMARKI911 GO TO 4999

4988 CC~TINUE 4999 N = M + 9

IFIN.GT.KIIN = K WR IT E I lOUT, 49661 I, IARC 11 II ,IARC2111 ,I POINT! I I , I ASTORE Ill, l=M, N I

5000 IFIN.EQ.KI GO TO 5022 M = N + 1 N = N + 10 IFIN.GT.KI N = K WRITE IIGUT,Selll IASTOREILI, L=M,NI

5011 FORMAT 11H , 21X, 10Gl1.51 GC TO 5000

5022 CONTINUE WRITE IIOUT,S, 331

5033 FORMAT 11Hl, ZOX, 44HVARIABLE NODE STORAGE IFRO~T PART OF NSTOREII WRITE IIOUT,4Q551 II, 1=1,121 00 5077 l=l,NNOOE M = NPOINTI II K = NARC II I I + NAR CO III + M - 1 IFIlOGIIII.E~.5.0R.LGGIIII.EQ.81 K = K + 3 I F I LOG I I I I • LT • 5. MO. LeG C I I I • EO. 4 I K = K + 1 N = M + 9 IFIN.GT.KI N = K WRITE (IOUT,5\.A41 1,~COElIII,NOOE2(II,NPOINTlII,('lSTORE(LI,L=M,NI

5044 FORMAT 11H , 15, IX, 2A4, IX, 16, Hlilll 5055 IFIN.EQ.KI GO TO 5071

M = N + 1 !II = N + 1(; IFIN.GT.KI N ~ K WRITE IICUT,~'661 (~STOREILI, L=M,NI

5066 FORMAT IIH • 21X. 101111 GO TO S05S

5077 CONTI'WE C C CHECK THE REST OF THE CONTRPl CARD PARAMETERS C

5088 IFIITRACE.LT.·· .• OR.ITRACE.GT.31 CALL ERROR (SC99,IBLK,IBLK,IBLK) IFIITRACE.EQ.3.ANO.ITER.GT.ILG) CALL ERROR (510Q,IBLK,I8LK,IBLK) IFIICUT.LT.0.0R.ICUT.GT.2) CALL ERRO~ 15111,IBLK,IBlK,18lKI IFILCOMP.EQ.2) LCO~P = 1& IFIlCOMP.LT.I.0R.LCC~P.GT.161 CALL ERRCR (S12G,18LK.IBLK,IBLKI IFI ISEEO.~!,).::I ISEEO = 43545<) IFIlTCR.LE.' .OR.ITER.GT-MITER) CALL ERROR (5122,lfLK.IBLK,MITER) L = V M = C IFIINFC.ANO.INFP) GO TO 5144 IFIFINT.LE.0.LI CALL ERPO~ 151B,[BLK,xBlK,J8LK) FINT = FINT/I(C.C + 1.0 L = 1

5144 IFIDISC.AND.CISPI GC TO 5166 IFIOIIIIT.lc.G.') CALL ERROR 1515S,IBLK,IBLK,JBLK) DI~T = DINT/lre.v • 1.0 M = 1

5166 IFIL+M.EQ.u) GC Te 51RB IFIFACTOK.LE.c.C) CALL ERROR 15117,IBlK,IBLK,IBLK)

5188 IFISTIME.LT.-~.~.OR.STIME.GT.I.G) CALL ERROR (519Q,IBLK.IBLK.IBLK) IFISCIJST.lT.-l.C.nR.SCCST.GT.l.O) CALL ERROR 152"::,ISLK.I3Lo<.,IBlKI IFISPERF.lT.-I.0.0M.SPERF.GT.1.0) CALL ERRCR 15211,IBLK,IBLK,IBLKI

Page 15: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

C C C C C C C C

C C r..

VERT-3 COMPUTER PROGRAM 233

5288

1480

1485

1488

UNFORM = ABSISTIME + SCOST + SPERFl IFIUNFORM.lT.O.99.0R.UNFORM.GT.1.OlICAllERRORI5222,IBlK,IBlK,IBlKI IFICTIME.lT.-1.0.0R.CTIME.GT.1.Ol CALL ERROR 15233,IBlK,IBlK,IBlKl IFICCOST.lT.-1.0.0R.CCOST.GT.1.0l CAll ERROR 15244,IBlK,IBlK,IBlKl IFICPERF.LT.-l.O.OR.CPERF.GT.l.Ol CALL ERROR 15255,IBlK,IBlK,IBLKI UNFORM = ABSICTIME + CCOST + (PERFl IFIUNFORM.EQ.0.01 GO TO 5288 IF IUNFORM. LT. C'. 99. OR .UNFORM. GT .1.0 1lCALL ERROR« 5266, I BlK, I Bl K, I BlK l IF1NHIST.GT.MHISTI C6ll ERROR 15277,IBlK,IBlK,[8lKl

CHECK NCDES FOR CD~PlETENESS ICOUNT - USED TC CCUNT NUMBER OF INITIAL NODES JCOUNT - U~EO TO COUNT NUMBER OF TERMINAL NCDES NI - NO. OF INPUT ARCS NO - NO. cr OUTPlT ARCS NP - POINTER INTO VARIA8LE NOOE STORAGE

ICOUNT = " JCOUNT = t 00 6066 l=l,NNODE JUMPII) = (; ill I = NARCI II) NO = NARCOII) SINGLE = .TRUc. ICUT = lCUT .- 1

OETERMI~i IF THE MEDIAN IS WANTED

IFIITRACE.NE.41 GO Te 14BB ITRACE = 1 GO TO 1499 IFIJTRACt:.'lE.~) GO TC 1500 ITRACE = 2.

1499 C

MED = .FALSi:.

C C C C C

C

LOAO THE SEec GENERATED AT VALUE r:NT~RFD FOq THE S THIS RUN IS THE FIRST 8 ~HICH GEN~RATOR 15 WANT

i5.v IFIM.EQ.lI SC Tf 1511 IF(ISEEO.NE.~) GO TO 1511 ISEtO = \ GO TO 1522

1511 KGc;J = .FALSE. IF(ISE[C.GE.~) GO TO 1522 KG::N = .TRUE. IS:cD = -IS~c[)

ThE END OF THE PREVIOUS RUN IF THE ED FOR THE CURRENT RUN IS ZERO. IF ING ENTERED IN THE COMPUTER, DETERMINE D

C ~EAD ANC LIST INPUT CPTIO~S

C 1522 IFINTRIP.~=.: .AND.~TRIP.lE.l) GO TO 1530

CALL ERRUK Il~33,IBLK,ISlK,IBlK)

GC TO 294·) 153u IFIICURR.G~.' .AND.ICCAR.l~.l) GO TO 1540

CALL EKRc;~ I 1544, IflU~. IBLK, IblKl GC TO 294'-

154J IF(lCPGAP.GE •.• JlND.ICPG~P.L[.3) GO TO 155C CALL ER~CR 11555,IBlK,IBlK,IDlKI GO TO 294: I

155, IF(K.GE.,.~\S_K.LE.l) GC TO 15~.

CALL ER~~R (1~66,I3lK,IBLK,IBlK)

Page 16: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

234 APPENDIX

GO TO 2940 1560 IFllCOMP.GE.O.AND.lCC~P.lE.16J GO TO 1512

CAll ERROR 11570.IBlK.IBlK.IBlKI GO TO 2940

1572 IF(lBOBO.GE.C.AND.l8C80.lE.ll GO TO 1575 CALL ERROR Il)74.1BLK,lBlK.IBlKJ GO TO 2940

1515 IFINTRIP.GT .OIREADIINPT.1455,END=29221C ITRIPlIlI ,ITRIP2111 ,L=I,101 ~IFIICORR.GT.JI REAC IINPT.2488.ENO=29221 IIIT~IPlll', ITRIP2Il'. l=11.221

IFIL8C80.NE.CI GO TO 1590 IFUHRIP.GT.(,) WRITE IICUT,15771 IITRIPlCll, ITRIP2111, l=I.l0)

15710FORMAT 14lH DE~IGNATED ARCS AND NODES FOR FUll PRINTIIIH , 20A411) IFIICORR.GT.OI WRITE IIOUT.IS881 IITRIPIIL). ITRIP2Il', l=11,221

IS~H~FORMAT 135H CuRRELATICN COMBINATIONS REQUESTEOIIIH , 1212A1,lX)II) C C REAu THE CCST-PERFOR~~NCE TI~E INTERVAL OATA C

C

i5% ClCP;;AP = ,~

IF(ICP~AP.EC.ll GO TC 1122 M = (l REIoIND IWF4 IF(l8080.Ea.~) WRITE IIOUT,15991

1599 FON"AT 136H CGST-PERFOR~A~CE TIME INTERVAL DATAII) 16~~ READ IINPT,24H8,ENC=2922) INOOETIl), l=l,BOI

IFILR080.~Q.ll WRITE IIOUT,1611) INOOETIl), L=I,8JI 1611 FORMAT IIH • 9lAl)

IF(~ODETI1'.Nc.IDXI9)) GO TO 1622 IFI~OD~T(2).NE.IDXIlC))GO TO 1622 IF('WDETl31.N':.IOXI11lIGO TO 1622 IFI'WD[T141.C •• IDXIl211GO TO 1644

I6n NCPGAP = NCPG;'P + 1 WRITE II~F4,?4881 1~(CETIl), l=1,801 DO 1633 J=IC,RO,10 I = J - J

16j3 CALL CHECK 1~,I,JI

GO TO 16(,"

C IFiO ~R~ORS, STORE T~E COST-PERFORMANCE TIME INTERVAL DATA C

1644 l = IRKOR IF(NCPGAP.GT.MCPGAPI CALL ERROR 11655.IBLK.IBLK. IBLKI IF(N.GT •• ) C.<LL ERRCR 1165b.IBLK,16l1<.IBLKI IF(l.4E.IRRO~) GO TO 1722 ~::w IND IwF4 DC 169q l=l,\CPGAP csr'IINIU = S":TUP CSMAXILI =-s~rup

CHI'I:HLI = secoup CHM~XIL) =-S[TUP PSMINIL) = seTUP PS~AXIl) =-S~iUP PHMI'HLl = squp PHMAXI 1I =-Sdl;P GAV~ILl = Co' PAIiEiLI = :).: KCOElSIU : " KPOJSILI : ReAD (H/F4, 16771 Ttl L1, T21 Ll ,(WORKI I) ,1=1.4) .CONFlIll.CONFSllI

i677 FORMAT (eFIC. 1 IF(T2Il).LT.~TIM[) ~ ~. 1 IrlTlILI.G::.PILlI ,. = M + 1

Page 17: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM

IFlwORKI1'.~C.0.0.ANC.WOR(121.EQ.0.CI GO TO 168R IFlwORKll).G~.WCRKI2)) ~ = M + 1 (HMINIL) = W8RKll) CHMAXIL) = WC~K(2)

1688 IFI~ORK(3).E~.(.C.A~C.WCRKI4).EQ.~.CI GO TO 1699 IFIWORKI31.~C.WORKI41' M = ~ + 1 PHMINIL) = WCRK(3) PHMAX(LI = ~[RK(4)

235

IF(CONFLIL).EC.0.(.A~C.CO~FSILI.EQ.D.CI GO TO 169~

IFICONFLll).L~.(.C.OR.CONFLILI.GT.1.l.OR.CONFSILI.LT.0.01M M + 1 1699 CC/,;TINUE

IFIM.GT.01 CALL ERRC~ 1171C,IBLK,IBLK,IBlK) IF(l8080.EQ.·;) WR rTE (lOUT .17111

1711 FORMAT (IH ) C C INITIALll~ FGR STORI~G TERMlhAl NODE HISTOGRAMS MINS AND MAXS C

c

1722 NTERM = l,

DO 1733 I=l,~TtRM KPOINTlII = C DC 1733 J=2.3,2 TERMI{,J-l)= SETUP

1733 TERMI ltJI = -SETUP IF(K.EQ.01 GC TO 1799

C CHECK AND LeAD THE CC~P(SITE TERMINAL NODE HISTOGRaM MINS ANn MAXS C

c

M = 0 REwIND IWF4 READ IINPT,2488,END=2922) INCOETILI, L=1,80) IF(L8D80.EQ.() WRITE (IOUT,17441 INOOETILI, l=I,8G I

17440FORMAT !54H ~INIMU~S ~ND MAXIMUMS FOR THE COMPOSITE TERMI~AL NODEI I11H , BOAl/)

DO 1755 J=IC,RQ,10 I = J - q

1755 CALL CHE~K 1~,I,J)

IFIM.EQ.JI GO TO 1171 CAll E~ROR (1766,IBLK,IBLK,IBLKl GO TO 1799

1777 WRITE IlwF4,Z488) INCCETll', L=I,801 REWIND IwF4 READ IIWF4,16771 ICOSTAIJI, J=l,fll DO 1788 J=2,9,2 I = J - 1 IFICOSTA(I).2~.0.u.ANC.C05TAIJI.EQ.o.rl GO TO 1788 TERMIl,!) COSTA(1l TERMll,JI COSTAIJI

1788 CONT INUE KPCl NTllI -1 NTEil.,.. " 1

C CHECK TYPE OF RUN REQUESTED C

1799 REWIND IwFl REwiND !WF2 I SA\lE () LASTA = If)XI71 LASTB = IDXI7I JSTAR = 0 IF(ISTAR.EQ.GI GO TO 1820 IFIISTAR.EQ.31 GO TC 18CO IF(IST~R.NE.41 GO TO 18G4

Page 18: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

236 APPENDIX

C

1800 JSTAR = ISTAR ISTAR = ISTA~ - 2

18'}4 IF(ISTAR.EQ.l.GR.ISTAR.CQ.21 GO TO 1888 CALL ERRCR 11811,IHll<,IflLK,IBLKI GO TO 294:'

C LOAD THE NEw PROBLEM G~ THE MASTE~ ANn INTERMEDIATE FIL~S

C

C

lSZC READ (INPT,18?2,END=2QZ21 (NeDETIII, 1=1,211 1822 FORMAT (3A4, AI, A3, 16A41

DC 1A2~ I=l,n IFUOOU( I I .I',c .IBlKI CO TO 1830

1825 CONT HWE GC TO 13ZC

1830 IF(~ODET(1'.EC.lASTA.ANC.NODETI21.EQ.LASTB' GO TO 1844 IF(L8C80.EU.;:I wRITE IIOUT.lll11 lASTA = ~ODor(11 LASTS = NCO(f(n

1844 IF(L8oAO.cQ.CI wRITE IICUT,l8551 I'lCnETlII, 1=1,211 1855 FORMAT (IH , 3A4, Ai, A3, 16A41

~RITE (I~Fl,le221 ("(CETIll, 1=1,211 WRITE IlwF2,18221 INCOETIII, 1=1,211 IFINOO~TI1'.~~.IDX(ll1 IS~VE = 1 IFPJQfJ::Tlll.NC.IDXI211 GO TO 182" IF(ISAVE.EQ.11 GO TC 2011

1866 CALL ERRJR 11877,[BLK,IBLK,IBlKI GC TO 2'H~

C STORE CHA~GES IN INTERNAL PRCGRAM STORAGE AREAS PRIOR TO LOADING C THE I;H!,RMi'f)IATE FILE ~NO PERHAPS CREATING A NEW MASTER FILE C

1838 ICGUNT = ': 1899 ICOUNT = lCOU~T + 1

IFIICQUNT.LE.MARC.ANC.ICOUNT.lE.MNODEI GO TO 1911 CALL ERQCR 117,;v,IeLK.ISLK,IllLKl GO TO 294')

1911GREAD IINPT,13Z2,END=2Q221 NODEIIICOUNTI, NODEOIICOUNTI, lICRITAIICCUNTI, ISTATEIICOUNTI, IPOINTlICOUNT1, JPOINTlICOUNTI, 2UTIMEAIICOUNTI, TI~EAIICOUNTI, UCOSTAIICOUNTI, COSTAIICOUNTI, 3UPEKFAIICOUNTI, PERFAIICOU~TI, KEEPCI(COUNTI, KEEPPIICOUNTI, 4LOGIIICCU\lTI, lOGOIICCUr-;Tl, ISTATlICOUNTl, ICRITNIICOUNTl, 5NARCIIICUUNTI, NARCOIICOUNTI, NPOINTI(COUNTI

IFtrJODEII ICOUNTI.N!;. IBlKI GO TO 1920 IFINODEOIICDUNTI.NE.IBlKI GO TO 1920 IFIICRITAIICCUNTI.NE.IBlKI GC TO 192~ IFIISTATE( [COUNTI.NE.IBlKI GC TO 1920 IFIIPOINTI(CCUNTI.NE.IBLKI GO TO 1920 IFIJPOIN1IICCUNTI.~E.IBlKI GC TO 1920 IFIUTIMEAIICQUNTI.N=.IBlKI GO TC 1920 IF(TIMEAIICOUNTI.NE.IBLKI GO TO 1920 IFIUCOSTAIICCUNTI.~E.IBlKI GO TO 1Q2C IFICOSTAIICOUNTI.NE.IBLKI GO TO 1920 IFIUPERFAIICCUNTI.NE.IBlKI GO TO 192C IFIPERFA(ICOUNTI.NE.IPLI<I GO TO 1920 IF(KEEPCIICOU~TI.NE.IBLKI GO TO 1920 IFIKEEPPIICOUNTI.NE.IBLKI GO TO 1920 IFILOGI(ICOUhTI.NE.lelKI GO TO 1920 IF(LOGOIICOUNTI.NE.IBlKI GO TO 1920 IFIISTAT( ICOU~TI.NE.IBLKI GO TO 192C IFIICRITNI(CClJNTI.NE.IBlKI GO TO 1920 IFINARCIIICOUNTI.NE.IBLKI GO TO 1920 IFINARCOIICOUNTI.NE.IBLKI GO TO 1920

Page 19: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM 237

IFINPOINT{ICCUNT).NE.IBLK) GO TO 192C GC TO 1911

192C IF{NODEIIICOU~T).EQ.lASTA.'NO.~OOEOIICOUNT).EQ.lASTB) GO TO 1122 IFIL8080.EQ.J) WRITE IIOUT,1711) LASTA = NCDEIIICOU~T) LASTB = NODECIICOU~T)

1922C,IFlL8080.cl.l. _) WRITE IIOUT.1855) "lOOEII ICCUNTl , NODU)(ICDUNT), lICRITAIICOUNTI, ISTATEIICOUNTI, IPCPH{ICOUtHI, JP81:1ITIIC)UNT), "UTIMEAIICOU'ITl, TII'EAIICOUNT), UCGSTAIICOUNT), COSTAIICQU'lT), 3UPERF,\IICOUNTl, PERF AI ICOUNTl, KEEPCIICOUNT), KEt'I'PIICDUNTl, 4LOGIIICOU'lTl. LOGOIICOU'H), ISTATlICOUNTl. ICRIn(l(rlUN1), 5NARCI{ICO~NT), NARCCIICCUNT), NPOINTIICOUNT) IFI"OOEI(ICOUNTJ.~Q.IDXI211 GO TC 1933 IF('WDEI(ICCU'H).NE.ICXlll) GO TO 189'1 JCOUNT = I CCU'H ISAVE = 1 GO TO 1899

1933 IFIISAVE.EQ.0) GO TC 1866 C C LOAD CHANGES AND UNCHANGED ARCSIFIRST PASS) AND NOnESISECOND PASS) C

C

REwiND It.Fl REWI NO I wF;> ISAVE = 1

1944 NCOESM = lOX 171 MAXTAG = lDXIl)

1955 RE AD I I W F 1 ,18 Z2) ("IO CET I II, I" 1 , 211 IFINODETIII.EC.NODES~.AND.NOCET(2).EQ.MAXTAG) GO TO 1155 IF(NOOETlll.fl;.IOX(ll.[R.NOOETIl).EQ.IOXIZ)) GO TD 1999 M " 1 00 1977 I=IS~V[,JCOU~T

IFINODET(1).NL.NOOEICI).OR.NCDETIZ).NE.NOOEOII)) GO TO 1117 NODfSM = ~OD~Tll) MAXTAG = ~OOET(2) M '" Z IF(ICRITAIl).EQ.IOX{3)1 GO TC 1966

uWRITE IIWF2,1822) "IOCEIIIl. r.ODEOII), ICRITAIII, ISTATEIIl. lIPOINTl{), JPCINTlIl. UTIIIEAllI, TIME:AIIl, UeOSTAII), COSTAII), ZUPERFAII), PERFAlIl, KEEPCII), KEEPPIII, LOGlII), LOGOII), 3ISTATII', lC:<ITNI!), NARCIIJ), NAROCIII. ,'lPCINTlII

1966 NCDEIII) = ICX(7) 1977 CCNT I NUE

GO TO 11918,1955),~

1988 WRITE I IWF2, 1~22) INC'JETIII, 1=1.21) GO TO 1955

C LOAD ADO ON AkCSIFIRST PASS) AND NOOESISECONO PASS' C

C

1999 DC 200u 1=ISAVE,JCCU~T

IFINODEIII).2Q.IDXI11) GO TO 2000 OWRITE IIWF2,IB22) NOCEIII). NOOEOII), leRITAI!), ISTATEII), lIPOINTII), JPOINTlIl, UTIMEA(l), TIMEAIIl, UCOSTAII), COSTAII), 2UPERFAII), PERFAII). KEEPCII), KEEPPIIl, LOGIII), LOGOII), 3ISTATII), {CRITNIIl, NARCIIIl. IIIARCOII), NPOINTlI)

2000 CO"TINUE IFIICOUNT.EQ.JCGUIIIT) GO TO 2eI1 ISAVE = JCOUNT + 1 JCCUNT " I COUNT GC TO 1944

C LIST THE INTERMEDIATE FILE. LOAD THE TRA"ISPORT FILE NO.1. LOAD C ARC A~O NCDE NA~ES A~D CREATE A NEw MASTER FILE IF REQUESTED

Page 20: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

238 APPENDIX

C IWFl IWF2 I WF3

2011 REW IND REWIND REWIND MAXTAG NODESH NARC = 0 NNODE= 0 ISAVE = 1

IDX(71 IOlI(7)

IFIJSTAR.EQ.0) GO TO 2022 LASTA = IOX(7) LASTB = IOX(7) IFILBOSO.EQ.C) WRITE IIOUT,2C201

2020 FORMAT 137HILISTING CF THE RECONSTITUTED PROBLEM) 20n ICOUNT = 0 2033 ICOUNT = ICOUNT + 1

IFIICOUNT.LE.MARC.ANC.ICOUNT.LE.MNODE) GO TO 2055 CALL ERROR 12G44,IBLK,IBLK,IBLK) GO TO 2940

20550REAO IIWF2,1822) "IeCEII ICOLINT), "IOOEDIICOUNT), IC~I TAl ICOUNTI, lISTATEIICCUNTI, IPCUTlICOUNTI, JPOINTlICOUNT), UTPolEAIICOUNTI, 2TIHEAIICOUNT), UCOSTAIICOUNT), COSTAIICOUNTI, UPERFAIICOUNT), 3PERFAIICOUNTI, KEEPCIICOU~TI, KEEPPIICOUNT), LOGIIICOUNTI, 4LCGOIICCUNTI, ISTATI ICOUNTI, ICRITNIICOUNT), NARCIIICOUNTI, 5NARCOIICOUNT), NPCINTIICOUNT)

IFIJSTAR.EQ.O) GO TO 2064 IFINOOEI lICOUNT).EQ.LASTA.ANO.NODEOIICOUNTI.EQ.LASTB) GO TO 2C60 IFlL8080.EQ.CI WRITE IICUT,1111) LASTA = NOOEIIICOUNT) LASTB = NOOEClICOUNT)

lOb00IFll8080.EQ.() WRITE IIOUT,1855) NOOEIIICOUNTI, NGDEOlICOUNT), llCtUTAIICOUNT), ISTATEI ICOUNTI, IPOI"ITlICOUNTl, JPOINTl ICOUNTI, 2UTIMEAIICOUNT), TIMEAIICOUNT), UCOSTAIICOUNT), COSTAIICOUNTI, 3UPERFAIiCCUNTl, PERFAIICOlJNTI, KEEPCIICOUNTl, KEEPPIICOUNTI, 4l0GIC [COUNTI, LOGOI ICCUNTI, ISTAT( [COU"ITI, [CRITNIICOUNTI, 5NARCIIICQUNTI, NARCOIICOU~TI, NPO[NTIICOUNTI

2064 IFIISTAR.NE.2) GO TC 2066 (JWRITE· I IWF1, lC221NOOfi I ICOUNTI, NODEOI [COUNTI, IC;.lITAI ICOUNT I, lISTATEIICOUNTI. IPO[NTI ICOUNTI, JPOINTl [COUNTI. UTIMEAIICOUNTI. 2TlMEAl ICOIJNTI. UCCSTA( ICOUNT I, COSTAl ICOUNTI, UPE~FAI ICOUNTl, 3PERFAIICUUNT). KEEPC([CCUNTI, KEEPPIICOUNT), LeGIIICOUNT). 4LOGOIICOU"lTl. ISTAT( ICOUNTI, TCR [HH ICOUNTI, NAR.CI (lCOU'HI.

2066 C

5NARCOIICOU"ITI, NPO[~T([COUNTI

IFlICOUNT.EQ.l1 GO TC 2433

C C

C

SAME FAMilY Y~T? [F NOT TAKE AN INVENTORY OF SATELLITE CARDS

IFlNOOEIl[COUNT).NE.MAXTAGI GO TO 2011 IFINODcCIICCUNTI.E'.~COESMI GO TO 2033

2077 K = ICOUNT - 1 IFIISAvE.EC.21 GO TO 2266

C COU~T THE NU~BlR OF TH~ V~RJCUS TYPES OF SATELLJT~S THIS ARC HAS C

00 2088 1=1.17 2088 NCIJEl( I) = .::

IFlK.EQ.l) GO TO ?133 00 2122 J=2.K DO 209'1 1 = 1.17 l = I IFIIO.\IL).,"E.JCRITAIJ)I GO Te 2C'N IFlICBILI.EQ.ISTATEIJII GO TO 2111

Page 21: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM 239

C

IFII.LE.lll GO TO 20~q

IFIIOXIIII.EQ.ISTATEIJII GO TO 2111 IFIIOXIl31.EC.ISTATEIJII GO TO 2111 IFIlOX1l41.EC.ISTATEIJII GO TO 2111

2099 CONTINUE CALL ERROR (2l00.NODEII ll,NOOEOlll,1BLKI GO TO 1122

2111 NODETIL) = NGOETILI + 1 2122 CONT l1<UE

C ENTER THE ARC NAM~ I~ THE ARC NAME ARRAYS C

C

2133 IFINAKC.CU.01 GO TC 2166 DC 2155 l=l,NARC IFIIARCIII).~~.NOO~I(I'.0R.IARC211).Nf.NODEOII» GO TO 2155 CALL ERROR I 2144,/IIOOEII ll,NODEOI 11 ,IBLK)

2155 CaNT INUE 2166 NARC = ~APC + 1

IFINARC.LE.~ARC) GC TC 2IAR CALL ERROR 12177,IBLK,IBLKtlBLKI GC [a 294,:'

2188 IARCIINARCI N(DEllll IARC21NARCI = NOOEOIll

C LCAOI~G S~C caTA C~ ThE TRANSPORT FILE C

CWRITE IlwF3,2199) IC~ITAIII. ISTATEIll, IPOINTlI), JPCIN;lll, IlJTIMEAlll, IIM'AIll. UCCSTAllI, IIIIOOETII)' 1=1.171

2119 FORMAT IA4. ~l. A3, 4A4, 11141 IFIK.cU.l) GC TO 2255 DC 2244 1=1,17 L = 0 DO 2233 J=Z,K IFIIDAIII.,E.ICRITAIJII GO TO 2233 1 F I I DB I I ) • E (;. 1 S TAT E( J I 1 GO T C 2200 IFII.LE.lll cil~ TO 2223 L = 1 IFIIDXIll).E,:.ISTATEIJII GO TO 22e:, L = 2 IFIIDXI131.~ll.ISTATEIJll ;0 TO 22uC' L = 3 IFIID)«(l41.\~.ISTt.TEIJII GO TO 2233

22~~~WRITE IIWF~,?2111IPCI~TIJ),JPCINTIJ),UTI~EAIJI,TIMEA(J),UCOSTAIJI,

1 COS T A I J I ,UP E ,~r A I J I ,P .oR FA (J ) ,KEEPC I J I ,KE EPP ( J) , LOGI I J I , LOGO I J I , 2IST.H(J), IC;1ITNIJI, "ARCI(JI, IIIARCOIJI, NPOIIIJTlJI, L

22.1 FORMAT IA3, 16A4, III IFIL.EU.~1 GO TO 2233 IFII.LT.IZIGC TC 2222 IF([.l;T.141~;C TO 2222 IF IL ."{,J.lI n ISC = .FALSE. IFIL.C~.21 I',Fe = .FALSE. IF(L.~E.31 GC TC 2222 OISC = .F4LV. I~FC = .FALSL.

2222 IFII.LT.l~)GC TC 2233 IFIL.cll.lI DISP = .FALSe. IFIL.EQ.21 I,FP = .FALSe. IFIL.NE.31 GC IC 2233 DISP = .F~LS". I,~ F P = • r \ L " ' •

2233 CC~ T I ;~UE 2244 CC"TnUE

Page 22: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

240 APPENDIX

C

2255 IFINOOEIIICOUNTI.NE.IDXI11 I GO TO 2422 ISAVE = 2 GO TO 2022

C COUNT THE NUMBER OF THE V~RIOUS TYPES OF SATELLITES THIS NODE HAS C

C

2266 DO 2211 1=1.3 2271 NOO~TIll = a

IFIK.Ew.ll GO TO 2322 DO 2311 J=2.K DO nSB 1=1.3 L = I IFIIDXIl+31.EC.ICRIT.6IJII GO TO 23(10

2288 CCNT I'~UE CALL ERROR 12Lqq.NOOEII11.NOOEOI1'.1BlKI GC TO 2311

23~y NCDETILI NCDETILI. 1 2311 CONTINUE

C E~T~R TH~ NOCE NAME IN THE NODE NAME ARRAYS C

C

2322 IFI~NODE.~Q.~I GO TC 2355 DO 2344 1=1.NNODE IFI·WDElIII.~t.NOCEIIlI.OR.'IICnE2111.NE.NODEOI111 :;0 TO 2344 CALL E~RO~ 12333.NCDE1111,NOOEOI1'.18LK'

2344 COillT !NUE 2355 ~~ODE = ~NOC~ • 1

IFINNODE.LE.~NODEI GC TO 2317 CALL EKROR 1?366"8L~,[BLK,(3LKI

DC TO 2Q4'! 2377 NCDU(,\NCr:E'1 = NOflEl1l I

NODE21NNODEI = NoaECIl'

C LeADING NODE CATA ON THE TRANSPORT FILE C

(WRITE (IwF3,nQQ' ICRITAIll, ISTITEIlI. IPOINTl1', JPOINTllI, lUTIMEAllI, Tlf'EA(1), UCOSTAlll, INDDETlI', 1=1.3) IFIK.E~.l) GC TO 2411 00 24')': J = 1,3 CJ 2399 J=2,K IFIID~II.3).r-,~.IC~ITAIJ» GO TO 23Q')

vWRITE IlwF3,2338) ISTATEIJI, IPOINTIJ). JPOINTIJ), UTIMEAIJI. lTli~':A(J), UC'J:TAIJ), COSTAIJ), UPERFAIJ), PERFAIJ), KEEPCIJI, 2KEE?P(J), LOGIIJ), lCGOIJI, ISTAfIJI, lCRITNIJ), NARCIIJ), 3'~ARCOl.ll, 'JPCI!JTIJI

2388 FOR~1AT (41, AI, 16A4' 2399 CCNTINUE Z4~L COdHUL 24il IFI'W[1[IIICCt;',T).fQ.Ir::XIZ" GO TC 2444

C C PUT LAST qECC~D READ ('J INTERNAL STO~AG~ POSITIO'J NO. 1 C 24~2 ,.oLltlll)

NOeeO(1) ICRIT~1l1

1ST" Tt: ( 1) IPOI'HIl) JPCLHIl ) UTlM~A(l)

TI;~~AI 11 UCOSTA(l ) CCSTA(l)

1\8f.i£ I ((C(U;~T) "'elDEO I I C (U.'lT I !-:RITA( ICCUNTl LTATCIIC(UNT) JPGI"lTI (CCU'JTl Ji'OINTI (CCUNT) LT I MEA I I COUNT) TIMfAIICC\.:NTl UCGSTA (( COUNT I C'JSTA I IC(UNTI

Page 23: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM 241

C C C c

UPERFA(1) PERFAnl KEEPCI U KEEPPIII LOGH1) LCGOn I ISTATllI ICRITNll1

UPERFA(ICOUNTI PERFA( ICCUNT) KEEPC (ICCUNT) KEEPPIICCt;NT) LOG I ( I COUNT 1 U1GO( ICOlJf\T) ISTATlICCt;NTI ICRIlNIICCUNT)

NARCIII) NARCIIICCUNT) NARCOIII NARCUliCOUNTI NPCINTll1 ~POINT(ICCUNT)

ICOUNT = 1 2433 MAXTAG = NODEIII)

NOoESM = NOOEOIl) GO TO 2033

LOAD DATA ON TRANSPORT FILE NO.2, FIRST TASK IS TO CHECK FOR ALPHA IN THE NU~ERIC FIElCS FOR ARC CARDS AND LOAD CONSTANT OR PREVIOUS TRANSFCRMATION DATA FOR FUNCTICNAL RELATIONSHIPS

C 2444 REWIND IWF3

REwIND I"F4 ISAVE = ()

C

2455 ISAVE = ISAVE + 1 IFIISAvE.Gr.~ARCI GO TO 2~33 M = 0

(JREAD (IWF3,Z46~I IICRITNII), 1=1,41, (NODETI II , 1=1,8), 1(ISTATEIII, 1=1,111

2466 FORMAT (4A4, 8Al, 1114) vWRITE IIWF4,2411) IICR I HI( II, 1=1,41, (NODETlII, 1=1,51, 111ST4Ttlll, 1=1.11)

~411 FORMAT (444, 5Al, 11141 CALL CHECK I~, 1,4) 00 2611 1=1,17 IFIISTATEIII.LE.O) GC TO 2611 NODESM = ISTATEIII 00 2600 J=I,NODESM READ (lWn,2488) INOCETIKI, K=I,~81

2488 FORMAT (111A1) CALL CHECK (M,I,2)

OGO TO 12533,2~55,2555,2555,2~33,2533,2599,2533,2533,2555,24g9, 12533,2555,24Qg,2533,2555,2499),1

C CHECK FUNCTIONAL RELATIO~SHIP DATA AND BOOT STRAP NUMERIC DATA C

2499 CALL CHECK (~, 3, 4) CALL CHECK IM,33,34) JCOUNT = () DC 2500 K=1,48

250C JPOINTIKI = IBlK 00 2522 K=6,51,Q JCOUNT = JCOUNT + 8 ICOUNT = JCOUNT - 1 L = K IFIL.GT.321 L = l • 3 IF(NODETILI.H.IBlK."~O.NOoETlLl.NE.IOXlR) 1 GO TO ,2522 LOW = L + 1 !UP = L + 8 CALL CHECK (~,LOW,IUPI

DO 2511 N=ICCUNT,JCOt;~T

Page 24: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

242 APPENDIX

C

L = L + 1 2511 JPCINTINI = NOCETILI 2522 CONTINUE

vWRITE IIWF4,Z4881 INODETIKI, K=1,321. IJPOINTIK). K=1.241, lINODETIKI, K=33.621, IJPOINTlKI, K=25.48.), NODETI681

GO TO <:6C'~

C CHECK MO~TE CARLO, FILTER 1-2, DIST., HIST. AND SLACK DATA. C RECORD Tf<E POSITIU OF THE LAST DATA ELEMENT p.j THE CARD. C

C C C

C

2533 IFI~OO£SM.GT.11 CALL ERRO~ 12544,IARC1IISAVE),IARC2IISAVEI,IBLK) 2555 CALL CHECK 1M, 3,12)

25&6

2517 2538

2599 26,,0 2&11

2633 21>44

2655

2666

CALL CrlECK 1~,13,22) CAll CHECK 1101,23,321 CALL CHECK IM.33,421 CAll CHECK 1~,43,521

CALL CHECK 1~,53,621

DO 2566 K=3,6£ L = 62 + 3 - K N = l - 2 IFI~OD[Tll).Nr.I8LKI GO TJ 2577 CCNTINUE N = 0 WRiTE IIWF4,Z'>881 INCDETlKI, K=1.621, NOOETI681, \j

FORMAT 163Al, 15) GC TO 26GL' WRITE IIWF4,24881 INCDETIK). K=1,681 C:J'lTIN'JE ceNT INUE IFIM.GT.~I CALL ERRCP 12622, IARClIISAVEI. IARC21 ISAVEI,MI GO TO ;~455

CHECK FOR ALPHA IN T~E NU~ERIC FIELDS OF THE NonE CARDS

ISAVE = (, ISAVE = ISAV[ + 1 IFIISAVE.GT.NNODEI GC TO 2711

101 = 0 READ IIWF3,26551 INOCETIII, 1=1,241. IICRITNILI, L=1,31 FORMAT 124Al, 3141 wRITE IIWF4.26661 I"'CCETlII, 1=1,211. II{;RITNILI, L=lt31 FORMAT IZIAI. 3141 CALL CHECK 1M. 1, 11 CALL CHECK I~. 2, 41 CALL CHECK 1M,S, 61 CAll CHECK 1M, 7, 8 I CALL CHECK 1M, 9.1ZI CALL CHECK (M,13,161 CALL CHECK IM,17,ZOI

C CHECK THE SATELLITES C

DO 2699 1=1,3 L = ICRITNIII IFll.EC.CI GC TO 2699 IFIL.GT.ll CALL ERROR 12677.NODEIIISAVEI.NODEZIISAVEI,IBLKI DC 2688 K=l.L READ IIWF3,Z48BJ Ir-;CI:ETIJI, J=1,641

2688 WRITE (IWF4,248BI INCDETIJI. J=1,641 IFII.EQ.ZI GC TO 2699 CALL CHECK (~, 1. 81 CALL CHECK I~. 9,161

Page 25: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM 243

CAll CHECK IM,17,241 CAll CHECK IM,25,321 CAll CHECK 1~,33,401 CAll CHECK IM,41,481 CAll CHECK IM,49,561 CAll CHECK IM,57,641

2699 CONTINUE

C C C

2711

2722

2733

2744

2755

2766

2777

2788 C C C

IFIM.GT.OI CAll ERROR 12730,NOOElIIS~YEI,NOOE21ISAYEI,IBlKI GO TO l644

INITIALIZE THE CORE STORA~E ARRAYS

REwIND IWF4 NHIST = a DC 2722 I=I,MHIST 10BSII 1 = 0 00 2722 J=1,4 XMIN(/ ,J 1 = SI::TUP HMINII,JI = SETUP HAVEII,JI = G.l XMAXII,JI =-$FTUP HMAXII,JI =-SETUP SLAK = .TRU[. IFICTIME.EQ.1.O.ANO.ITRACE.EQ.31 SlAK NSLACK = 0 DO 2733 1=1,"SLACK JOBSIII 0 RHINII) = SETUP SHINII) = SETUP SAVEl I I = 0.(, RHAXII I =-SETUP SMAX I I) =-SETUP DC 2744 I =l,MNODE NSLAKI [I = (1

NARC[I II = (J NARCOI[) = 0 NPOINTIII=G KNODE = 0 00 2755 1=I,MTAG NSTOREIl) = ::' DC 2766 l=l,~ARC

ISLAKII) = 'j

1 PO I NT I I I = ;) KARC = 0 DO 2777 1=I,LARC ASTOREI I I = C.O 00 2788 l=l,MlTER NCDETI!) = ~

DO 2783 J=I,4 STORETII,JI = 0.0

.FAlSE.

CHECK THE DfSIGNATED ARCS AND NODES FOR BEING VALID AND DECODE

IFIITRACE.EC.3.AND.NTRIP.GT.(;) CALL ERROR 12799,IBLK,IBLK,NWARN) IFINTRIP.EQ.() GO TC 2855 NTRJP = C 00 2844 [=1, ll' [FIITRIPlll'.NE.IDLKI GC TO 2808 IFIITRIP2(1).NE.IBLK) GC TO 2Aoe ITRIPlII) = ::, GC TO ':844

28vO IF( !'GT.~TRIPI NTRIP = I

Page 26: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

244

DO 2811 J=1,NARC IfIITRIP1111.NE.IARCIIJII GO TO 2811 IfIiTRiP2111.NE.IARC2IJIl GO TO 2811 ITRIPlIll = 1 ITRIP2 I II = J GO TO 2844

2811 CONTINUE DO 2822 J=l,NNODE IfIITRIPlll'.NE.NOCElCJI) GO TO 2822 IfCITRIP2111.NE.NODE2IJII GO TO 2822 ITR IPlIn = 2 !TR I P2 I II = J GO TO 2844

2822 CONTINUE CALL ERROR 12833.ITRIPlll'.ITRIP2ITI.I8LK)

2844 CONTINUE C C CHECK THE CORRELATION COMBINATIONS REQUESTED C

C

2855 IfIICORR.EQ.CI RETURN ICORR = 10

2866

2877

2888

290C

2911

2922

DO 2911 1=11.22 IfIITRIPlll'.EQ.IBLK.AND.ITRIP2III.EQ.18LKI GO TO 2911 M = 0 N = 0 DC 2877 J=1.4 IfIITRIPlll'.NE.NUM8IJII GD TO 2866 M = J IFIITRIP2(II.NE.NUM8IJII GO TO 2877 N = J CONTINUE IFIM.E~.OI GO TO 2888 IFIN.E~.OI GC TO 2888 IfIM.NE.NI GC TO 2900 CALL E~ROR 12899,IBLK.IBLK,IBlK) RETURN ICORR = ICORR + 1 ITRiPIIICORRI H ITRIP211CORRI N CCNTINUE RETURN CALL ERROR (2933,I8LK,IBLK.I8LKI GC TO 2944

APPENDIX

C A STOP PROCESSING ERRCR HAS OCCURRED, DUMP THE REST OF THE PROBLEM C 294()

2944

READ IINPT,1822.E'IIC=29221 INODElll', 1=1.211 IFINODETIl'.EQ.IDX(211 RETURN GO TO 2940 . CALL EX IT END SU8ROUTINE CHECK 1~,lCW,IUPI

IMPLICIT INTEGER*411-NI ('COHMONIT RIAL 51 S TORET« lCO:·,4 It TERMI 1(,81. KPO INTI H'I • NODE TI 1 Dec I, IMT(RM,NTERM,~ITER,ITER

DIMENSION ISYMI141 INTEGER*2LOW,IUP DATA ISY~/IHO,lHl,I~2.1H3,lH4,lH5,lH6,lH7,lH8.1H9,lH+,lH-,1H.,lH I ,

C THIS SUBROUTINE CHECKS NUMERIC FIELD fOR ALPHA INFORMATION C

KEY = 0

Page 27: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM 245

C

IT Al = 0 DO 2999 l=lOW,IUP IF(NOOF.T(I).NE.ISY~114)) GO TO 2955 IF(KEY.EQ.I) KEY = 2 GO TO 299<)

2955 IF(KEY.EQ.2) GO TO 2988 IF(KEY.EQ.l1 GO TO 2966 KEY : 1 IFINOOETII).EQ.ISY~(II'.OR.NCOETI(I.EQ.(SYM(12)) GO TO 2999

2966 DO 2977 J=1,10 IFINODETIII.EQ.ISYMIJII GO TO 2999

2977 CONTINUE IFINODETI(I.NE.ISY~1131)GO Te 298B !TAL'" ITAL + I GO TO 299<)

2988 M = M + I 2999 CONTINUE

IFIITAl.GT.I) M M + 1 RETURN END SUBROUTINE LOADT IMPLICIT INTEGER*4II-N)

GCOMMON/TA8LE/TABI13,3,31.TAB2(3,3,)I,TA83(3,3,3).TAB413,3.31, IT~B513,3,31.TAB613,3,31,TAB713,3,31,LXCKI71,MXCKI71.lYCKI1',

2MYCKI71,LlCKI71,MlCKI71

C fHIS SUBROUTINE IS FeR THE USER TO CODE INSTRUCTIONS FOR lOADING C DATA IN THf ARRAYS TABI - TAB7 FOR TABLE lCCK-UP (SEE OOARC). C THE UPPER BOUNOS OF THE ARRAYS TABI - TAB7 SHOULD BE LOADED IN C THE CHECK ARRAYS ~XCK, MYCK AND MlCK. THE lowER BOUNDS OF THE C ARR4YS TAdl - TABl SHOULD BE LOADED IN THE CHECK ARRAYS LXCK, C LYCK AND LlCK. C

00 300'_' LXCK I I) LYCKIII LiCK I I) MXCK« II MYCKI [I

1=1,7 1 1 1 3 3

:WVO MICK(I) "3 DO 30e? I=ld 00 300', J= 1,3 CO 30e·5 K:l,"3 TABlIl,J,KI TAB2( [,J,K I TAB3« I ,J,KI TAB41 [.J,KI TAB5( I,J,KI TABldI,J,KI

30L,5 TAIHII,J,KI RETURN END

+ J + K + 1 +J+K+2 +J+K+3 +J+K+4 +J+K+5 +J+K+6 + J + K + 1

SUBROUTINE LO~OA

IMPLICIT INTEGER*4IJ-N) 0CO~MC'1 EMARK« 111. SET\,P. F I'H, OINT, FACTOR ,$ TIME, SCOS T. SPERF. criME, ICCOST ,CPERF ,BTIME,BCCST ,BPF.RF,TlMESM,UNFORM, ITRJ PI 1221, ITRIP2 (221, 2KNT (6), I NPT, lOUT, IPNh IWFl, hF2, tWF3, IWF4, IBLK, TT'l.ACE, J CUT, I SEED, 3JRRUR,ISAVE,~ODES~,~~XTAG, ICOUNT,JCOUNT,NTRIP,ICO~R,LCOMP,NWARN,

4NRK,NRKS,SLAK,MOOE.I~FC,J~FP,DISC,OISP,CRIT,KGEN,MED,SINGLE,OQUBLE

0COMMONfTRIALSfSTORET( IGtir>,41.TERMI 1(',81.KPOINTI1[') ,NODETI 100GI, lMTERf",HERM,I"1 fER, ITER UCOMMON/ARCSfASTORE« 28CCI,UTI"EA( 350),TIMEAI 3501,UCOSTAC 3501,

Page 28: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

246 APPENDIX

C

lCOSTAC 350l,UPERFAC 350ltPERFAC 350l,WORKC 35CI,ISTATEC 3501, 2NOOEI( 350I,NODEO( 350I,ICRITA( 350I,KEEPC( 350I,KEEPP( 3501, 31ARClC 350l,IARC21 350l,IPOINTI 3501.JPOINTC 350l,ISLAKC 3501, 4KARC,LARC,MARC,NARC, ITALC, ITALP,ISTAR OCOMMON/NODES/TIMENI 200l,COSTNI 200l,PERFNI 20CI,NSTOREC 54001, INODElC 200l,NODE21 2COI,LDGIC 200l,LOGOI 200l,NSTATEC 2001, 2NARCIC 200l,NARCOC 2COl,ISTATI 200',INSTAT( 200l,ICRITNI 2001, 3NPOINTI 200l,NSLAKI 200l,JUMPI ~OOI,KNODE,LNOOE,MNODE,NNODE,MTAG, 4NTAG OCOMMON/INTERN/XMINC2C,4I,XM~XC20,4I,HMINC20,4I,HMAXC20,41,

IHAVEC2U,41,ICBSC20l,MHIST,NHIST OCOMMON/SLACK/RMINC20I,RMAXC201.SMINC2~I.SMAXC20I,SAVEC20l,

IJOBSC20l,MSLACK,NSLACK DIMENSION TYPEC51, NFC41 LOGICAL SLAK.MODE,INFC,INFP,DISC,OISP,CRIT,KGEN,MED,SINGLE,DOUBLE

ODATA TYPE.OMIT,SUM,B~CKUP,IPCS,NEG.NF/IHT,lHC,IHP,IHK,lH ,1HO,lHS, 1IHB,lH+,lH-,4HNOFL,4~OW .4HDATA,4HGEN I

C THIS SUBROUTINE LOADS THE BALANCE OF THE ARC AND NODE DATA INTO C THE STORAGE ARRAYS - FIRST TASK IS LOADING ARC DATA C

C

ISAVE = C 3011 ISAVE = ISAVE + 1

IFCISAVE.GT.NARCI RETURN IE = IARCICISAVEI JE = IARC2CISAVEI

DREAD I IWF4,3C22 I INOCETIIl, 1=1,41, UNFORM, M, IISTATECJI, J=l,SI, IINSTATEIKI, K=l,91

3022 FORMAT 14A4, F4.4, AI, 11141 NOCEIIISAVEI = 0 NODEOCISAVEI = U

OIFCNODETC11.EQ.NFCl'.ANO.NOOETI21.EQ.NFC21.AND.NOOETI31.EQ.NFI31. lAND.NODETC4'.~Q.NFC411 GO TO 3088

C STORE THE ADCKESSES CF THE INPUT AND OUTPUT NODES AND CHECK TO SEE C IF THIS A~C IS FUNCTIONING AS A TRANSPORTATION ARC C

C C C C C

DO 3033 1=I,NNODE IFINODETlI'.NE.NODE1111.0R.NCOETI21.NE.NODE2(1)) GO TO 3033 NODEI( ISAVEI = I GC TO 3055

3033 CONTINUE CALL ERROR C3.44,IE,JE,IBLKI

3055 DO 3066 I=I,N~ODE IFCNOD::T (3' .~~.NODElCII.OR.NCDETI41 .NE.NOOE2(111 ,,0 TO 31;66 NODEOIISAVEI = I GO TO 3099

3066 CONTINUE CALL ERRCR C3·:71,IE,JE,IBLKI

3088 UNFORM = 1.0

3099

3100

M : IBLK

CHECK TO SEE IF THERE IS MORE THAN I MCNTE CARLO OR FILTER OUTPUT THEN COUNT THE NUMBER OF TIME, COST AND PERFORMANCE ENTRIES AND LOAD REQUeST FOR A SLACK HISTCGRAM IF WANTED

ICOUNT = 0 DO 3100 1=1,7 IF(lSTATEIII.GT.OI ICCUNT = ICOUNT + I IFC lCOUNT.GT.1I CAll ERRO~ C311l,IE,JE,IBlKI JCOUNT = 0 DC 3122 I=l,~

Page 29: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM

3122 IFINSTATEIII.GT.OI JCCUNT = JCOUNT • 1 IFIM.EW.IBLK.LJR.CTfME.NEal.'j) GO TO 3166 SLAK = .FALS€. NSLACK = NSl~CK + 1 IFINSlACK.lE.MSlACKI GO T~ 3155 IFIITRACE.EC.3) C~ll ERPOR 13133,IE,JE,NWARN) IFIITRACE.NE.~) CAll ERROR 13144,IE,Jf,IBLKl ~JSlACK = I

3155 ISlAKIISAVEI = NSlACK 3166 IF(UNFCR~.EC.l.O.A~D.ICOUNT.EQ.D.ANO.JCOUNT.EQ.C) GO TO 3011

C C THI~ AkC IS MORE THA~ A T~ANSPORTATJON ARC, LOAD THE POINTER,

247

C STORE PR08ABIliTY CF ARC COMPLETION AND FUN. REl. INDICATOq C

C

IPOINT( [SAVE I = K~RC + 1 KARC = KA~C + 2 IFIKARC.lE.LARCI GC TC 3199

3177 CALL ERROR 13168,[BlK,IBlK,IBlKI RETURN

3199 ASTORE(K~RC-ll = UNF(R~ ASTOREIKARCI = G.C

C READ I~ THE ~nNTE CARLOS JR FILTERS 1 AND 2 C

IFIICOUNT.EQ.JI GO TO 3355 00 3222 1=1. (, IFIISTATEIII.EQ.OI GC TC 3222 M = 1 IFII.Gc.2.0R.l.lE.41 !II = "lARC/6 IFI ISTATEI II.GT .Hl OlL ERROR 1320(1, IE,JE,MARC I IFII.GT.41 GC TO 3211 KARC = KARC + 1 IFIKARC.GT.lARCI GO TO 3177 ASTOREIKARCI = I

3211 CALL S~READ IISTATEIII,IE,JE,IADJ) IFINOO~SM.LE.C.AND.I.LE.41 KARC = KARC - 1 IFIKARC.GT.lARCI GC TO 3177

3222 CeNTI NUE C C READ IN FILT~K NO.3 C

If I I STAHt7I.[Q.O) GC TC 3344 MAXTAG = G NOOESM = ISTATEI71 IFCNOOESM.GT.MARCI CALL ERROR f3233,IE,JE,MARCI DO 3266 I=I,~ODESM

MAXTAG = MAXTAG + 6 IFIMAXTAG.lE.MARCI G( TO 3244 MAXTAG = 6

3244 M = MAXTAG - 5 READ IIWF4,3255) J,IJPOINfIKI,KEEPCIKI,KEEPPIKI,K=M,MAXTAG),IAOJ

3255 FORMAT 112, 6ClX,Al,2A41, 11 I 3266 IFIJ.Nt.11 CALL ERROR 13277,IE,JE,IBlKI

DO 3333 l=l,~AXTAG

IFIKEEPCIII.EQ.IBLK.A~D.KEEPPIII.EQ.18lKI GO TO 13B IFIJPOINTIII.£Q.IPCS.(R.JPOlhTIII.EQ.NEGI GC TO 3299 CALL ERROR 13268,IE,JE,IBLK) GO TO 3333

3299 DO 3300 J=I,NARC K = J IFIKEEPCIII.EQ.IARCIIKI.ANO.KEEPPllt.EQ.IARC2IK)) GO TO 3322

noo CONTINUE

Page 30: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

248

CAll ERROR 13311,KEEPClll,KEEPPIII,IBlKI GO TO 3333

3322 KARC • KARC + 1 IFIKAKC.GT.L~RCI GC TC 3177 IFIJPOI~TI 11.0Q.NEGI K • -K ASTOR~'KARCI = K

3333 CCHI"lUE C C E~T~R TH[ E~~ OF FIR~T SEG~EhT INOICATOR C

C

3344 KARC • KARC + 1 IF'KARC.GT.l~2CI GC TC 3117 ASTOREIKA~CI = EMARKIll

C IF PRESENT, ~~AD IN ~ SLACK ~ISTCGRAM MIN-MAX CAQn C

3355 IF'IST~TEI81.LE.OI GC TO 3388 IFI ISl:'KIISAV~I.EQ.()) CALL ERROR (3366tlE,JE,IBlK) IfIIST:'Tt::181.'.t.1I CALL ERROR 13377,IE,JE,IALi<I ICOUNT = -1'l9'l CALL StRtAD IISTATEIR),IE,JE,IADJ) SMI"lIN~LACK) = TIMEAll) SMAAINSlACK) = TIMEAI21

3388 IFIJCOUNT.fC. ) GO TO 4466 C

APPENDIX

C REAlJ IN TI M~, CCST A,..O PERFORMANCE G£NERATES FCR THIS ARC C

C

DC 4388 1=3.9,3 N = III LOSH\i) = (; LOGOINI = (, TII"ESM • L*N M = 1-2 J = I - 1 ISTATlM) = (. ISTATIJ) • r; ISTATI I) = (' IFINSTAT~IMI.GT.O.ANr.NSTATFIJI.GT.DI CALL ERQOR 13399,IE,JE,IBlK) Ml = MARCIl> 142 • M"lODE IFIMARC.lT.MNODEI M2 = MA~C IFINSTAHIJI.GT.Mll CAll ERRCR (341)0,IE,JE,I4ARCI IFINSTATEII).GT.M2) CAll ERRCR 13411,IE,JE,M2)

C THIS S~CTION ~ODIFIES AND STORES STA~DARD PROBABiliTY DISTRIBUTION C

C

IFINSTATE(MI.EQ.O) GC TC 3922 CAll SERf AD INSTATEIMI,IE,JE,IAOJI IFINODESM.lE.~) GO Te 3922 IFIKARC.GT.LARCI GC TC 3177

C CHECK THE OISTRIBUTICN INOICATOR C

C

M = KARC - NCOESM + 1 J = ASTOREIMI + 0.001 IFIJ.GE.l.ANC.J.LE.141 GO TO 3455 CALL ERROR 1~422,IE,JE,JI

GO TO 3911

C PERFORM THE CHECKS ANt CONVERSIONS REQUIRED OF EACH DISTRIBUTION -C FIRST SET UP THE fRROR MESSAGE FOR AN INCORRECT NO. OF ENTRIES C

Page 31: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM 249

C C C

C C C

C C C

C

3433 CALL ERRC~ 13444,\o,JE,Jl GO TO ~911

34~5 Ml M + 1

3466

3477

3458

M2 '" + 2 M3 M + ~

"14 M + 4 ~GO TO 13466,3477,3488,3490 ,3511,3544,358R,3611,3644,3677,369'I, 1373J,3777,3bll1,J

CO'~STA H

I F llOOcS~. :H .• L I Ge H 3433 GO ra 3911

U\IFO"I'

I F I :W[)~SM. ~.o. J I Ge H 3433 G:J TO 3899

TRI,,\iGULAP

IFI'WDESM.NE.41 GO Te 3433 X = ASTOREI"I31 GC TO 3877

C NCR~\AL

C

C

3499 IF(:~OlliS·~.~IE.-;) GC TC 3433 3500 X = ASTOREIM3)

V = ASTO~EI"4) GO TO 38S5

C LOG:WRroAL C

C

3511 IFINODESM.NE.S) GO TC 3433 X = ASTOREPU) V = ASTOREI~4) IFIASTOREIM1).GT.C.0.AND.X.GT.C.01 GO TO 3533 CALL ERROR 13522, IE, JE, IBlK) Ge TO YHI

i533 U~FORM = ALCGC IV*VI/C~*XI • 1.CI ASTOREIM3) .LDGIX) - S.5*UNFOR~

ASTOREIM41 =SQRTIUNFORM) GC TO 3855

C GAM"'A C

c

3544 IFINODESM.NE.51 GO TC 3433 X = ASTOREIM]) V = ASTOREI~4) IFIASTOREIMll.GT.C.O.!ND.X.GT.O.C.AND.ASTOREIM4).GT.O.O)GO TO 3566 CALL ERROR 13555,IE,JE,IBLK) GO TO 3911

3566 UNFORM = v*v ASTOREIM3) = X/UNFGR~ ASTOREIM4) = X*ASTOREIM31 IF(ASTGREIM4).LE.C.OI CALL ERROR 13577,IE,JE,IBlK) GC TO 3855

C WE!BULl C

3588 IFI~ODESM.~E.51 GO T( 3433

Page 32: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

250 APPENDIX

c

0IFIASTOREIM1'.GE.O.O.AND.ASTOREI~31.GT.O.O.AND.ASTOREIM~I.GT.O.OI 1GC TO 3600

CALL ERRCP 13599,IE,JE,IBlKI GO TO 3'Hl

3600 ASTOREIM~I = 1.0/ASTOREIM41 GO TO 3899

C ERLANG C

C

3611 IFINODESM.NE.51 GO TC 3433 X = ASTOREIM31 K = ASUJREIM41 + 0.00 UNFORM = K

uIFIASTOREIM1'.GT.0.0 •• NO.X.GT.0.O.AND.ASTOREIH41.GT.0.O.AND. lASTOREIM41.EU.UNFORMI GO TO 3633

CALL ERROR 13622,IE,JE,18LKI GO TO 3911

3633 ASTOREIM31 = ASTOREI~41/X Y = ASTOREIM41/IASTOREI~31*ASTOREIM311 GO TO 3855

C CHI SQUARE C

3644 IFINODESM.NE.41 GO TC 3433 X = ASTOREIH31 K = X + 0.001 UNFORH = K IFIASTOREIM1'.GT.0.O.ANO.UNFORM.EO.X.ANO.X.GT.0.01 GO TO 3666 CALL ERROR (3655,IE,JE,18LKI GO TO 3911

3666 Y = 2.0*X L = K/2 ICCUNT = L*2 IFIK.NE.ICOUNTI L -L ASTOREIH31 = l GO TO 3855

C BETA C

3617 IFINODES~.NE.51 GO TC 3433 uIFIASTOREIM1'.GT.O.O.AND.ASTORE(M31.GT.O.O.AND.ASTOREIM41.GT.O.01 IGO TO 3899

CALL ERROR 13688,1E,JE,18LKI GO TO 3911

C POISSON

C

3699 IFINODESM.NE.41 GO TC 3433 L = ASTOREIH21 - ASTGREIHll + 0.001 IFIASTOREIM1'.GE.O.O.~NC.ASTORE(M3).GT.J.O.ANO.l.GE.1) GO TO 3711 CAll ERROq 137C0,IS,JE,18lKI GO TO )911

3711 IFIASTOREIM3).lE.I0.01 GO TO 3722 KARC = KAqC + 1 IFIKARC.GT.lARC! GO TO 3177 ASTOREI~) = 4.0 ASTOREI~41 = SQRTIASTCREIM3)) GO TO 35C0

3722 X = ASTOREIM3! ASTOREI~31 = EXPI-ASTCREIM3)) GO TO 3811

Page 33: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM 251

C PASCAL C

C

3133 IFINOOESM.NE.51 GO TO 3433 IFIASTOREIM31.LE.O.O.OR.ASTOREIM31.GE.1.OI GO TO 3144 K = ASTCREIM41 • 0.001 UNFORM = K IFIUNFORM.EO.ASTOREfM41.ANO.K.GT.O.ANO.ASTOREIMl I.GE.O.IGO TO 3766

3144 CALL ERROR 13755,IE,JE,IBlKI GO TO 3911

3166 X = IASTOREIM41*11.C - ASTOPEIM3111/ASTOREIM31 Y = X/ASTOREIM31 ASTOREIM31 = -ALOGI1.O - ASTCREIM311 GO TO 3855

C BINOMIAL o

C C C

C C C

C C

3117 IFINODESM.NE.51 GO TC 3433 IFIASTOREIM31.LE.O.O.CR.ASTOREIM31.GE.1.OI GO TO 3788 K = ASTOREIM4) + O.OCI UNFORM = K IFIUNFOR~.EO.ASTORE(M41.ANO.K.GT.O.ANO.ASTORE(Ml'.GE.O.IGO TO 3800

3188 CALL ERRO~ 13799,IE,JE,IBLKI GC TO 3911

380e X = ASTOREIM4)*ASTORE(M3) Y = X*ll.J - ASTOREI~311 GO TO 3855

3811

3822

J844

385~

3817 31\99

HYPERGEOMETRIC

IFINODESM.NE.61 GO TC 3433 IFIASTOREIM31.GT.C.O.ANO.ASTOREIM31.lT.1.OI GO TO 3844 CALL fRRC~ 13833, I E, JE, IBLKI GC TO 3911 K = ASTOR=IM41 + C.CCI UNFlJRM = K "15 = 1'1+5 l = ASTCRE IMS) + O.ed T I ~E SM = L

OIFIUNFORM.N".ASTOREIM41.0~.TI"1ESM.NE.ASTOREIMS).O~.K.LE.l.OR. lL.LE.u.CR.K.lf.L.OR.~STOREIMl).lT.o.rl GO TO 3822

X = ASTORE(~S).ASTCR~(M3) U'lFORM = (4STlIREf'oI4) - ASTOREIMSIII(ASTOREIM41 - 1.G) Y = X~ll.Q - ASTOREt'311*U~FCRM

CHECK FOR POSITIVE VARIAN:f, MEAN wiTHIN MIN-MAX. MIN-MAX OKAY

IFIY.LE ••• 01 CALL ERRCR 13~66,IE.JE.IBLKI

I F ( X • LT. AS T C ~ f: I MIl .0 R • X • G T • A S T OR E I M2 I I CAL L ERR 0 R I 3888, IE, J E , I B L K I IFI4STC~~(Ml).GE.ASTOAEIM211 CALL ERROR {J90C.JE,JE.IRLKI

ENTeR THe E~D OF SEG'E~T INDICATOR FOR DISTRI8UTION INPUT Nfl = r~po PH I I I I" = r~CCtl (II JE = ,"00,;2 I I) IFIIE.cQ.WLK.AND.JE.EO.18LKI CAll ERROR 152<J9.IBLK,I3LK,I1 CC 53.;J J=l,I\;.RC I F I I AR C 11 J ) • 0: • IE. AN C • I ARC 2 t J I • E C • J E I CALL E q R 0 R I 5311 tI E , J t:, I B L K I LOGII = L'JGII!I LeGGO = LOGC I I I IFILOGII.GT.41 GO TC 5322 IFILOGOO.~[.lll LeGCe = 1

5322 !F(LOGII.LT.1.OR.LOGII.GT.81 CALL ERROR t5333,IE.JE,IBLKI

Page 34: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

252 APPENDIX

C

IFILO~II.G .41 GO TC 5477 IFI LOGGO.L .11 GO TC 5355 IFILOGJO.L .~I GO TO 5377 K -9 L = \; M = 'l'lOC:: -IFIM.GT.911 ~ 99

5344 K = K + L L = L + I IFIL.GT.MI GC TO 5155 IFIK - LeGOI II 15344,')371,5344

5355 CALL ERAC~ 15366,IE,J~,IBLKI

5317 IFILOGOC.LT.31 GO TC 5399 IFI<C.LE.lI CALL E'RRCR 153b8,1~.JE,IBLKI

C CHECK TE~MI~AL NOD:=S C

C

5399 IFILCGCC.~=.ll GO TO 5477 IFllSTATII'.LL.(.A~C.ISTATII'.GE.-11 GO TO 5411 CALL Et{RC, 15'fCC,Je,JE'[BLKI

5411 JCCUNT = JCOUNT + 1 IFI H.Ef;:. I c/.LL FQRCP 15422,IE,JE.IBLKI IFI"O.NE.:·' CALL FRRCR 15433,IE.JE,lflLKI IFILOGII.LT.2.0R.LOGII.GT.41 CALL ERROR (S444,IE,JE,IBLKI DC 5466 J=I,1<1 M 'lJp + J - 1 M = "lSTOKEIMI L = IPOlr-.T I~' I IFIL.c~.'1 CC TO 5466 IFIASTOA~ILI.~E.I.CI CALL ERROR (5455,IARC1(MI,IARC2IMI,IBLKI

5466 CONT HWE GC TO 56dlj

C CHECK FOt{ PROPER USE CF I~TERNAL 'lODE STATISTICS OPERANDS C

c

5417 IFIISTaTIII.E~.GI GC TO 5500 K = (j

DO 5488 J=l,N~ODE IFII.EC.JI GC TO 5488 IFIISTATlII.'<r.ISTATlJIl GO TO 54AI! K = K + 1

5488 CCNTI'lUE IFIK.;T.21 CALL ERRCR 15499,IE,JE,IBLKI

C CHECK INITIAL NODES C

C

550G IFILOGII.NE.ll GO TO 5544 ICOUNT = 1 IFINI.NE.01 CALL E~ROR 15511,IE,JE,IBLKI IFI;~O.EQ.:·I CAll ERRCR 15522,IE,JE,18LKI IFILOGOO.LT.2.0R.LOGCC.GT.31 CALL ERROR 15533,IE,JE,IBLKI GC TO 5688

C CHECK INTERNAL NODES C

5544 IFI,~I.EQ.OI CAll ERROR 15555,I!:,JEtlBLKI IFI~C.EQ.OI CALL ERR(R 15566,IE,JE,IBlKI DO 5588 J=l,NI l = NP + J - 1 M = NSTOREIU M = IPOINTIMI IFIM.EQ.OI GO TO 5517

Page 35: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM

IFIASTCR~IMI.~E.l.OI JU~PIII = 1 5577 DO 5588 K=l,~C

M = NP + N I + K - 1 5588 IFINSTOREILI.cQ.NSTOREIMII CALL ERROR 15599,I~,JE,IBLKI

C C CHECK QUE AND SCRT NCCES FOR INPUT - OUTPUT ARCS C

C

IFILOGII.LT.71 GO TO 5633 IFIJUMPIII.EC.11 GC Te '>6'~ IFINI - NO)5688,56€8,5611

560C IFINI+l.EQ.NC) GO TO 5688 5611 CALL ERRCR 15622,JE,J~, IBLKI

GO TO 5688

C CHECK CC~PARE AND PREFE~REO NODES FOR INPUT - OUTPUT ARCS C

C

5633 IFILOGII.LT.5) GO TO 5666 IFINI+I.EQ.NCI GO TO ~688

IFILOGCC.GT.ll GO TC 5644 IFI~I.NE.NO) GO TC 5644 IFIJUMP(II.EQ.CI GC TC 5688

5644 CALL ERRCR 15655, IE,JE, IBLKI GO TO 5689

C CHECK AND. PAND, OR NCDES FOR INPUT - OUTPUT ARCS C

C

5666 IFI JUMPI I) .EC.O) GC TC 568A IFINO.GT.11 GO TO 5bE8 CALL eRRCR 15c77,IE,JE,IBLK)

C CHECK ALL OUTPUT LOGIC C

5688 IFILOGCC.NE.21 GO TC 5711 L = 0 00 5699 J=I,NO M = NSTOREINP+NI+J-l I K = IPOINTIMI IFIK.EQ.01 GJ TO 569q CALL SEEK IK,~MARKllll

IFIITALP.NE.CI L = L + 5699 CONTINUE

IFIL.GT.01 CALL ERROR (57J:,IE,JE,lSlKI C C CHECK MO~TE CARLO CUIPUT LOGIC C

5711 IFILOGCC.~E.3) GO TO 5q31 DC 5722 J=l,P'ARC

5722 T I ME AI J I = G. c' DO 5900 J=l.NLl M = NSTOR~(NP+NI+J-ll KE = IARCH"-) LE = 14RC21MI IFIIPOINTIM1.GT.01 GC TO 5755 IFIJ.NE.NOI GO TO 5731 IF(JUMPIII.EQ.ll GC TC 6C66

5733 CALL ERROR 15744,KE.LE,IBLKI GO TO 6066

5755 CALL SEEK IIPOINTIM),EMARKllll IFIJ.LT.NOI GO TO 5111 IFIJUMPII1.EC.OI GC Te 5711 IFIITALP.NE.OI CALL ERROR 15766,KE.LE.ISLKI GC TO 6066

253

Page 36: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

254 APPENDIX

5177 IFIITAlP.~Q.c) GO Te 5713 C C LOAD 4KC NO. l'S BOU~CARIES AND CHEcr FOR AN COO NO. OF eNTRIES C

C

IFIJ.GT.l) GC TC 5911 N = IfAlt' L = IITALP/2)"'2 IFI".E:;;.Ll GC TO 579<) CALL EqRO~ 15788,KE,LE,IBLK) GO TO 6066

5799 TIM~SM = ASTCREIITALC+l) IFIN.LE.2) GO TC 586~

00 580') 1"=3,:'<,2 58Ge TIMeAIK) = ASTOREIITALC+K)

GO TO 5866

C COMPARE THE NO. OF ENTRIES AND 80UNOA~IES OF THE 1ST ARC AGAINST C ~LL OTHER ARCS PLLS CHECK ANC SUM rHE PROBABILITIES C

5811 IFIN.Ew.L) GO TO 5833 CALL ERRCR I'3H22,KE,LE,18LKl GO TO 6066

5833 IFIN.Lc.2) GO TO 5866 DC 5844 K=3,N,2

5844 IFITIMcAIK) .N~.ASTCRfl !TAlC+K)) CALL ERROR 15855,KE,LE, ISlK) 5866 DO 58£S K=2,N,2

~IFIASTOREIITAlC+K).LT.a.G.OR.ASTORE(ITAlC+K).GT.1.0)

lCALL ERRCq 1'jP,71,KE,lE,leLK) 5888 TIMEAIK) = TIMEAIK) + ASTJAEIITALC+KI

IFITIMtSM.Ni:.I.STOREIITAlC+l)) CALL E~ROR (5899,KE,LE,IBLK) 590.) CON TI NUE

C C CO EACH OF TH~ DISTRI~UTIDNS SUM TO O~E

C DC 5911 K=2.1\,2

5qll IFITIMEAIK).LT.L.9g.CR.TI~EAIKI.GT.I.OlICALLERRORI5g22,IE,JE,IBLK) C C CHECK FILTER OUTPUT LCGIC C

5933 IFILOGOO.LT.4) GO TO 6066 NCCi:SM = i) DC 6044 J=l,I\O M = NSTOREINP+NI-l+JI IFIIPOI~TIM).iQ.O) GC TO 5944 KE = lARCI I~) LE = lARC2(M) CALL SEEK IlPOINT(Ml,EMARKlll) IFllTAlP.GT.J) GO TO 5955

5944 NOD~SM = ~OOt5M + 1 GO TO 6044

5955 IFILOGCC.EQ.6) GO TO 6044 N = lTALP l = I ITAlP/2)"'2 IFIN.EQ.Ll GO TO 5917 CALL ERRCR 15966,KE,LE.IBlK) GO TO 6044

5977 DO 5988 K=2,ITAlP,2 5988 IFIASTCREIITAlC+K-Il.GT.ASTOREIITAlC+KIICAllERRORI5999,KE,lE,IBlK)

C C CHECK FILTER NO. 2 O~TPUT LOGIC C

IFllCGCO.EQ.4) GO TC 6044

Page 37: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM

('1)44

6066 C C C

c

IF( LOGI r. 'JE. 'J) CALL r:I~RCR ((,1.((1,

IF(L.N~.2) CALL E~qCK 16011,KE,L IF(..ISTCl<cIlHLC+ll.LT.O.OI CALL IF(ASTCqL(ITALC+21.GT.FLOAT(~111

CCi\T I:WE

f;, Jc, I BLK) ,I BLK I I<RO? (b022,KE,L::, 13LK I CAll EKROA (6033,KE,LE,ISLKI

IF(,WDESI'.'E.~1 CALL "RRnp (6255,1[,J~,lflLK)

(D,H "JUE

ANY I:HTIAL ,nC' EI<MINAL 'JODES

IF(ICUUNT.EC. I C~LL EQRO~ (6C77,IBLK,IBLK,IBLKI IF(JCOUNT.~Q" ) CALL ERROR 16C86,IBlK.IBlK,IBlK) IFIJCOUi'>T*4.GT .MA'ICI CAll ERROR (6099, IBlK, IBlK, InLK)

C CHECK ARCS ~RRLRS

C DC 6133 1=1,~.RC

K= = PR(1(I)

L~ = I~RC2II)

IF(NODd II) .Gl.'JOCEO (I» CALL ERROR (610I',KE,LE,'JWARN) IF(KE.[Q. I llLK.ANC.LE .;:C. IBLK I CALL (;RRCR (6111, IBLK, ItlLK, I) J = I PO un ( I )

255

IF(J.l=. I GC TO 6131 IF(ASTQR~IJ).L~.(.0.(R.ASTnREIJI.GT.I.0)CALl~RROR(6122,~E,lE,IBLK)

6133 cor~ TI :WE IFIIRROR.I'T .. ) RETUR~

C C LIST THE COMPUTER TI~E CDNSU~PTION WARNING MESSAG~S

C IF(MED) GC TC 6155 CALL ERRJq C6144,IBLK,lolK,~WAR~1

6155 IF( ICPG'PoE(;;.,1 GO TO 6177 CALL [~RC~ (6166,IBLK,lelK,~WAPNI

6177 IF(MOD~) GO T0 6199 IF( ITqACi'.EC.) GO H .. 61')9 CALL E',R2~ (bI8R, IHlK, IRLI(,NwARN)

6199 CRI T = • TRUE. IF(CTl~E.EQ.0.(.A~O.CCDST.EQ.0.0.ANn.CPERF.EQ.C.OI GO TO 6222 CRIT = .FALSt. CALL E~RLR (6~':;C, IBLl<, 18LK,NWAR,\l1 IF(SLA~) JO TC 6222 CALL t;<RCq (6211,IBLKtltlLK."lIolMNl

62'-2 IFIITUCt.E~.3) wPITE (IOUT,6233I 6233 FORMAT (47HC~OTE--- * INDICATES BEING ON THE CRITICAL PATH)

IFl ITRACE.Nt.!) GO TC 6344 wRITE (IOUT,6£44)

6244 FORMAT (ii'll, loX, 8HFRMINAL, 4X, 9HBEGINNING) IF( I'JFC) GrJ Te' 6266 IO:<ITE (ICOT,(,!55)

62:>5 FCRMAT (lH+. 3(X, 131-00ST INFLATED) 6266 IF(DISC) GO TC 6239

wRITE CIOUT,6:!771 6277 FORMAT IIH+. 45X, 15~CCST DISCOUNTEDI 6288 IFCINFP) GO TO 63':::

WRITE (IOUT,62991 6299 fORMAT IIH+, o<X, 1ll-PERF I'JFlATEOI 6300 IF(OISPI GO TC 6322

WRITE (ICUT,63111 6311 FO~MAT 11H+, 77X, 15~PERF OISCOUNTED) 6322 WRITE CIOUT,b333) 6333CFORMAT 16H COUNT, 5X, 4HNOO[, 9X, 4HSEEO, 22X, 4HTIME. 17X, 9HPATH

1 COST, 14X. UHCVERAll COST, 15X, llHPERFORM,Afl/CE)

Page 38: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

256 APPENDIX

C

6344 DO 6355 I=l,~NOOE 6355 ICRITNIII = 0

00 6366 l=l,MARC 6366 ICRITA(II = C

RETURN END SUBROUTINE OCNET IMPLICIT INTEGER*411-NI

OCOMMON EMARK(ll),SETUP,FI~T,OINT,FACTOR,STI~E,SCOST,SPERF,CTIHE, lCCOST,CPERF,BTIME,BCCST,BPERF,TIHESM,U~FORM,ITRIP1(221,ITRIPl(22I, 2KNT(6),INPT,IOUT,IPNH,IWF1,IWFl,IWF3,IWF4,IBLK,ITRACE,ICUT,ISEEO, 3IRROR,ISAVE,NOOES~,MAXTAG,ICOUNT,JCOUNT,NTRIP,ICORR,LCOMP,~WARN,

4NRK,NRKS,SLAK,MOOE,INFC,INFP,0ISC,OISP,CRIT,KGEN,HEO,SI~GLE,OOUBLE

OCOHMON/TRIALS/STORET( lOOO,4),TERM(lO,8I,KPOINT(lOI,NOOET( 1000), lMTERM,NTERM,HITER,ITER OCOMMON/ARCS/ASTOREI 2800),UTIHEA( 350),TIMEA( 350),UCOSTA( 350), lCOSTAI 350),UPERFAI 3501,PERFAI 350l,WORKI 3501,ISTATE( 3501, 2NOOEII 3501,NOOEO( 35CI,ICRITA( 3501,KEEPCI 3501,KEEPPI 3501, 3IARC1( 3501,IARC2( 35CI,IPOINT( 3501,JPOINT( 3501,ISLAKI 350), 4KARC,LARC,HARC,NARC,ITALC, ITALP, ISTAR OCOMMON/NOOES/TIMENI 2CO),COSTN( 2CCI,PERFN( 2COI,NSTOREI 5400), lNODEll 2001,NOOE2( 2COI,LJGJ( 2001,LOGO( 2CCI,NSTATEI 2001, 2NARCII 2001,~ARCO( 2COI,ISTAT( 2001,INSTAT( 200),ICRITNI 2001, 3NPOINTI 200),NSLAKI 2001,JUMPI 2001,KNOOE,lNOCE,HNODE,NNOOE,HTAG, 4NTAb OCOMMON/INTER~/XMIN(2C,41,XMAXI2u,41,HMIN(2u,41,HHAX(20,41,

lHAVEI20,41,ICBSI2~1,~HJST,NHIST

OCOHMON/SLACK/RMIN(2CI,RMAXI2CI,SMINI20),SMAX(201,SAVE12QI, 1~OBSI201,MSLACK,NSLACK

uCQMMON/CPbAP/TIllOI,12IlGI,CCNFLIlD),CONFSIIOI,CAVEI1CI,CSMINIIOI, lCSMAXllOI,CHMINllOI,CHMAXllOI,PAVEllOI,PSMINllCI,PSMAXIIOI, 2PHMINIIOI,PH~AXIIO),KCOBSI101,KPOBSI1~I,MCPGAP,NCPGAP,ICPGAP

DIMENSION SLACKAI 35GI, SLACKNI 200), IPATHAI 3501, IPATH~I 2001 OLOGICAL SLAK,MODE,INFC,INFP,DISC,nISp,CRIT,KGE~,HEO,SINGLE,DOUBLE, lICHECK,JCHECK

DATA KSTAR/IH~I

C DO~ET CO~DUCTS SIMUL~TION, FINDS CRIT-OPT PATH, STORES STATISTICS C ARC STATUS - THIS IS CA~RIED BY THE VARIABLE ISTATE C -1 - EQUIVALENT TO n, THIS OPTION IS USED fOR BACKTRACKING C LOGICALLY ELIMINATED fROM THE NETWORK C NC~PRCCESSED

C Z - UNSUCC~SSFULLY CCHPlETED ARC C 3 - SUCCESSFULLY CCMPLETED ARC C 4 CRITICAL PATH CANDIDATE C ~ODE STATUS - THIS IS CARRIED ey THf VARIABL~ NSTATE C 0 - LOGICALLY eLI~INATED FROM THE NETWORK C I NC~PRCCESSEC C 2 CANDICATE FCR PRCCESSI~G

C 3 - SUCCESSFULLY C(MPLETEt C 4 ON THE CRITICAL PATH C 5 - CN THE CRITIC~L PATH AFTER CALCULATIO~ OF THE SLACKS C

NRK = 0 NRKS = 0 RE~IND IWF2 REWIND IwF3 REWIND IWF4 ICOUNT = 1 JCOUNT = C MAXTAG

6377 JSEcC = ISEEC

Page 39: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM

6380

6388

6399 C

NT NODE = 0 ISTAR = 0 NTAG = KNODE DO 6380 1=1.6 KNTlI) = 0 DO 6388 I=l.NARC SlACKAII) = SETUP TlMEAllI '" SETUP COSTAl 11 = SETUP PERFAIII = SETUP UTIMEAII) SfTUP UCOHAIl) S£TUP UPERFAIII S~TUP

IPATHAIII IBlK I STATE III 1 IFI NOOt:IC I) .Nf.O) GC TO 6388 TIMEAIII C.'.· COSTAIII = C.! PERFAIII = C.'· UT IMEAIII = G.0 UCOSTAIII = G.t UPERFAlll = l.G CALL DOARClll CONTINUE DC 6399 I=l.NNCDE SLACK~II) = SETUP lIMtN!11 SETUP COSTNIII = SETUP PERFNIII = StTUP NSTATEIl I = 1 IPATHNI II = Ir.LK IFILOGII I1.E~.l I ~SHTE! II = 2

257

C C

SIMULATE THE ~ETWORK

lCHcCK .T~UE.-

VIA NODE REVIEW. CORRECT NODF ENTRY=1 REVIEW. NO VIRGIN NODES OR UNPROCESSED INPUT ARCS

C C C C C

C

64;0

6411

6422

ICHECK JCHcCK JCHECK

.FALSE.­

.rALSE.­

.TRUE. -

ICH;::CI< = .T~Uf. JCHECK = .FAl"E.

FOR CANCIOATES NOOES. AT LEAST 1 OF THE 2 PRECEEDING OCCURRED. NO NODES PROCESSED THIS NODE REVIEW. AT LEAST 1 NODE wAS PROCESSED THIS REVIEW.

00 7466 (=l,~~ODE

(F(:JSTAHClI.~Q.21 GC TO 6411 (FINSTHc! II - 117466.6433,7466 NI = "'ARCIIII N P = ,'j PO I ~ T! ( I (FILOGII II.tll.ll GC TC 6455 K = (' L = NSTOR"C,P+KI IF!ISTATElLI.N£.lI GC TC 6444

6433 ICHeCK = .HLSE. GC TO 7466

6444 K = K + 1 I F ( K • N c • 'H I GL TO 64 22

6455 JCHcCK = .Tqu~. NC ; "ARCS!II

C I~ITIATE THe CURRENT NODES OUTPUT ARCS AND INITIATE THOSE ARCS C OUTPUT ~cr:s.

C IFI~O.LE.01 ~c TO 6411

Page 40: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

258

6466 C

DO 6466 K=l,NO l = NSTCREINP+NI+K-11 CALL INITAL( LI

APPENDIX

C CHECK AND, PA~O, O~ FCR LJGICAl ELIMINATIONS OR ESCAPES C AND IINFlU[~CE CF THE INPUT ARC'S STATUS ON P~QCESSINGI

C 1. AT LEAST 1 ZERO = LOGICAL ELIMINATICN C 2. CO~BI~ATION OF 2'S A~O 3'5 = GO OUT THE ES:APE A~C C 3. ALL 3'S = NCR~AL PROCESSING C PANO - OR IINFLUE~CE OF THE INPUT ARCS STATUS ON PROCESSING) C 1. ALL ZEROS = lCGICAL ELIMINATION C C C

6471

2. CO~6INATION cr v'S AND 2'S = GO OUT TH~ eSCAPE ARC 1. AT LEAST ONE 3 = NORMAL PROCESSING

IFILOGIII).LT.2.0Q.LCGIIII.GT.41 GO TO 6533 KCOUNT = r !TALC .) ITALP (. TSAVE -SETU? CSAVE ';.'J M (' N = 0 J = C DO 6500 K=l,f'ol l = NP + K - 1 L = NSTO'lEILl IFIISTAEILl.GT.C) GC TC 648~ M = M + 1 GO TO 650':'

6488 IFIISTATcIL).~Q.21 ~ = N + 1 IFIISTATEIL).~C.31 J = J + 1 IFITIMEAIL).LT.TS4VE) GO TO 6499 TSAVE = TIMEAIL)

6499 KCOUNT = KCCUNT + 1 IFIDOUBLc) CSAVE = CSAVE + CCSTAILI IFISINGLEI CALL OVECT 11,(CDUNT,l,CSAVE,SETUP) CSAVE = CSAVE - BCCST

65CC CONTI NUE C C CHECK ANC LOGIC C

C

IFILOGIII).N~.21 GC TC 6511 IFIM.GT.0) GO TO 7455 IFIN.GT.O) GC TO 6522 GO TO 6533

C CHECK PAND, CR lOGIC C

6511 IFIM.EQ.NII GO TO 74~5

IFIJ.GT.C) GO TO 6533 C C INITIALIZE THe ESCAPE A~C

C 6522 TIMENII) = TSAVE

COSTNII) = C~AVE + BeeST PERFNIIl = BP(RF NSTATEI I) = 3 IFISINGlEI CALL SWECT IFIIRRCR.GT.C) R[TUR~

N = NP + NI + ~o - 1 N = NSTOREI!\I) CALL OOA~CIN)

Page 41: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM

C

JPOINT(~) = I$TAR GC TO 7466

C INlllALllE FCR NoA~Al PROCESSING C

C

6533 KCoUNT = ,) MCOUNl = c'

TSAVE SETUt> CSAVE C.C PSAIIE ~.O J = C ITAlC IT AL P 2 IF(LoGI(I).E~.4) GC TC 6577 TSAVE = -SETUP IF(LOGI(I).G~.5) GO Te 7111 IF(LoGIII).E~.2.oR.lCGIll,.cU.3) GO TO 6544

C PROCESS .\loDES WITH' Ir-ITIAl' INPUT lOGIC HERE C

C

TIMEN(I) COSTN( I) PERFNI I ) GO TO 6611

STIME BCoST BPERF

C PROCESS NCDES wITH '~r-O' AN') 'PAND' I\iPUT lOGIC HERE C

C

6544 DO 6566 K=l,~1 l = NP + K - 1 L = NSToREI LI IFI ISTATEIl) .to.2) GC TO 6555 IFIISTATEIll.lE.OI GC TO 6566 ISTATEILI = 4

KCoUNT = KCOUNT + 1 IFIDoUBLe) PSAVE = PSAVe + PERFAILl IFI~I~GlEI CALL DVECT 12,KCoUNT,l,P~AVE,SETUP)

pSAVE = PSAVE - BPERF 6555 MCOUNT = MCOUNT + 1

IFIDoUBlE) (SAVE = CSAVE + CCSTAIl) IFI~IN~LE) CAll DVECT Il,MCDUNT,l,eSAVE,SETUP) CSAVE = CSAV~ - BeaST IFITIMEAILI.LT.TSAVEI GC TO 6566 TSAVE = T1MEAIlI

6566 CONTINUE GC TO 660l

C PROCESS NODES WITH 'CR' INPUT LOGIC HERE C 6577 DO 6588 K=I,NI

L = NP + K - 1 l = NS TORE I LI IFIISTATEIl).lE.O) GC TO 6588 IFITIMEAIl).GE.TSAVE) GO TO 6588 TSAVE = TIMEAIll J = l

6588 CONTINUE ISAVE = 0 00 6599 K=l,f<ol l = NP + K - 1 l = NSTOREIl) IFIISTATEIl).lE.o) GO TO 6599 KCoUNT = KCCUNT + 1

259

Page 42: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

260 APPENDIX

(

IFISINGLEJ GC TO 65gC CSAVE = CSAVE + COSTAIL) GO TO 6595

659C IFIL.E~.J) X6 SETUP IFIL.Nc.JJ X~ TSAVE C~LL DVECT Il,KCUNT,l,eSAVE,X61

65g5 CSAVE = CSAVe - BCOST 6599 ceNT INUE

IFIiSAVE.~Q.lJ GO TC 6400 IFIDOU3LEJ PSAVE = PSAVE + PERFAIJI IFISINGLCI (ALL DVECT 12,l,J,PSAVE,SETUPl PSAV[ = PSAV: - BPERF 1ST ATE I J J = 4

( STORE THt NGCE TIME, COST AND P~RFORMANCE (

C

66';(; TIM::NI I J TS~VE

COSTNI I I CSAVE + !lCeST PE::lFNI I J PSAVE + BPERF

6611 I'.STATEIIl = '\ IFISINGLEJ CALL SVECT IFIIAROR.GT.0J RETURN IFILOGCIII.GE.lll GC TO 6622 IFILOGOIII.N~.lJ GC TC 6633

6622 ~TNOD~ = NTNCCE + 1 IHNODE = I GO TO 7466

6633 NCO = NO IFIJUMPI Il.E~.lI NCO = NO -IFILOGCIII.GT.31 GC TC 67&6

C PROCESS NODES WITH 'ALL' OUTPUT LOGIC HERE C

C

IFILOGCIII.NE.'<'J GC TC 6655 00 6644 ~=l.I\CO

L = NP + N I + K -L = NSTCRE III CALL DOARC I l J

6644 JPOINTIL I = ISTAR GC TO 7466

e PROCES~ NODES WITH '~CNTE CARLO' OUTPUT lOGIC HERE C

C

6655 CALL RANDOM X2 = C.O 00 674,< K=l,NOO l = NP + NI + K - 1 L = NSTOREILl CALL SeEK IIPOINTILl,EMARKlll1

C IF THIS IS T~E FIRST ARC, FIND THE CORRECT DISTRIBUTION C

IFIK.GT.IJ GC TO 6733 M = 2 IFIITALP.EQ.2) GO TO 6733 LS = /TALC + 1 X3 = 1.0 X4 = 1.0 IFIASTOREILSI - 3.016666,6677,6699

6666 X5 = TIME~111 GO TO 6711

6677 X5 = COSTNII)

Page 43: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM

C

IFIP.FC) GC TL 6688 X3 = FI:-.n**((,IME'HI) - BT\MEl/FACTO~)

6&8R IFIDISC) ,,0 L= 6711 X4 = DI'H'''''IIT1~F.·HI) - BTIMU/FACTO;o GO TO 6711

66~9 X5 = PE~F~II) IF I P'IF~) (,0 TC 67'.'C X3 = FI\lT"'*IITIMENI I) - 'lTIME)/FACTOR'

67J( IFIDIV) GO h' 6711 X4 = DlI'iT**IITIf"E~CII - flT\ME)/FaCTCRI

67~1 DO 672L ISAV"=3.\TALP,2 ~ = IS i.V" - 1 LS = I TALC + ISAVc X6 = A~TORfIL~)*X3/X4 IFIX6.GE.X5) SO TO 6733

6122 CCNfPWE 11 = (T :'LC + I HLP

C OET~R~IN~ W~(r~ OUTPLT 'R~ WILL BE PlnCESSED C

C

6713 Xl = Xl MS = l'ALr: + M X2 = Xl + aSTCRE(MS) IFIUNFJR~.GE.XI.ANO.L~FORM.LT.X2) GO TO 6755

6744 CaNT IliUE 675~ CALL DCA,CIl)

JPCINTILl = \:'TAIl GO TO 7466

C PReCESS ~ODE, WIT~ 'FILTE~' CUTPUT LOGIC HERE C

6766 MCOUNT = '.' DO 6977 K=l,I'iC L I'iP + ~( + K - 1 L 'jS TOR: III N = (POI'HILl

C C FI~D THE EscapE ARC I~CCUNT POINTS TO THAT ARC) C

IFIN.Eu.0) GC TO 6717 CAll S~EK IN,~MARK(11)

IF(ITALP.GT.'1 GO TO 6788 6117 NCOUNT = L

GC TO 6977 6788 IFILOGCI I) - 5167'J1,6899,6911

C C PROCESS FILTEK 1 LOGIC C

6799 N = NP + ~I + NO N = NS TORE I N 1 TSAVE = ~.r

CSAVE = 0.0 PSAVE = 0.0 lFIN.EQ.O) GC TO 6822 IFI~STATEINI.~O.3' GC TO 6811 CALL E<RCR 16800,NCCE1III,NOCE2II),JBLK) GO TO 7499

6811 TSAVE liMENINI CSAVE COSHI"" PSAVE P!:RHIN)

6822 TSAVE TIMEN(II - TSAVE CSAVE COSTNIl) - CSAVE

261

Page 44: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

262 APPENDIX

C

PSAVE = PERFNIII - PSAVE Xl = ASTOREIITAlC.l) X2 = ASTOREIITAlC.21 IFIXl.EQ.O.O.ANO.X2.EQ.O.O) GO TO 6833 IFITSAVE.lE~Xl.OR.TS.VE.GT~X21 GO TO 6911

6833 IFIITAlP.EQ.21 GO TO 6966 X3 = ASTOREIITAlC+31 X4 = ASTCREIITAlC+41 IFIX3.EQ.O.O.ANO.X4.EQ.O.OI GO TO 6866 IFIINFCI GO TO 6844 X = FINT**IITI~ENI[1 - BTIMEI/FACTORI X3 = X3* X X4 = X4*X

6844 IFIDISCI GO TO 6855 X = DINT**IITI~ENIII - BTIMEI/FACTORI X3 = X3/X X4 = X4/X

6855 IFICSAVE.lE.X3.0R.CS.VE.GT.X41 GO TO 6977 6866 IFIITAlP.EQ.41 GO TO 6966

X5 = A5TOREIITAlC+51 X6 = ASTCREIITAlC+61 IFIX5.EQ.C.C.AND.X6.EQ.0.OI GO TO 6966 IFIINFPI GO Te 6871 X = FINT**IITIMENIII - BTIMEI/FACTORI X5 = xs*x X6 = X6*X

6877 IFIDISPI GO TO 6888 X = DINT**IITI~ENIII - 8TIMEI/FACTORI X5 = XS/X X6 = X6/X

6888 IFIPSAVE.lE.X5.0R.PS.VE.GT.X61 GO TO 6971 GO TO 6966

C PROCESS FILTER #2 LOGIC HERE C

C

6899 Xl = 0.0 00 69\)'; J=l.NI N = NSTOREINP+J-ll

6900 IFIISTATEINI.GT.21 Xl = Xl + 1.0 IFlxl.lT.4STOKEIITAlC+II.DR.XI.GT.ASTOREIITALC+211 GO TO 6917 GC TO 6966

C PROCESS FllTE~ '3 lCGIC HERE C

C

6911 DC 6955 J=l.(TALP Xl = ASTOREIITALC+JI N = ABSI Xl I + G.GOI IFIISTATE(NI.NE.ll GO TO 6933 CALL ERROR, 16922,IARClINl.IARC2INI.lfllKI GO TO 749~

6933 IFIXl.GT.0.ul GO TO 6944 IFIISTATtINl.[C.3.(R.ISTATEINI.EC.41 GO TO 6977 GO TO 6955

6944 IFIIST'TEINI.LE.O.OR.ISTATEI~I.EQ.21 GO TO 6977 6955 CONTINUE

C PROCESS THIS CGNSTRAINEO ARC C

6966 MCCUNT = MCOUNT + CALL OGARC III JPOINTIL) = (STAR

6977 CO"!T I NUE

Page 45: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM

c

IfiMCOUNT.GT.0) GO TC 7466 CALL DOARC INCOUNT) JPOINTINCOUNTI = ISTAR GO TO 7466

C PROCES~ NODES WITH SCRT LOGIC C

C

6988 NCOUNT 'J N = NP + NI + NO

6999 J = a Xl = 0.0 X2 = 0.0 X3 = 0.0 00 70CO K=l,NI L = NP + K - 1 L = NSTCREILl IFIISTATEIL).NE.3) GC TO 7J0C J = L Xl Xl + TI~LAILI X2 = X2 + CCSTAIL) X3 = X3 + PEKFAILI

7000 CCNT INUE IFIJ.E;. ) GC TO 7433 X = SETUP DO 7011 K=1."<I L = NP + K - 1 L = NSTOt{':ILl IFIISTAHILI.:;E.31 GC TO 7l'11 X4 = 0.0 X5 = 0.0 X6 = 0.0 IFIXl.~E.O.CI X4 = TI~EA(LI/XI IFIX2.NE.:.CI X5 = CCSTAILI1X2 IFIX3.~E.O.CI X6 = PERFAILI/X3

vTIMESM = X4*FlGATINSTOREI~11 + X5*FLOATINSTOREIN+11) -lX6*FLOATI~STCREIN+211

IFITIM~SM.Gt.X) GC TC 7011 X = TI:~~SM J = L

7011 CC"<TI:WE ISTHE(JI = 4 IT ~L C = ,) ITALP = ,) IF(OOUoL~1 GC TO 702~

CALL OVECT 11,l,J,UNFORM,SETUPI CALL OvECT (2,1 ,J,UNfCRM,SETUP) CALL "VECf IF(lRR(;R .'~T. ~I Rtn;R~

70lL M = NP + ~( + NCOUNT ~CCUNT = ~CCUNT + 1 M = NSTO'l."IMI TIMiAIM) = TIMEAIJI CALL OCARCltI) JPCINT(~) = ISTAR COSTA(~) = CCSTAIJI • UCOSTA(MI PEKrA(~) = ~~KFAIJI + UPE~FAI~1 GC fO n1g,}

C PRJCESS 1~DES WITH QL~UE LOGIC, FIRST INITIALIZE C

7v22 IFILOGI(II.EC.81 GC Te 69Bq T L~H;( I) = ~'"

263

Page 46: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

264 APPENDIX

COSTNIII O.C PERFNI II 0.0 N '" 0

7033 LS '" 0 X '" SETUP

C C ARRANGE THE ARCS IN THE QUEUE FRCM EARLIEST TO LATEST, FIRST FINO C MIN OF CURRENT CANDIDATE SET OF INPUT ARCS C

DC 7044 K"'l,l'd M '" NP + K - 1 L '" NSTOREI"" IFIISTATEILI.NE.31 GC TO 7044 IFITIMcAILI.~(.XI GC TO 7044 X '" T1MEAILI LS = L MS = NSTOREI~+NII

1044 CONTINUE C C IF THERE wAS A SELFCTICN, RECORD IT C

C

IFILS.EQ.CI GO TO 7055 I STATEILSI = 4 ITALC = C ITALP = " IFIDOUBLEI GC TO 705C CALL OVECT tl,l,LS,U~FORM,SETUPI

CALL O~ECT 12,1,LS,U~FCRM,SETUPI

CALL SIIECT IFI IR~CR.GT."I RETUR~

705C TIM[AIMSI = TIMEAILSI CALL DOARCIMSI JPCINT(MSI = ISTAR COSTAIMSI = COSTAILSI + UCOSTAIMSI PoRFAIMSI '" PERFAILSI + UPcRFAtMSI CSA~E = CSAV" + UCOSTAIMSI PSAVF. = PSAVc + UPERFAtMSI IFITSAVE.lT.TIMEAI~SII TSAV[ = TIMEAI~SI "l = N + 1 WCRK(''l1 = LS SlACKA(;~1 = "'5 IFIN.ll .,~I I GC' TO 1033

C ~DJUST PROCESSING TI~ES FOR ITEMS WAITING IN THE QUEU~ PROVIDING C THERE ARE MeRE 1f[~S l'l THE QUEUE THAN THERE ARE SERVERS C

c

7:"55 \lSERVE = LOGCI I I IFIN.L:.~SEAVfl GO TC 7(99 DO 7C6u K=I,NSERVE

7066 IPATHAIKI = K ~CCUNT = ~SERVE + 1 DC 7L8P K=MCCUNT,N X = StiUP i\COUNf = K - l

C FI~U THE SERVeR FINISHE~ FIRST C

DC 1177 I SAY IFIIPHHtdlS M = SU,CKAI I IFITIM°,lIMI. X = T I ,\i: A I'll

=1,NCCUH EJ.~C.CI GO TO 7077 VEl + (.1 • X , .oC T C 7) 17

Page 47: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM

L = ISAVE 1077 CCNTINUE

C

265

C PUT THE SERVER ON A ~Ew ARC AND COMPUTE THE DELAY TIME FOR THAT C ~EW ARC IF THERE IS DELAY TIME C

C

IPATHAIKI = IPATHAILI IPATHAILl = 0 L = WORKILI + ~.l IFITIMEAILI.GE.XI GC TO 1088 M = SLACKAIKI + 0.1 TIMEAIMI = TfMEAIMI + X - TIMFAIll IFITSAVE.LT.TIMEAIMII TSAVE = TIMEAIMI

1088 CONTINUE 7099 DO 710e ~=l,NARC

SLACKAINI = S~TUP 1100 IPATHAINI = IBLK

GO TO 7433

C ARE THERE ENCUGH SUCCESSFULLY PROCESSED INPUT ARCS TO SATISFY THE C OUTPUT ARC SET RECUIREMENT C

C C C C C

1111 MCOUNT = C M = 1 DO 1144 K=l,NI L = NSTCREINP+K-ll IFIISTATEILI.LE.O.CR.fSTATEILI.EC.21 GO TO 1122 IFIDOUBLEI PSAVE = PSAVE + PERFAIll IFISINGLEI CALL DVECT 12,KCOUNT,L.PSAVE,SETUPI PSAVE = PSAVE - BPERF KCOUNT = KCOUNT + 1

1122 IFIISTATEILI.lE.O) GO TO 1144 MCCUNT = MCOUNT + 1

1133

7144

1155 1166 1177

IFIDOUBLE) CSAVE = CSAVE + ceSTAIl) IFISINGLEI CALL DVECT 11,MCOUNT,L,(SAVE,SETUPI CSAVE = CSAVE - BCOST GC TO 11133,11441,~

IFILOGUIII.GT.O.ANO.lOGIII).EQ.6.AND.KCOUNT.EQ.LOGOIIII M 2 fFITSAVE.lT.TfMEAIlII TSAVE = TIMEAlll CCNTINUE IFIMCOUNT.EQ.~) GO TC 1455

IF THERE ARE NOT ANY SUCCESSFUL INPUT ARCS - OR NOT ENOUGH, FIRE THE ESCAPE OUTPUT ARC - FIRST FIND THE TIME WHEN CONDITIONS TURNED INFEASIBLE IF THERE WASN'T ENOUGH SUCCESSFUL INPUT ARCS

IFIKCOUNT.LE.vl GO TC 1155 IFllOGII 1) - 6)1200,120C,1022 IFILOGOIIl.LT.O.OR.lCGIIII.GE.lI GO TO 1199 NCCUNT = LOGe I I I TSAVE = SETUP 00 1188 K=l,NI M = NP + K - 1 L = NSTOREI~) IFIISTATEILI.LE.OI GC TC 1188 M = NSTOREIM+NII IFITSAVE.lE.TIMEAIl)) GO TO 1188 TSAVE = TfMEAILI lS = L MS = M

1188 CONTINUE TIMEAIMSI 0.0

Page 48: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

266 APPENDIX

7199

120C

1211 C C C C (

(

MCoUNT = ~CCU~T - 1 IFIISTATEILSI.GT.21 NCoUNT = NCoUNT - 1 IFIMCoUNT.GE.NCCU~TI GO TO 7177 N S TATE I I 1 = 3 TIMENIII = TS.'Wt C(STHI I 1 = CSAVE + BCCST PERFNI I 1 = BP':PF IFISINGLEI (~LL SVECT IFIIRRC~.GT.0) RETURN M = NSTCRcINP+NI+NC-ll CALL DOARCI") JPOINTIM) = I~TAR

GO TO 7466 N = NP + N I + NC NCOUNT = -LOGell) IFILOGCIIl.LT.OI GO TO 7211 IFIKCOUNT.LT.lOGOII» GC TO 1166 IFIlOGil I) - 511166.7266,7388 IFIlOGIIIl.[{.:.61 GO TC 1377

CALCULATE OUTPUT ARC TIMES IDESIRED CONDITIONS) WHEN THERE IS ~ FULL SUBSET AND LESS THAN 100: WEIGHT CN TIME MCOUNT - CURRENT NUMtlE~ OF ~EMAINING OUTPUT ARC CANDIDATES NCOU~T - CURRENT ~UMBFR OF GOeD OUTPUT ARC'S STILL NEEDED

IFIKCOUNT.GE.-LoGOII,.0~.IABSINSTO~EIN»).EQ.1JC' ~o TO 7266 7222 Xl = SdUP

C

DO 7233 K=l,NI M = NI' + K - 1 L = NSTOREIMI M = NsrOREIM+~I) IFITIMEAI~).NC.SETuPI ~C TO 7233 IFIXl.LE.TIMCAIL)1 GC TO 7233 Xl = TiMEAIlI LS = L MS = M

7233 CCNT INUE T1MEAIMSI = ).0 MCoUNT = MCOuNT - I IFIISTU(ILS).GT.Z) NCOUNT = NCOUNT­IFIMCOUNT.GT.NCoUNTI GO TO 7222

NOT

C THE PIVOT TIME HAS BEEN FOUND, ASSIGN TIME VALUES TO OUTPUT ARCS C

C

DO 7255 K=l,NI M = NP + K - 1 l = NSTOR[IMI M = NSTOREIM+NII IFITIMEAIM).EQ.SETUP) GC TO 7244 TIMEAIM) = Xl GO TO 7255

1244 TIMEAI"') = TIMEAll) 7255 CONTINUE

C PROCESSING pCINT FOR THE COMPARE NODE - COMPUTE NORMALIZATION BASE C

7266 "COUNT = 0 IFIIABSINSTOREIN)).NE.IOO) GO TO 7288 IFILOGOIII.GT.CI GC TC 7277 TSAVE = SETUP GO TO 7288

7277 TSAVE =-SETUP

Page 49: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM

1288 NCCUNT " <)

Xl " 0.0 X2 " 0.0 X3 " 0.0 DO 7299 K"l,NI

267

L " NSTOREINP+K-il IFIISTATEIL1.LE.O.CR.ISTATEILI.EQ.2.0R.ISTATEILI.EQ.41 GO TO 7299 Xl " Xl + TI~EA(LI X2 = X2 + COSTAILI X3 " X3 + PERFAILI NCCUNT " 1

7299 CONTINUE IFI~COUNT.E'.~I GO TC 7333

C C CHOOSE THE WINNING I~PUT ARC C

UNFORM = SETUP DC 73(JO 1<=1,~1

L " NSTORcINP+K-ll IF(ISTATE(l'.lE.O.OR.ISTATEIL1.EQ.2.0R.ISTATEIL'.EQ.4' GO TO 7300 X4 = (J.D X5 = ('.0 X6 = 0.0 IFIX1.NE.C.CI X4 = TIMEAILI/XI IF(X2.NE.C.Ol X5 = CCSTAIL1/X2 IFIX3.~E.(.rl X6 = PERFAIL1/X3

(TINlSM = X4.FLOAT(NSTOREI~ll • X5*FLOATINSTOREI~+111 -lX6~FlOAT(NSTCREIN+211

IFITIMESM.G~.UNFOR~1 GO TO 73CO UNFORM = TIMeSM J " L M = K

13:;( CO"lTINUE C C ANOTHER wINNING I~PUT ARC HAS BEEN DETERMINED - UPDATE C

C

ISTATEIJI = 4 !TALC = ;) ITAlP .', IF(DOU~lt' GC TO 731( CALL OVECT (l,l,J,UNFCRM,SETUP) CALL DVECT 12,1,J,lJNFORM,SETUPl CALL SVECT IF( IRROR.GT .u) RETUR~

731~ M • NSTCREINP+NI+M-ll JPOI~H(MJ = ISTAR IF( IABS( ,\JSTOR: (I;' l.~[.l(r) GC TC 7322 IF(lOGO(ll.G7.() GO Te 7311 IF(TSAIIE.GT.fIMEA(JII TSAilE TI~EAIJ)

TlMt.A( '" = rIMEA( Jl GO TO 7322

7311 IF(TSAVE.lT.TIMEA(J)) TSAVE = TIMEA(J) 7322 MCGUNT • MCCU~T + 1

IFIMCOUNT.LT.IABS(LCGOIII)) GO Te; 728P

C FeR TH~ SPECI~L CASE CF TIME ALONE, TRIM THOS[ INPUT ARCS WHOSE C TIME :XCE~ns THE ~CDE TIM~

C 7333 IF(IABS(\STC'c(N)).r,l.l.~'C\) t;C TO 7433

KCOUNT • " IT AL C ITALP .'

Page 50: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

268 APPENDIX

ISAVE = 0 DO 7355 K=I,NI l = NSTOREINP+K-Il M = ISTATEILl IFIM.lE.0.OR.M.EQ.21 GO TO 7344 KCOUNT = KCOUNT + 1 IFISINGlEI GC TO 1335 PSAVE = PSAVE + PERFAIll GO TO 1340

1335 IFIM.EQ.41 X6 = SETUP IFIM.NE.41 X6 = TSAVE CAll DVECT 12,KOUNT,l,PSAVE,X61

1340 PSAVE = PSAVE - 8PERF 1344 IFIM.lE.OI GC TC 1355

IFISINGlEI GC TO 1345 CSAVE = CSAVE + COSTAIll GO TO 1350

1345 IFIM.EQ.41 X6 = SETUP IFIM.NE.41 X6 = TSAVE CAll OVECT II,KOUNT,l,CSAVE,X61

1350 CSAVE = CSAVE - 8CCST 7355 CONT INUE

IFIISAVE.EQ.01 GO TO 1433 DO 1366 K=I,NI L = NSTOREINP+K-II

1366 IFIISTATEILI.EQ.41 ISTATEILI = 3 GO TO 6400

C C PROCESSING POINT FOR THE PREFERRED NODE C

1311 TSAVE = -SETUP 1388 MCOUNT = (,

K = 0 1399 K = K + 1

IFIK.GT.NI.CR.MCOUNT.EQ.IABSIlOGOIII)) GO TO 14~3 MS = NP + K - 1 LS = NSTOREIMS) MS =. NSTCREI~S+NI) IFIlOGOI Il.GT .('.AND.ISTATEIlSI.lE.OI GO TO 1399 IFllOGOII'.GT.OI GO TO 7422 Xl = SETUP DC 1400 J=l.~COUNT M = NP + J - 1 l = NSTOREIMJ ,,= NSTOREIM+NIJ IFIISTATEIl'.LE.O.CR.TI"EAIMI.NE.SETUPI GO TO 140~

IFITIMEAIl'.G~.Xll GC TO 140C Xl = TIMEAIl) lS = l MS = M

1400 C ONT I NUE IFIXl.NE.SETUP) GO TC 1411 NCOUNT = NCOUNT + I IFINCOUNT.GT.~II NCOUNT = NI GO TO 1399

1411 IFIISTATEIlSI.EQ.21 ~CGUNT = NCOUNT + 1 IFINCOUNT.GT.~II NCOUNT = NI IFITSAVE.lT.TIMEAILSI) TSAVE = TIMEAILSI

IFIISTATEIlSI.lE.2) GO TC 1399 IFIlOGOIII.GT.('1 TlMfAIMS) = TSAVE ISTAT(llS) = 4 ITAlC = u

GLM)O

Page 51: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM

C

ITALP " 0 IFIOOUBLEI GO TO 7420 CALL OVECT Il.l.lStU~FORM.SETUPI CALL DVECT 12.1.lS.U~FORM.SETUPI

CAll SvECT IFIIRROR.GT.O) RETUR~

7420 JPOINTIMS) = ISTA~ MCOUNT = MCOUNT + 1 GO TO 7399

269

C SUCCESSFUL COMPlETI(~ - CALCULATE NODE AND OUTPUT ARC STATISTICS C

C

7433 NSTATECI) = 3 TIMENI 1J = TSAVE COSTNIII = CSAVE + BeOST PERFNCII = PSAVE/FlO~TCKCOUNTI + BPE~F IFClOGIII).Gt.71 GC TC 14&6 DO 7444 K=I,1Ii1 M = NP + K - 1 l = NSTO~ECI') IFCISTATECll.NE.4) G( TO 7444 M = NSTOR2CMHd) CAll DCARCC'" CGSTACM) = UCDSTAC~I + COSTAIll PERFACMI = U~FRFA(~) + PERFACll

7444 CONTINUE GC TO 74&6

C PRESENT NODE UNDER C(~SInERATION IS BEING LOGICALLY ELIMINATED C

C

1455 NSTATECI) = , 1466 CONTINUE

C IS THIS LAST NODE REVIEW ~EEDED FOR THIS ITERATION C

C

IFCIRRCR.GT.~) GC TC 7499 IFIICHeCK) GO TO 75ec IFCJCHECK) GC TO 64C~

7411 CALL ERRCR 11488.I8lK. IflLK, IBlK) 74~9 NODESM = MNcn~

GO TO 8033

C DETLRMINE THE TERI'I~Al NODF FOR THIS ITE~ATIGN

C 7500 IFINTNOD2 - 117477,1511,1522 1511 NCDESM = I'TNCDE

TIMESM = TIM~NIMTNODEI GC TO 1538

1522 K " -9 1~33 K = K + 1;

UNFQRM = SETUP T 5 Av E = .). C CSAvE' = (,.U PSAVE = (.0 Xl = -SeTUP "lOOi:SM = :' l = (. DO 7~44 l=l,N~CDE

Iflr<STAEI 1).cQ.l.0R.NSTATEI 1l.EO.21 GO TO 7471 IFILOGI(I'.GC.5) GO TO 1544 IFIlOGCI 1'.N':.K.CR.I\STATEI II.NE.31 GO TO 7544 IFITJM~NII).GT.Xll Xl = TIi-IENII)

Page 52: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

270 APPENDIX

C

L = L + 1 NOoESM = I TSAVE = TSAVE + TIMENIII CSAVE = CSAVE + CoSTNIl1 PSAVE = PSAVE + PERF~III

7544 CONTINUE IFIL - 117533,7577,7555

7555 DO 7566 J=1,N~00E

IFILoGIII'.GE.51 GC TC 7%6 IFILOGOI II.NE.K.OR.NSTATEI II.NE.3) GO TO 7566 X4 = 0.0 X5 = 0.0 X6 = 0.0 IFITSAVE.NE.J.C.ANo.STIME.NE.O.O) X4 STIME*ITIMENIII/TSAVEI 1~ICSAVE.~E.~.r.ANC.SCOST.NE.O.O) X5 SCOST*ICOST~III/CSAVEI

IFIPSAVE.~E.C.C.ANo.SPERF.NE.O.OI X6 SPERF*tPERFNIII/PSAVEI X2 = )(4 + X5 - X6 IFI)(2.GE.UNFCRMI GO TO 7566 U,\jFURM = X2 NODESM = I

1566 cel\T INUE 1511 TIMESM = TI~ENINODES~)

IFIABSISTIM~).NE.1.CI TIMESM = Xl

C Ch£CK MAX STCFAGE ~ECUIRED 3F COST PERFORMANCE VE:TOR STORAGE AND C STORE THE ITER~TI(~ RESULTS AND LIST SPECIAL PRINTOUT IF WANTE~ C

1598 IFI~TAG.GT.M~.TAGI M.XTAG = NTAG ~CDETIICOUNTI = NOCES~ STORETIICGUNT,II = TI~ESM STJRETIICOUNT,21 = CCSTNINDDESMI C'LL OCCST ITIMESMI STJ~ETIICOU"T,31 = U~FCRM STJRETIICOUNT,41 = PoRFNINODESMI

I.IFIITRIICt.EQ."1 W~ITE IIDUT.75991 ICOUNT, NOOEIINOOESMl, 1"GDE21~ODESI'I, JSHC. ISTORETlICCUNT,Kl, K=I,41

7599 FO~r'lAT I iH , 15, IX, 2,\4, 113. 4G26.121 C C FI~D THE CRJTICAL-CPTIMUM PATH FOR THIS ITERATION, IF WANTED C

IFICRITI GO Te' 7922 IFIISTATINDDESMI.eQ.-ll Gn Te 7922 I SAVE = ">ODE S~· JCOU~T = JCJU~T + 1

16.( IC~IT~IISAVfl = IC~ll~IISAV[1 + I IFICTIME.':C.l.C1 SLACK~IISAVEI = r.-: IPATH~IISAVfl = KSTAR ·~STATEI ISAV~ I = 4 L = ',ARCIIIS~vCI IFIL.LE.cl GC TL 7655 M = 4

7611 TSAVE ".' CSAVE ' .. 0 i>SAV~ !J. ~ 007622 1=I.l K = NPUI~nllstv'" + 1-1 K = NSTORclKI (FIISTATEIKI 1[.Ml GC TO 7622 TSAvE = TSAV + TIMEAIKI CSAVE = CSAV + CCST~IKI PSAVE = ~SAV + PE~FAIKI

11>n. CC'HI~UE

Page 53: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM

C

J = 0 UNFORM = -St:TUP DO 1633 l=l.L K = NPOIIITlISAVEI + I - 1 K = NSTORCIKI IFIISTATEIKI.~E.MI GC TO 1633 X4 = 0.0 X5 = 0.0 X6 = 0.0 IFtTSAVE.~E.0.C.ANC.CTIME.NE.O.CI X4 IFtCSAVE.NE.D.t.ANC.CCCST.NE.O.CI X5 IFIPSAVE.NE.G.C.AND.CPERF.NE.O.tl X6 Xl = X4 + X5 - X6 IFIXl.LE.UNFCRMI GC TC 1633 UNFURM = Xl J = K

1633 CONT I NUE M = 2 IFIJ.EQ.CI GC TC 1611 ICRITAIJI = ICRIT~IJI + 1 IPATHAIJI = KSTAR IFICTIME.NE.l.CI GC TC 1644 SLACKAIJI = C.C WORKIJI = TI~EAIJI - UTIMEAIJI

7644 ISAVE = NCOEIIJI GO TO 76<';0

CTIME*ITIMEAIKI/TSAVEI CCOST*ICOSTAIKI/CSAVEI CPERF*IPERFAIKI/PSAVE)

271

C COMPUT~ THE SLACKS. START ~ITH THE WINNING TERMINAL NODE AND FIND C THE SLACKS FOR ThE INPUT ARCS AND THEIR LATEST STARTING TIME C

7655 IFISLAK) GO TO 1922 NSTATEINCDES~1 = 5 NI = NARCIINCO~SM) NP = NPOINTINODESMI 00 7611 K=I.NI L = NSTCR~I~P+K-l1 IFIISTATEILI.~T.11 GC TO 1666 SLACKAILI = -SETUP GO TO 1611

7666 IFISLACKAILI.NE.SETUPI GO TO 7671 SLACKAILI = TIMENINOCESMI - TIMEAILI WORKILI = TIMeAILI - UTIMEAll! + SlACKAll!

1677 CONTINUE C C COMPUTE THe SLACKS FCR THE REST OF THE NODES AND A~CS

C

C

KCOUNT = 0 76BB ICHECK = .TRUE.

DO 1844 ISAVE=l.NNCCE I = NNODE + 1 - ISAVE

C IF THIS ~ODE IS ACTIVE AND HAS NOT BEEN PROCESSED. PROCESS IT NOW C

C

IFINSTATEIII.EQ.51 GC TC 7844 IFINSTATEII!.NE.4.ANO.SLASKNII!.NE.SETUPI GO TO 1844 ICHECK = .FALSE. NP " NPOINTlII N I = 0 IF ( LOG III ) • N E. 1) N I = N AR C I( II

C IF THIS NODE IS A NC~-CRITICAL TER~INAL NOOE OR HAS BEEN ELIMINAT-C ED OR IS OF NO CCNSEQUENCE TO THE CRITICAL PAT~ ANALYSIS. WIPE

Page 54: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

272 APPENDIX

C IT OUT A~C ITS I~PUT NODES C

C

IFI~STATfl 1'.~~.CI GC TO 7619 I F I LOG II [I. G [.51 GO TO 1711 IFILOGO(lI.Gi.lllGC TC 1f>99 I F I L 0:;0 II I • "·EO. 11 GO TC 1711

1699 SLACKNIII = -SETUP IrINI.EC.01 GO TO 1844 00 17,10 K=I''''1 L = NSTOR~INP+K-l1

I1ve SL4CKAILI = -SETUP GG TO 7844

C IF T~E ACTIVE OUTPUT 4RCS OF THIS NODE ALL HAVE ~ON-INITIAL VALUES C FOR TH~IR SLACKS, CCMPUTE THE NODE SLACK C

C

1111 NO = ~ARC8111 UNFURM = SETUP 00 7722 Y,=I,r;(J M = NSTOREINP+NI+K-ll IFISLACKAIMI.c~.SCTUPI GO TO 7844 IFISLACKAIMI.cQ.-SETlP.GR.NSTATEIII.EC.41 GO TO 1722 IF(WORKIM).LT.UNFORMI UNFORM = wnRKIMI

7722 CCNT Jr.UE IF(~STAT~(Il.NE.4) GC TO 1733 UNFURM = TI~EN{I) GO TO 7744

1133 IF(UNFOR~.EC.SETUPI CC TO 7699 SLACK'l( I I = lNFC,RM - TII4ENII I

C COMPUTE SLACKS FOA ARCS FLOWING INTO NODES HAVING SPLIT NODE LOGIC C

C

7744 IFILOGIII).~Q.11 GC Te 7833 IF(LOGIIIl.G':.5) GO TO 78('\C

7755 DO 7799 K=I,NI L = NSTORlINP+K-ll IFI ISTAT=ILI.GT.ll GC TO 7717

7766 SL4CK4(L) = -~ETUP GC TO 7199

1111 IF(SLACKAILl.NE.SETUPl GO TO 7799 IFILOGIIl'.NE.4' GO TO 7788 IFITIMEA(LI.~~.TIMENII)) GO TO 1766

71R8 SLACKAILI = UNFORM - TIMEAILJ WORKILI = TI~EAILI - UTIMEAILI + SLACKAILI IFISL~CKAILI.LT.o.al SLACKAlll = -SETUP

1199 CONTINUE GO TO 7833

C COMPUTE SLACKS FOR ARCS FLOWING INTO NODES ~AVING SPECIAL NODE C LOGIC, EXCLPT IF THE ESCAPE ARC WAS USED, THEN TREAT LIKE SPLIT C

C

78ce M = NSTCREINP+NI+NC-ll IFIISTATEIMI.GT.ll GC TO 1155 DO 78ll K=l,'il M = NP + K - 1 L = NSTOREIMI IFIISTATEIU.GT.lI GC TO 7811 SLACKA(L) = -SETUP GC TO 1822

1811 IFISLACKAILI.NE.SETUPI GO TO 1822 M = NS TOR ElM +N I I

Page 55: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM 273

C IF THE ST~RTI~G TI~E CF THIS INPUT ARCS MATTING OUTPUT ARC IS THE C SAME .~S TIE NODE, (;SE "lODE SLACK, as!: USE OUTPUT ARC SLACK C

c

UNFORM = rl~L~tl)

IFtISTATUM) .GT.ll Ur-FCR!'! = TlMEAIM) - UTIMEAI!'!) Xl UNFORM~(.:OI

X2 = UNFGR!4 - Xl Xl = UNFGRM + xl X4 = SLACKAIM) IFITIMtNII).Gc.12.ANC.T1MENIII.LE.X3114 SlACKNII) UNFJRM = UNFC~~ + X4 SLACK,\Il) = U·.FORM - TI!'!EAll) wCRKIl) = TI~~AIL) - UTIME41l1 + SLACKAILI IFI~lACKAIL).lT.J.OI SLACKAIl) -SETUP

7822 CO,H I',U= 7833 IFINSTATEI I).iQ.4) NSTATEII) 5 7B44 CCf'.T1'WE

IFIICIIECK) GC TO 7866 KCOliNT = KCOUNT + 1 IFIKCOUNT.LE.NNODE) GC TO 768A Clll ERRCR 17855,leLK,IBLK,N~ARNI

SLAK = .TRUE. GC TO 7922

C R~VIE'" MI., MAX, AVERAGE, COt:NT AND TEMPORARILY STORE SLACK DATA C

C

7866 IFIITRACc.EC.31 GO Te 7?22 K = " 7877 K K + 1 I = ('

7888 I + 1 GO TO 17899,790l),K

7899 IFII.GT.NARCI GO TG 7877 M=ISLAKII) Xl = SlACKAl1I GO TO 7911

7900 IFII.GT.NNOOEI GO TC 7912 M = NSLAK I I ) Xl = SLACKNII)

7911 IFIM.LE.C.OA.Xl.EO.-SETUP.OA.XI.EO.+SETUPI GC TO 7888 IF(XI.lT.~MJ~IM)) ~~INIMI Xl IFIXI.GT.RMAXIM)I R~~XIMI = Xl SAVE (1'4) = SAVi:IMI + Xl JOBS (MI = JOIlS 1M) + 1 WRITE IlwF4) 1'4, Xl NRKS = NRKS + 1 GO TO 7838

C IF REQUESTED, COMPLTc THE COST-PERFORMANCE TIME INTERVALS C

7922 IFIITRACE.EQ.3.0R.NCPGAP.EQ.01 GO TO 7999 l = 2*NCPGAP DO 1988 1=1,~CPGAP K = NCPGAP + I WORK! II = O.V WORKIK) = O.C IFITIIII - STIMEI7933,7944,7955

7933 Xl = C.O X2 = 0.0 GO TO 7966

7944 Xl BceST X2 = BPERF

Page 56: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

274 APPENDIX

C

GO TO 1966 1955 CAll OCOST IT1IIII

Xl " UNFORM X2 = TlMESM

7966 CAll OCOST IT21111 Xl = UNFORM - Xl X2 " TlMESM - X2 IFIX1.lE.0.OI GO TO 1911 IFIX1.LT.CSMINIIII CSHINIII Xl IFIX1.GT.CSMAXIIII CSHAXIII Xl CAVEIII = CAVEIII + Xl KCOBSIII = KCOBSIII + 1 WORK II I = Xl

1977 IFIX2.LE.0.01 GO TO 7988 IF I X2.L ToPSM INII II P SM I NI II X2 IFIX2.GT.PSMAXIIII PSMAXIII X2 PAVE II I = PAVE III + X2 KPOBSIII = KPOBSIII + 1

7988 WCRKIKI = X2 WRITE IIWF21 IWORKIII. l-l.ll

C IF REQUESTED. MAKE A TRACE OF THIS ITERATION. ARCS FIRST C

7999 IFIITRACE.EQ.31 GO TC 8033 IFINTRIP.LE.CI GO TO 8233 00 8022 l=l.NTRIP J = ITRI P21 II IFIITRIP1IIl - 118022.8000.8Gll

8000 IFIISTATEIJI - 218022.8033.8033 8011 IFINSTATEIJI.GE.31 GC TO 8033 8022 CONTINUE

GO TO 8233 8033 W~ITE IIOUT,80441 ICOUNT. NOOEIINODES~I. NODE21NODESMI, JSEEO 8044CFORMAT 17HelTER =. 15. 20H OPT TERMINAL NOOE =. 2A4. 12H INIT SEfO

1 =, 1121 IFIINFCI GO TO 6066 WRITE (IDUT.8l55)

8055 FORMAT I1H+, 66X, 13rCOST INFLATED I 8066 IFIOISC) GO TU 8088

WRITE IIGUT.8(71) 8077 FORMAT I1H+, 81X, 15hCOST DISCOUNTEDI 8088 IFIINFP) GO TO 81CO

WRITE IICUT,8099) 8099 FORMAT I1H+, 96X. 13HPERF INFLATEDI 8100 IF(DISPI GO Te 8122

WRITE IIOUT.6111) 8111 FORMAT (lH+, 113X, l~HPERF DISCOUNTED) 8122 WRITE (IOUT,e133) ISTORETIICDUNT,KI. K=l.4) 8l33uFO~MAT 145H TIME. PArr-COST, OVERALL-COST. PERFOR~ANCE =, 4F21.41

IlH , 48X, 4HTIME, 30X, 4HCOST, 26X, 11HPERFORMANCEI l1H ARC NAME 2STATUS, ax, 5HSLACK, 31 lOX,7HPRIHARy,1X.I0HCU~ULATIVE))

DC 8188 1=I,NARC IFIISTATE{I).LE.O.A~C.IRROR.EQ.O) GO TO 818B IF( ISTATE{ I I.GT.ll GC TO 8155 WRITE IICUT,8144) IARClIII, IARC21I1, IPATHAIII, ISTATEII)

8144 FORMAT IIH , 2A4, IX, AI. IX, 13, F15.2, 6F17.2) GO TO Rle8

8155 IF(SLACK~I I).EC.+SETLP.OR.SLACKAII).EQ.-SETUP.OR.SLAK) GO TO 8166 "WRITE IICUT,8144) IARC1II),IARC211).IPATHAII),ISTATEII),SLACKAIII, lUTIMEA(I1, TIMEAIII, UCCSTAII), COSTAIII, UPERFAIII, PERFAII)

GO TO 8183 81660WRITE (ICUT,al11l IARCIIII, IARC?II), IPATHA"), ISTATEII),

Page 57: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM

C

lUTlMEAIII, TlMEAIII. UCOSTAIJI. COSTAIII. UPERFAIII. PERFAIII 8171 FORMAT 11H , 2A4. lX, Ai. lX, 13. 15X. 6Gl1.91 8188 CONTINUE

C NOW LIST OUT THE NCDES C

~RITE IIOUT.81991 81990FORMAT 111H NODE NAME STATUS. 8X. 5HSlACK. 13X. 4HTIME. 13X.

14HCOST, 6X, llHPERFORMANCE I 00 8222 l=l,NNODE IFINSTATEIII.EQ.O.AhC.IRROR.EQ.OI GO TO 8222 IFINSTATEIII.GT.21 G( TO 820e ~RITE lIOUT,81441 NOCElIlI, NODE211', IPATHNIII, NSTATEIII GC TO 8222

275

8200 IFISlACKNIII.EQ.+SETLP.CR.SlACKNII'.EU.-SETUP.OR.SlAKI GO TO 8211 OWRITE IIOUT,81441 NOCElIlI, NODE2111. IPATHNIJI, NSTATEII', lSLACK~III, TIMENIII, C(STNIII, PERFNIII

C

GO TO 8222 8211iJWRITE IICIUT,81711 NOCElIII, NODE2111, IPATHNIII, NSTATEIII,

lTIM[NIII, COSTNIII, FERFNIII 8222 CONTINUE

IFI IRROR.GT.C) RETUR~

C IF REQUESTED, STORE IhTERNAL NODE POINT AND INTERVAL STATISTICS C MINS AND ~AXS A~D ACCUMULATE fOR FINDING THE AVERAGES C

C

8233 IFIMODE) GO TO 8299 DO 8289 M=l,NHIST I = 0

8244 I = I + 1 IFll.GT.~~OO~) GO TC 8288 IFIISTATII) .N['~) GC TO 8244 IFI~STl>.TE(I).i::Q.O)GO TO 8288 CALL OCCST IliMENII)) WORKlll Tl~ENII) WORK(2) COSTNII) WORK(3) = UNFORM wCRK(4) = PERf Nil)

C CHeCK FOR ANe IF REQUESTED, COMPuTE PHERVAL IGAP) STATISTICS C

C

8255 I = I + 1 IFII.GT.NNOOfl GO TO 8266 IFIIST4T(I).~c.M) GO TO 8255 IFI '~STATEI I I.EQ.(' IGC TO 8288 CALL OC05T I Tll'ENI III WOil-KIll TII'LNII) - WORKIl) ~ORK(2) CCSTNII) - wCRK(2) WORK(3) = UNFl·PM - IICRK(3) WORK(4) = Pf>-(F'HI) - 100R)(14)

C REVIEW MI~, ~AX, ~VER~GE, COUNT ANO TEMPORARILY STORE HISTO. DATA C

8266 00 8217 K=1,4 IFlwnRKIK).LT.X~INIM,~I) XMINIM,KI WORKIK) IFI wORKI K) .GT. XMAX(M,K)) XMAXIM,K) WORKIK)

8277 HAVl(M,K) = h~VfIM,K) + WOR)(IK) ICBS 1M) = lOllS (M) + 1 IFIITR:'CE.EC.' .OR. ITRACE.EQ.3) GO TO 828R WRITE III/F3) M, WORKIll, WOPK(2), WOR~(3), WORK(4) 'IRK = ~J::\K + 1

82HH CCHINUE

Page 58: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

276 APPENDIX

C C TALLY THE ITERATION JUST COMPLETED AND CHECK fOR IT BEING THE LAST C

8299 ICOUNT = ICOUNT + 1 IFIICOUNT.LE.ITERI GO TO 6377 RETURN END SUBROUTINE OOARC (II IMPLICIT INTEGER*4(I-N)

QCO~MON EMARK(lll,SETUP,FI~T,OINT,FACTOR,STIME,SCOST,SPERF,CTIME,

lCCOS T, CPERF, 8T1ME, BceST, 8P.ERF, TI MESM, UNFORM, ITR I PH 22), ITR IP2 (221, 2KNTI61,INPT,IOUT,IPNH,IWFl,IWF2,IWF3,IWF4,lBLK,ITRACE,ICUT,ISEEO, 3IRROR,ISAVE,NOOESM,M_XTAG,ICOUNT,JCOUNT,NTRIP,ICORR,LCOMP,NWARN, 4NRK,NRKS,SLAK,MOOE,I~FC,INFP,OISC,OISP,CRIT,KGEN,"EO,SINGlE,DOUBLE OCOMMON/AReS/ASTORE( 28001,UTIMEA( 350),TIMEA( 350l,UCOSTA( 350), 1COSTA( 350I,UPERFA( 350l,PERFA( 35C),WORK( 350),ISTATE( 3501, 2NCOEII 350l,NOOEO( 35C/,ICRITA( 350hKEEPC( 350l,KEEPP( 3501, 31ARCli 35el,IARC21 35el,IPOINTC 3501,JPOINT( 3501,ISlAK( 350), 4KARC,lARC,MARC,NARC,ITALC,ITALP,ISTAR ~CO~MON/NCOES/TIMENI 2001,COSTN( 200),PERFN( 2COI,NSTORE( 54001, INODElC 2C,)I,NODE2( 2eCI,lOGI( 20CI,lOGO( 200l,NSTATE( 2001, 2NARCII 2GO),NARCO( 2cel,ISTAT( 2001,INSfAT( 200l,ICRITNC 2001, 3NPCINTI 200l,~SlAKI 200l,JUMP( 200I,KNOOE,LNOOE,MNOOE,NNOOE,MTAG, 4NTAG OCOMMONITABlE/TABlI3,3,31,TAB2(3,3,3I,TAB3(3,3,31,TAB413,3,3/, ITAB513,3,31,TA66(3,3,31,TAB7(3,3,31,LXCKC7I,MXCK(71,lYCKI71, 2MYCK(7),LlCK(7),MlCK(7)

DIMENSION IFIREI31 LOGICAL SLAK,MOOE,INFC,INFP,OISC,OISP,CRIT,KGEN,MEO,SINGLE,OOUBLE

C C THIS SUBROUTfNE CAlCLLATES TIME COST PERFORMANCE FOR ARCS AND C OET=RMINES THEIR SUCCESS-FAil STATUS, INITIALIZE C

C

UTlMEAII) = C.C UCOSTAlll = ~.C UPERFAI II = 0.C: J = IPOINTlII IFIJ.L~.01 GO TO 9333 IFIASTCREIJ+I'.lE.C.C' GO TO 9333 K = ASTCREIJ+lI + 0.C01 lFIREIU = 1<11"0 L = IFIRE( lI*lOG K = K - L IFIRE121 = Klle IFIREI31 = I< - IFIRE(21*lO

C Gt~~RATE THE TIME COST PERFOPMANCE VALUES FOR THIS ARC C

c

lOse = c IDSP = 0 DO 9322 Ml=l,J 00 9311 K=l,3 IFIIFIRE(K).~E.NNI GC TO 9311 ~NOX = EMARKlt:1 - FLCATI2*KI CAll SeEK IJ,cNCX) RANVAR = 0.( IFIITAlP.EC.CI GO TO S633 IFIINFC.A~O.INFP.A~C.CISC.kNC.OISP) GO TO 8311 L = ASTORE(ITALC+ITALP) + 0.0C1 IFIENOX.EG.E~ARKI411 IOSC L IFIENOC.E~.E~tRKI611 IOSP = L

Page 59: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM

C C

GENERATE THt: S TOCHAS TI C C1NTRIBUTION

8311 Ii",.. = l'

I' = ASTOREIITALC+II + O.COI Il IT ALC + 2 12 ITALC + 3 13 lTALC + 4 14 IT ~LC + 5

8322 MliM = "",.. + 1 IF(MMM.LT.ICJ~I GO T( 8344 CALL ERRllR 18333, IARCl I II, IAPC21 11,1'1 RETURN

277

83440GC TO 18399,84(0,841L,9444,3444,8455,8477,8455,8488,850(,8511, 18455,8555,8517,83551,M

C C CREATE A VAqIATE FRO" A DISTklBUTIDN ENTERED AS A HISTOGRAM c

C

8355 CALL RANDOM PR081 = 0.0 13 = lIAlC + !TAlP - 1 DO 8366 l=I2,13,2 I'M = l PR082 = P~OBI + ASTOREIMMI IFIUNFJRM.lE.PRCB21 GC TO 3317

8366 PROSI = PR082 GO TO 8385

8377 PROBI = IUNFeR,.. - PRCPII/IPRCB2 - PROSll 8388 UNFJRM = ASTCREII''''-ll + IASTCREII'M+11 - ASTCRfll'M-III*PROBl

GC TO 8622

C CREATE A CO~STANT VARIATE C

8399 UNFORM = ASTCREIIII GO TO ~622

C C CREATE A UNIFORM VARIATE C

C

8400 CAll RANDOM UNFURl' = ASTO~EIIll + IASTOREII21 - ASTOREIII11*UNFORM GC TO 8622

C CREATE A TRIANGUlA~ ~ARIATE C

8411 PROBI = A5TCREI121 - ASTOREllll TIMeSI' = IA5TOREI131 - A5TOl'tEIIlIIIPROBl CALL R:'NOOM IFIUNFORM.GT.TIME5MI GO TO 8422 TIMESI' = SQRT(TIHE5~*LNFORMI GO TO 8433

8422 TIMESI' = 1.0 - SQRTI1.O - TIMESH - UNFORM + TIHESM*UNFORMI 8433 UNFORM = ASTCREI111 t TIMESH*PROBl

GO TO 8622 C C CREATE A NORMAL OR LOGNORMAL-IM.EQ.51 VARIATE C

C

8444 CALL !\IORM UNFORM = UNFORM*ASTCREI141 + ASTOREIl31 IFIM.EQ.51 UNFORH = EXPIUNFORMI GO TO 8611

C CREATE A GAMMAIM.EQ.61, ERLANGIM.EQ.81 OR PASCALI~.EQ.121

C

Page 60: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

278 APPENDIX

C

8455 ISAVE = ASTC~c( 141 + C.OOI IFIM.GT.61 GO TO 846t TIMtSM = ISAVe TIM2SM = ASTCREII41 - TIMESM CALL R.l.NOOM IFIUNFGRM.GT.TIMESMI GO TO 8466 ISAVE = ISAV:: + 1

8406 CALL G~M

UNFORM = TIMESM/ASTCREI131 IFIM.E~.121 GO TO 8544 GC TO 3611

C CREATE A WEIBULL VARIATE C

C

8477 CALL RANDOM UNFORM = ASTORfllll + ASTJREI131*II-ALOGIUNFORMII**ASTOREII411 GC TO 8611

C CREATE A CHI SQUARE VARIATE C

C

8488 PROSI = ,.0 IFIASTOREI13l.GT.C.OI GO TO 8499 CALL NLlRM PROSI = UNFORM*UNFOR~

84~9 ISAVE = ABSI~STOREII3ll + 0.001 CALL GAM UNFORM = TIMcSM/O.5 + PRO~l GC TO f;611

C CREATE A ~ETA VARIATE C

C

85':0 ISAVE = ASTORU 131 + C.5 CALL GAM PROlll = T I"IESM [SAVE = ASTORcl[41 + C.S CALL GAl' UNFORM = PR031/lPRC81 + TIMESMI UNFORM = UNFOMM*IASTCREII21 - ASTOREIIlll + ASTOR~IIll GC TO l:l6ll

C CREAT~ A POISSON VARIATE C

c

8511 ISAVE = l' T I ME SM = 1. C

8522 CALL RANDOM TIMESM = TI"ESM*UNFCR~ IFITIM~SM.LT.ASTOREII311 GO TO 8533 ISAVE = ISAVe + 1 GO TO 8522

8533 UNFORM = ISAVE GO TO R6ll

C CREATE A PASCAL VARIATE C

C

8544 ISAVE = UNFORM UNFORM = ISAV~ GO TO A6U

C CREATE A BINOMIAL VARIATE C

8555 ISAVE = 0 MM = ASTOREII41 + O.CCI

Page 61: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM

C

CO 8566 L=I,"" CALL q\"OCM IFIU~F~RM.GT.ASTCREII]' I GO TO 8566 ISAVE = ISAV': + 1

851>6 CC"T I NUt I.J\FURM = (SAV:: GO TO '36 11

C CREATE A HYP~RGEO~ETR[C VlqlATE C

C

8577 PRGJI = ASToe (13) PRClB2 = ~STO~U 14' ~,'" = A~TCRE(ITALC+61 .. :'.~-;l

ISAVE = DC 860·: L=l,MM CALL ;l.6/11COP. I F I I.JNFl:RI'. G1 • PReBl I GC TO 8588 TIMESI' = I.e ISA"" = ISAIi': + 1 Ge TO <'Sq,

8588 TIMESM = 0.' 8599 PROBI = (P~012*PRGBI - TIM~SM)/IPROB2 - 1.el 86l~ PRO~2 = PROHl - 1.G

ur,FJRI1 = (S~V:

279

C PcqFOR~ CHECKS TH~N SUM NEW DEVIATE I~TO APPROPRIATE TCP VECTOR C

C

8611 IF! UNFL'RM.LT ."STGQEI 11I.OR.UNFOR".GT .ASTOREI 12" GO TO 8322 8622 IFIK.EU.l' UTIMEAII' UT[M~AII) + UNFO~M

IFIK.CC.21 U:;CJSTAIII UCOSTAIIl" UN FORM IFIK.EQ.3' UPERf'III = UPERFAIII .. UNFORM RANVA" = UNFm,M

8633 E~DX = ENOX - 1.0 CALL S=EK IJ,ENCX) IFIITALP.EO.)) GO TC 9311 IF(INFC.'NO.[NFP.ANC.CISC.A~D.O[SP' GO TO 8644 L = AsrCREIlfAlC+ITALP' + 0.(Cl IFlcNOX.EQ.E~~RKI511 10SC = l IFIcNoX.EQ.cMARK(71) IOSP = l

C GENERATE THe VARIABLE CCNTRIBUTICN C

c

8644 TIMESI' = 0.~ ITALP ITALC + ITAlP - 1 ITALC ITAlC + 9 L = 0 ISAIIE 0 PROB 1 SETUP DO 9300 N=ITAlC,ITALP,9 IFIISAIIE.EQ.1' GO TO 8655 IFIASTOREIN-7).EQ.2.CI GO TO 9300 IFIAST0REIN-71.EQ.-2.CI GO TC 9300

8655 00 8744 11=1,3 12 = ASTOREIN-7+2*ll) + O.COI 13 = N - 6 + 2*11 14 = ABS(ASTOREII31' + O.COI IFII2 - 418666,8722,8111

C LOAD TIME, CCST OR PERFORMANCE FROM A NODE OR AN ARC C

8666 IFIASTORE(131.GT.O.OI GO TO 8671 IF(NSTATE(141.NE.31 GC TO 8688

Page 62: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

280 APPENDIX

C C C C

8t.11 8688

8100

8711

8120

8722 8733

IFIIZ.EQ.1l IFIIZ.EQ.2l IFIlZ.EQ.3l GO TO 8133

UNFORM TIMENI141 UNFORM COST~1141 UNFORM % PERFN(141

IFI14.EQ.I.OR.ISTATEI14l.GE.Zl GO TO 8100 ISAVE = 1 IFCASTORECN-6l.NE.O.CI GO TO 930e CALL ERROR 18699,1ARClIIl,(ARCZCII,IBLKI RETURN IFtl2.EQ.1I IFC 12.EQ.ll IFC 12.EQ.31 GO TO 8733

UNFORM UNFORM UNFORM

UTI ME A(141 UCC UPERFAI141

LOAD THE RESULTS OF A PREVIOUS TRANSFORMATION OR LOAD A CONSTANT, THEN LOAD TRANSFCR~ATION VARIABLES K, Y AND l

IFI14.GT .01 GO TO 872r:: UNFORM = RANVAR GO TO 87B UNFORM = WORKI141 GC TO 8733

8744 C

UNFORM = ASTCREI13) IFlIl.cQ.lI X UNFORM IFlll."Q.2l Y = UNFORM IFII I.CQ.3) l = UNFOR~

C C

COMPUT~ THE VALUE OF THIS TRANSFORMATION

~~ = ASTCREC~-81 + C.OOI 1'1 = 11M IFIM.LE.501 GG TO 8755 M = M - 50

8755 IFIM.GI.t71 GU TO 9144 GGG TOI1788,8799,88CO,881I,8822,8833,8844,8855,8866,8877,8888,8899, 1890J,8~11,891I,8922,e933,8944,8955,8966,R977,8988,8999,9ceo,90l1,

290Z2.9~3~,9C44,9055,9C66,9D77.9088,9C99.9100.9111.9122,91331,1'1

8766 CALL ERROR '8717,1 ARClIlI, IARC21 II, "'HI RETURN

8788 UNFORM = X*Y*I GO TO nB8

8799 IFIl.E~.~.vl GO TO 8166 UNFORM = IX*Vlll GO TO 92813

88~C UNFORM = y*z IFIUNFOR~.2~.~.DI GO TO 8766 U~FORM = X/U~FORM GO TO 92e~

8RIl UNFORM = X*Y*l UNFORM = 1.:/UNFOR~ GO TO n~'l

8822 UN FORM = X+Vtl GC TO 1288

a833 UNFORM = X+V-l GO TO ne8

8844 UNFORM = X-Y-l GO TO 928lj

8855 U~FORM = -X-Y-l GO TO qUR

8866 UNFO~M = X*(Y+ll lie TO '1281'

8877 U~FORM = X*'Y-ll

Page 63: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM

GC TO 9288 8888 UNFORM = V+l

IFIUNFORM.EQ.(.OI GC TO 8766 UNFORM = X/UNFORM GO TO 92all

8899 UNFORM = V-Z IFIU~FORM.EQ.v.OI GO TO 8766 UNFORM = X/UNFORM GC TO 1288

8900 IFIV.LE.O.01 GO TO 8766 UNFORM = X*IVI**Z GC TO 9288

8911 UNFORM = V*l IFIUNFORM.LE.~.OI GO TO 8766 IFIM.EQ.14) UNFORM = X*AlJGIUNFORMI IFIM.EQ.1S) UNFORM = X*AlOG1~IUNFORMI GO TO n8f!

8922 UNFORM = X*SINIV*ZI GC TO n81l

8933 UNFORM = X*COSIV*Z' GO TO n81l

8944 UNFORM = X*ATANIV*ZI GO TO 9288

8955 PROBI = X PR082 = Y UNFORM = l'.';' GO TO 92~R

8966 IF(PROBl.EQ.S~TUPI GC TO 8766 IFIPROB1.GE.PRG821 U~FORM X IFIPROB1.LT.PPOB21 U~FORM • V GO TO naB

8977 UNF ORM = X IF(Y.lT.U~FOR~' UNFCRM Y IF(I.lT.UNFO~MI UNFCRM Z GO TO '~2a>!

89qa U\jFORM = x IFIY.&T.UNFORM) UNFORM Y IFIl.GT.U~FOqMI UNFORM Z

GO TO neg 89J9 UNFQRM = (X*Y)+l

liC TO n'lll 9U~C UNFURM = (X.Y)-l

GO TO neB 9011 IF(Y.E •• 0.0) GO TO 8766

UNFORM = (X/Y)+{ GO TO '1288

9022 IF(Y.Ew.~.GI GO TO 8166 UNfORM = (X/YI-I GO TO 'l2e~

9033 U\jFORM = (X~YI*l GG TO 'l2'l8

9~44 IF(l.E~.J.G) GO TO 8766 UNFORM = (X+YIII GO fa nSR

9~55 UNF0QM = (X-Yl*l GO TOi2?3

10&6 IF(z.E~.~.n) GO T~ 8766 UNFDRM = (X-Y)/Z GC TO ne~

}077 UNFJRH = X + IY~l) GC TO Olas

)088 UNFORM = X - (V-I)

281

Page 64: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

282 APPENDIX

GO TO 9288 9099 IFIZ.EO.O.OI GO TO 8766

UNFORM = X + IVIZI GO TO 9288

9100 IFIZ.EO.O.OI GO TO 8766 UNFORM = X - IVIZI GO TO 9288

9111 UNFORM = -X -v + Z GO TO 9288

9122 UNFORM = -X +V + I GO TO 9288

91H IFIV.EQ.O.O.OR.Z.EQ.C.OI GO TO 8766 UNFORH = X/V/Z GO TO 9288

C C INTEGERIIE THt TASLE LOOK-UP INDICES, THEN DO THE LOOK-UP C

9144 IX X + 0.5 1 V = V + 0.5 11=Z+0.5 M = M - 37 IFIM.LE.7) GC TO 9147 UNFORM = 0.0 GO TO 9150

9147 IFIIX.LT.LXCKIMI.OR.IV.lT.lVCKIMI.OR.IZ.lT.LICKIM)) GO TO 8766 IFIIX.GT.HXCKIM).OR.IV.GT.MVCKIM).OR.IZ.GT.MICKIMI) GO TO 8166

915GLGO TO 19155,9166,9111,9188,9199,9200,9211,9222,9233,9244,9255, 19266,92711,f"

9155 UNFORM = TASlIIX,IV,ll) GO TO 9288

9166 UNFORM = TAIl2IIX,IV,!l) GO TO n8~

9171 UNFURM = TAB31IX,IV, II) GO TO 128R

9188 UNFORM = TAB41IX,IV.IZl GO TO nea

9199 UNFORM = TAB51 IX, IV, IZ) GO TO n88

nee UNFORM = TAB61IX.IV,Il) GO TO nAg

9211 UNFOIHI = TAB7IIX, IV, II) GO TO 1283

9222 CALL SUB1IX,V,Z,UNFORM,KNTIl)) GO TO naB

9233 CALL SUB2IX.y,Z.U~FCR~,KNT(2))

GO TO '1288 9244 CALL SUB3IX.V,l.U~FORM,KNT(3))

GO TO n~8 ~255 CALL SUB4IX,V,l.UNFOR~,KNT(4)1

GC TO q283 9266 CALL SUR5IX,V.l.UNFCR~,KNTI~))

GO TO 92E~

9217 CALL SUBb(X.Y.l,U~FOR~,K~TI6)) C C SHOULD THf RrSUlTS CF THIS T~ANSFORMATION BE SUM ED INTO THE TIME, C COST OR PERFORMANCE VALUE BEING GENERATEn FOR THIS ARC. C

9288 IFtMM.LE.5CI ~C TO 9291 MMM = UN FORM UNFOC(r~ = ~,.~

92,9 IFIASTCR::I"-71.GT.".CI TIMESM L = l + 1

TIMESM + UNFJRM

Page 65: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM 283

IS~'1E : cl IooORK I L) : UNFOR~I

93GO CONTI"JLE C C STCRE THE '1AAIABLE CC"JTRIBUTION C

C C C

9311 9322

9333

9344

9355 9366

9377

9388

9399

9400

IFO<..EQ.ll IFIK.E'J.Z) IFIK.EC.3) CONTINUE

uri MEAl I I UCCSTAI [) UPlRFA I I I

UTIMEAIII ~ TIMESM UCJSTAII) ~ TIMESM UPERFAII) ~ TIMESM

CONTI"JUE IFINODEIII).EQ.CI GO TO CJ4L~'

STORE THE CU~ULATIVE VALUES AND DETERMINE THIS ARC'S STATUS

N : f.lODEIIII UNFORM • TI~ENINI

IFILOGIIN).LT.51 GC Te 9344 M • NSTOREINPGINT(NI~NARCII~I~NARCOINI-11

IFIM.EC ... II GC TC 1344 IF(TIM~A(I ).~[.SETUPI UNFOR~ = TIMEAIII T IMLAII I = UTlMEAI II + UNFORM IFIINFC.AND.INFPI GO TO 9317 IFIIDSC - 21g)55,CJ36b,9365 IF( IDS;> - 219377,936t,9366 PR031 = FINT*~IIUTIM~AIII/2.C + UNFORM - HTIMEI/FACTORI IFIIDSC.GE.21 UCOSTAIII = UCCSTAII)*PROBl IFIIDSP.GE.21 UPERFAII) • UPERFAII)*PROBI IFIDISC.ANO.CISPI GO TO 9399 IFIIDSC.cQ.ll GO TC 138R IFIIDSC.EQ.3) GO TC ~368

IFIIDSP.EQ.II GO TO ~388 IFIIDSP.NE.11 GO TO 9399 PRCBI • DINT~.IIUTIMEAIII/2.L + UNFORM IFIICSC.EW.1.OR.IOSC.EQ.3) UCOSTAIII IFIIDSP.EQ.1.OR.IDSP.EQ.31 UPERFACII CCSTAIII • UCCSTAII) + COSTNCN) PERFAI I 1 • UPERFA( I) ~ PERFNINI IFIJ.L~.OI GC TO 94Ct IFIASTOREIJ).EQ.l.O) GO TO 9400 CALL RANDOM IFIUNFaRM.L~.~STOREIJI) GO TO 9400 ISTATEI II 2 RETURN ISTATEI I I • 3 RETURN EI'<O SUB~OUTINE SvECT IMPLICIT INTEGER*4(I-N)

- BTl HE II FACTOR I UCOSTAI II/PROBI UPERFAI I) IPROBI

~CO~HON EMA~K(lll,SETUP,FI~T,DINT,FACTOR,STIHE,SCOST,SPERF,CTIME, ICCO~T,CPERF,BTIME,BCCST,BPERF,TIMESM,UNFORM,ITRIPl(221,ITRIP2(221, lKNTI6I,INPT,IOUT,IPNH,IWFl,IWF2,IWF3,IWF4,IBlK,ITRACE,ICUT,ISEED, 3IRROR,ISA'IE,NODESM,M~XTAG,ICOUNT,JCOUNT,NTRIP,ICORR,lCOMP,NWARN,

4NRK,NRKS,SlAK,MODE,I~FC,INFP,OISC,DISP,CRIT,KGEN,MED,SINGLE,DOUBLE OCOMHON/ARCS/ASTORE( 2eOO),UTIHEAI 35CI,TIMEAI 350l,UCOSTA( 3501, lCOSTAI 35(lI,UPERF4( 3S0l,PERFA( 350l,WORKI 35(;),15TATE( 3501, 2NOOEI I 3501,NODEO( 350 I, ICRITAC 3S0 I,KEEPCC 3501,KEEPPI 3501, 3IARCl( 350),IARC2! 3SCI,IPOINT! 350l,JPOINTI 350),ISLAK( 3501, 4KARC,LARC,MARC,NARC.ITAlC,ITAlP,ISTAR OCO~MON/NOOES/TIMENI 200l,COSTNC 200),PERFNC 20(l),NSTOREC 54001, INODEll lOO),NOOE2( zeCI,LOGI! ZOOl,lOGOI 200l,NSTATEI 2001, 2NARCII lOOl,NARCO! zeol,ISTAT! ZOOI,INSTATI lOOl,lCRITNI 20tl.

Page 66: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

284 APPENDIX

3NPOINT( 2SUI ,N~LAK( ~COI,JUMPI 2CO),KNDoE,LNOCE,MNOOE,N~ODE,MTAG,

41HAG LOGIC~L SLAK,MODE,INfC,INFP,OISC,DISP,CRIT,KGEh,MED,SINGLE,DDUBL~

C C THE FUNCTION THIS SUeRCUTINE PERFORMS IS THAT OF STORING ARC C AOD~ESSES USED IN CALCULATING NODE COSTS ANC PERFORMANCES C

C

ISTAR = " ISUM = ITALC + ITALP + 2 IF( ISUM.LE.21 RETURN I = ISUM + NTAG IF(I.LE.~TAGI GO TC J455

C THIS SEGM~NT REORGANIZES THE AREA OF NSH!RE OEDICHED TO STORING C ARC ACDRES~ES USEC IN CALCULATING NODE COSTS AND PERFORMANCES C

C

ISTAR = KNODE + 1 IE:'lD = NHG NTAl; = KNODE K~Y = 2 00 1433 I=ISTAR,I~NO

CC ~411 J=l,NARC IF(ISTATE(JI.LE.11 GC TC 9411 IF(I.NE.JPOINTIJI I GO TO 9411 JPCINTIJI = NTAG + 1 KEY = 1

9411 CONTINUE IF( NSTCREI I I .LQ.-ICC I GO TO 9433 GC TO (9422,94J31,KEY

9422 NTAG = NTAG + 1 NSTOREINTAGI = NSTOREI I)

9433 IF(NSTCRcll'.~Q.-192' KEY 2 I = ISUM + NTAG IFII.Lc.MTAGI GO TO S455 CALL ERROR (9444, IBLK, 1I3LK, JlllKI RETURQ

C LOAD THE VECTOR OF ARC ADDRESSES C

9455 ISTAR = NTAG + 1 IF( ITAlC.LE.:I GO TC H77 DO 1466 l=l,ITALC NTA(; = NUG + 1

9466 NSTORE(NTAGI = KEEPCIII 9477 NTA(; = NTAG • 1

NSTORE(NTAGI = -991 IFIITALP.LE.OI GO TC 9499 DO 9489 l=l,ITALP. NUG = NTAG • 1

9488 NSTOREINTAGI = KEEPPIII 9499 NTAG = NTAG + 1

NSTOREINTAGI = -992 RETURN END SUBROUTINE 1~ITAlIlI

IMPLICIT INTEGER*411-NI uCD~MCN/ARCS/ASTOREI 2800),UTIMEAI 3SDI,TIMEAI 35D),UCOSTAI 3501, 1COSTAI 350l,UPERFAI 350l,PERFAI 350l,WDRKI 3501,ISTATEI 350), 2NODEII 350l,NOOEOI 35CI,ICRITAI 350l,KEEPCI 350l,KEEPPI 3501, 3IARC11 350l,IARC21 3501,IPCINTI 350),JPOINTI lSOl,ISlAKI 3501, 4KARC,lARC,MARC,NARC,ITAlC,ITAlP,ISTAR ~CO~MON/NODES/TIMENI 200),COSTNI 200l,PERFNI 2COI,NSTOREI 54001,

Page 67: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM 285

C

li\1GDElI 2::,),I\CDc21 2(':),LOGII <"'r),LOGOI 20C),~SUTEI nul, 2NARCII ZC(),\~RCOI 2C r ),ISTATI 2CC),INSTATI 2~G),ICRITNI 200), 3~POINTI Z0l),NSLAKI 2CO),JUMPI 2cr).KNODE,LNonE,MNODE,~~ODE,MTAG,

4~HA(,

C I~ITAL l,jITI~LIlES A~ A~C ANV ITS OUTPUT NGDE, IF THIS ARC ~AS

C P~OCESSEC AND IS NCW BEI~G CONSIDERED FOR REPRJCESSI~G, ElIMI-C NATE IT FRCM THE CCST-PE~FCR~ANCE CALCULATICNS VECTGR C

C

M = NOCECIl) IFIISTATEIl).~f.-I) ~STATEIM)

IFIISTAEIU.'Q.I) G( TO 1122 1'1 = KNODe + 1 DC 1111 I=M,l\lAG

1111 IFCjSTCRcl I) ."C.L1 I\STOPEI I) = -iC'C 1122 JPOINTIl) •

ISTATEIll RETUR'~

END SUBkOUTIN~ OVECT IKE',IFI~ST,l,XSAVE,TSAVE) IMPLICIT INTEGER*4II-N)

LCC~MON EM~Rkl~I),SETLP,FI~T,DINT,FACTrR,STI~E,SCnST,SPERF,CTIME,

ICCCST,CPoRF,OTIME,BCCST,BPcRF,TIMESM,UNFORM,ITRIPI122),ITRIP2122), 2 KNT (6) , I,~PT , I GUT, I PNh I WFl , I WF;>, I WF 3, I ~F 4, I B LK, I n AC E, I CUT tI SE ED, 3IRROR,IS~VE,I\Uf)ES~,~~XTAG, IC(UNT,JCOUNT,NTRlr,ICORR,lCOMP,NWA~N,

4NRK,NRKS,SLAK,MODE,I~FC,I~FP,DISC,DISP,CRIT,KGEN,MED,SI~GlE,DOU8LE

~CO"MON/AR.CS/ASTOR::I 2e(j~),UTIMEA( 35C),T1MEAI 350),UCOSTAI 35(\), ICOSTAI 35C) ,LPERFAI i50l,PERFAI 350l,rlORKI 350),ISTATEI 350), mODEl I 350),:'<CDf:OI 35C),ICRITAI 350l,KEEPCI 35('),I<EEPPI 3501, 3IARClI 350)"ARC21 35C)t1POINTI 35C),JPDINTI 35C;)t1SlAKI 3%), 4KARC, LARC, "ARC ,NARC, IT ALC, IT ALP, IS T A~ UCOMMON/NODES/TIMENI 2CCI,COSTNI 2001,PERFNI 200l,NSTOREI 54jO), INODell 20:\),NODE21 2CC),LDGII ZOCI,lOGO( 20C),NSTATEI 200), ~NARCII Zcev),f\ARCOI 2'_O),ISTATI 200l,INSTATI 2CC),ICRITNI 20,,), 3NPOINTI 2C0) ,~SLAKI 2CO),JUMPI 202I,~NGDE,lNOOE,MNOOE,NNOOE,MTAG,

4NTAG LOGICAL SLAK,MOOE, INfC,INFP,OISC,[,ISP,CRIT,KGcN,MEO,SINGlE,DOlJBLc INTEGER*LKE1

C THIS SUBROUTI~E PRUN~S ARCS AND DEVELOPS COST (FI~ST HALF) AND C PERFORMA~CE ISEC(~[ HALFl VECTORS (SEE SUBQOUTINE HELPDV) C

GO TO 11133, 12111,KE'I' 1133 IFIICUT.GT.ll GO TO 1144

IFITIMEAIL)-LTIMEAIL).LT.TSAVfl GO TO 1144 ISTATEIl) = -I GC TO 1I5?

1144 IFIUCOSTAIL).~E.O.O) CALL HElPDV (l,l,TSAVE,XSAVE) 1155 I = JPOINTIl)

XSAVE = XSAVt + BCOST IFII.LE.v) RETURN

1166 K = NSTOREI I) IFIK.EQ.-ICl) GO TO 1200 IFIK.EQ.-991) RETURN IFIITALC.EC.~.OR.IFIRST.EQ.II GO TO 1188 DO 1177 J=I,ITAlC IFIK.EJ.KEEPCIJ)) GO TO lZ0C

1177 CONTIIIIUE 1188 IFIICUT.GT.I) GO Te 1199

IFITIMcAIK)-UTIMEAIK).lT.TSAVEI GO TO 1199 ISAVE = I CALL l'lITAlIt<)

Page 68: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

286 APPENDIX

GO TO 1200 1199 CALL HElPOV 11,~,TSAVE,XSAVEI 1200 I ,. I + 1

GO TO 1166 1211 IFIICUT.GT.11 GO TO 1222

IFITIMEAILI-UTIMEAIl'.lT.TSAVEI GO TO 1222 ISTATEIlI = -1 GO TO 1233

1222 IFIUPERFAILI.NE.O.OI CALL HELPO~ 12,l.TSAVE.XSAVEI 1233 I = JPOINTIlI

XSAVE = XSAVE + BPERF IFII.lE.OI RETURN

1244 IFINSTOREII'.EQ.-991' GC TO 1299 I = I + 1 GO TO 1244

1255 K = NSTOREIII IFIK.EQ.-1001 GO TC 1299 IFIK.EQ.-9921 RETURN IFIlTAlP.EQ.O.OR.IFIRST.EQ.11 GO TO 1271 00 1266 J=I.ITALP IFtK.EQ.KEEPPIJII GO TO 1299

1266 CONT I NUE 1217 IFtICUT.GT.lI GO TC 1288

IFtTIMEAtKI-UTIMEAIKI.LT.TSAVEI GO TO 1288 ISAVE = 1 CAll INITALIKI GO TO 1299

1288 CALL HELPDV 12,K.TSAVE.XSAVEI 1299 I = I + 1

GO TO 1255 END SUBROUTINE HELPDV IKEY.L.TSAVE.XSAVEI IMPLICIT I~TFGER*411-~1

OCOMMON EMARKIll),SET~P.FI~T,DINT,FACTOR,STIME,SCOST,SPERF.CTIME, lCCOST.CPERF.BTIME,BCCST,BPERF,TlMESM,U~FORM.ITRlPI1221,ITRIP2(22),

lKNTt 6 I, I NPT, lOUT. I PM·. IWFI. hiF2, IWF). IWF4. lBLK, IHACE. ICUT, I SEED, 3IRROR.ISAVE,NODES~,~~XTAG,ICOUNT,JCOUNT.NTRIP,ICORR,LCO~P,NWARN,

4NRK,NRKS,SLAK,MODE,INFC,I~FP,DISC,DlSP,CRIT,KGEN,MED,SINGLE,DOUBLE CCO~MON/ARCS/~STOREI 28(1CI,UTIMEAI 3501,TIMEAI 35CI,UCOSTAI 3501, 1COSTAt 350l,UPERFAI 350),PERFAI 350l,WORKI 35C),ISTATEI 350), 2~OCEI( 35~),NOOEOt 35CI,I:PlTAI 350l,KEEPCI 35CI,KEEPPt 35CI, 31ARClt 35'J),l4RCZ( 35CI,IPCIt-.TI 350l,JPOINTt 350),ISLAKI )!)JI, 4KARC,LARC,MARC,NARC,ITALC,ITALP.ISTAR ()COMMON/NODESITIME'l1 2CCI,:OSTNI 2')GI,PERFNI ZOCI,NSTOREI 54CO), 1NODElI 20GI,NCDEZI 2t;:)I,LJGII 20CI,LOGOI 20C),NSTUEI 20al, 2NARCII 2L.}I,NARCOI Z:OI,ISTATt 2Cll,I~STATI 200l,ICRITNI ZCOI, 3NPOINTI 20CI,~SLAK( 2CCI,JUMPI 20CI,KNODE,LNCOE,~NODE,NNODE,MTAG,

4NTAG LOGICAL SLAK,~ODE,I~rc,INFP,CISC,OISP,CRIT,KGEN,MED,SINGLE,DOUBLE

C C THIS SUBROUTINE ADJUST AR: UNIT COST AND PERFORMANCES FOR PARTIAL C VALUES FC~ THOSE ARCS WHOSE COMPLETION TIME EXCEEOS THE CUTOFF C TIME. IT ~LSC CR£ATES VECTORS OF CO~T At-.O PERFORMANCE ELE~ENTS C UF ARCS R"~UIRcD TO BE CO~PLETEO BEFORE PReCESSING THE AKC C UNDER CO~SIDERATION ICJST FIRST HALF AND PERFORMANCE SECOND C HALFI C

GO T'l 113(Jv, l3221,KEY 1300 IFtICUT.EC.~.OR.ICUT.2Q.2.'lR.TIMEAIl'.LE.TSAVEI GJ TO 1311

COSTAILI = eCSTAIL) - UCOSTAILI UCOSTAIL) = UCOST.\(L 1*1 1.r. - I tTIMEAILl - TS~VEI/UTIMEAtLlII TIMEAILI = TSAVE

Page 69: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM 287

CCSTAIl) : CCSTAIl) • UCOSTAIll 1311 ITAlC,: ITAlC • 1

KEEPCIITAlC) : l XSAvE : XSAvE • UCCSTAIll RETURN

1322 IFIICUT.EQ.C.OR.ICUT.EQ.2.0R.TIMEAIl'.lE.TSAVE) GO TO 1333 PERFAIL) : PERFAIL) - UPE~FAILI

UPERFAILI : UPERFAILI*ll.j - IITI~EAILI - TSAV~I/UTIMEAILI)I

TlMEAIU = TSAVE PERFAIlI = PERFAIL) + UPERFAILI

1333 ITALP = ITALP • 1 KEEPP( ITALPI = l XSAVE = XSAVE • UPERFAIL) RETURN END SUBROUTI~E DCGST ITCPITI IMPLICIT INTEGER*411-NI

OCO~MON EMARK(lll,SETUP,FI~T,DINT,FACTOR,STIME,SCDST,SPERF,CTIME,

lCCOST,CPERF,BTIME,ACCST,BPERF,TIMES~,UNFORM,ITRIP1(22I, ITRIP2(221, 2KNT (61, INPT, lOUT, I PNI1, I WF 1 ,I WF 2, IWF 3, IWF4, I BLK, ITRACE, I CUT, ISEEO, 3IRROR,ISAvE,NOOESM,MAXTAG,ICOUNT,JCOUNT,NTRIp,ICORR,LCOMP,NWARN, 4NRK,NRKS,SlAK,MODE,II\FC,INFP,OISC,OISP,CRIT,KGEN,MEO,SINGLE,OOUBU' 0COMMON/ARCS/ASTORE( 2eOO),UTIMfAI 35DI,TIMEAI 350),UCOSTA( 350), lCOSTA( 3501,UPERFAI 350l,PERFAI 3%),WORKI 35C),ISTATE( 350), 2NODEI( 3501,NODEO( 3SCl,ICRITA( 3!lO),KEEPC( 3S0),KEEPPI3S0), 3IARC1( 35JI,IARC2( 35C),IPDINT( 350),JPOINT( 350),ISLAK( 350), 4KARC,LARC,MAKC,NARC,ITALC,ITALP,ISTAR uCCf'MON/NCDES/T[MEN( 200),COSTN( 20t»),PERFN( 20(ll,NSTORE( 5400), 1NOOEl! 2C0),r.ODEZ( 2COI,LOGII 2CC),LOGO( 2UO),NSTATE( 200), 2NARCI( Z<'::JI ,l\lt.RCOI 2CO)tlSTAT( lC(),IrtSTATI ntJ),ICRITN( ZOOI, 3NPOINTI i00),NSlAKI ZOO),JUMPI lOOI,KNODE,lNOCE,M~ODE,NHOOE,MTAG,

4NTA;' LOGICAL SlAK,HOOE,INFC,INFP,OISC,DISP,CRIT,KGFN,MEO,SINGlE,DOUBLC

C C THI~ SUBRCUTI~E CALCULT~S WHAT IS REFERRED TC AS OVERALL COST. C THIS IS CALCULATEC FCR NoefS AT THE TIME THEY ARE COMPLETED AND C FOR TH: TIME AN ITERATION IS COMPLETED •. ITERATION COMPLETICN C TIME IS ~CT NECESSA~IL' ThE TIME AT wHICH THF WINNING TERMINAL C NODE w~s CCMPLETEC. TeRIT [S THE ~OOE OR ITERATION TIME. C

UNFJRM = HeeST T1"~SM = BP!"~F DO 1377 1= I,N.~RC IF(NCDEI(I).~ •• O) GO TO 1377 IF(ISTATE(I).LE.Cl GC TC 1377 J = NODE I ( II IF(LOGI(J).L~.41 STA~T = TIMENIJI IF(,-CGII n.GL4) START = TI,.EAII) - UT[MEA( II IF(START - TC~[T)1355,1344,1377

1344 IF(UT[ME~(I'.GT.O.~1 GO TJ 1377 13j5 RAT[O = 1.,

IF{TIM~'(II.Lf.TCRIT.CR.ICUT.EQ.0.CP.ICUT.EC.21 GO TO 1366 RATiO (TCR[T - STA~T)'UTIMEA(I)

1366 XCCST = U(OST~(I)~RATIO XP::P.F : L.P~PF" I II"RATIC UNF~RM • UNFGRM • KCCST TIM~SM = TIM'cM + XP<RF

1377 CC'" l'llUE Rc TuR.\l ,,'10 SUBRCUT I'-/': :u',r;OM I"PLICIT [W:,;E,,(*4II-N)

Page 70: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

288 APPENDIX

OCO~MON E~ARK(11I,SET~P,FINT,DINT,FACTOR.STIME,SCOST,SPERF,CTIME, lCCOST.CPERF,BTIME,BCOST,BPERF,TIMESM,UNFORM,ITRIP1(221,ITRIP21221, 2KNTI61,INPT,IOUT,IPNH,IWF1,IWF2,IWF3.IWF4,IBlK,ITRACE,ICUT,ISEED, 31RROR,ISAVE,NODESM,M.XTAG,ICOUNT,JCOUNT.NTRIP,ICORR.lCOMP,NWARN, 4NRK,NRKS,SLAK,MODE,INFC,INFP,OlSC,OlSP,CRIT,KGEN,MED,SINGlE,DOUBLE

LOGICAL SLAK,MODE,INfC,INFP,OISC,OISP,CRIT,KGEN,MED,SINGlE,DOUBlE C C THIS SUBROUTINE GENERATES UNIFORM DEVIATES ON AN IBM 360 MACHINE C IN THE EVENT THIS PROGRAM IS PUT ON SOMETHING OTHER THAN.360 C GEAR, ANOTHER UNIFORM GENERATOR MAY BE REQUIRED. ISEED CARRIES C THE SEED UTILIZED TO MAINTAIN AND CREATE NEW UNIFORM DEVIATES. C UNFORM CARRIES THE UNIFORM DEVIATE. ITHIS IS IBM'S RANDU.I C

C

IFIKGENI GO TC 1399 ISEED = ISEED*65539 IFIISEED.GE.OI GO TO 1388 ISEED = ISEEC + 2147483647 + 1

1388 UNFORM ISEED UHFORM UNFORM*.465t613E-9 RETURN

C PLACE A SECOND (.! TO 1 UNIFORM RANDOM NUMBER GENERATOR H"RE C

1399 UNFORM = URA~11I RETURN END SUBROUTI N:: NORM IMPLICIT INTEGER*4II-~1

0COMMON EMARKIlll,SETUP,FINT,UINT,FACTOR,STI~E,SCOST,SPERF,CTIME, lCCOST,CPERF,BTIME,BCOST,8PERF,TIMESM,UNfORM,ITRIP1122I,IT~IP2(22), 2KNT(6),INPT,IOUT,IPNH,lwfl,IWF2,IwF3,IWF4,IBLK,ITRACE,ICUT,ISEEO, 3IRRQR,ISAVE,NODES~,~AXTAG,ICCUNT,JCOUNT,NTRIP,ICORR,LCOMP,NWARN, 4NRK,NRKS,SLAK,MOD~,I~FC,I~FP,DISC,nISp,CRIT,KG:N,MED,SINGLE,DOUBLE

LOGICAL SLAK,MODE,INFC,INFP,CISC,DISP,CRIT,KGEN,MED,SINGLE,DOUBLE CAll R AND')M T IMESM = U:-.IFIJRM CALL RAND:JM UNFORM = (1-2.G*ALCG(TI~ESMI)**O.5)*(COSI6.281*UNFORM)1 RETURN ENe SUBROUT I N<: GMt IMPLICIT INT~GER*411-~1

~COMMON EMARK(111,5ETLP,FINT,OINT,FACTOR,STIM~,SCDST,SPERF,CTIME,

lCCDST,CPtRF,~TIME,8CCST,BPERf,TIMES~,UNFORM,I1RIPlll2),ITRIP21221,

2 KNT I 61 , II>PT , I CUT, I PM-., 1 WFt , I WF2, IwF3, IWF4, IBLK, 1 T~ ACE, I CUT, 1 SEED, 31qRUR,ISAVE,NGDES~,~AXTAG,ICCUNT,JCOUNT,NTRIP,ICORR,LCO~P,NWARN,

4NRK,NRKS,SLAK,MODE,I~fC,I~FP,OISC,OISP,CRIT,KGEN,MED,SINGLE,DOUBLE

LOGICAL 5LAK,MODE,I~FC,INfP,CISC,D[SP,CRIT,KGEN,MEO,SINGLE,DOUBLE

TlMi.SM = J.'J DO 1411 1=1,ISAVE

14'jl! CALL RANDO'I IFIUNFJRM.LT.; .• 10-771 GC Te 140( UNFJRM ALQG(UNFOR~)

1411 TIMESM = 11~cSM - U:-.IfCR~

R~ TU~·' E:W SU8ROUTI~E DUTFLO I !'PlIC IT I'IT <:GER*4 I J--N I

~CO~MON EM'RK(ll"SETLP,FJNT,CINT,FACTCR,STI~E,SCOST,SPERF.CTIME, lCCQST,CPEqf,~TIME,BCCST,~PERF,TIMfSM,UNFnR~,ITRIPI122I,ITRIP2Il21,

2KNTI61,1~~T,IOUT,IPNr,IWF1.lwF2.IwF3,IWF4,IBLK,ITRACE,ICUT,ISEED,

31 RRJR, I SAvE, \00.05/1 ,,, ~x TAG, ICCUNT ,JCnUNT, NTR I P, ICO~R, LCOMP, No/ARN,

Page 71: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM 289

4NRK,NRKS,SLAK,MOOE,INFC,I~FP,OISC,DISP,CRIT,KGEN,MEO,SINGLE,OOUBLE

CO~MON/TRUCK/?DFI241,COFIZ4',SIOEI251,AVE,STD,TOS >iC OMMCNITR I Al 51 STORET I IIJOJ,4 I, TERM flO ,f:\ 1 ,KPO PH ( 1C' I, NODElI 1C1)0), 1MTERM,NT[RM,~ITER,IT~R

OCOMMON/ARC5/ASTOREI 2eOOI,UTIMEAI 3501,TIMEA( 350),UC05TAI 350}, lCCSTA( 351)1,UPERFAI 3501.PERFA( 350J,WORK( 35CltlSTATEI 35Cl, 2NODEII 35CI,NOOEOI 35C},ICQITA( 3501,KEEPCI 350),I(EEPPI 350}, 31ARClI 350)'[ARCZ! 35CltlPOINTI 3501,JPOINTI 35C}t1511IK! 350}, 4KARC,lARC,MARC,NARC,ITAlC, ITAlP, ISTAR OCOMMONINOOES/TIMENI 2CO),COSTN( ZC~),PERFNI 200),NSTOREI 54001, INOOEl! 2C01,NOOE21 2(CI,lDGII ZOCI,lCGCI 2CC),NSTATEI 2JOI, 2NARCII 200),NARCOI 2~OI,15TATI 20GI,INSTATI 2CO),ICRITNI 20C), 3NPCINTI 2DO),NSlAKI 200l,JUMPI 2CCI,KNODE,lNOCE,MNODE.NNODE,MTAG, 4NTAG CCOMMON/INTER~/XMINI2C.41,XMAXfZO.41,HMINI20,4),HMAXI2J,4),

IHAVEI20,4),IC3S120),'~IST,NHIST 0COMMON/5LACK/RMINI20I,RMAXI2CI,5MINI20I,SMAX(20) ,SAVE(201, IJ08S(20),MSLACK.NSlACK CCOMMON/CPGAP/TIIIO),r21ID),CCNFLIICI,CONFSIIQ),CAVEIIO),eSMINIIGI, Ie SMAXI 10 1 ,CH" I NI 10) ,CHMAXf 10 I. PAVE ( 10 1 ,PSM I N 11 G) ,PSMAX (10) , 2PHMINll0),PHMAXIIC),KeOBS(IGI.KPORS(10),MCPGAP,~CPGAP.ICPGAP

COMMON/MEDAN/ll IJOO).XMED,KCUNT CDIMENSION HSTDI20,4), HTOSI2C,41. HISTI20,4,25), AB5AII0), IITCP(4), ITABCI7,4)

lOGICAL ~LAK,MOOE,I~FC,INFP,OISC,DISP.CRIT.KGEN,MED,SINGlE,OOU8lE

DATA IASTR. I TC P/IH*,4HTi ME ,4HeOST ,4HCOS T ,4HPERFI DATA ABSA,IC1,IC2/.1,.2,.3,.4,.5,.6,.7,.8 •• 9,1.O,4HCOMP,4HSITEI

e C LOAD THE TA8LE FOR SELECTIVELY PRINTING TIME AND/OR pATH COST C AND/OR OVERALL eCST ANO/OR pERFORMANCE FOR REQUESTED INTERNAL C AND TERMINAL NOCES e

DO 1422 1=1,17 DO 1422 J= 1 , 4

1422 ITABII,J) 1 IlABl1,21 () ITABll')) C ITABIl,4) ~

IT AB I 2.11 .: ITABI2.31 ;; IT AtlC2 ,4 1 0 ITABl3,lI C' ITABI3,2I = (; ITAS(3,41 C ITABI4,11 " (., ITAB14,21 C ITABI4,31 C ITABI5,3) U ITABI5,4) C llABI6,2) C ITABI6,4I 0 ITA8f7,z) " \; ITAB17,31 " (; ITABI8,1) J ITABIB,4) 0 ITAB(9,1I G ITAB(9,31 C ITABIlO,l) = " ITABIIO,21 G ITAB11l.41 (I

ITABCl2,3) !)

I TABIl3,21 = L

Page 72: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

290 APPENDIX

C

ITABI14,l' lTABIl5,l, = l I TABIl5,2' = ~ !TAI3115,3' !TABI1S,4' = I

C THIS SU8QOUTIrlE DIRECTS THE LISTING OF THE SI~ULATION RESULTS C FIRST TASK, IF THIS RU~ ISN'T A DEBUG RUN, FINISH THE SLACKS C

IFIIT~~CE.EC.3' GO TC 2622 ICUT = C CRIT = .FALSE. IFI5LAK' GO TO 1622 00 1444 I=l,NSLACK IFIJOBSI 1'.LE.ll GO TO 1444 DC 1433 J=i ,25

1433 HISTII,I,JI = t.e HSTOIltlJ = c.e HT OS I I ,11 = '';. C IFISMI~III.EC.+SETUPI SMINIiI = RMINIII IFISMHIII.U;.-SETUP' SMAXII' = RMAX(II SAv~II' = SAVEII'/FLO~TIJJBS(III IFIRMI:"ollll.EC:.RMAXII ','SAVEll' = RMINI II

1444 CONTINUE C C COMPUTf TH~ SWUARE FRCM THE MEAN AND FILL THE HISTOGRAMS C

C

IFIITRACE.EQ.(.GR.~RKS.EQ.01 GO TO 1500 !TALC = ( REwiND I"F4

1455 READ I IwF4' ~, X IFIKMINIMI.EQ.RMAXIM" GO TO 1488 L = 1 IFlx.LT.SMINIMIl GC Te 1477 L = 24 IFIX.GT.SMAXIMI' GO TO 1477 UNFORM = ISMAXIM' - S~INIMII/22.0 TIMESM = SMINIMI + U~FORM DO 1466 ISAVE=2,23 L = ISAVi IFIX.LT.TIM~SMI GC T( 1477

1466 TIMESM = TIMESM + UNfORM 1477 HISTIM.l,LI = HISTI~,l,LI + I.C

UNFORM = SAVEI~1 - X UNFORM = UNFOKM*UNFoRM HSTDIM,II = PSTDIM,11 + U~FORM HTOSIM,ll = HTeSIM,ll + UNFORM*UNFORM

1488 ITALC = [TALC + 1 [FIITALC.LT.NRK~' GO TO 1455

C COMPUTE THE STANDARC CEV[ATICN AND KURTOSIS C

DO 1499 [=I.NSLACK [FIJOBSIIl.LLll GC TC 1499 X = JOBS I II - 1 UNFORM = HSTOII.11/X HSTDII.11 = SQRTIUNFCRHI IFIUNFORM.NE.I.CI liTeS I I,ll = HTeSII,lIlIUNFORM*UNFORM*XI IFIRMINIIJ.EQ.RMAX(I" HSTDI [.11 = O.Co

1499 CCNT !NUE C C PRINT THE SLACK [NFC

Page 73: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM

C

C

15(,,, DO 1611 l:l,r-.SlACK IFIJOBSIIl.EC.CI GC TC 1&11 SIUEll) : RMIIHII SIDEIZI : S~I~lll

SIDEIZ4): S"~A([) SIDE(25): RMAXII) IFIIHACE.EQ.·,) GU TC 1533 DO 15li. J:i,L4 POFIJ) : HISTlI,l,J)/FlCATlJCBSIIII COFIJ) : PCFIJ)

1511 IFIJ.GT.I) CCfIJ) = CCFIJ) + COFIJ-1) IFIPOFI2~).EC.C.O) ([FIZ4) = 0.t UNFJRM: ISM!XII) - S"I'HI))I22.C. 00 1522 J:2,n

1522 SID[IJ+l) : SICEIJ) • U~FOR~ TOS = HT~~11 ,11 STD : HSrJI 1,1)

1533 AVe. = SAV"I I) IFI~ID~(1).EC.SIOEI2~).AND.AVE.EC.D.~) ~o Te 1611 IRKJR = JO(;SI I)

C IF THE '~9IAN HAS PE~~ REQUESTED, LOAC MEOIAN STO~AGE C

C

IFIMED) GO TG 1566 IFINRKS.~;.() GO TO 1566 IUlC :, REWIND !\<IF4 KautH = i:'

1544 READ (J"F4) f'I, X IFIM.NE.I I GC TC 1555 KOUNT = KOUNT + 1 l IKOU~H) = X

1555 ITALC = ITALC + 1 IF( ITALC.LT.NKKS) GO TO 1544 CALL MEDIA'j

C FIND WHICH ARC GR ~(CE

C

C

1566 DC 1577 J=I.N~RC IFIISLAK(J).~€.I) GC TO 1577 M = IARC l( J) N = IARC2(J) JTITlE = 4 GO TO 160(:

1577 cCIn INUE DO 1588 J:l,~NODE K = J IFINSLAK(J).cQ.Il GO TO 1599

1588 CONT I ~~UE 1599 M = NOOEIIK)

N = NOOE2(KI JTITlE = 3

1600 CALL HISTO (M,N,IBlK,IBlK,~MEO,~,JTITLE.OI

1611 CONTINUE

C FINISH THE CCST-PERFCRMANCE TIME INTERVALS HISTOGqAMS C

1622 IF(ICPGAP.EQ.G) GG T( 2066 !TALC = NCPGAP + 1 ITAlP : NCPGAP + NCPGAP IFIICPGAP - 2)1633,2(44,1&33

291

Page 74: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

292 APPENDIX

1b33 ISTAR '" 0 HillE = 6

16~~ 00 1666 1=1,NCPGAP 00 1655 J=ltl~

1655 HISTII.1,J) = 0.0 HSTOII.I) " 0.0 HTOSII,lI = C.O IFICHMINII).EC.+SETUP) CHHINII) = CSHIN'I) IFICHMAXIII.EQ.-SETUP) CHMAX(t) = CSMAXCt) IFIKCOBSII).EQ.O) GO TO 1666 ~ CAVEIII = CAVEII)/FlOATIKC08S(t)I

1666 IFICSMINIII.EQ.CSMAXltl) CAVE(II = CSMINel) C C COMPUTE THE SQUARE FROM THE MEAN AND FIll THE HISTOGRAMS C

IFIITRACE.EQ.G) GC TC 1144 REWIND IWFl 00 1700 I=I,tTER READ IIWFlI IWORKIJI, J=l,NCPGAPI, IWORKIJ), J=ITAlC,ITAlPI 00 1699 M=I,NCPGAP X = WORKIM+ISTARI IFICSMINIMI.EQ.CSMAXI~I.OR.X.lE.O.OI GO TO 16g9 l = 1 IFIX.LT.CHMINIM)) GO TO 1688 L = l4 IFIX.GT.CHMAXIM)) GC TO 1688 UNFORM '" CCHMAXIM) - CHMtNIM))/2l.G TIMESM = CHMINIMI + LNFOR~ DC 1677 ISAV~=l,23

l " ISAVE IFIX.lT.TIMESMI GO TC 1688

1677 TIMESM " TIMESM + UNFCRM 1688 HISTI".l,ll = HISTIM,l.ll + 1.0

UNFORM " CAV~IMI -" X UNFORM = UNFCRM*UNFORM HSTDIM,11 HSTCtM,11 + UNFORM HTOSIM,11 = HTOSI",11 + UNFORM*UNFORM

1699 CONT INUE l1ae CONTINUE

C C COMPUTE THE STANDARD DEVIATION AND KURTOSIS C

DO 1733 I=I,NCPGAP X = KCOBSIlI - 1 IFIX.GT.u.OI GO TO 1122 HTDS( 1,11 " ~.O

1111 HSTOII,11 = C.G GO TO 1733

1722 UNFORM " HSTCII,lI/X HSTOIl,11 = SQRTtUNF(~M) IFIUNFORM.NE.c.01 HT(511,11 = HTOSI[,lI/IUNFGR~*U~FORH*XI IFICSHINtll.EQ.CSMAX(lJl GO TO 1711

1733 CCNTI~UE C C PRINT THE COST POINT DATA C

1744 D( 1811 ISAV~=l,NCPG~P IRROR = KCOBSIISAVEI IFI [RROR.EQ.GI GO TO 1811 SIDEIlI = CS"INIISAVEI S[OEI21 = CH~IN(ISAV[1 SIOE!241= CH~~X( Isavf'l

Page 75: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM 293

C

SIOEI251= CS~AXIISAVEI IFISIOEI1'.EC.SIOE(251.0R.ITRACE.EQ.OI GO TO 1188 OC 1755 J=I,24 POFIJI = HISTIISAVE,I.JI/FLOATIIRRORI COFt JI = POFIJI IFIJ.GT.11 COFIJI = COFIJI + COF(J-ll

1755 HISTIISAVE.2.JI = CCFIJI UNFORM = (CHMAX([SAVel - CHM(NIISAVEll/l2.0 00 1166 J= 2. 2l

1166 SIDEIJ+l1 = SIDEIJI + UNFORM DO 1171 J=1.25

1171 HISTIISAVE,3,JI = SICEIJI TOS = HTCSIISAVE,II STO = HSTOIISAVE,11

1188 AVE = CAVEIISAVEI IFISIDEI1'.EQ.SIDEI2S1.ANO.AVE.EQ.O.OI GO Te 1811

C IF THE MEnIA~ HAS BEF.~ REQUESTED. LOAD MEDIAN STORAGE WITH ALL THE C OBSERVATICNS C

C C C C C C C C C C

1199

1800 1811

1822

IFIMEDI GO Te 1800 KOUNT = 0 REWIND lWF2 DC 1199 L=I,ITER READ IIWF21 IWORKIJI. J=I,NCPGAPI, IWORKIJI. J=ITALe,ITALPI X = WORKIISAVf+ISTARI IFIX.Lt.0.01 GO TO 1799 KOUNT = KOU~T + 1 llKOUNTI = X CONTINUE CALL MEDIAN CALL HISTC I IlllK, IeU(, IeLK,18lK,XMED, ITlTlE,5,C I CDNT INUE IFIITITLE.EC.71 GO Te 2066

DETERMINE THE INOI~ICUAl PERIOD EXPENDITURES NEEDED TO MEET THE OVERALL RISK LEVEL DESIRED. IDIR INDICATES THE DIRECTION ALL THE INDIVIDUAL TI~E PERIODS ARE BEING ADJUSTED TO YIELD THE cc~rInENCE OF THE ENTI~E TIME PERIOD AT THE TRACE COST IOIR = +1 - MOVING UP IDIR = -I - MOVING DOW~ CONFL - CARRIES E~CH PERICOS CONFIDENCE LEVEL CO~FS - CARRIES U~IT CONFIDENCE ADJUSTMENTS (STEPS UP OR DOWNI

N = 0 IDIK = C LESSI = NCPGAP -N = N + 1 IFI~.LT.Z00(1 GO Te 1944 IRROR = Co CALL EKRQR (1833,IBLKtlllLK,! IlLK' GC TO lOB

1844 UNFGRM = 0.l DO 1933 I=I.NCPGAP IFIN.GT.II GC TO 1866 IFICONFlIII - C.GI20~1.2C33,18S~

1855 IF(CONFL(II - 1.011A~q.1888.2a31

18&(, IFICONFLlI'.GT.G.CI GC TO 1817 X = HlSTlIt3.11 GO TO 1 9 33

1811 IF(CO~rL(II.LT.l.-' GC TO 18<;9 18&8 X ~ HI~TII.3,151

Page 76: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

294 APPENDIX

GO TO 1933 C C FIND THE COST CELL WkERE THE CONFIDENCE VALUE CURRENTLY LIES C

c

1899 DO 1900 J=I,24 IPT '" J IFCHISTCI,2,JI.EQ.1.OI GO TO 1911 IFIHISTII,2,JI.GE.CC~FLCIII GO TO 1911

1900 CONT mUE

C INTERPOLATE WITHIN T~IS COST CELL AND THUS DETERMINE THE COST C WHICH CORRESPONDS TO THE GIVEN CONFIDENCE LEVEL C

19l1 BOT = ['.0 TOP = HISTCI,2,IPTI IFIIPT.EQ.11 GO TO 1922 BOT = HISTII,2,IPT-11

1922 X = IceNFlCII - aOTI/CTOP - 80TI X = HISTII,3,IPTI + ~.CHISTCl.3.IPT+ll - HISTII.3,IPTII HIST 11,4.11 = X

1933 IFII.LT.~CPGAP) UNFCP~ = JNFCPM + X C C DOES THE COMBINED COST OF ALL THE PARTS EXCEEC OR FALL SHORT OF C 'THE CO~BINEO TOTAL CCST C

IFIUNFORM - X11944,1988,1955 1944 IFIIDI~.EQ.-l1 GO TO 1988

10IR =+1 GO TO 1966

1955 IFIIDIK.EQ.+11 GO TO 1988 IDIR =-·1

1966 00 1977 1=I,L~SSI

CDHFL(ll = CONFLIII + CCNcSIII*FLOATlIOIRI lFICONFLltl.LT.O.LI CCNFLlII 0.0

1977 IF(CO.'iFLIII.GT.l.CI CCNFLlll = 1.0 GO TO UI22

C C LIST THE REFCRMULATEf CCNFIOENCES C

C

19R8 WRITE IIOUT,19991 N lS990FORMAT 1')2H1COST CONFIDENCE BALANCE AMONG SELECTED TIME PERIOOS/I

119H NO OF ITERATIONS =, 1&1/ 71H CFD ~ TIME INTERVAL COVERED C lONFIDENCES COST INTERPOL.TEG FOR THE/ IH , 11 X, 5HSTART, l~X, 34HSTOP, 5X, 8HCOMPUT·cC, 7X, 2C'HCONFInENCES COMPUT~DI

DC 2011 l=l,~CPGAP IFII.E~.NCPGAP) WRIT[ 16,2u(() UNFORM

200G FORMAT lit< , 7(,(lH-1I IH , 25X, l8HSUM OF ABOVE COSTS, F27.8) 2,)11 wRITE (I[UT,2, 22) I. TlO), T211l, CUNFLlll, HIST( 1,4,11 2[22 FORMAT I tHO, 14, 2H. , FlO.?, 2H -, FI2.?, F13.2, r27.B)

C LOAD P~RFORMINCE INrc ceST IF PERFORMANCE IS WA~T[D C

2C33 IFIICPGA~ - 21?C66,2(44,2~44

lC44 ISTAR = NCPGAP ITlTlE = 7 DO 2055 l=l,NCPGAP CSMIN(ll PSMIrHII CSMAXIII PSMAXIII CIWINIIl PI-'P'INII) CHMAXII) PHMAXlll CAVell) PAV(111

2055 KCObSlll KPLdSIII

Page 77: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM

GO TO 1644 C C FINISH THe INTERNAL ~CDE STATISTICS C

2066 IFIMODEI GO TO 2271 DO 2017 1=I.NHIST DO 2017 J=I,4 HSTDIloJ) = <l.V HTOS(I,JI = c.') DO 2077 K=I,24

2077 HISTII,J,K) = O.() C C CHECK FOR USER SCALE AND COMPUTE THE AVERAGE C

C

DC 2099 K=l,~hIST IFI 10B~IK).LE.OI GC TC 2(199 DO 2088 L=l,4 IFIHMI~IK,LI.EQ.SETUPI HMINIK,LI = XMINIK,LI IFIHMAXIK,LJ.EQ.-SETLP)HMAXIK,LI = XMAXIK,ll HAVElK,Ll = I-IAVEIK,Ll/FLOATIIOBSIK))

2088 IFIXMI~IK,L).EQ.XMAXIK,LJ) HAVEIK,L) = XMINIK,LI 2099 CO"'TINUE

C COMPUT: THE S~UARE FRCM THE MfAN ANO FILL THE HISTOG~AMS C

C

IFIITRACE.EC.t .GR.NRK.EQ.:)) GO TO 2166 IT Al C = (; REwIND IwF3

2100 READ IIWF3) ~, IwORKIKI, K=I,41 00 2133 K=I,4 IFIXMINIM,KI.EQ.XMAXIM,KII GO TO 2133 L = 1 IFIWORKIKI.LT.HMINIM,KI I GO TO 2122 L '" 24 IFIWORKIK).GT.HMAXIM,K)I GO TO 2122 UNFORM = IH~AXIM,KI - H~INIM,K)I/22.r. TIMESM = HMINIM,KI + UNFORM DO l111 ISAVE-2,23 L - ISAVE IFI"ORKIKI.LT.TIMES~I GC TO 2122

2111 TIMESM - TIMESM + UNFCRM 2122 HISTIM,K,ll = HISTIM,K,LI + 1.0

UNFORM - HAVEIM,KI - .ORKIKI UNFORM = UNFCRH*UNFOKM HSTOIM,KI = I-ISTDIM,K) + UN FORM HTOSIM,KI = HTCSIM,KI + UNFORM*UNFORH

21B CONTINUE !TALC = ITALC + 1 IFIITAlC.LT.NRK) GO TO 2100

C COMPUTe THE STANDARD CEVIATICN ANO KURTOSIS C

DC 2155 K=l.NHIST IFIIOBSIK).lE.I) GC Te 2155 TIMESH = IOBSIK) - 1 DC 2144 L=1,4 UNFORM = HSTCIK.LI/TI~ESM HSTDIK,LI = SQRTIUNFCRMI

295

IFIUNFURM.NE.0.01 HTCS(K,LI = HTOSIK,LI/{UNFORM*UNFORM*TIMESM) 2144 IFIXMINIK,L).~Q.XMAXIK,lll HSTO(K,ll = 0.0 2155 CONTINUE

C

Page 78: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

296 APPENDIX

C LIST THE INTERNAL NCCE STATISTICS C

C

2166 00 2266 1=1,~HIST

IFIIDBSII).Ee.C) Ge TO 2266 K = ') M = IBLK ~~ = IBLK DC 2191 J=I,~~ODE IF II Sf.'IT(J) .Ne.I1 GC TO 2199 K = I' + 1 IFIK - 2)Z177,21se,21es

2177l=J JTlTLi: = 3 GC TO Ll99

2188 M = NOUclIJ) N = NOOEZIJ) JTITLE = 2

2199 CCNTINUE IRROR = ICBSII) 00 2255 K=I,4 SIDEll) = XMIiH I,K) SIDEIZ) = HMINII,KI 510[(24)= HMAXlliK) Src[Cl~)= XMXI[,K) DC 22C· J=1,24 PDFIJ) = HISTlI,K,JIIFlCAT(lCBSIIII CDFIJ) = PDFIJ)

22JO IFIJ.GT.I) CCFIJ) = CCFIJI + CDFIJ-ll UNFORM = IHMAXIl,K) - HMIN([,KI1l22.0 DO 2211 J=2,22

2211 SIOEIJ+l) = SIDEIJ) + UNFORM TCS = HTes I 10K I STD = HSTIH I ,K) AVE = HAVEl I,f( I IF(SID~(11.E~.SIDEI2JI.AND.AVE.EQ.O.OI GO TO 2255

C IF THE MEOIA~ HAS SEEN REQUESTED, LOAO MEOIAN STORAGE C

C

IFIMED) GO TC 2244 IFINRK.EC.O) ;0 TO 2244 KOUNT = ') HALC = J RE~I"ID I;oF3

2222 READ (IWF3) M, IWDRKIJ), J=I,41 IFIM.NE.[I GO TO 2233 KOUNT= KOUNT + 1 ZIKOUNTI = WORKIK)

2233 ITALC = ITALC + 1 IFIITAlC.lT."IRKI GO Te 2222 CAll MEDIAN

2244 ITALC = INSTATllI IFIITABIITAlC.KI.EQ.CI GO TO 2255 J = 0 IFlfTAlC.EQ.l1) J = ITCPIK) CAll HISTO I~ODEIIL),NODE2(l)~M,N,X"ED,K,JTITLE,JI

2255 CONTINUE 226b CON fI !IIUE

C lIST EACH TERMINAL NOtE C

2277 NRK = (; lOUT = 1

Page 79: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM

IT AL = 0 ISTAR = (. MED .F~LSE.

I1CD;:: = .FALSE. REWIND IwF2 DO 2311 l:l,~NODE

IFILOGII I1.GE.51 GO TO 2311 IFILOGCIII.G".l1IG( T( 2288 IFILOSLIII.N~.ll GC TC 2311

2288 IFIIST~TIII.LT.CI ICLT = 2 NCCLSM = I DC dO J=l,4 CALL MSIJI IFIIRRCR.t:Q.:1 GO TO 2311 K = NRK -+ J TIM~AIKI SIOlill COSTAIK I = AV~ PERFAIKI = SIrEI251 IFISIDEIl'.E'.SID(1251.ANO.AVE.EC.0.GI GO TO 2300 IFIISTATIII.~~.-21 GC TO 22'19 ITAL = !TAL" 1 WRITE II"F21 NOOEIIII, NODE2111, ITCPIJI, SIDE, PDF

2299 CALL MEDIAN IT AL C = INS T,H 1 II IFIITArlIITALC,JI.EO.CI GO TO 2300 M = 0 IFIITAlC.EQ.171 11 = ITCPIJI CAll HISTO INODEI I II ,NODE21 II, IBLK, IBLK,XMED,J,3,"l1

230~ CCNTlNUE IFIIRR2R.GT.1I NRK = ~RK + 4 ISTAR = ISTAR -+ 1

2311 CCNTH-WE C C LIST ThE CO~prSITE NCDE C

IFIISTAR.lE.11 GO TC 24GO MODE = .TRUE. DO 2333 J=1,4 CALL M:'IJI K = NRK -+ J TIMEAIKI = SIOEl11 COSTAIKI = AVE PERFAIKI = SIOEI251 IFIITAL.Ee.GI GC TC 2322 IFISIOd 1'.EC.SIOEI251.ANO.AVEoEQ.0.GI GO TO 2333 ITAL = !TAL" 1 WRITE II~F21 ICl, IC2, ITCPIJI, SIDE, PDf

2322 CALL MEDIAN IFIITA3ILCO~P,JI.EO.CI GO TO 2333 ~ = \) IFILCOMP.EQ.171 M = ITCPIJI CALL HISTO I ICl, IC2, IBLK,IBLK,XMED,J, 1,MI

2333 CONTI"WE C C LIST THE TERMINAL NOCE INDEX C

2400 IFIISTAR.LE.11 GO Te 2500 WRITE IIOUT,24111 ITER

297

2411 FORMAT 147H10PTIMUM TERMI~Al NODE INDEX - NO. ITERATIONS =, 151 WRITE IIOUT,24221 ABSA

2422 FORMAT 11H , lax, 10F5.11 lH , 16X, lHI, 1015H-----+I, lH11 DO 2488 J=l,NNODE

Page 80: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

298 APPENDIX

C

IFllOGIIJI.GE.51 GO TO 2~88 IFllOGOIJI.GE.IIIGC TO 2~33 IFllOGOIJI.NE.l' GO TO 2~88

2433 ICOUNT = 0 00 2444 K=l,ITER

2444 IFINOOETIKI.EO.J' IC(UNT = ICOUNT + 1 IFIICOUNT.EQ.O' GO TC 2488 UNFORM = FlOATIICCU~T'/FlOATIITERI K = UNFORM*50.0 + 0.5 00 2455 L=l,50 ISTATEllI = IBlK

2455 IFll.lE.KI ISTATEIL' = IASTR WRITE IIOUT,24661 NOOEIIJ', NOOE21J', UNFORM, IISTATEIL', L=l,5D'

2466 FORHAT 11H , 2A4, F7.4, 2H I, 50A1, IHII IFIJ.NE.~NOOE' WRITE IIOUT,2477'

2477 FORHAT 11H ,16K, IHI, 1014K,IH+', IHII 2488 CONTINUE

WRITE CICUT,2499' A8SA 2499 FORHAT 11H ,16K, 1H[, 1015H--+', IHII 1H ,18K. 10F5.1I 2500 IF!JCOUNT.EC.ul GO TO 2744

C liST TERMINAL NODES EXCLUDED IN THE CRITICAL-OPTIMUM PATH ANALYSIS C

C

GC TO 12555.Z5ll',ICLT 2511 WR[TE IICUT,25221 25220FORHAT 174HCTHESE TERMINAL NODES ARE EXCLUDED FROM THE CRITICAl-OP

ITIMUM PATH ANALYSIS/ffl 00 2533 I=l,NNODE

2533 IF! ISTA"I' .EO.-lI WRITE IIOUT,2544, NOOElIlI, NODEZIIl 2544 FORMAT I1H • lOX, 2A41

C liST CRITICAL-OPTl~U~ PATH I~DEXES FOR THE NODES C

C

2555 W~ITE CICUT,Z566' JCCUNT 2566 FORMAT C48Hl~OOES CRITICAL-OPTIMUM PATH INDEX - NO. PATHS =, 15'

WRITE IIOUT,2422' ABSA DC 2588 I-l.~NOOE IFCICRITNIII.EC.CI GC TC 2588 UNFORH - FlOATIICRIT~(I"/FLCAT(JCOUNTI K - UNFORM*5C.C + C.S DO 2.577'L=1.5, ISTATECll - 13LK

2577 IF(l.L~.K' ISTATECl' = IASTR WRITE IICUT.2466' NOt:ElIll, r-;OOE21 [I, UNFORM. (lSTATEIL). L=I.50' IFII.Nc.~NOCE' WRITE IICUT.24171

2588 COIH INUE ~RITE (ICUT.2499' ABSA

C liST CRITICAL-OPTI~U~ PATH I~OEX~S FO~ THE ARCS C

WRITE (ICUT.25991 JCCUNT 2599 FCRMAT e47H1AKCS CR(TICAL-OPTIMU~ PATH INDEX - NO. PATHS =. 151

WRITE (IOUTt24221 ABSA 00 2611 l-l,NARC IFIiCRITh(I'.EQ.ul G( TC 2611 U~FOR~ = FlCATCICRITAI!,,/FLCATeJCOUNT' K - U~~ORM*50.G + C.5 DC 260,; L=l.'),. IST"TEI L I = (i.;LK

26,)v IF(L.Lc.KI ISTATEILI = IASTR, WRITE IICUT,24661 IAQCllll. IARC2el'. UNFORH, IlSTATEeLl. L-lt5(;1 IFII.~2.N'RCI WRITE (IOUT.2411'

Page 81: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM 299

C

2611 CONTINUE WRITE (ICUT.2499' ABSA GO TO 2744

C LIST STORAGE UTILIZATION tlND ENDING SEED C

2622 1 (MITER - ITER'*5 J IMARC - NARCI*16 K LARC - KARC L (MNCDE - ~NODEI*13 M LNODE - KNODE N MAXTAG- M IFIN.LT.O' N = 0 ISTAR MTAG - N ITALC (MHIST - NHISTI*141 ITALP IMTERM - NTERMI*9 ISAVE IMSLACK - NSLACKI*6 ICUT = IMCPGAP - NCPGAPI*7 ICOUNT = I + J + K • L + M + ISTAR + ITALC + ITALP + ISAVE + ICUT

0JCOUNT = MITER*5 + MARC*16 + LARC • MNODE*13 + LNODE • MTAG + IMHIST*~41 + ~TERM*9 + MSLACK*6 + MCPGAP*r

UNFDRM = lOC.C*ll.C - FLOAT( ICOUNTI/FLOATIJCCUNTII WRITE (ICUT.26331 MITER. ITER. I

26J10FORMAT IIHI. IGX. 32HCORE DATA STORAGE USAGE ANALYSISI 5SHOAI. CUR I~ENT NUMBER OF ITERATIONS ALLOWED (VALUE OF MITERI. 11(lH-I. 161 235H A2. NUMBER OF ITERATIONS REQUESTED. 4011H-I. 161 49H A3. lTERA 3TlC'l STO~AGE SPACE ~CT USED IIAI-A2'*51, 26( IH-I. 1121

WRITE IIOUT,26441 MARC, NARC. J 26440FORMAT (SIHCBl. CURRE~T N~MBER OF ARCS ALLOWED (VALUE OF MARCI,

l.24IlH-I, 161 27H 62. IIU"BER CF ARCS ENTERED, 48( IH-I, 161 44H 83. 2ARC STURAGE ~PACE IIeT USED ((BI-B71*161. 3111H-I, 1121

WRITE (IOUT.16551 LARC, KARC. K 26S5~FORMAT 160H0Cl. VARI.BLE ARC STORAGE IASTOREI AVAILABLE IVALUE OF

lLARC), 15(lh-I, 161 3~H C2. VARIABLE ARC STCRAGE USED, 4511H-I,I61 24AH C3. VARIABLE ARC STORAGE SPACE NOT USED lel-e21. 2111H-I, 1121 ~RITE (ICUT,L6661 ""CDE. NNCDE, L

2666LFOR~AT 153HCDI. CURRfllT NUMBER OF NOO~S ALLowrD (VALUE OF MNOOEI. 122llH- I, 161 ~8H 02. ,.,UMBEP CF NODES ENTERED. 41I1H-). 161 45H 03. 2 NODE STCRAG'c SPACE /.OCT USED I (01-D2I*13', 3C( IH-I. 1121

WRITE (ICUT,2677) LIICCE. KNOUf. " 26770FORMAT 173HCEl. VARIABLE NODE STCRAGE IFRONT PSRT NSTOREI AVAILASL

iE (VALUE CF L"JCCEI, 211H-I, 161 31h E2. VARIABLE NODE STORAGE lJSED 2, 44(1~-), Ibl 49~ E3. VARIABLE NODE ~rORAGE SPACf NOT USED IEI-EZ 3 I, Z 6 I 1 H- I, 1121

wRITE (lOUT,?68BI MTAG, N. ISTAR 2688(FORMAT 174H,Fl. CCST-PERF VECTOR STORAGE (BAC~ PA~T NSTOREI AVAILA

HlLE (V:'LUt OF MTA;;I, lIlH-I. 161 34ft F2. CCST-PERF VECTOR STORAGe 2USEJ, 4l( IH-I, 161 52H F3. COST-PERF VECTOR STORAGE SPACE NOT USED 3 (F~-F21, 23(IH-I, 112)

WRITE (IOUT,26991 ~HIST, NHIST, ITALC 2697CFDRMAT (72HCGl. CU~R~NT NUMBER OF INTE~NAL NODE STATISTICS ALLOWED

1 (I/ALUe CF "~IS'tI, 311H-I. 161 49H G2. NUMBER OF INTE~NAL NODE ST 2ATl~TICS ~E~U:STED, i61IH-), 161 66H G3. INTERNAL NeDE STATISTICS 3STORSGc 5PAC~ NOT user IIGI-GZ'*141', 911H-I, 112)

WRITE (ICUT,l.7':CI MTERM, IITtRM. ITALP 27~'LFORMAT (72H~Hl. CU1RE~T NU~8tP OF TERMI~AL NeUE HISTOGRAMS AlLOw~U

1 (VALU,- DF MFRMI, 3( IH-I, 161 41H H2. NUMBER OF TERMPIAL ,'lOOE HI 2STC~~AMS ~NT~R[C. 28(IH-), 161 63H H3. TERMINAL NODE HISTUGRAM STO 3RAGE S~ACE Ncr USEe IIHI-H21¥91. l211H-I. 112)

WRITE IIGUT,?711) M$LACK. NSLACK, ISAVE 2711LFCR~AT 1&~H(Il. CURR·~T NU~BER OF SLACK HISTOGRAMS ALLOwED (VAlUi

lOF ;~SLACK), L IlH-I, 161 41H 12. NUMBER OF SL,~CK HISTOGRAMS REQUES

Page 82: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

300 APPENDIX

2TED, 3411H-), 161 55H 13. SLACK HISTOGRAM STORAGE SPACE NOT USED I 3111-12).6), 20IlH-), 112)

WRITE IICUT,2122) MCPGAP, NCPGAP, ICUT 21220FORMAT 115HOJ1. CURRENT NUMBER OF COST-PERF TIME INTERVALS AVAILAB

lLE IVALUE OF MCPGAP), 161 49H J2. NUMBER OF COST-PERF TtME INTERVA 2LS REQUESTED, 2611~-1, 161 50H J3. COST-PERF TIME INTERVALS NOT US 3ED IIJI-J2).6), 2511H-), 112)

WRITE IIOUT,2133) JCOUNT, ICOUNT, UNFORM 2133CFORMAT 133HO TOTAL CORE STORAGE AVAILABLE, 4211H-), 161 32HO

1 TOTAL CORE STORAGE ~CT USED, 4311H-), 1121 31HO OVERALL CORE S 2TORAGE UTILIZATION, 38IlH-I, F12.2, lH%)

2144 WRITE IIOUT,2155) IseeD 21550FCRMAT 1/30HC LAST RANDOM NUMBER SEED =, 113)

RETURN END SUBROUTINE MEDIAN IMPLICIT INTEGER.411-~)

OCOMMON EHARKlll),SETUP,FI~T,DINT,FACTOR,STIME,SCOST,SPERF,CTIME, lCCOST,CPERF,BTIME,BC(ST,BPERF,TIMESM,UNFORM,ITRIPlI22),ITRIP2122), 2KNTI61,INPT,IOUT,IPNH,IWF1,IWF2,IWF3,IWF4,IBLK,ITRACE,ICUT,ISEED, 3IRROR,ISAVE,NODESM,MAXTA~,ICCUNT,JCOUNT,NTRIP,ICORR,LCOMP,NWARN,

4NRK,NRKS,SLAK,MODE,INFC,INFP,DISC,DtSP,CRIT,KGEN,HED,SINGLE,DOUBLE COMMON/MEDAN/ZI 1000),XMED,KCUNT LOGICAL SLAK,HODE,INFC,INFP,DISC,DISP,CRIT,KGEN~MED,SINGLE,DOUBLE

C C THIS SUBROUTINE COMPUTES THE MEDIAN OF THE OBS. STORED IN Z C

C

XMED = 0.0 IFIKOUNT - 112777,2766,218R

2166 ~MEO = llil 2717 RETURN

C ORDER THE ELEMENTS STeRED IN VECTOR l C

2788 MIOPT - FLOATIKOUNTI/2.C + 0.6 MIOPTI = MIOPT + 1 DO ~80~ l-l,MIDPTI Y = SETUP DO 2799 J=I,KOUNT IFIlIJI.GE.YI GO TC 2799 K = J Y = ZIJI

2799 CONTINUE llK) = llil

2B~CZ(II=Y

C C COMPUT~ THE ACTUAL MECIA' C

XMED = l (I'I DPT) I = MI~PT + MIOPT IF(l.GT.K~UNTI GO TO 2811 XMEO = Il(MICPT+ll + XMF.DII2.'

2811 RETURN END S~BROUTI~[ MSIJ) II'PLICIT INTfGER*411-~1

LCOHMON EMARKllll,SETUP,FINT,DINT,FACTOR,STIME,SCOST,SPE~F,CTIME,

iCCCST,CPERF,eTII'E,HC(ST,BPERF,TIMESM,UNFORM,ITRIPI122),ITRIP2122), lKNT(b),I~PT,IGUT,IP~h,IWFl,IWF2,IWF3,IWF4,IBL~,ITRACE,ICUT,ISEED,

JIRROR,ISAVE,NOOESM,MAXTAJ,IC(UNT,JCOUNT,NTRIP,ICORR,LCO~P,NwARN,

4NRK,NRKS,SLAK,MOOE,I~FC,INFP,CISC,DISP,CRIT,KGEN,MEO,SINGLE,DOUBLE

COMMON/TRUCK/PCF(24),CDFI241,SIDEllS),AVE,STC,T05

Page 83: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM 301

0COMMON/TRIALSISTORETI 1COD,4),TERMIIG,S),KPCINTI10),NCDETI lOCC), 1MTERM,~TERM,~ITER,IT~A

COMMON/MEOANlll 1CCO),XMED,KCUNT LOG I CAL SLAK ,MODE, INFC, INF P, 01 SC ,01 SP ,CRIT, KGEfi, ME 0, SINGLE, DOUAL E

C C THIS SUBROUTINE CALCLLATES MEANS, STANDARD DEVIATIONS AND FILLS C HISTOGRAMS FOR TER~INAL ~CDES

C K = 11 IFIMODe) GO TC 2833 00 lA2~ l=l,NTFRM

2822 IFINODESM.EC.KPOINT( III K GO TO 2844

2833 IFIKPOINTC 1I.LT.OI K = 1 2844 SIDEIll = SETUP

SIDE (25) =-SFTuP AVE = C.l. STD = C.O TCS = 'J.O IRROR = 0 UNFORM = C.O DO 2866 1=1, ITER IFIMOOE) GO TO 2855 IFINOOESM.NE.NODETIII) GO TO 2866

2855 IRROR = lRROR + 1 ZIIRRO,~1 = STORETII,J) UNFORM = UNFCRM + STCRETII,JI IFISTORETII,J).LT.SICEI1)) SIDEll) STORETII,JI IFISTORETI I,JI.GT.S(CEI25) ISIOE(25)= STORETCI,J)

2866 CCNTINUE KOUNT = I RRC~ IFI1RROR.EQ.ll AVE = UNFO~M IFIIRROR.LE.ll RETURN AVE = UNFOR~/FLOATIIRROR) IFIITRACE.EQ.CI RCTURN IFIK.E~.01 GC TO 2877 M = J*2 L = 14-1 IFITERMIK,LI.EQ.SETUP.ANO.TERMIK,M).EQ.-SETUP) GO TO 2877 SIDE(2) = TERMIK,LI SIDE(24)= TERMIK,M)

1444 GO TO 28E8 2877 SIDEI21 = SICElll

SIDEI241= SIC[1251 2886 UNFORM = ISID£1241 - SIOE(2))/22.0

DC 2899 1=2,22 2899 SIDE I 1+11 = SIDEI II + UNFORM

DO 2900 1=1,24 2900 PDFII) = 0.0

DO .2944 1=1, ITER IFIMODEI GO TO 2911 IFINOOESM.NE.NOOETI(I) GO TO 2944

2911 L = 1 IFISTORETII,J).LT.SICEI21) GO TO 2933 L = 24 IFISTORETII,JI.GT.SICE(24))GO TO 2933 DO 2922 ISAVE=3,24 L = (SAVE - 1 IFISTORETI 1,J).Ll.SICEI ISAVEII GO TO 2933

2922 CCNTINUE 2933 POFILI POFILI +1.(

UNFORM = AVE - STORETII,J)

Page 84: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

302 APPENDIX

C

UNFORM = UNFC~M*UNfORM STn = STD • UNFOPM TOS = TOS • U~FORM*UNFORM

2944 CCNT I rIVE IF(~TO.EC.CI RETUR~

UNFURM = STD/FLOAT(I~RC~-11 STD = SURT(UNFGRMI TCS = TOS/(UNFORM*UNFORM*FLOAT(IRROR-lll 00 2955 1=1,24 PDF(II = PDF(II/FL(ATIIRRO~I CCF(lI = PDF(II

2955 IF(J.GT.ll CeFllI = C(Flll + CDFII-ll RETURN E'IID SUBROUTI:E HISlO (I'I,Ml,Nl,'II2,XMED,!TITLE,JTITLE,1 TYPEI I~PLICIT INT~G[R*411-~1

uCOMMON EMARK(lll,SETLP,FINT,DINT,FACTOR,STI"E,SCOS~,SPERF,CTIME, lCCOST,CPERF,BTIME,BCCST,BPERF,TIMESM,UNFORM,ITRIP1(221,ITRIP2(22I, ZKNT (6 I ,I ~PT, ICUT, I PNh lIoIFl, IIoF2, lloIF3, IWF4, IllLK, ITR.ICE, ICUT, ISEED, 3IRROR,ISAVE,~ODES~,I'AXTAG,ICOUNT,JCOUNT,NTRIP,ICORR,LCOMP,NWARN,

4NRK,NRKS,SLAK,MOO~,INFC,I~FP,DISC,DISP,CRIT,KGEN,MED,SINGLE,DOUBLE CO~MON/TRUCK/PDF(241,CDFIl4I,SICEll5I,AVE,STC,TOS

C;COMMO"UCPGAPlTlIICI ,TlI 101 ,CCNFLIlC'I,CONfSIlGI,OAVE( Ie I ,CSMIN( 10 I, 1 CSMAX ( 10 I ,CHM I N ( 1'; I, CHMAX( 1 C I, PA VI: ( 10 I ,P SM I NIl C I ,P SMAX ( 101 , 2PHMINII01,PH~AXI1SI,KCOeS(1)I,KPO~SII[I,MCPGAP,NCPGAP,ICPGAP

DIM~NSION ASSA(151, lINEP(251, LINEC(SOI LOGICAL SLAK,~ODE,INFC,INFP,nIsc,DISP,CRIT,KGEN,~ED,SINGLE,OOUBLE

DATA Ai3SA, \'~/.l,.2, .3, .4, .5, .6, .1, .8, .9,I.C, .u5, .1, .15, .2, .25.lH"'1

C THIS SUBROUTINE CONSTRUCTS HISTOGRAMS WITH ACCCMPANYING STATISTICS C OR A ONE LINER CONSISTING OF THE MIN, AVE A~O ~AX. FIRST TASK C CONSISTS CF LISTI~G THE FIRST HALF OF THE TITLE e

IF(SIDcll'.EQ.SIOEI2511 GO TO 2966 IFIITRACE.NE.,) GO TO 2988

2966 wRITE (IGUT,2~771

2977 FORMAT (IIIH I GC TO 30QJ

2988 wRITE (ICUT,29991 29~9 FORMAT (lHll 3000 GO TO (3 n ll,3(33,3055,3C77,3t99,311I,31331,ITITLE 3011 wRIIE IICUT,3l221 3022 FORMAT (IH+, 4X, 13H~ETWORK TIME

GO TO 3233 3033 wRITE (lCUT,3',441 3044 FORMAT (lH+, IX, 10HPATH COST 1

GO TO 3194 3055 WRITE (ICUT,3J661 3066 FORMAT (lH+, 4X, 13H(VERALL COST

GO TO 3194 3077 WRITE (IOUT,3~881 3088 FORMAT (lHH+PATH PERFCRMANCE I

GO TO 3155 3099 WRITE (IOUT,31tOI 310e FORMAT (lH+, 6X, 11HSLACK TIME I

GO TO 32H 3111 WRITE IIOUT,31221 T111SAVEI, T2(ISAVEI 312lJFORMAT (lH., 5X, 38HPCSITIVE COST INCURRED BET~EEN PERIODS,

IF 10. 2, 2H -, Fl2.21 GO TO 3199

3133 WRITE (IOUT,31441 TIIISAVEI, TZIISAVEI 31440FORMAT (lH+, SX, 43HPCSITIVE PERFORMANCE GAINED BETWEEN PERIODS,

Page 85: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM

lF10.2, 2H -, f12.2) c C DOE~ PERF~R~A~CF NEEC TC HE INFLATED CR D[SCOUNTED C

3155 [F( itIFP) GO T" 3177 WRITE ([CUT.31661

3166 FGR~AT (21H P~RFOR~A~CE INFLATEDI 3177 IF(DISP) GO Te 3233

WR IT E (I CUT, 318!j ) 3188 FORMAT (lH+. ;5X. 22~PERFORMANCE D[SCOUNTEO)

~O TO 3233 C CODES CCST NEED TO BE [NFLATED DR DISCOUNTED C

3199 IF( PJF~) GO n 3211 WRITE (JCUT,3t~C I

32~G FORMAT (~4H COST [NFLATEn) 3211 IF(O[SC) GO TO 3213

W'<ITE ([CUT,L221 3222 FORMAT {lH+. l~X. l5rCOST DISCOUNTEDI

C C IS THE~E A S[COND HALF OF THi TITLE N~EDED

C 3233 GC TO (3244.1266,3?98,330~,33221.JTITlE

3244 WRITE (JOUT,32551 3255 FORMAT {lH+, 17X, 31rFOR THE COMPOSITE TERM[NAL NODEI

GC TO 3322 3266 WRITE (JCUT,3i771 MI, M2, :-U. N2

303

3277 FORMAT (IH+, 17X, 26HFOR THE GAP BETWEEN ~OOES , 2A4, 5H AND ,2A4) GO TO 3322

3218 WRITE ([SUT,3~991 ~l. H2 3299 FORMAT (1H+, 17X. 9HFOR N3DE , 2A41

GC TO 3322 330C WRITE (IOUT,33111 ~l, H2 3311 FORMAT (lH+, 17X. 8HfGR ARC, 2A41

C C A CNE LINER C

C

3322 IF(SI9c(1'.EQ.SJDE(2511 GO TO 3333 IF(ITRACt.NE.:') GO TC 3355

3133 WRITE (IOUT,33441 IRRCR, AVE. SIDEll), 510E(25) 3344~FORMAT 19H NO OBS •• 117. 7H AVE·. G20.61 6H MIN =, G20.6,

17H MAX =, G20.61 IFISIOEI1'.NE.StDE(2511 GO TC 3567 IF(ITYPE.EQ.C) GO TO 3572 N = I WRITE IIPNH,3350) ~l. "2, /TYPE. N, AVE

3350 FORMAT (2A4, lHD. A4. 12. 3X, 3Hl.O, 4X. FIO.31 RETURN

C A HISTOGRAM C

3355 IF(ITRACE.EU.ll GO TC 3377 WRITE I!CUT.31661 AS5A. 5[DEtl', SIDEtll

3366uFORMAT (lHO. 12X. 3HCFO. IX. 10tF4.1,IXI, 15X. 4HRFD , 5F5.21 IH , IG12.4, ZH I, lO(SH----I), 4H MIl';, G13.4. 2H I, 515H----II, 4H "Ii'll

GO TO 3399 3317 WRITE {IGUT,33881 IABSAll,. L=I,ICI, SIOEIII 33880FORMAT 11HO, 12X, 3HCFO, IX. 10IF4.1.1XII IH • GI2.4, 2H I,

110(5H----II, 4H MIN. G13.41 3399 UNFORM = 0.0

DO 3455 [=1.24

Page 86: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

304 APPENDIX

IFIPDFIII.GI.UNFORM) UNFORM = PDFII) 00 HOO J z l,2S LINEPIJI .. I8LK X = FLOAIIJI/I00.0

3400 IFIX.LE.PCFIIII L[hEPIJI [A 00 3411 J=2,100,2 L = J/2 UNECIL) = [8LK X = FLOATIJI/I00.0 - 0.01

3411 [FIX.LE.CDFIIII LfNECILI = IA IFI[TRACE.EQ.l1 GO TC 3433 WR[TE IICUT,34221 LIhEC,CDFIII,LINEP,PDFI[I,SIDEI[+1I,S[DEII+11

34220FORMAT 11H , 12X, 2H I. SOAl, FS.3. 12X. 2H I. 2SAl, F5.3/ IH , IG12.4, 2H I. 55X, G12.4, 2H I)

GO TO 3455 3433 WR[TE I[OUT,34441 ll~EC. COFI[I, SIOEII+11 3444 FORMAT 11H , 12X, 2H [. 50Al, F5.31 IH , G12.4, 2H II 3455 CONTINUE

IFIITRACE.EO.II GO TC 3477" WR[TE IIOUT,34661

3466 FORMAT I1H+, 14X, 1015H----II, 4H MAX, 15X, 515H----fl, 4H MAXI GO TO 3499

3477 WRITE IIOUT,3488) 3488 FORMAT I1H+, 14X, 1015H----II, 4H MAXI 3499 X = 0.0

[FIAVE.NE.O.OI X = STD/AVE WRITE IlCUT,350Cl) IRRGR, STD, X, AVE, lOS

35000FORMAT IIHO, 13X, 6H~C CBS, 1211H-I, IB, 2X, 10HSTD ERROR-, G18.41 llH , 13X, 18HCOEF CF VARJATION-, F8.2, 2X, 10HMEAN------, G18.4/ 21H , 13X, 18~KURTOSIS 18ETA 2)-, F8.2)

[FIMEDI GC Te 3522 WRITE I[OUT,35111 X~fC

3511 FORMAT 11H+, 41X, 10HMEO[lN----, G18.4) C C FIND THE MODE, COMPUTE AND LIST THE PEARSONIAN S~EW C

3522 M = 99 iii =-99 DO 3533 1=1.24 IFIPOFIII.NE.UNFORM, GO TO 3533 IFCI.LT.MI M = I IFII.GT.~I iii = I

3533 CONTINUE IF(M.EQ.~I GO TO 3555 WR IT E I I CUT, 35441

3544 FORMAT IIH , 13X, 23~~ULT[MOCAL DISTRIBUTIONI GO TO 3561

3555 Fl = 0.0 IFIH.GT.U Fl = PCFI"-ll F2 = 0.0 [FIN.LT.24)F2 = POFfN+l)

OXMODE = SIDEIHI + IIPCfIM) - FlI/12.0*PDFIMI - F2 - FIl,. 1lSIDEII01 - S1Dll911

PS = 0.0 IFISTD.GT.O.JI PS = ~BSI~AVE - XMDDEI/STO) WRITE IIC~T.35bbl PS, XMODE

3566 FORMAT IIH .13X.18HPEARSONIAN SKEW---,F8.2.2X,10HMODE------,G18.41 C C L[ST THE DISTAIBUTIC~ CARDS IF WANTED C

3561 IFIITYPE.FU.JI GO TO 3512 DO 3569 L=3,23,3

Page 87: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM 305

C

K = l - 2 N = lI3

3569 WRITE IIPNH,3510) Hl, M2, ITYPE, N, ISIOEIMI, POFIHI, M=K,l) 3510 FORMAT (2A~, lHH, A~, 12, 3(FlO.3, FlO.811

N = 9 WRITE IIPNH,357C) Ml, M2, ITYPE, N, SIOEI251

3512 RETURN END SU8ROUTI NE COol.R 1 MPllC IT I NT EGER*~ II-N I

OCO~MON EMARKIll),SETLP,FINT,OINT,FACTOR,STIME,SCOST,SPERF,CTIME, lCCOST,CPERF,BTIME,BCCST,BPERF,TIMESM,UNFORM,ITRIPlI22),ITRIP21221, 2KNTI61,INPT,IOUT,IPN~,IWF1,IWF2,IWF3,IWF~,IBlK,ITRACE,ICUT,ISEEO, 3IRROR,ISAVE,NOOESM,~AXTAG,ICCUNT,JCOUNT,NTRIP,ICORR,lCOMP,NWARN,

4NRK,NRKS,SlAK,MOOE,I~FC,INFP,OISC,O(SP,CRIT,KGEN,MEO,SINGLE,DOUBlE (COMMON/TRIAlS/STORETI lOOO,~I,TERM(lO,81,KPOINTllCI,NOOETI 10001, IMTERM,NT[RM,~ITER,ITER

OCOMMON/ARCS/ASTOREI 2800l,UTIMEAI 3501,TIMEAI 350l,UCOSTAI 3501, lCOSTA! 3501,UPERFAI 3501,PERFAI 350),WORKI 3501,ISTATEI 350), 2NOOEII 350l,fiOOEOI 350l.ICRITAI 3501.KEEPCI 35C),KEEPPI 3501, 31ARClI 350) ')ARC21 35C) ,JPOINTC 3501.JPOINTC 350l,ISLAKI 3501, 4KARC,LARC,MARC,NARC,ITALC,ITAlP,ISTAR ('COMMON/NCCES/T1MENI 200),CnSTNI 200l,PERFNI 2COI,NSTOREI 54001, INOOEl( 2Ci)I,NODE21 2eOI,LOGIt 20CI,lOGOI 200).NSTATEI 2001, lNARCII 2COI,IIlARCOI zeCI,ISTATI 2CO),INSTATC 2(;CI.ICRITNllOC), 3NPOINTI 20GI.NSLAKI 200),JUMP! 20CI.KNOOE,LNODE,MNODE,N~ODE,MTAG, 4NTAG

DIMENSION RI2.21, S(2), XMIZ), NUMClll), ISTCREI55,110) LOGICAL SlAK,MODE,INFC,INFP,CISC,DISP,CRIT,KGEN,MED,SINblE,DOUBLE DCUBlE PRECISION ~, E, XM DATA NUMB/IHl,lH2,lH3,lH4,lH5,lH6,IH1.IHR,lH9,lH ,IH*I

C THIS SUBRQUTINE COMPUTES THE CORRELATION AND PLOTS 2 TERMINAL NODE C VARIABLES AT A TI~E. FIRST, INITIALIZE FOR INDEXING THE NODES. C

C

NRK = -4 leUT = 1 I SA liE = (;

3577 ISAVE = ISAve • 1 IFIISAVE.LE.~NODEI GC TO 35&8 ICUT = Z GO TO 36G,'

3588 IFIlOGIl ISAVd.GE.51 GO TJ 3571 IFILObOIISAVEI.GE.ll)GC TO 3599 IFILOGG!ISAVd.NE.lI GO TO 3517

3599 IFIISTATIISAVE1.LT.OIGO TJ 3571 360G NRK = ~RK + 4

00 3888 l=11,ICCRR M = ITRll-'lILl IFIM.E~.01 Ge TO 3888 ~ = IHIP2!Ll !TALC M + NRK ITALP = N + NRK

C CALCUlAT~ SU~S CF SCLARES AND CRess PRODUCTS C

)("1,1 = COSTAl !TALC) X"(il = CCSTAIITALP) DO 3611 1=1,2 DC 3611 J=l,~

3611 R I I , J 1 = c.: ISTAR = "

Page 88: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

306 APPENDIX

C

DO 3644 K=l,ITER IFIICUT.EQ.21 GO TO 3622 IFIISAVE.NE.NOOETIKII GO TO 3644

3622 Bill = STORETIK,MI BI21 = STORETIK,NI DO 3633 1=1,2 00 3633 J=1,2

3633 RII,JI = RII,JI + (B(11 - XMIIII*(B(JI - XM(JII ISTAR = ISTAR + 1

3644 CONTINUE IFIISTAR.GT.11 GO TO 3655 NRK = NRK - 4 GO TO 3899

C COMPUTE THE VALUE OF THE VARIANCE-COVARIANCE MATRIXANO PRINT THE C TITLE BLOCK AT THE TOP OF THE PAGE C

C

3655 DO 3666 1=1,2 366b Bill = OSQRTIR(I,III

IFIBllI.EC.C.(,.OR.BI2I.EQ.O.GI GO TO 3B88 Rll,21 = Rll,21/IBlll*BI211 IFIM.EO.II R~ITE IICUT,36111

3611 FORMAT IIHl, 55X, IlHTIME IVI VSI IFIM.EO.21 WRITE IIOLT,36881

3688 FORMAT (lHl, SOX, 16~PATH COST IVI VSI IFIM.Ee.31 WRITE IIOLT,36g91

3699 FORMAT IIH1, 41X, 19HOVERALL COST (vI VSI IFIM.EQ.41 WQITE IICUT,31001

37~C FORMAT IIHl, 48X, 18~PERFORMANCE IY' VSI IFIN.EO.ll WRITE IIOLT,31111

3711 FORMAT IIH+, 61X, 8hTlME I XII IFIN.EC.21 hRITE IICUT,37221

3722 FORMAT IIH+, 61X. 13hPATH COST IXII IFIN.EQ.31 WRITE IIOLT,3133)

3733 FORMAT (lH~, 67X, 1611(VERALL COST (X)I IFIN.EQ.41 WRITE (ICLT,31441

3744 FORMAT IIH+, 61X, 15HPERFORHANCE IXII GC TO 13155,37771,ICUT

3755 WRITE (IOUT,3166) ~CCEIIISAVEI, NCOE211SAVEI 3766 FORMAT (lH+, 85X, 16HTERMINAL NODE = , 2~41

GC TO 3190

3177 WRITE (ICUT,3788) 3788 FORMAT (lH+, 85X, 23HCOMPOSITE TERMINAL NODE) 3199 WRITE (IOUT,38CO) R(I.21, PERFAIITALCI 380CuFORMAT (lH , lLX, 25~CORRELATION COEFFICIENT =, F5.2, 2X, 79H* MEA

INS PLOTT I NG l( OR "CRE POI NTS PER UNIT CELL - lIlt· X 55 OR CE 2LL PLOTII 111 , lOX, F2e.3, 14H IMAX Y VALUE), 7711HXII

C LeAD THE DATI APRAYS, FIRST INITIALIlE C

DO 3811 1=1,55 DC 3811 J=l.llL

3811 ISTOPEII,JI = c XMIlI = I'cRFI\IITALC) - TI"IEAIITALCI xMIZ I = PERFAI ITALPI - TIMEAI ITALPI 00 3833 l=l.IH:R IFI (CUT.EQ.2) GO TO 3B22 IF( ISAVE.NE.'>GOET( I I I GO TO 3f33

3822 J=56-156.~-II(STORETII,NI - TIMEAIITALPII/XM(21)* 54.0 ~ 1.0))+0.5 K = (lll.S-((ISTO"ETlI,MI - TIHEAIITALCIIIXMIlII*1:"9.0 ~ 1.011+0.5 ISTUREIJ,K) = ISTOREIJ,Kl + 1

3833 CCt;TI'WE

Page 89: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM

C C CONVERT STOR~GE TO PKINT CHARACTERS AND PLOT C

DO 38S5 (:1,55 DO 3844 J:l,llC K: ISTCRf;(I,JI IF(K.G=.101 K : 11 IFIK.Li.(I K : 10

3844 ISTOREII,JI = NUMB(K) 3855 wRITE (ICUT,3b66) ItSTOREII,J}' J=ltllOI 3866 FORMAT I1H , 9X, lHY, 110Al, IHY)

307

WRITE (IOUT,3377) TI~~AIITALC), TIMEAIITALP), PERFA(ITALPI 38770FORMAT IlH ,;'CX, F20.3, 141' (MIN Y 'IALUE), 7711HXlI IH , lOX,

C

IF20.3, 14H I~IN X VALLE), 44X, 14H IMAX X VALUEI, F20.31 3888 CONT INUE 3899 GC TO 13577,3900l,\CUT 39CC RETURN

END SUBROUTINE SUhl (X,Y,Z,R,KOUNT) I~PLICIT INTtGE~*41I-~I

C SUBROUTINE SUBI THRU SUB6 ARE SETUP FOR THE LSER TO CREATE HIS O~N

C TRANSFORMATIONS. THE RESULTNAT VALUE CREATED MUST 8E PLACED IN C R. KOUNT IS A COl~TEP WHICH ENABLES THE USER TO MAKE MULTIPLE C DATA TRANSFERRING CALLS TC THIS SU~RUUTINE BEFORE COMPUTING A C VALUE FOR Q. THIS EXAMPLE FINDS THE MIDDLE VALUE OF I, Y, & l. C

c

AMIN = X IFIY.LT.AMINI AMIN Y IFIZ.LT.AMINI AMIN Z AMAX = X IFIY.GT.AMAX) AMAX Y IFIl.GT.AMAXI AMAX Z IFIAMIN.N~.X.ANC.A~AX.NE.X) R X IFIAMIN.NE.Y.ANO.A~AX.NE.YI R Y IFIAMI~.~c.Z.AND.AMAX.NE.lI R l RETUR'J END SUBROUTI1~c SUB2 (X,Y,l,R,I<OUNTI IMPLICIT INTEbER*4(I-NI

C SUBROUTINE SUBI THRU SUB6 ARE SETUP FOR THE USER TO CREATE HIS OW~ C TRANSFOR~ATIONS. THE ~ESULTNAT VALUE CREATED MUST BE PLACED I~ C R. KOUNT IS A CCU~TER WHICH ENABLES THE USER TO MAKE MULTIPLE C DATA TRANSFERRING CALLS TC THIS SUBROUTINE BEFORE COMPUTING A C VALUE FOR R. THIS EXAMPLE EVALUATES THE EXPRESSION BELOW. C

C

R = IX**3 + Y~*41Il**C.3 RETURN END SUBROUTINE SUB3 (X,Y,Z,R,KOUNTI IMPLICIT I~TEGER*4(I-~)

C SUBROUTI'JE SUBI THRU SUB6 ARE SETUP FOR THE USER TO CREATE HIS O~N C TRANSFORMATIONS. THE RESULTNAT VALUE CREATED MUST BE PLACED IN C R. KOUNT IS A CO~NTER WHICH ENABLES THE USER TO'MAKE MULTIPLE C DATA T~ANSFERRING CALLS TO THIS SUBROUTINE BEFORE COMPUTING A C VALUE FOR R. THIS EXAMPLE SUBROUTINE FINDS THE ABSOLUTE VALUe C OF THE PRCQUCT CF x, V, , AND Z. C

R = ABS( X*Y*Zl RETURN

Page 90: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

308

C

END SUBROUTI~E sue4 IX.Y.l,R,KOUNTI I~PLICIT I~T~~ER*411-~1

APPENDIX

C SUBKOUTI;I~ SU?I THRU SU136 ARE SETUP FCR THE USER TO CREATE HIS OwN C TRANSFQP~ATICNS. THE PESULTNAT VALUE CREATED ~UST BE PLACED IN C ~. KCUNT IS A CCL~TER WHICH ENABLES THE USER TO MAKE MULTIPLE C D~TA TRA~SFEARING CALLS TC THIS SUBROUTINE BEFORE COMPUTING A C VALUE FOA R. TblS EXAMPLE SUBROUTINE FINOS THE ABSOLLTE VALLE C SF THE SU~ CF X, y, AND l. C

C

R = ABS(X+Y+ll RETURN END suaROUTI~[ SUB5 (X,y,Z,R,KOU~TI

I~?LICIT I~TE~ER*4(I-NI

C SUBROUTINE SUBI THRU SUB6 ARE SFTUP FCR THE USER TO CREATE HIS OWN C TRANSFORMATIONS. THE ~ESULT~AT VALUE CREATED MUST BE PLACED IN C R. KCUNT IS A CCU~TER WHICH ENABLES THE USER TO MAKE MULTIPLe C lJAT:' TllANSFERRI!l.G CALLS TO THIS SUBROUTItiE BEF(lRE COMPUTING A C YAlU~ FOR K. THIS EXAMPLE SUBROUTINE FINDS THE SUM OF THE C ABSCLUT~ CALU~S CF X, V, A~D I. C

c

R = ABSIX' + ~eSIY' + ABS(ZI RETUR"l END SUBRCUTI~E SL86 (X,Y,Z,R,KOUNTI I,.PllCIT PHEGER*4(1-NI CO~MON/SIMS/F'12511,SPACE,SU",NU~BFX

C SUBROUTI~~ suel THRU SUB6 ARE SETUP FOR THE' USER TO CREATE HIS OwN C TRANSFOR',JICNS. THE RESULT~AT VALUE CREATED MUST BE PLACED IN C ~. KGUNT IS A COL~TER WHICH ENABLES THE USER TO MAKE MULTIPLE C DATA TRANSfERRING CALLS TG THIS SUBROUTINE. BEFORE COMPUTING A C vALUE FOR~. T~IS EXAMPLE SUBROUTINE WITH SUBROUTINE C SI~SON, CCMPUTE T~E INTEGRAL OF E**T OT CVCR THE INTEGRAL OF C X TO Y. C

c C C C C C

MAXFX = 251 SPACE = ~.OI NUMBFX = IY-XI/SPACE + I.QQqqq I = (NUM8rX/ZI*Z IFII.EQ.NUI"aFXI NUMBFX = NUMBFX + 1 IFINUM6FX.GT.MAXFXI RETUR~

SPACE = IY-XI/FLOATI~UMBFX-ll DO 3911 1=1,~UMBFX FXIII = 'OXP(XI

3911 x = X + SPACe CAll SIMSCN R = SUM RETURN Er-oc SLBROUTI~E SI~SON

IMPLICIT INT=~ER*4(I-~1 COMMON/SIMS/FX(251',SPACE,SUM,NUMBFX

NUMBFX= SPACE SUM FX

NUMB~~ CF PGI~TS TO BE INTEGRATED (,.UST BE AN 000 NUMBERI SPACING BET~EEN THE POINTS OF INTEGRATION ON THE X-AXIS FINAL VALUE CF THE INTEGRATION ARRAY OF PCI~TS TO BE INTEGRATED ON THE F(XI-AXIS

Page 91: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

VERT-3 COMPUTER PROGRAM

rj = NUMBFX - 3 SLM = U.:'-DO j922 [=2,"',2

3922 SUM = SUM + 4.G*FX( II + 2.~*FX(I+II

309

SUM = (SUM + Fxlll + 4.U*FX(NUMBFX-II + FXINUMBFXII*SPACE/3.0 RETURN 2'W

Page 92: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

REFERENCES

Archibald, R. D. 1976. Managing High Technology Programs and Projects. New York: Wiley.

Beer, S. 1968. Management Science. Garden City, N.Y.: Doubleday. Brown, E. L. 1975. "An Application of Simulation Networking Techniques in

Operational Test Design and Evaluation." Unpublished masters thesis. Georgia Institute of Technology, Atlanta.

A Course of Instruction in Risk Analysis. 1972. ALM-3315-H. United States Army Logistics Management Center, Fort Lee, Va.

Crowstone, W. B., and G. L. Thompson. 1967. "Decision CPM: A Method for Simultaneous Planning, Scheduling, and Control of Projects." Operations Re­search 15:407-26.

Dalkey, N. 1969. "An Experimental Study of Group Opinion, The Delphi Method." Futures (5):408-26.

Digman, L. A. 1967. "PERT/LOB: Life-Cycle Technique." Journal of Industrial Engineering 28 (2): 154-58.

___ . 1980. "A Decision Analysis of the Airline Coupon Strategy." Interfaces 10 (2):97-101

___ , and G. I. Green. 1981. "A Framework for Evaluating Network Planning and Control Techniques." Research Management 24 (1):10-17.

DOD/NASA Guide to PERT/COST Systems Design. 1962. Washington, D.C.: Office of the Secretary of Defense and National Aeronautics and Space Ad­ministration (June).

311

Page 93: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

312 REFERENCES

Eisner, H. 1962. "A Generalized Network Approach to the Planning and Schedul­ing of a Research Program." Operations Research 10:115-25.

Elmaghraby, S. E. 1964. "An Algebra for the Analysis of Generalized Activity Net­work." Management Science 10:494-514.

Hespos, R. F., and P. A. Strassman. 1965. "Stochastic Decision Trees for the Analysis of Investment Decisions." Management Science, series B, 11 (10):244-59.

"Improvement in Weapon Systems Acquisition." 1%9. Memorandum from the Deputy Secretary of Defense to the Secretaries of the Army, Navy, and Air Force, Washington, D.C. (July 31).

Juran, J. M. 1964. Managerial Breakthrough: A New Concept of the Manager's Job. New York: McGraw-Hill.

Lee, S. M. 1981. Management by Multiple Objectives. Princeton, N.J.: Petrocelli Books.

___ , and L. J. Moore. 1975. Introduction to Decision Science. New York: Petro­celli! Charter.

__ , __ , and B. W. Taylor. 1978. "Analysis of Multi-Objective Project Crashing Models." AIlE Transactions 10 (2): 163-69.

___ , ___ , and ___ . 1981. Management Science. Dubuque, Iowa: Wm. C. Brown.

__ , O. Park, and S. Economides. 1978. "Optimal Resource Planning for Multiple Projects." Decision Sciences 9 (1 ):49-67.

Lindblom, C. E. 1959. "The Science of Muddling Through." Public Administra­tion Review 20 (Spring):79-88.

Magee, J. F. 1964a. "Decision Trees for Decision Making." Harvard Business Review 42 (4): 126.

___ . 1964b. "How to Use Decision Trees in Capital Investment." Harvard Busi­ness Review 42 (5):79.

Malcolm, D. G., et al. 1959. "Application of a Technique for Research and Development Program Evaluation." Operations Research 7:646-69.

Maslow, A. 1965. Eupsychian Management: A Journal. Homewood, Ill.: Irwin-Dorsey.

Mathematica. 1970. Mathnet, preliminary ed. Princeton, N.J. McLuhan, Marshall. 1964. Understanding Media. New York: McGraw-Hill. Mintzberg, Henry. 1975. "The Manager's Job: Folklore and Fact." Harvard Busi-

ness Review 53 (4):49. Moder, J. J., and C. R. Philips. 1964. Project Management with CPM and PERT.

New York: Reinhold. Moeller, G. L. 1971. Statnet. Rock Island, Ill.: U.S. Army Management Engineer­

ing Training Agency. ___ . 1972. "VERT." Technical papers of the American Institute of Industrial

Engineers, 23rd conference and convention, Anaheim, Calif. ___ , and L. A. Digman. 1978. "VERT: A Technique to Assess Risks." Vol. 2,

proceedings of the American Institute for Decision Sciences, 10th annual con­ference, St. Louis, Mo. (October).

Page 94: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

REFERENCES 313

__ , .and __ . 1981a. "Operations Planning with VERT." Operations Research 29 (4).

__ , and __ . 1981b. "A Stochastic Networking Approach to Strategic Plan­ning." Long Range Planning (forthcoming).

Moore, Laurence J., and Edward R. Clayton. 1976. GERT Modeling and Simula­tion: Fundamentals and Applications. New York: Petrocelli/Charter.

Northrop, G. M., et aI. 1970. "Use of Quantified Expert Judgment in Cost Effec­tiveness Studies." Paper presented at the 38th national meeting of the Operations Research Society of America, Detroit, Mich.

Percy, Stephen R. 1973. "Advanced Solvnet: A Network Analyzer Program." Re­port no. Papas-14. Prepared by Plans Office, Picatinny Arsenal, Dover, N.J. (January).

Pritsker, A. A. B. 1977. Modeling and Analysis Using Q-GERT Networks. New York: Halsted Press.

__ , and W. W. Happ. 1966. "GERT: Graphical Evaluation and Review Tech­nique-Part I." Journal of Industrial Engineering 18 (5): 267-74.

__ , and C. D. Pegden. 1979. Introduction to Simulation and SLAM. New York: Halsted Press

__ , and G. G. Whitehouse. 1966. "GERT: Graphical Evaluation and Review Technique-Part II." Journal of Industrial Engineering 18 (6):293-301.

Project Management System (PMS) 360: Application Description Manual, 2nd ed., no. GH2oo21O. 1968. White Plains, N.Y.: IBM Corporation.

Quinn, J. B. 1977. "Strategic Goals: Process and Politics." Sloan Management Review 19 (1):21.

Raiffa, H. 1968. Decision Analysis: Introductory Lectures on Choices under Uncer­tainty. Reading, Mass.: Addison-Wesley.

Rappaport, A. 1979. "Strategic Analysis for More Profitable Acquisitions." Harvard Business Review 57 (4):99-110.

Salter, M. S., and W. A. Weinhold. 1981. "Choosing Compatible Acquisitions." Harvard Business Review 59 (1):117-27.

Schoderbek, P., and L. A. Digman. 1967a. "Third Generation, PERT/LOB." Har­vard Business Review 45 (5):100-10.

__ , and __ . 1967b. "Third Generation in PERT Systems." In R. W. Millman and M. P. Hottenstein, eds., Promising Research Directions: Academy oj Management Proceedings. Washington, D.C.

Thomas, Maj. T. N. 1977. "VERT -A Risk Analysis Technique for Program Manag­ers." Unpublished report. Defense Systems Management College, Ft. Belvoir, Va.

Uyterhoeven, H. T., R. W. Ackerman, and J. W. Rosenblum. 1977. Strategy and Organization, rev. ed. Homewood, III.: Irwin.

Weston, J.F., and E.F. Brigham. 1969. Essentials of Managerial Finance, 3rd ed. New York: Holt, Rinehart & Winston.

Wiest, Jerome D., and Ferdinand K. Levy. 1977. A Management Guide to PERT/CPM, 2nded. Englewood Cliffs, N:J.: Prentice-Hall.

,Work Scheduling Techniques. 1968. U.S. Department of Army pamphlet no.1-54 (March).

Page 95: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

Ackerman, R. W., 313 Activities in stochastic networks, 31 ALL: output logic, 51, 68; risk analysis,

32 Alternative energy source analysis,

application ofVERT-3 to, 179 Analysis of strategic decisions, 10 Analytic functions of management, 3 Analytical techniques: deterministic, 3;

network, 3; simulation, 3; stochastic, 3

AND: input logic, 50, 66; risk analysis, 31

Applications of VERT -3: to alternative energy sources, 179; and decision trees, 174; to mergers and acquisitions, 202; military, 217; and multiple performance attributes, 157; to new-product development decisions, 167; operational, 217; planning, 217; to project management, 135; to project selection, 157; to strategic decision

INDEX

analysis, 39, 202, 217; to weapon system development, 217

Archibald, R. D., 32, 31 I Arcs: cumulative set values of, in

VERT-3, 49,132; free, 62; primary set values of, in VERT-3, 49; in risk analysis, 31; transportation, 62

Arcs module, 76, 89

Beer, S., 6, 3II Breakthrough concept, 7 Brigham, E .F., 313 Brown, E. L., 311

Cards, input: arcs module, 76, 89; control and problem options module, 75,79; formats of, 79; nodes module, 77,107

Check variables, 131 Clayton, E. R., 37, 312 Coefficient of variation, 116 COMPARE: node logic, 71; unit logic,

52

315

Page 96: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

316

Composite terminal node histogram input options card, 76, 88

Computer equipment, 125 Computer program, VERT-3, 219 Conditions for modeling, 8 Contingency planning, 214 Control function, 7 Control options card, 75, 79 Control and problem options module,

75, 79 Correlation computation and plot

option card, 76, 86 Cost histogram satellite arc cards, 93 Cost math-related satellite arc cards,

100 Cost-performance time intervals option

card, 76, 86 Cost-pruning option, 113 Cost statistical distribution satellite arc

card,92 Costs, concern to management of, 16,

213 Course of Instruction in Risk Analysis,

311 CPM: development of, 12,29,30; and

project management, 13 Critical/optimum path index, 38, 115 Critical path, 38, 56, 115 Crowstone, W. B., 31, 311

Dalkey, N., 179,311 Data input preparation, 78 Data storage arrays, 131 Decision CPM, development of, 31 Decision-making function, 6 Decision tree and application of

VERT-3,174 Decisions: amenable to quantitative

analysis, 7; concept, 214; project, 214; under risk, 47; strategic, 214

Deterministic techniques: description of, 3, 34; and network technology, 31

Digman, L. A., 3, 34, 36, 39,179,311 DOD/NASA Guide to PERT/Cost

Systems Design, 35,311

Economides, S., 312 Eisner, H., 30, 312 Elmaghraby, S. E., 30, 312 Error messages, 113 Events in stochastic networks, 31

FILTER 1 output logic, 51, 69 FILTER 2 output logic, 52, 69 FIL TER 3 output logic, 52, 69

INDEX

FILTER Number 1 satellite arc card, 77, 102

FILTER Number 2 satellite arc card, 77, 103

FILTER Number 3 satellite arc card, 77, 103

Formats for input preparation, 79 Free are, 62 Full print trip option card, 76, 85 Functions: control, 7; decision-making,

6; main, 126; managerial, 4; planning, 7; subroutine, 126

GERT: ability to simulate with, 37; and concept of project management, 13; cost as dependent variable in, 37; history and origin of, 12

Green, G. I., 13,34,39,311

Happ, W. W., 30, 313 Hespos, R. F., 31, 312 Histogram satellite arc cards, 77, 93,

94 Histogram satellite node card, 78, III

Information processing, project, 19 INITIAL,128 INITIAL input logic, 50, 66 Input logic, 50, 66 Input modules: arcs, 76, 89; card

formats and, 75, 79; control and problem options, 75, 79; nodes, 79, 107; overview of, 74; preparation instructions for, 79

Juran, J. M., 7, 312

Page 97: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

INDEX

Kurtosis, 116

Lee, S. M., 312 Levy, F. K., 35, 313 Life-cycle management information

needs, 17 Lindblom, C. E., 5, 312 Line of balance (LOB), 36; and concept

of project management, 13 Logic, network, 66; input, 50, 66;

output, 51, 68; unit, 52, 70

Magee, J. F., 176,312 Malcolm, D. G., 312 Management: information needs of, 16;

parameters of concern to, 16 Management science, 6, 10; applied to

strategic decisions, 10; definition of, 23; distinguishing characteristics of, 24; role of, 6; scientific method in, 24

Management science models, 23 Managerial functions, 4, 6; key elements

of, 5; roles and, 4; strategic planning and,5

Maslow, A., 8, 312 Master arc card, 76, 89 Master node card, 77, 107 Material Requirements Planning

(MRP),36 Math-related satellite arc cards, 77, 94,

100 Mathematica risk analysis, 31 Mathematical relationships, 33, 54, 94,

214; structuring of, within VERT, 55

MA THNET risk analysis, 32 McLuhan, M., 8, 312 Mintzberg, H., 4,312 Modeling, 8; conditions for, 8 Models: management science, 23; types

of,26 Moder, J. J., 312 Modules, input: arcs, 76, 89; control

and problem options, 75, 79; nodes, 77,107; overview of, 74

317

Moeller, G. L., 32, 33, 39,179,312-13 MONTE CARLO: cost-conditioned

satellite arc card, 77, 106; output logic, 51, 68; performance­conditioned satellite arc card, 77, 106; satellite arc card, 77, 104; time­conditioned satellite arc card, 77, 105

Moore, L. J., 37, 313 Multiple performance attributes: and

application ofVERT-3, 157; example of, 157

Network construction, 53; and arcs, 62; definition of, 61; examples of, 53, 62, 64; and free arc, 62; general concepts of, 62; number of arcs and nodes required in, 63; and parameters, 62; and parametric values, 63; and requirement values, 64; and transportation arc, 62; units of measure in, 64; weights in, 64

Network logic, 66; split-node, 66 Network models, history of, 28 Network symbols, VERT-3, 49 Network technology: development of,

31; and risk analysis, 31 Network time for composite terminal

node, 118 Networking techniques: comparison and

evaluation of, 39; description of, 34 New-product development decisions,

application of VERT-3 to, 167 Node logic: development of VERT, 33;

single-unit, 38, 66; split-, 38, 66 Nodes, 132; composite terminal, 114;

internal, 114; intervals between, 114; network construction and, 63; in risk analysis, 31; split-logic, 38, 66; unit­logic, 38, 70

Nodes module, 77, 107 Northrup, G. M., 179,313

Operands, 60 Optimum path, 56, 115 Optimum terminal node index chart, 117

Page 98: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

318

OR input logic, 50, 67; in risk analysis, 31

Organizational success, elements of, 5 Output forms, 56 Output logic, 51, 68 Output reports, samples of, 117 Output sequence, 1I5 Outputs, 113; measures of results of,

114 Overall cost, 114; for composite

terminal node, 119 Overlay structure, 125, 129

Packard, D., 31 Parameters: of concern to management,

16,213; network construction and, 61 Parametric values, 63 Park, 0.,312 PARTIAL AND input logic, 50, 67 Path cost for node, 114, 120 Pegden, C. D., 216, 313 Percy, S. R., 32, 313 Performance, concern of, to

management, 16,213 Performance histogram satellite arc

cards, 94 Performance math-related satellite arc

cards, 100 Performance statistical distribution

satellite arc card, 92 PERT concept of project management,

13 PERT: development of, 29; history and

origin of, 12 PERT/Cost: development of, 29; and

project management, 13 PERT/Cost technique, description of,

35 PERT /CPM: approach of, 35;

description of, 34 PERT/Reliability, development of, 29 PERT/Time, development of, 29 Philips, C. R., 312 Planning, 7 Positive cost incurred, 123

PREFERRED node logic, 52, 71 Present-value analysis, 124

INDEX

Pritsker, A. A. B., 30,216.313 Pritsker and Associates. 215. 216 Probabilistic network. advantages of,

37 Probabilistic nodes (events), 36 Problem identification options card. 76,

85 Project: information processing, 19;

life-cycle phases. 14; management information needs, 16; parameters of concern to management, 16

Project management: application of VERT-3 to, 135; concept of. 13

Project Management System 360, 36 Project selection. application of

VERT-3 to. 157

Q-GERT.215 Quantitative analysis, decisions

amenable to, 7 QUEUE node logic, 52, 72 Quinn, J. B., 5, 313

Raiffa, H., 166, 179,313 Rappaport. A.. 313 RISCA risk analysis technique, 32 Risk: analysis of, 8, 31; concern to

management of, 18; decisions under, 47

Rosenblum, J. W .• 313

Salter, M. S., 313 Scenarios, 214 Schoderbek, P .• 36, 313 Scientific method, 24 Sensitivity analysis, 58 Simulation. techniques of, 3, 55 Single-unit logic, 38, 50 Slack histogram satellite arc card, 77,

106 Slack histogram satellite node card, 78,

112 Slack time, 114

Page 99: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

INDEX

SLAM, 216 SOL VNET risk analysis technique, 32 SORT node logic, 52, 73 Split-node logic, 38, 50, 66 Standard deviation, 116 Statistical distribution satellite arc

cards, 77, 90, 92 Statistical distributions, VERT-3 listing

of, 54 Statistical measures, interpretation of,

116 ST ATNET risk analysis technique, 32 Stochastic capabilities, development of,

30 Stochastic techniques, 3, 36 Strassman, P. A., 31, 312 Strategic decisions: analysis of, 10,39,

202; applications of VERT-3 to, 202, 217; management science and, 10; merger and acquisitions example of, 202

Strategic planning, 5 Subroutines, VERT-3, 126 Subtract satellite node card, 78, 112 Symbols, VERT-3 networking, 49

Taylor, B. W., 312 Techniques, comparision of, 39 TERMINAL output logic, 51, 68 Thomas, Maj. T. N., 313 Thompson, G. L., 31,311 Time, concern of, to management, 16,

213 Time histogram satellite arc cards, 93 Time-math related satellite arc cards, 94 Time statistical distribution satellite arc

card,90 Transformation example, 101 Transformations, 94 Transportation arc 62

Unit logic, 52 Unit-logic: nodes, 70; risk analysis, 32 U.S. Army, 313; and risk analysis, 31 Uyterhoeven, H. T., 5, 313

Variance, 116 Venture concepts, evaluating

alternative, 21 Ventures, 11

319

VERT: arcs and nodes in, 38; and concept of project management, 13; critical/optimum path in, 56; critical/optimum path index in, 38; critical path in, 38; and degrees of completion, 214; development of, 32; equal treatment of parameters with, 59; flexibility of nodes in, 214; future of, 217; histogram in, 38; history and origin of, 13; mathematical relationships in, 33, 38, 214; new applications of, 217; and performance, 38; process of, 57; relationship between arcs and nodes in, 214; relationship between parameters in, 214; and risk analysis, 56; simulation in, 38, 55; and single­unit logic, 38; and split-node logic, 38; and statistical distributions, 38; and stochastic techniques, 37; and strategic decision analysis, 39

VERT-2, development of, 33 VERT-3: and accumulated cost, 34; and

activities, 49; addition of nodes to, 34; advantages of, 213; applications of,39, 135, 157, 167, 174, 179,202, 217; arcs in, 49; basic network symbols in, 49; capabilities of, 213; computer program for, 219-309; and cost parameter, 213; critical path in, 34; and decision points, 49; description of, 47; development of, 33; features of, 213; future of, 217; histogram form in, 34; limitations of, 215; mathematical relationships in, 33; measures in, 49; model of, 49; new features of, 216; nodes in, 49; optimal path in, 34; optimum terminal node index in, 115; and overall cost, 34; and parameters (time, cost, performance), 49, 213;

Page 100: VERT-3 Computer Program - Springer978-94-009-8171-3/1.pdf · 4karc.li?c,maqc,naqc,italc,italp,istaq logical slak,mude.infc, infp,dlsc.nisp,crit,kgen,med,single,dou9le this subrouti~e

320

and path cost, 34; and results parameter, 213; and subroutine functions, 126; and time parameter, 213; types of decisions with, 214; values of, 213

Weinhold, W. A., 313 Weston, J. F., 313 Whitehouse, G. G., 313 Wiest, J. D., 35, 313

INDEX