Reactive Methods to Solve the Berth AllocationProblem with Stochastic Arrival and Handling Times
|
|
- Hilda Craig
- 5 years ago
- Views:
Transcription
1 Reacve Mehods o Solve he Berh AllocaonProblem wh Sochasc Arrval and Handlng Tmes Nsh Umang* Mchel Berlare* * TRANSP-OR, Ecole Polyechnque Fédérale de Lausanne Frs Workshop on Large Scale Opmzaon November 21-22, 2012, Vevey, Swzerland
2 Conens Movaon Research Objecves Bref Leraure revew Problem Saemen Mehodology Compuaonal Resuls Conclusons and Fuure Work
3 Movaon Hgh level of uncerany n por operaons due o weaher condons, mechancal problems ec. Dsrup he normal funconng of he por Requre quck real me acon. Very few sudes address he problem of real me recovery n por operaons, whle he problem has no been sudedd a all n conex of bulk pors. Our research problem derves from he realsc requremens a he SAQR por, Ras Al Khamah, UAE
4 Research Objecves Develop real me algorhms allocaon problem(bap) for dsrupon recovery n berh For a gven baselne berhng schedule, mnmze he oal realzed coss of he updaed schedule as acual arrval and handlng me daasrevealednrealme.
5 Leraure Revew Very scarce sudes on real me and robus algorhms n conaner ermnals. To he bes of our knowledge, no leraure on bulk pors. OR leraure relaed o BAP under uncerany n conaner ermnals Pro-acve Robusness Sochasc programmng approach usedbyzheneal.(2011), Haneal.(2010) Defne surrogae problems o defne he sochasc naure of he problem: Moorhy and Teo (2006),ZhenandChang(2012),Xueal.(2012)and Hendrkseal.(2010) Reacve approach or dsrupon managemen Zeng e al.(2012) and Du e al. (2010) propose reacve sraeges o mnmze he mpac of dsrupons.
6 Schemac Dagram of a Bulk Termnal YARD SPACE cargo blocks w= 11 ROCK FACTORY CONVEYOR w= 12 OIL TANK TERMINAL PIPELINE w= 2 SILICA SAND w= 4 CLAY w= 6 SODA ASH w= 8 CEMENT w= 10 COAL w= 1 ANIMAL FEED w= 3 GRAIN w= 5 ROCK AGGREGATES w= 7 FELDSPAR w= 9 LIMESTONE secons along he quay k = 1 k = 2 k = 3 k = 4 Vessel berhed a secon k=5 carryng cemen k = 5 k = 6 k = 7 k = 8 QUAY SPACE Vessel 1 Vessel 2 Vessel 3
7 Baselne Schedule Any feasble berhng assgnmen and schedule of vessels along he quay respecng he spaal and emporal consrans on he ndvdual vessels Bes case: Opmal soluon of he deermnsc berh allocaon problem (whou accounng for any uncerany n nformaon)
8 Deermnsc BAP: Problem Defnon Fnd Gven Opmal assgnmen and schedule of vessels along he quay (whou accounng for any uncerany) Expeced arrval mes of vessels Esmaed handlng mes of vessels dependen on cargo ype on he vessel (he relave locaon of he vessel along he quay wh respec o he cargo locaon on he yard) and he number of cranes operang on he vessel Objecve Mnmze oal servce mes (wang me + handlng me) of vessels berhng a he por Resuls Near opmal soluon obaned usng se paronng mehod or heursc based on squeaky wheel opmzaon for nsances conanng up o 40 vessels
9 Real Tme Recovery n Berh Allocaon Problem
10 Problem Defnon: Rea Objecve: For a gven baselne ber realzed coss of he acual berhng n real me Z Z Z Z mn + + = ) ' ( 3 3 = o N w c Z ) ( ) ' ( ( = u N c k b k b c Z ) ) ' ( ' ( 1 + = u N k h a m Z al me recovery n BAP rhng schedule, mnmze he oal g schedule as acual daa s revealed ) ' 2 e e µ Servce cos of unassgned vessels Cos of re-allocaon of unassgned vessels Berhng delays o vessels arrvng on-me
11 Problem Defnon: Real me recovery n BAP Key arrval dsrupon paern n real me For each vessel ϵn, we are gven an expeced arrval me A whch s known n advance. The expeced arrval me of a gven vessel may be updaed F mes durng he plannng horzon of lengh H a me nsans 1, 2 F such ha 0 1 < 2 < 3. (F-1 1) < F < a where a s he acual arrval me of he vessel, and he correspondng arrval me updae a me nsan F s A F for all ϵn. Acual handlng me of a vessel s revealed a he me nsan when he handlng of he vessel s acually fnshed
12 Modelng he Uncerany Uncerany n arrval mes Arrval mes are modeled usng a unform dsrbuon. Acual arrval me a of vessel les n he range [A -V, A +V], where A s he expeced arrval me of vessel a he sar of he plannng horzon. A any gven me nsan n he plannng horzon, he followng 3 cases arse Case I : vessel has arrved and he acual arrval me a s known Case II : he vessel hasn arrved ye bu he expeced arrval me A s known Case III : neher he acual nor he expeced arrval me s known a me nsan, hen he arrval me esmae a a me nsan s such ha a [, A + V ], and s deermned from he followng equaon Pr ob( a a ) = ρ a Snce he arrval me of vessel s assumed o be unformly dsrbued, a = + ρ a ( A A + V )
13 Modelng he Uncerany Uncerany n handlng mes Handlng mes are modeled usng a runcaed exponenal dsrbuon. Handlng me h (k) of vessel berhed a sarng secon k les n he range [H (k), γh (k)], where H (k) s he esmaed (deermnsc) handlng me of vessel berhed a sarng secon k A any gven me nsan n he plannng horzon, he followng 3 cases arse Case I : he handlng of vessel berhed a sarng secon k s fnshed, hen he acual handlng me h (k ) s known Case II : he vessel s beng handled a me nsan, hus he acual berhng poson k of he vessel s known, bu he acual handlng me s unknown. The handlng me esmae a me nsan s gven by Pr ob ( h ( k ' ) h ( k ' )) = Case III : he vessel s no assgned ye, n whch case he handlng me of he vessel a me nsan for any berhng poson k s gven by Pr Snce he handlng mes follow a runcaed exponenally dsrbuon, ob ( h ( k ) h ( k )) = ρ h ρ h h ( k ) = 1 / λ ln( e λ h L ( k ) ρ h ( e λ h L e U ( k ) λ h ( k ) ))
14 Soluon Algorhms Opmzaon Based Recovery Algorhm Re-opmze he berhng schedule of all unassgned vessels usng se-paronng approach every me here s a dsrupon arrval me of any vessel s updaed and devaes from s prevous expeced value. handlng of any vessel s fnshed and devaes from he esmaed value he fuure vessel arrval and handlng mes provded as npu parameers are modeled as dscussed earler he berhng assgnmen of all vessels ha have already been assgned o he quay s consdered frozen and unchangeable Smar Greedy Recovery Algorhm Assgn an ncomng vessel o he quay as arrves as soon as berhng space s avalable, o he secon(s) a whch he oal realzed cos of all he unassgned vessels a ha nsan s mnmzed by modelng he uncerany n fuure vessel arrval and handlng mes of oher vessels Vessel s assgned a or afer he esmaed berhng me of he vessel (as per he baselne schedule) In he deermnaon of he oal realzed cos o assgn a gven vessel a a gven se of secon(s), all oher unassgned vessels are assgned o he esmaed berhng secons as per he baselne schedule
15 Benchmark Soluons Greedy Recovery Algorhm Assgn he vessels as hey arrve as soon as berhng space s avalable. Any gven vessel s assgned a hose se of secons where he realzed cos of assgnng s mnmzed No need o model uncerany n fuure arrval and handlng mes Closely represens he ongong pracce a he por Apror Opmzaon Approach Assume ha all arrval and handlng delay nformaon s avalable a he sar of he plannng horzon Problem of real me recovery reduces o solvng he deermnsc berh allocaon problem wh he objecve funcon o mnmze oal realzed cos of he schedule Provdes a lower bound o he mnmzaon problem of real me recovery beng solved
16 Arrval Dsrupon Scenaro Vessel EAT Vessel 0: 23(21) ATA:26 Vessel 1: 9(2) 14(4) 17(5) ATA:8 Vessel 2: 24(3) 31(7) 15(9) 21(12) 24(13) 16(14) 30(15) 32(16) 21(17) 20(18) 20(19) 21(20) ATA:21 Vessel 3: 22(8) ATA:10 Vessel 4: 16(1) 16(2) ATA:6 Vessel 5: 19(8) 12(10) 15(13) 24(14) 24(15) 18(16) 20(17) 24(18) 22(19) 22(20) ATA:21 Vessel 6: 15(8) ATA:16 Vessel 7: 3(1) 10(6) 13(7) 19(10) 32(11) 23(12) 22(13) 19(14) 26(15) 32(16) 31(17) 31(18) 29(19) 21(20) ATA:21 Vessel 8: 29(1) 20(2) 19(4) 9(5) ATA:7 Vessel 9: 3(2) ATA:20 Vessel 10: 10(1) 15(6) 8(7) 14(8) 13(9) 16(10) ATA:11 Vessel 11: 23(6) 18(7) 15(9) 12(10) 16(11) 20(12) ATA:13 Vessel 12: 29(1) ATA:10 Vessel 13: 5(0) 8(6) ATA:9 Vessel 14: 17(2) 27(4) 13(9) 26(15) 22(16) 27(17) 27(18) 33(19) 25(20) 23(21) 34(22) ATA:23 Vessel 15: 19(2) 12(4) 7(5) 7(6) 29(7) 29(9) 16(10) 20(11) 20(12) 24(13) 28(14) ATA:15 Vessel 16: 15(6) 10(8) 11(9) 28(10) 27(11) 29(12) 16(13) 15(14) ATA:15 Vessel 17: ATA:-12 Vessel 18: 29(8) 13(9) 25(10) 30(12) 34(13) 18(14) 25(15) 20(16) 29(17) 34(18) 34(19) ATA:20 Vessel 19: ATA:-15 Vessel 20: ATA:-1 Vessel 21: 7(6) 20(9) 25(14) 24(19) 22(20) 27(21) 23(22) 26(23) ATA:24 Vessel 22: 12(0) ATA:5 Vessel 23: 21(5) 14(6) 13(7) 10(8) 10(9) 24(13) 19(14) 17(15) 27(16) ATA:17 Vessel 24: ATA:-1
17 Compuaonal Resuls N =10 vessels, M = 10 secons, c 1 = c 3 = 1.0, c 2 = 0.002, U= 4 hours, V= 5, γ= 1.1 Mean Gap wh respec o he apror opmzaon soluon Greedy Approach Opmzaon based Approach Smar Greedy Approach 7.65% 3.16% 7.81%
18 Compuaonal Resuls N =25 vessels, M = 10 secons, c 1 = c 3 = 1.0, c 2 = 0.002, U= 4 hours, V= 5, γ= 1.1 Mean Gap wh respec o he apror opmzaon soluon Greedy Approach Opmzaon based Approach Smar Greedy Approach % % %
19 Compuaonal Resuls N =10 vessels, M = 10 secons, c 1 = c 3 = 1.0, c 2 = 0.002, U= 4 hours, V= 10, γ= 1.1 Mean Gap wh respec o he apror opmzaon soluon Greedy Approach Opmzaon based Approach Smar Greedy Approach % 3.06 % 8.56 %
20 Compuaonal Resuls N =25 vessels, M = 10 secons, c 1 = c 3 = 1.0, c 2 = 0.002, U= 4 hours, V= 10, γ= 1.1 Mean Gap wh respec o he apror opmzaon soluon Greedy Approach Opmzaon based Approach Smar Greedy Approach % % %
21 Compuaonal Resuls N =25 vessels, M = 10 secons, c 1 = c 3 = 1.0, c 2 = 0.002, U= 4 hours, V= 24, γ= 1.2 Mean Gap wh respec o he apror opmzaon soluon Greedy Approach Opmzaon based Approach Smar Greedy Approach % % %
22 Conclusons and Fuure Work Modelng he uncerany n fuure vessel arrval and handlng mes can sgnfcanly reduce he oal realzed coss of he schedule, n comparson o he ongong pracce of re-assgnng vessels a he por. The opmzaon based recovery algorhm ouperforms he heursc based smar greedy recovery algorhm, bu s compuaonally expensve. Lmaon: Modelng of uncerany fals o produce good resuls for larger nsance sze or when he sochascy n arrval mes and/or handlng mes s oo hgh. As par of fuure work, plan o develop a robus formulaon of he berh allocaon problem wh a ceran degree of ancpaon of varably n nformaon.
23 Thank you!
24 Problem Defnon: Real me recovery n BAP Penaly Cos on lae arrvng vessels: Impose a penaly fees on vessels arrvng beyond he rgh end of he arrval wndow, A +U Penaly Cos Arrval TmeWndow = 2U g c 3 g slope = c 3 A -U A A +U a Acual Arrval Tme
V.Abramov - FURTHER ANALYSIS OF CONFIDENCE INTERVALS FOR LARGE CLIENT/SERVER COMPUTER NETWORKS
R&RATA # Vol.) 8, March FURTHER AALYSIS OF COFIDECE ITERVALS FOR LARGE CLIET/SERVER COMPUTER ETWORKS Vyacheslav Abramov School of Mahemacal Scences, Monash Unversy, Buldng 8, Level 4, Clayon Campus, Wellngon
More informationUNIVERSITAT AUTÒNOMA DE BARCELONA MARCH 2017 EXAMINATION
INTERNATIONAL TRADE T. J. KEHOE UNIVERSITAT AUTÒNOMA DE BARCELONA MARCH 27 EXAMINATION Please answer wo of he hree quesons. You can consul class noes, workng papers, and arcles whle you are workng on he
More informationModeling and Solving of Multi-Product Inventory Lot-Sizing with Supplier Selection under Quantity Discounts
nernaonal ournal of Appled Engneerng Research SSN 0973-4562 Volume 13, Number 10 (2018) pp. 8708-8713 Modelng and Solvng of Mul-Produc nvenory Lo-Szng wh Suppler Selecon under Quany Dscouns Naapa anchanaruangrong
More informationDynamic Team Decision Theory. EECS 558 Project Shrutivandana Sharma and David Shuman December 10, 2005
Dynamc Team Decson Theory EECS 558 Proec Shruvandana Sharma and Davd Shuman December 0, 005 Oulne Inroducon o Team Decson Theory Decomposon of he Dynamc Team Decson Problem Equvalence of Sac and Dynamc
More informationLecture 2 M/G/1 queues. M/G/1-queue
Lecure M/G/ queues M/G/-queue Posson arrval process Arbrary servce me dsrbuon Sngle server To deermne he sae of he sysem a me, we mus now The number of cusomers n he sysems N() Tme ha he cusomer currenly
More informationEEL 6266 Power System Operation and Control. Chapter 5 Unit Commitment
EEL 6266 Power Sysem Operaon and Conrol Chaper 5 Un Commmen Dynamc programmng chef advanage over enumeraon schemes s he reducon n he dmensonaly of he problem n a src prory order scheme, here are only N
More informationRobustness Experiments with Two Variance Components
Naonal Insue of Sandards and Technology (NIST) Informaon Technology Laboraory (ITL) Sascal Engneerng Dvson (SED) Robusness Expermens wh Two Varance Componens by Ana Ivelsse Avlés avles@ns.gov Conference
More informationDual Approximate Dynamic Programming for Large Scale Hydro Valleys
Dual Approxmae Dynamc Programmng for Large Scale Hydro Valleys Perre Carpener and Jean-Phlppe Chanceler 1 ENSTA ParsTech and ENPC ParsTech CMM Workshop, January 2016 1 Jon work wh J.-C. Alas, suppored
More informationThe preemptive resource-constrained project scheduling problem subject to due dates and preemption penalties: An integer programming approach
Journal of Indusral Engneerng 1 (008) 35-39 The preempve resource-consraned projec schedulng problem subjec o due daes and preempon penales An neger programmng approach B. Afshar Nadjaf Deparmen of Indusral
More informationGraduate Macroeconomics 2 Problem set 5. - Solutions
Graduae Macroeconomcs 2 Problem se. - Soluons Queson 1 To answer hs queson we need he frms frs order condons and he equaon ha deermnes he number of frms n equlbrum. The frms frs order condons are: F K
More informationSolution in semi infinite diffusion couples (error function analysis)
Soluon n sem nfne dffuson couples (error funcon analyss) Le us consder now he sem nfne dffuson couple of wo blocks wh concenraon of and I means ha, n a A- bnary sysem, s bondng beween wo blocks made of
More informationVariants of Pegasos. December 11, 2009
Inroducon Varans of Pegasos SooWoong Ryu bshboy@sanford.edu December, 009 Youngsoo Cho yc344@sanford.edu Developng a new SVM algorhm s ongong research opc. Among many exng SVM algorhms, we wll focus on
More informationThe Dynamic Programming Models for Inventory Control System with Time-varying Demand
The Dynamc Programmng Models for Invenory Conrol Sysem wh Tme-varyng Demand Truong Hong Trnh (Correspondng auhor) The Unversy of Danang, Unversy of Economcs, Venam Tel: 84-236-352-5459 E-mal: rnh.h@due.edu.vn
More informationComputational results on new staff scheduling benchmark instances
TECHNICAL REPORT Compuaonal resuls on new saff shedulng enhmark nsanes Tm Curos Rong Qu ASAP Researh Group Shool of Compuer Sene Unersy of Nongham NG8 1BB Nongham UK Frs pulshed onlne: 19-Sep-2014 las
More informationOutline. Probabilistic Model Learning. Probabilistic Model Learning. Probabilistic Model for Time-series Data: Hidden Markov Model
Probablsc Model for Tme-seres Daa: Hdden Markov Model Hrosh Mamsuka Bonformacs Cener Kyoo Unversy Oulne Three Problems for probablsc models n machne learnng. Compung lkelhood 2. Learnng 3. Parsng (predcon
More informationAPOC #232 Capacity Planning for Fault-Tolerant All-Optical Network
APOC #232 Capacy Plannng for Faul-Toleran All-Opcal Nework Mchael Kwok-Shng Ho and Kwok-wa Cheung Deparmen of Informaon ngneerng The Chnese Unversy of Hong Kong Shan, N.T., Hong Kong SAR, Chna -mal: kwcheung@e.cuhk.edu.hk
More informationSingle-loop System Reliability-Based Design & Topology Optimization (SRBDO/SRBTO): A Matrix-based System Reliability (MSR) Method
10 h US Naonal Congress on Compuaonal Mechancs Columbus, Oho 16-19, 2009 Sngle-loop Sysem Relably-Based Desgn & Topology Opmzaon (SRBDO/SRBTO): A Marx-based Sysem Relably (MSR) Mehod Tam Nguyen, Junho
More informationOn One Analytic Method of. Constructing Program Controls
Appled Mahemacal Scences, Vol. 9, 05, no. 8, 409-407 HIKARI Ld, www.m-hkar.com hp://dx.do.org/0.988/ams.05.54349 On One Analyc Mehod of Consrucng Program Conrols A. N. Kvko, S. V. Chsyakov and Yu. E. Balyna
More informationTSS = SST + SSE An orthogonal partition of the total SS
ANOVA: Topc 4. Orhogonal conrass [ST&D p. 183] H 0 : µ 1 = µ =... = µ H 1 : The mean of a leas one reamen group s dfferen To es hs hypohess, a basc ANOVA allocaes he varaon among reamen means (SST) equally
More informationMulti-priority Online Scheduling with Cancellations
Submed o Operaons Research manuscrp (Please, provde he manuscrp number!) Auhors are encouraged o subm new papers o INFORMS journals by means of a syle fle emplae, whch ncludes he journal le. However, use
More informatione-journal Reliability: Theory& Applications No 2 (Vol.2) Vyacheslav Abramov
June 7 e-ournal Relably: Theory& Applcaons No (Vol. CONFIDENCE INTERVALS ASSOCIATED WITH PERFORMANCE ANALYSIS OF SYMMETRIC LARGE CLOSED CLIENT/SERVER COMPUTER NETWORKS Absrac Vyacheslav Abramov School
More informationAn introduction to Support Vector Machine
An nroducon o Suppor Vecor Machne 報告者 : 黃立德 References: Smon Haykn, "Neural Neworks: a comprehensve foundaon, second edon, 999, Chaper 2,6 Nello Chrsann, John Shawe-Tayer, An Inroducon o Suppor Vecor Machnes,
More informationCS286.2 Lecture 14: Quantum de Finetti Theorems II
CS286.2 Lecure 14: Quanum de Fne Theorems II Scrbe: Mara Okounkova 1 Saemen of he heorem Recall he las saemen of he quanum de Fne heorem from he prevous lecure. Theorem 1 Quanum de Fne). Le ρ Dens C 2
More informationA Tour of Modeling Techniques
A Tour of Modelng Technques John Hooker Carnege Mellon Unversy EWO Semnar February 8 Slde Oulne Med neger lnear (MILP) modelng Dsuncve modelng Knapsack modelng Consran programmng models Inegraed Models
More informationCS 268: Packet Scheduling
Pace Schedulng Decde when and wha pace o send on oupu ln - Usually mplemened a oupu nerface CS 68: Pace Schedulng flow Ion Soca March 9, 004 Classfer flow flow n Buffer managemen Scheduler soca@cs.bereley.edu
More informationPolymerization Technology Laboratory Course
Prakkum Polymer Scence/Polymersaonsechnk Versuch Resdence Tme Dsrbuon Polymerzaon Technology Laboraory Course Resdence Tme Dsrbuon of Chemcal Reacors If molecules or elemens of a flud are akng dfferen
More informationOnline Supplement for Dynamic Multi-Technology. Production-Inventory Problem with Emissions Trading
Onlne Supplemen for Dynamc Mul-Technology Producon-Invenory Problem wh Emssons Tradng by We Zhang Zhongsheng Hua Yu Xa and Baofeng Huo Proof of Lemma For any ( qr ) Θ s easy o verfy ha he lnear programmng
More informationWay nding under Uncertainty in Continuous Time and Space by Dynamic Programming
Way ndng under Uncerany n Connuous Tme and Space by Dynamc Programmng Dr. Serge P. Hoogendoorn (s.hoogendoorn@c.udelf.nl) Transporaon and Tra c Engneerng Secon Faculy of Cvl Engneerng and Geoscences -
More informationIncluding the ordinary differential of distance with time as velocity makes a system of ordinary differential equations.
Soluons o Ordnary Derenal Equaons An ordnary derenal equaon has only one ndependen varable. A sysem o ordnary derenal equaons consss o several derenal equaons each wh he same ndependen varable. An eample
More informationJ i-1 i. J i i+1. Numerical integration of the diffusion equation (I) Finite difference method. Spatial Discretization. Internal nodes.
umercal negraon of he dffuson equaon (I) Fne dfference mehod. Spaal screaon. Inernal nodes. R L V For hermal conducon le s dscree he spaal doman no small fne spans, =,,: Balance of parcles for an nernal
More informationPlanar truss bridge optimization by dynamic programming and linear programming
IABSE-JSCE Jon Conference on Advances n Brdge Engneerng-III, Augus 1-, 015, Dhaka, Bangladesh. ISBN: 978-984-33-9313-5 Amn, Oku, Bhuyan, Ueda (eds.) www.abse-bd.org Planar russ brdge opmzaon by dynamc
More informationIntroduction ( Week 1-2) Course introduction A brief introduction to molecular biology A brief introduction to sequence comparison Part I: Algorithms
Course organzaon Inroducon Wee -2) Course nroducon A bref nroducon o molecular bology A bref nroducon o sequence comparson Par I: Algorhms for Sequence Analyss Wee 3-8) Chaper -3, Models and heores» Probably
More information(,,, ) (,,, ). In addition, there are three other consumers, -2, -1, and 0. Consumer -2 has the utility function
MACROECONOMIC THEORY T J KEHOE ECON 87 SPRING 5 PROBLEM SET # Conder an overlappng generaon economy le ha n queon 5 on problem e n whch conumer lve for perod The uly funcon of he conumer born n perod,
More informationCHAPTER 10: LINEAR DISCRIMINATION
CHAPER : LINEAR DISCRIMINAION Dscrmnan-based Classfcaon 3 In classfcaon h K classes (C,C,, C k ) We defned dscrmnan funcon g j (), j=,,,k hen gven an es eample, e chose (predced) s class label as C f g
More informationClustering (Bishop ch 9)
Cluserng (Bshop ch 9) Reference: Daa Mnng by Margare Dunham (a slde source) 1 Cluserng Cluserng s unsupervsed learnng, here are no class labels Wan o fnd groups of smlar nsances Ofen use a dsance measure
More informationDECOMPOSITION-COORDINATION METHOD FOR THE MANAGEMENT OF A CHAIN OF DAMS
DECOMPOSITION-COORDINATION METHOD FOR THE MANAGEMENT OF A CHAIN OF DAMS J-C. ALAIS, P. CARPENTIER, V. LECLÈRE Absrac. We sudy he managemen of a chan of dam hydroelecrc producon where we consder he expeced
More informationJohn Geweke a and Gianni Amisano b a Departments of Economics and Statistics, University of Iowa, USA b European Central Bank, Frankfurt, Germany
Herarchcal Markov Normal Mxure models wh Applcaons o Fnancal Asse Reurns Appendx: Proofs of Theorems and Condonal Poseror Dsrbuons John Geweke a and Gann Amsano b a Deparmens of Economcs and Sascs, Unversy
More informationABSTRACT. KEYWORDS Hybrid, Genetic Algorithm, Shipping, Dispatching, Vehicle, Time Windows INTRODUCTION
A HYBRID GENETIC ALGORITH FOR A DYNAIC INBOUND ORDERING AND SHIPPING AND OUTBOUND DISPATCHING PROBLE WITH HETEROGENEOUS VEHICLE TYPES AND DELIVERY TIE WINDOWS by Byung Soo Km, Woon-Seek Lee, and Young-Seok
More informationA Dynamic Economic Dispatch Model Incorporating Wind Power Based on Chance Constrained Programming
Energes 25 8 233-256; do:.339/en8233 Arcle OPEN ACCESS energes ISSN 996-73 www.mdp.com/journal/energes A Dynamc Economc Dspach Model Incorporang Wnd Power Based on Chance Consraned Programmng Wushan Cheng
More informationA Systematic Framework for Dynamically Optimizing Multi-User Wireless Video Transmission
A Sysemac Framework for Dynamcally Opmzng ul-user Wreless Vdeo Transmsson Fangwen Fu, haela van der Schaar Elecrcal Engneerng Deparmen, UCLA {fwfu, mhaela}@ee.ucla.edu Absrac In hs paper, we formulae he
More informationPartial Availability and RGBI Methods to Improve System Performance in Different Interval of Time: The Drill Facility System Case Study
Open Journal of Modellng and Smulaon, 204, 2, 44-53 Publshed Onlne Ocober 204 n ScRes. hp://www.scrp.org/journal/ojms hp://dx.do.org/0.4236/ojms.204.2406 Paral Avalably and RGBI Mehods o Improve Sysem
More informationJanuary Examinations 2012
Page of 5 EC79 January Examnaons No. of Pages: 5 No. of Quesons: 8 Subjec ECONOMICS (POSTGRADUATE) Tle of Paper EC79 QUANTITATIVE METHODS FOR BUSINESS AND FINANCE Tme Allowed Two Hours ( hours) Insrucons
More informationMANY real-world applications (e.g. production
Barebones Parcle Swarm for Ineger Programmng Problems Mahamed G. H. Omran, Andres Engelbrech and Ayed Salman Absrac The performance of wo recen varans of Parcle Swarm Opmzaon (PSO) when appled o Ineger
More informationUsing Aggregation to Construct Periodic Policies for Routing Jobs to Parallel Servers with Deterministic Service Times
Usng Aggregaon o Consruc Perodc Polces for Roung Jobs o Parallel Servers wh Deermnsc Servce Tmes Jeffrey W. errmann A. James Clark School of Engneerng 2181 Marn all Unversy of Maryland College Park, MD
More informationComb Filters. Comb Filters
The smple flers dscussed so far are characered eher by a sngle passband and/or a sngle sopband There are applcaons where flers wh mulple passbands and sopbands are requred Thecomb fler s an example of
More informationAppendix H: Rarefaction and extrapolation of Hill numbers for incidence data
Anne Chao Ncholas J Goell C seh lzabeh L ander K Ma Rober K Colwell and Aaron M llson 03 Rarefacon and erapolaon wh ll numbers: a framewor for samplng and esmaon n speces dversy sudes cology Monographs
More informationOMXS30 Balance 20% Index Rules
OMX30 Balance 0% ndex Rules Verson as of 30 March 009 Copyrgh 008, The NADAQ OMX Group, nc. All rghs reserved. NADAQ OMX, The NADAQ ock Marke and NADAQ are regsered servce/rademarks of The NADAQ OMX Group,
More informationFTCS Solution to the Heat Equation
FTCS Soluon o he Hea Equaon ME 448/548 Noes Gerald Reckenwald Porland Sae Unversy Deparmen of Mechancal Engneerng gerry@pdxedu ME 448/548: FTCS Soluon o he Hea Equaon Overvew Use he forward fne d erence
More informationComputing Relevance, Similarity: The Vector Space Model
Compung Relevance, Smlary: The Vecor Space Model Based on Larson and Hears s sldes a UC-Bereley hp://.sms.bereley.edu/courses/s0/f00/ aabase Managemen Sysems, R. Ramarshnan ocumen Vecors v ocumens are
More informationLinear Response Theory: The connection between QFT and experiments
Phys540.nb 39 3 Lnear Response Theory: The connecon beween QFT and expermens 3.1. Basc conceps and deas Q: ow do we measure he conducvy of a meal? A: we frs nroduce a weak elecrc feld E, and hen measure
More informationSimultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
Smultaneous Optmzaton of Berth Allocaton, Quay Crane Assgnment and Quay Crane Schedulng Problems n Contaner Termnals Necat Aras, Yavuz Türkoğulları, Z. Caner Taşkın, Kuban Altınel Abstract In ths work,
More informationSolving the multi-period fixed cost transportation problem using LINGO solver
Inernaonal Journal of Pure and Appled Mahemacs Volume 119 No. 12 2018, 2151-2157 ISSN: 1314-3395 (on-lne verson) url: hp://www.pam.eu Specal Issue pam.eu Solvng he mul-perod fxed cos ransporaon problem
More informationLecture 18: The Laplace Transform (See Sections and 14.7 in Boas)
Lecure 8: The Lalace Transform (See Secons 88- and 47 n Boas) Recall ha our bg-cure goal s he analyss of he dfferenal equaon, ax bx cx F, where we emloy varous exansons for he drvng funcon F deendng on
More informationIn the complete model, these slopes are ANALYSIS OF VARIANCE FOR THE COMPLETE TWO-WAY MODEL. (! i+1 -! i ) + [(!") i+1,q - [(!
ANALYSIS OF VARIANCE FOR THE COMPLETE TWO-WAY MODEL The frs hng o es n wo-way ANOVA: Is here neracon? "No neracon" means: The man effecs model would f. Ths n urn means: In he neracon plo (wh A on he horzonal
More informationISSN MIT Publications
MIT Inernaonal Journal of Elecrcal and Insrumenaon Engneerng Vol. 1, No. 2, Aug 2011, pp 93-98 93 ISSN 2230-7656 MIT Publcaons A New Approach for Solvng Economc Load Dspach Problem Ansh Ahmad Dep. of Elecrcal
More information5th International Conference on Advanced Design and Manufacturing Engineering (ICADME 2015)
5h Inernaonal onference on Advanced Desgn and Manufacurng Engneerng (IADME 5 The Falure Rae Expermenal Sudy of Specal N Machne Tool hunshan He, a, *, La Pan,b and Bng Hu 3,c,,3 ollege of Mechancal and
More informationMachine Learning Linear Regression
Machne Learnng Lnear Regresson Lesson 3 Lnear Regresson Bascs of Regresson Leas Squares esmaon Polynomal Regresson Bass funcons Regresson model Regularzed Regresson Sascal Regresson Mamum Lkelhood (ML)
More informationDynamic Power Management Based on Continuous-Time Markov Decision Processes*
Dynamc Power Managemen Based on Connuous-Tme Markov Decson Processes* Qnru Qu and Massoud Pedram Deparmen of Elecrcal Engneerng-Sysems Unversy of Souhern Calforna Los Angeles Calforna USA {qnru pedram}@usc.edu
More information[ ] 2. [ ]3 + (Δx i + Δx i 1 ) / 2. Δx i-1 Δx i Δx i+1. TPG4160 Reservoir Simulation 2018 Lecture note 3. page 1 of 5
TPG460 Reservor Smulaon 08 page of 5 DISCRETIZATIO OF THE FOW EQUATIOS As we already have seen, fne dfference appromaons of he paral dervaves appearng n he flow equaons may be obaned from Taylor seres
More informationTools for Analysis of Accelerated Life and Degradation Test Data
Acceleraed Sress Tesng and Relably Tools for Analyss of Acceleraed Lfe and Degradaon Tes Daa Presened by: Reuel Smh Unversy of Maryland College Park smhrc@umd.edu Sepember-5-6 Sepember 28-30 206, Pensacola
More informationAdvanced Macroeconomics II: Exchange economy
Advanced Macroeconomcs II: Exchange economy Krzyszof Makarsk 1 Smple deermnsc dynamc model. 1.1 Inroducon Inroducon Smple deermnsc dynamc model. Defnons of equlbrum: Arrow-Debreu Sequenal Recursve Equvalence
More informationLecture VI Regression
Lecure VI Regresson (Lnear Mehods for Regresson) Conens: Lnear Mehods for Regresson Leas Squares, Gauss Markov heorem Recursve Leas Squares Lecure VI: MLSC - Dr. Sehu Vjayakumar Lnear Regresson Model M
More informationLecture 6: Learning for Control (Generalised Linear Regression)
Lecure 6: Learnng for Conrol (Generalsed Lnear Regresson) Conens: Lnear Mehods for Regresson Leas Squares, Gauss Markov heorem Recursve Leas Squares Lecure 6: RLSC - Prof. Sehu Vjayakumar Lnear Regresson
More informationHidden Markov Models Following a lecture by Andrew W. Moore Carnegie Mellon University
Hdden Markov Models Followng a lecure by Andrew W. Moore Carnege Mellon Unversy www.cs.cmu.edu/~awm/uorals A Markov Sysem Has N saes, called s, s 2.. s N s 2 There are dscree meseps, 0,, s s 3 N 3 0 Hdden
More informationThe One-Dimensional Dynamic Dispatch Waves Problem
The One-Dmensonal Dynamc Dspach Waves Problem Mahas Klapp Alan L. Erera Alejandro Torello H. Mlon Sewar School of Indusral and Sysems Engeerng Georga Insue of Technology Alana, Georga 30332 maklapp a gaech
More informationExact Dynamic Programming for Decentralized POMDPs with Lossless Policy Compression
Proceedngs of he Egheenh Inernaonal Conference on Auomaed Plannng and Schedulng (ICAPS 2008) Exac Dynamc Programmng for Decenralzed POMDPs wh Lossless Polcy Compresson Abdeslam Boularas and Brahm Chab-draa
More informationTight results for Next Fit and Worst Fit with resource augmentation
Tgh resuls for Nex F and Wors F wh resource augmenaon Joan Boyar Leah Epsen Asaf Levn Asrac I s well known ha he wo smple algorhms for he classc n packng prolem, NF and WF oh have an approxmaon rao of
More informationSurvival Analysis and Reliability. A Note on the Mean Residual Life Function of a Parallel System
Communcaons n Sascs Theory and Mehods, 34: 475 484, 2005 Copyrgh Taylor & Francs, Inc. ISSN: 0361-0926 prn/1532-415x onlne DOI: 10.1081/STA-200047430 Survval Analyss and Relably A Noe on he Mean Resdual
More informationFI 3103 Quantum Physics
/9/4 FI 33 Quanum Physcs Aleander A. Iskandar Physcs of Magnesm and Phooncs Research Grou Insu Teknolog Bandung Basc Conces n Quanum Physcs Probably and Eecaon Value Hesenberg Uncerany Prncle Wave Funcon
More informationHEAT CONDUCTION PROBLEM IN A TWO-LAYERED HOLLOW CYLINDER BY USING THE GREEN S FUNCTION METHOD
Journal of Appled Mahemacs and Compuaonal Mechancs 3, (), 45-5 HEAT CONDUCTION PROBLEM IN A TWO-LAYERED HOLLOW CYLINDER BY USING THE GREEN S FUNCTION METHOD Sansław Kukla, Urszula Sedlecka Insue of Mahemacs,
More informationVolatility Interpolation
Volaly Inerpolaon Prelmnary Verson March 00 Jesper Andreasen and Bran Huge Danse Mares, Copenhagen wan.daddy@danseban.com brno@danseban.com Elecronc copy avalable a: hp://ssrn.com/absrac=69497 Inro Local
More informationMeta-Heuristic Optimization techniques in power systems
Proceedngs of he 2nd IASME / WSEAS Inernaonal Conference on Energy & Envronmen (EE07), Pororoz, Slovena, May 15-17, 2007 163 Mea-Heursc Opmzaon echnques n power sysems Vlachos Arsds Deparmen of Informacs
More informationDynamic Team Decision Theory
Dynamc Team Decson Theory EECS 558 Proec Repor Shruvandana Sharma and Davd Shuman December, 005 I. Inroducon Whle he sochasc conrol problem feaures one decson maker acng over me, many complex conrolled
More informationLecture 11 SVM cont
Lecure SVM con. 0 008 Wha we have done so far We have esalshed ha we wan o fnd a lnear decson oundary whose margn s he larges We know how o measure he margn of a lnear decson oundary Tha s: he mnmum geomerc
More information( ) () we define the interaction representation by the unitary transformation () = ()
Hgher Order Perurbaon Theory Mchael Fowler 3/7/6 The neracon Represenaon Recall ha n he frs par of hs course sequence, we dscussed he chrödnger and Hesenberg represenaons of quanum mechancs here n he chrödnger
More informationEXECUTION COSTS IN FINANCIAL MARKETS WITH SEVERAL INSTITUTIONAL INVESTORS
EXECUION COSS IN FINANCIAL MARKES WIH SEVERAL INSIUIONAL INVESORS Somayeh Moazen, Yuyng L, Kae Larson Cheron School of Compuer Scence Unversy of Waerloo, Waerloo, ON, Canada emal: {smoazen, yuyng, klarson}@uwaerlooca
More information12d Model. Civil and Surveying Software. Drainage Analysis Module Detention/Retention Basins. Owen Thornton BE (Mech), 12d Model Programmer
d Model Cvl and Surveyng Soware Dranage Analyss Module Deenon/Reenon Basns Owen Thornon BE (Mech), d Model Programmer owen.hornon@d.com 4 January 007 Revsed: 04 Aprl 007 9 February 008 (8Cp) Ths documen
More informationA fuzzy approach to capacity constrained MRP systems *
A fuzzy approach o capacy consraned MRP sysems * J. Mula CGP (Research Cenre on Producon Managemen and Engneerng) Polyechnc Unversy of Valenca Plaza Ferrándz y Carbonell, 080 Alcoy (Alcane) fmula@cgp.upv.es
More informationCollege of William & Mary Department of Computer Science
1 Techncal Repor WM-CS-2012-01 College of Wllam & Mary Deparmen of Compuer Scence WM-CS-2012-01 Onlne Vecor Schedulng and Generalzed Load Balancng Xaojun Zhu, Qun L, Wezhen Mao, Guha Chen March 5, 2012
More informationA GENERAL FRAMEWORK FOR CONTINUOUS TIME POWER CONTROL IN TIME VARYING LONG TERM FADING WIRELESS NETWORKS
A GENERAL FRAEWORK FOR CONTINUOUS TIE POWER CONTROL IN TIE VARYING LONG TER FADING WIRELESS NETWORKS ohammed. Olama, Seddk. Djouad Charalambos D. Charalambous Elecrcal and Compuer Engneerng Deparmen Elecrcal
More informationMulti-Fuel and Mixed-Mode IC Engine Combustion Simulation with a Detailed Chemistry Based Progress Variable Library Approach
Mul-Fuel and Med-Mode IC Engne Combuson Smulaon wh a Dealed Chemsry Based Progress Varable Lbrary Approach Conens Inroducon Approach Resuls Conclusons 2 Inroducon New Combuson Model- PVM-MF New Legslaons
More informationF-Tests and Analysis of Variance (ANOVA) in the Simple Linear Regression Model. 1. Introduction
ECOOMICS 35* -- OTE 9 ECO 35* -- OTE 9 F-Tess and Analyss of Varance (AOVA n he Smple Lnear Regresson Model Inroducon The smple lnear regresson model s gven by he followng populaon regresson equaon, or
More informationA heuristic approach for an inventory routing problem with backorder decisions
Lecure Noes n Managemen Scence (2014) Vol. 6: 49 57 6 h Inernaonal Conference on Appled Operaonal Research, Proceedngs Tadbr Operaonal Research Group Ld. All rghs reserved. www.adbr.ca ISSN 2008-0050 (Prn),
More informationOPTIMIZATION OF A PRODUCTION LOT SIZING PROBLEM WITH QUANTITY DISCOUNT
NERNAONAL JOURNAL OF OPMZAON N CVL ENGNEERNG n. J. Opm. Cvl Eng., 26; 6(2:87-29 OPMZAON OF A PRODUCON LO SZNG PROBLEM WH QUANY DSCOUN S. hosrav and S.H. Mrmohammad *, Deparmen of ndusral and sysems Engneerng,
More informationA Principled Approach to MILP Modeling
A Prncpled Approach o MILP Modelng John Hooer Carnege Mellon Unvers Augus 008 Slde Proposal MILP modelng s an ar, bu need no be unprncpled. Slde Proposal MILP modelng s an ar, bu need no be unprncpled.
More informationCS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 4
CS434a/54a: Paern Recognon Prof. Olga Veksler Lecure 4 Oulne Normal Random Varable Properes Dscrmnan funcons Why Normal Random Varables? Analycally racable Works well when observaon comes form a corruped
More informationTime-interval analysis of β decay. V. Horvat and J. C. Hardy
Tme-nerval analyss of β decay V. Horva and J. C. Hardy Work on he even analyss of β decay [1] connued and resuled n he developmen of a novel mehod of bea-decay me-nerval analyss ha produces hghly accurae
More informationSampling Procedure of the Sum of two Binary Markov Process Realizations
Samplng Procedure of he Sum of wo Bnary Markov Process Realzaons YURY GORITSKIY Dep. of Mahemacal Modelng of Moscow Power Insue (Techncal Unversy), Moscow, RUSSIA, E-mal: gorsky@yandex.ru VLADIMIR KAZAKOV
More informationRobust and Accurate Cancer Classification with Gene Expression Profiling
Robus and Accurae Cancer Classfcaon wh Gene Expresson Proflng (Compuaonal ysems Bology, 2005) Auhor: Hafeng L, Keshu Zhang, ao Jang Oulne Background LDA (lnear dscrmnan analyss) and small sample sze problem
More informationOptimal replacement policy for safety-related multi-component multi-state. systems
Opmal replacemen polcy for safey-relaed mul-componen mul-sae sysems Mng Xu, Tao Chen 2,*, Xanhu Yang Deparmen of Auomaon, Tsnghua Unversy, Bejng 84, Chna 2 Dvson of Cvl, Chemcal and Envronmenal Engneerng,
More informationRELATIONSHIP BETWEEN VOLATILITY AND TRADING VOLUME: THE CASE OF HSI STOCK RETURNS DATA
RELATIONSHIP BETWEEN VOLATILITY AND TRADING VOLUME: THE CASE OF HSI STOCK RETURNS DATA Mchaela Chocholaá Unversy of Economcs Braslava, Slovaka Inroducon (1) one of he characersc feaures of sock reurns
More informationChapter Lagrangian Interpolation
Chaper 5.4 agrangan Inerpolaon Afer readng hs chaper you should be able o:. dere agrangan mehod of nerpolaon. sole problems usng agrangan mehod of nerpolaon and. use agrangan nerpolans o fnd deraes and
More informationP R = P 0. The system is shown on the next figure:
TPG460 Reservor Smulaon 08 page of INTRODUCTION TO RESERVOIR SIMULATION Analycal and numercal soluons of smple one-dmensonal, one-phase flow equaons As an nroducon o reservor smulaon, we wll revew he smples
More informationDelay-Constrainted Optimal Traffic Allocation in Heterogeneous Wireless Networks for Smart Grid
elay-consraned Opmal Traffc Allocaon n Heerogeneous Wreless eworks for Smar Grd Sya Xu, ngzhe Xng, 3, Shaoyong Guo, and Luomng Meng Sae Key Laboraory of eworkng and Swchng Technology, Beng Unversy of Poss
More informationImpact of Probabilistic Road Capacity Constraints on the Spatial Distribution of Hurricane Evacuation Shelter Capacities
Impac of Probablsc Road Capac Consrans on he Spaal Dsrbuon of Hurrcane Evacuaon Sheler Capaces Musafa Anl Yazc M.Sc. (Correspondng Auhor) Graduae Research Asssan Deparmen of Cvl and Envronmenal Engneerng
More informationDemand Side Management in Smart Grids using a Repeated Game Framework
Demand Sde Managemen n Smar Grds usng a Repeaed Game Framework Lnq Song, Yuanzhang Xao and Mhaela van der Schaar, Fellow, IEEE Absrac Demand sde managemen (DSM) s a key soluon for reducng he peak-me power
More informationAlgorithmic models of human decision making in Gaussian multi-armed bandit problems
Algorhmc models of human decson makng n Gaussan mul-armed band problems Paul Reverdy, Vabhav Srvasava and Naom E. Leonard Absrac We consder a heursc Bayesan algorhm as a model of human decson makng n mul-armed
More informationIntroduction to Compact Dynamical Modeling. III.1 Reducing Linear Time Invariant Systems. Luca Daniel Massachusetts Institute of Technology
SF & IH Inroducon o Compac Dynamcal Modelng III. Reducng Lnear me Invaran Sysems Luca Danel Massachuses Insue of echnology Course Oulne Quck Sneak Prevew I. Assemblng Models from Physcal Problems II. Smulang
More informationForecasting customer behaviour in a multi-service financial organisation: a profitability perspective
Forecasng cusomer behavour n a mul-servce fnancal organsaon: a profably perspecve A. Audzeyeva, Unversy of Leeds & Naonal Ausrala Group Europe, UK B. Summers, Unversy of Leeds, UK K.R. Schenk-Hoppé, Unversy
More informationLocal Cost Estimation for Global Query Optimization in a Multidatabase System. Outline
Local os Esmaon for Global uery Opmzaon n a Muldaabase ysem Dr. ang Zhu The Unversy of Mchgan - Dearborn Inroducon Oulne hallenges for O n MDB uery amplng Mehod ualave Approach Fraconal Analyss and Probablsc
More information