A Simple Inventory System
|
|
- Annice Simpson
- 6 years ago
- Views:
Transcription
1 A Smple Inventory System Lawrence M. Leems and Stephen K. Park, Dscrete-Event Smulaton: A Frst Course, Prentce Hall, 2006 Hu Chen Computer Scence Vrgna State Unversty Petersburg, Vrgna February 8, 2017 H. Chen (VSU) A Smple Inventory System February 8, / 40
2 Introducton Dscrete or Contnuous Varables? Sngle Server Queue both arrval and servce tmes are contnuous varables Smple Inventory System Input varables are nherently dscrete H. Chen (VSU) A Smple Inventory System February 8, / 40
3 Conceptual Model A Smple Inventory System: Conceptual Model customers. demand tems.. faclty. order tems.. suppler Dstrbutes tems from current nventory to customers Order tems from suppler to replensh the nventory Customer demand s dscrete Customers do not want a porton of an tem Balancng holdng cost, shortage cost, and orderng cost Smple One type of tem H. Chen (VSU) A Smple Inventory System February 8, / 40
4 Conceptual Model Dfferent Inventory Polces Transacton Reportng Polcy Inventory revew after each transacton Sgnfcant labor may be requred Less lkely to experence shortage Perodc Inventory Revew Inventory revew s perodc Items are ordered, f necessary, only at revew tmes Defned by two parameters (s,s) s: mnum nventory level S: maxmum nventory level s and S are constnat n tme, wth 0 s < S Assume perodc nventory revew Search for (s, S) that mnmze cost H. Chen (VSU) A Smple Inventory System February 8, / 40
5 Cost and Assumpton Conceptual Model Inventory System Costs Holdng cost: for tems n nventory Shortage cost: for unmet demand Orderng cost: sum of setup and tem costs Setup cost: fxed cost when order s placed Item cost: per-tem order cost Addtonal Assumptons Back orderng s possble No delvery lag Intal nventory level s S Termnal nventory level s S H. Chen (VSU) A Smple Inventory System February 8, / 40
6 Specfcaton Model A Smple Inventory System: Specfcaton Model Tme begns at t = 0 Revew tmes are t = 0,1,2,... -th tme nterval begns at tme t = 1 and ends at t = l 1 : nventory level at begnnng of the th nterval o 1 : amount ordered at tme t = 1 s an nteger, o 1 0 d : demand quantty durng the th nterval, d 0 Inventory at end of nterval can be negatve As a result of back-orderng H. Chen (VSU) A Smple Inventory System February 8, / 40
7 Specfcaton Model Inventory Level Consderaton Inventory level s revewed at t = 1 If l 1 s, no order s placed; tem If l 1 < s, nventory s replenshed to S { 0 l 1 s o 1 = S l 1 l 1 < s (1) Items are delvered mmedately At end of -th nterval, nventory dmnshed by d l = l 1 +o 1 d (2) H. Chen (VSU) A Smple Inventory System February 8, / 40
8 Computatonal Model A Smple Inventory System: Computatonal Model Algorthm l 0 = S; = 0; whle (more demand to process) { ++; f (l 1 < s) o 1 = S l 1 ; else o 1 = 0; d = GetDemand(); l = l 1 +o 1 d ; } n = ; o n = S l n l n = S; return l 1, l 2, l 3,...l n and o 1, o 2,...o n ; H. Chen (VSU) A Smple Inventory System February 8, / 40
9 l Examples Example 1.3.1: SIS wth Sample Demands Let (s,s) = (20,60) and apply Algorthm to process n = 12 tme ntervals of operaton as follows. Note that l 0 = S = nput d order o nventory l 80 S 40 s Fgure: Inventory Levels H. Chen (VSU) A Smple Inventory System February 8, / 40
10 l Examples Example 1.3.1: SIS wth Sample Demands Let (s,s) = (20,60) and apply Algorthm to process n = 12 tme ntervals of operaton as follows. Note that l 0 = S = nput d order o 0 nventory l S 40 s Fgure: Inventory Levels H. Chen (VSU) A Smple Inventory System February 8, / 40
11 l Examples Example 1.3.1: SIS wth Sample Demands Let (s,s) = (20,60) and apply Algorthm to process n = 12 tme ntervals of operaton as follows. Note that l 0 = S = nput d order o 0 45 nventory l S 40 s Fgure: Inventory Levels H. Chen (VSU) A Smple Inventory System February 8, / 40
12 l Examples Example 1.3.1: SIS wth Sample Demands Let (s,s) = (20,60) and apply Algorthm to process n = 12 tme ntervals of operaton as follows. Note that l 0 = S = nput d order o nventory l S 40 s Fgure: Inventory Levels H. Chen (VSU) A Smple Inventory System February 8, / 40
13 l Examples Example 1.3.1: SIS wth Sample Demands Let (s,s) = (20,60) and apply Algorthm to process n = 12 tme ntervals of operaton as follows. Note that l 0 = S = nput d order o nventory l S 40 s Fgure: Inventory Levels H. Chen (VSU) A Smple Inventory System February 8, / 40
14 l Examples Example 1.3.1: SIS wth Sample Demands Let (s,s) = (20,60) and apply Algorthm to process n = 12 tme ntervals of operaton as follows. Note that l 0 = S = nput d order o nventory l S 40 s Fgure: Inventory Levels H. Chen (VSU) A Smple Inventory System February 8, / 40
15 Examples Example 1.3.1: SIS wth Sample Demands Let (s,s) = (20,60) and apply Algorthm to process n = 12 tme ntervals of operaton as follows. Note that l 0 = S = nput d order o nventory l l 80 S 40 s Fgure: Inventory Levels H. Chen (VSU) A Smple Inventory System February 8, / 40
16 Output Statstcs Output Statstcs Average demand and average order per tme nterval d = 1 n ō = 1 n n d (3) =1 n o (4) =1 For Example Data d = ō = 305/12 = tems per tme nterval H. Chen (VSU) A Smple Inventory System February 8, / 40
17 Exercse L3-1 Output Statstcs Let (s,s) = (20,60) and apply Algorthm by tracng the algorthm to process n = 12 tme ntervals of operaton as follows nput d order o nventory l Calculate average demand. You must show the steps. Calculate average order. You must show the steps. H. Chen (VSU) A Smple Inventory System February 8, / 40
18 Flow Balance Output Statstcs Average demand and order must be equal Endng nventory level s S Over the smulated perod, all demand s satsfed Average flow of tems n equals average flow of tems out customers. d faclty. ō suppler The nventory system s flow balanced H. Chen (VSU) A Smple Inventory System February 8, / 40
19 Output Statstcs Constant Demand Rate Assumpton Holdng and shortage costs are proportonal to tme-averaged nventory levels Must know nventory level for all t Assume the demand rate s constant between revew tmes As a result, the contnuous-tme evoluton of the nventory level s pecewse lnear, as llustrated below. l(t) 80 S 40 s t Fgure: Pecewse-lnear nventory levels H. Chen (VSU) A Smple Inventory System February 8, / 40
20 Output Statstcs Inventory Level as a Functon of Tme Under condton that the demand rate (d ) s constant between revew tmes, then the nventory level at any tme t n -th nterval s, l(t) = l 1 (t +1)d (5) l 1 ( 1, l 1 ) l(t) l 1 d l(t) = l 1 (t + 1)d (, l 1 d ). 1 t Fgure: Lnear nventory level n tme nterval l 1 = l 1 +o 1 represents nventory level after revew. H. Chen (VSU) A Smple Inventory System February 8, / 40
21 Output Statstcs Inventory Level s Not Lnear! Inventory level at any tme t s an nteger l(t) should be rounded to an nteger value As a result, l(t) s a star-step, rather than lnear, functon However, t can be shown, t has no effect on the values of Tme Averaged Inventory Level l + and l l(t) l 1 l 1 d ( 1, l 1 ) 1 l(t) = l 1 (t + 1)d. (, l 1 d) Fgure: Lnear nventory level n tme nterval t l(t) l 1 l 1 d ( 1, l 1 ) 1 l(t) = l 1 (t + 1)d (, l 1 d) Fgure: Lnear nventory level n tme nterval t H. Chen (VSU) A Smple Inventory System February 8, / 40
22 Output Statstcs Tme Averaged Inventory Level at Tme Interval l(t) s the bass for computng the tme-averaged nventory level Case 1: If l(t) remans non-negatve over -th nterval Case 2: If l(t) becomes negatve at some tme τ l+ = l(t)dt (6) 1 τ l+ = l(t)dt (7) l = l(t)dt (8) 1 τ where l + s the tme-averaged holdng level and l s the tme-averaged shortage level H. Chen (VSU) A Smple Inventory System February 8, / 40
23 Output Statstcs Case 1: No Back-Orderng No shortage durng -th tme nterval f and only f d l l 1 d l 1 l(t) t. ( 1, l 1 ) (, l 1 d ) Fgure: Inventory level n tme nterval wthout back-orderng Tme-averaged holdng level: area of a trapezod l+ = 1 l(t)dt = l 1 +(l 1 d ) 2 = l d (9) H. Chen (VSU) A Smple Inventory System February 8, / 40
24 Case 2: Back-Orderng Output Statstcs Inventory l(t) becomes negatve f and only f d > l 1,.e., at t = τ = 1+l 1 /d l(t) l 1 s 0 l 1 d ( 1, l 1 ) 1 τ t. (, l 1 d) Fgure: Inventory level n tme nterval wth back-orderng Tme-averaged holdng and shortage levels for -th nterval computed as the areas of trangles τ l+ = 1 l(t)dt =... (l 1 )2 2d (10) l = τ l(t)dt =... = (d l 1 )2 2d (11) H. Chen (VSU) A Smple Inventory System February 8, / 40
25 l+ and l Output Statstcs l+ = l τ = 1 τ l(t)dt = 1 [τ ( 1)]l 2 1 )2 1 = (l 2d l(t)dt = 1 ( τ)(l 1 2 d ) = 1 [ ( 1+l 1 2 /d )](l 1 d ) = 1 2 (1 l 1 /d )(l 1 d ) = 1 d l 1 (l 1 d ) 2 d = (d l 1 )(l 1 d ) 2d = (d l 1 )2 2d H. Chen (VSU) A Smple Inventory System February 8, / 40
26 Output Statstcs Tme-Averaged Inventory Level l(t) 80 S 40 s t Fgure: Pecewse-lnear nventory levels Tme-averaged holdng level and tme-averaged shortage level l+ = 1 n n =1 l+ (12) l = 1 n Note that tme-averaged shortage level s postve The tme-averaged nventory level s 1 l = n n n =1 l (13) l(t)dt = l + l (14) 0 H. Chen (VSU) A Smple Inventory System February 8, / 40
27 Exercse L3-2 Output Statstcs Let (s,s) = (20,60) and process n = 3 tme ntervals of operaton as follows (see sldes 23, 24, and 26 for steps) nput d Calculate tme-averaged holdng level Calculate tme-averaged shortage level H. Chen (VSU) A Smple Inventory System February 8, / 40
28 Smulaton Trace-drven Smulaton Create program ss1, a trace-drven computatonal model of the SIS Compute the output statstcs d: Average demand ō: Average order l+ : Tme-averaged holdng level l : Tme-averaged shortage level and the order frequency ū ū = number of orders n Consstency check: compute d and ō separately, then compare. They should be equal. H. Chen (VSU) A Smple Inventory System February 8, / 40
29 Trace-drven Smulaton Example 1.3.4: Trace Fle ss1.dat Trace fle ss1.dat contans data from n = 100 tme ntervals Inventory-polcy parameter values (.e., mnnum & maxmum nventory levels) (s,s) = (20,80) Program ss1 should output: ō = d = ū = 0.39 l + = l = 0.25 H. Chen (VSU) A Smple Inventory System February 8, / 40
30 Trace-drven Smulaton Exercse L3-3: Implement Program ss1 Develop a smulaton program to mplement Algorthm n your favorte programmng language Lets call the program ssq1 In the program, compute and prnt average demand, average order, tme-averaged holdng level, and tme-averaged shortage level Verfy the program Create a test case usng exercses L3-1 and L3-2, and apply the test case to your program Use a large trace Run your program usng the provded large trace as nput, observe the output H. Chen (VSU) A Smple Inventory System February 8, / 40
31 Operatng Cost Operatng Cost and Case Study A faclty s cost of operaton s determned by ctem : unt cost of new tem csetup : fxed cost for placng an order chold : cost to hold one tem for one tme nterval cshort : cost of beng short one tme for one tme nterval H. Chen (VSU) A Smple Inventory System February 8, / 40
32 Operatng Cost and Case Study Example 1.3.5: Case Study An automoble dealershp that uses weekly perodc nventory revew The faclty s the showroom and surroundng areas holdng cars The tems are cars for sell The suppler s the car manufacturer The customers are the people who purchase cars from the dealershp Assume SIS: sells one type of car H. Chen (VSU) A Smple Inventory System February 8, / 40
33 Operatng Cost and Case Study Example 1.3.5: Results of Case Study Lmted to a maxmum of S = 80 cars Lmted to a mnmum of s = 20 cars Inventory revewed every Monday f nventory falls below s, order cars suffcent to restore the nventory to S For now, gnore delvery lag Then costs: Item cost s ctem = $8,000 per tem Setup cost s csetup = $1,000 per order from manufacturer Holdng cost s chold = $25 per week Shortage cost s chold = $700 per week H. Chen (VSU) A Smple Inventory System February 8, / 40
34 Operatng Cost and Case Study Per-Interval Average Operatng Costs The average operatng costs per tme nterval are ctem ō: tem cost csetup ū: setup cost chold l+ : holdng cost cshort l : shortage cost The average total operatng cost per tme nterval s ther sum C total = c tem ō +c setup ū +c hold l + +c short l (15) Total cost of operaton s the product of the average total operatng cost per tme nterval and the number of ntervals C total = n C total (16) H. Chen (VSU) A Smple Inventory System February 8, / 40
35 Operatng Cost and Case Study Example 1.3.6: Operatng Cost Use the statstcs n Example ō = d = ū = 0.39 l + = l = 0.25 and the constants n Example c tem = $8,000 c setup = $1,000 c hold = $25 c short = $700 For the dealershp tem cost: $8, = $234,320 per week setup cost: $1, = $390 per week holdng cost: $ = $1,060 per week shortage cost: $ = $175 per week H. Chen (VSU) A Smple Inventory System February 8, / 40
36 Cost Mnmzaton Operatng Cost and Case Study By varyng mnmum nventory level s (and possbly maxmum nventory level S), an optmal polcy can be determned Optmal mnmum average total cost per tme nterval Note that ō = d and d depends only on the demands Hence, tem cost per tme nterval c tem ō s ndependent of (s,s) Average dependent cost per tme nterval s the sum of these three csetup ū: average setup cost per tme nterval chold l + : average holdng cost per tme nterval cshort l : average shortage cost per tme nterval Average dependent cost (or total cost for convenence) becomes, c total = c setup ū +c hold l+ +c short l (17) H. Chen (VSU) A Smple Inventory System February 8, / 40
37 Experment Operatng Cost and Case Study Let S be fxed, and let the demand sequence be fxed If s s systematcally ncreased, we expect: Average setup cost and holdng cost per tme nterval wll ncrease as s ncreases Average shortage cost per tme nterval wll decrease as s ncreases Average dependent cost per tme nterval wll have U shape, yeldng an optmum (.e., mnmum cost = $1,550 at s = 22) H. Chen (VSU) A Smple Inventory System February 8, / 40
38 Operatng Cost and Case Study Example 1.3.7: Optmal Perodc Inventory Revew Polcy setup cost shortage cost s s holdng cost total cost 800 s s Mnmum cost = $1,550 at s = 22 H. Chen (VSU) A Smple Inventory System February 8, / 40
39 Operatng Cost and Case Study Exercse L3-4: ss1 and Optmzng Operatng Cost Use the sample data (ss1.dat) and the parameters n the lecture notes, verfy the optmal nventory revew polcy by reproducng the results n sldes and the graphs n slde 38. H. Chen (VSU) A Smple Inventory System February 8, / 40
40 Summary Not the end, but the end of the begnng SIS Cost model and case studes H. Chen (VSU) A Smple Inventory System February 8, / 40
Section 1.3: A Simple Inventory System
Section 1.3: A Simple Inventory System Discrete-Event Simulation: A First Course c 2006 Pearson Ed., Inc. 0-13-142917-5 Discrete-Event Simulation: A First Course Section 1.3: A Simple Inventory System
More informationThe (Q, r) Inventory Policy in Production- Inventory Systems
Proceedngs of SKISE Fall Conference, Nov 14-15, 2008 The ( Inventory Polcy n Producton- Inventory Systems Joon-Seok Km Sejong Unversty Seoul, Korea Abstract We examne the effectveness of the conventonal
More informationEFFECTS OF JOINT REPLENISHMENT POLICY ON COMPANY COST UNDER PERMISSIBLE DELAY IN PAYMENTS
Mathematcal and Computatonal Applcatons, Vol. 5, No., pp. 8-58,. Assocaton for Scentfc Research EFFECS OF JOIN REPLENISHMEN POLICY ON COMPANY COS UNDER PERMISSIBLE DELAY IN PAYMENS Yu-Chung sao, Mng-Yu
More informationAmiri s Supply Chain Model. System Engineering b Department of Mathematics and Statistics c Odette School of Business
Amr s Supply Chan Model by S. Ashtab a,, R.J. Caron b E. Selvarajah c a Department of Industral Manufacturng System Engneerng b Department of Mathematcs Statstcs c Odette School of Busness Unversty of
More informationCS-433: Simulation and Modeling Modeling and Probability Review
CS-433: Smulaton and Modelng Modelng and Probablty Revew Exercse 1. (Probablty of Smple Events) Exercse 1.1 The owner of a camera shop receves a shpment of fve cameras from a camera manufacturer. Unknown
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 CAPACITATED VEHICLE ROUTING PROBLEMS WITH TIME WINDOWS BY GOAL PROGRAMMING APPROACH
Proceedngs of IICMA 2013 Research Topc, pp. xx-xx. SOLVIG CAPACITATED VEHICLE ROUTIG PROBLEMS WITH TIME WIDOWS BY GOAL PROGRAMMIG APPROACH ATMII DHORURI 1, EMIUGROHO RATA SARI 2, AD DWI LESTARI 3 1Department
More informationEEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming
EEL 6266 Power System Operaton and Control Chapter 3 Economc Dspatch Usng Dynamc Programmng Pecewse Lnear Cost Functons Common practce many utltes prefer to represent ther generator cost functons as sngle-
More informationA NOTE ON A PERIODIC REVIEW INVENTORY MODEL WITH UNCERTAIN DEMAND IN A RANDOM ENVIRONMENT. Hirotaka Matsumoto and Yoshio Tabata
Scentae Mathematcae Japoncae Onlne, Vol. 9, (23), 419 429 419 A NOTE ON A PERIODIC REVIEW INVENTORY MODEL WITH UNCERTAIN DEMAND IN A RANDOM ENVIRONMENT Hrotaka Matsumoto and Yosho Tabata Receved September
More informationPolynomial Regression Models
LINEAR REGRESSION ANALYSIS MODULE XII Lecture - 6 Polynomal Regresson Models Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur Test of sgnfcance To test the sgnfcance
More informationWinter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan
Wnter 2008 CS567 Stochastc Lnear/Integer Programmng Guest Lecturer: Xu, Huan Class 2: More Modelng Examples 1 Capacty Expanson Capacty expanson models optmal choces of the tmng and levels of nvestments
More informationInventory Model with Backorder Price Discount
Vol. No. 7-7 ead Tme and Orderng Cost Reductons are Interdependent n Inventory Model wth Bacorder Prce scount Yu-Jen n Receved: Mar. 7 Frst Revson: May. 7 7 ccepted: May. 7 bstract The stochastc nventory
More information(1, T) policy for a Two-echelon Inventory System with Perishableon-the-Shelf
Journal of Optmzaton n Industral Engneerng 6 (24) 3-4 (, ) polcy for a wo-echelon Inventory ystem wth Pershableon-the-helf Items Anwar Mahmood a,, Alreza Ha b a PhD Canddate, Industral Engneerng, Department
More informationMinimisation of the Average Response Time in a Cluster of Servers
Mnmsaton of the Average Response Tme n a Cluster of Servers Valery Naumov Abstract: In ths paper, we consder task assgnment problem n a cluster of servers. We show that optmal statc task assgnment s tantamount
More informationLecture 4: November 17, Part 1 Single Buffer Management
Lecturer: Ad Rosén Algorthms for the anagement of Networs Fall 2003-2004 Lecture 4: November 7, 2003 Scrbe: Guy Grebla Part Sngle Buffer anagement In the prevous lecture we taled about the Combned Input
More informationQueuing system theory
Elements of queung system: Queung system theory Every queung system conssts of three elements: An arrval process: s characterzed by the dstrbuton of tme between the arrval of successve customers, the mean
More informationStatistics for Managers Using Microsoft Excel/SPSS Chapter 13 The Simple Linear Regression Model and Correlation
Statstcs for Managers Usng Mcrosoft Excel/SPSS Chapter 13 The Smple Lnear Regresson Model and Correlaton 1999 Prentce-Hall, Inc. Chap. 13-1 Chapter Topcs Types of Regresson Models Determnng the Smple Lnear
More informationOrder Full Rate, Leadtime Variability, and Advance Demand Information in an Assemble- To-Order System
Order Full Rate, Leadtme Varablty, and Advance Demand Informaton n an Assemble- To-Order System by Lu, Song, and Yao (2002) Presented by Png Xu Ths summary presentaton s based on: Lu, Yngdong, and Jng-Sheng
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationSuggested solutions for the exam in SF2863 Systems Engineering. June 12,
Suggested solutons for the exam n SF2863 Systems Engneerng. June 12, 2012 14.00 19.00 Examner: Per Enqvst, phone: 790 62 98 1. We can thnk of the farm as a Jackson network. The strawberry feld s modelled
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationLATERAL TRANSSHIPMENTS IN INVENTORY MODELS
LATERAL TRANSSHIPMENTS IN INVENTORY MODELS MIN CHEN 11.2008 BMI THESIS Lateral Transshpments n Inventory Models MIN CHEN 11.2008 II PREFACE The BMI Thess s the fnal report to acqure the Master's degree
More informationResource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud
Resource Allocaton wth a Budget Constrant for Computng Independent Tasks n the Cloud Wemng Sh and Bo Hong School of Electrcal and Computer Engneerng Georga Insttute of Technology, USA 2nd IEEE Internatonal
More informationSingle-Facility Scheduling over Long Time Horizons by Logic-based Benders Decomposition
Sngle-Faclty Schedulng over Long Tme Horzons by Logc-based Benders Decomposton Elvn Coban and J. N. Hooker Tepper School of Busness, Carnege Mellon Unversty ecoban@andrew.cmu.edu, john@hooker.tepper.cmu.edu
More informationDurban Watson for Testing the Lack-of-Fit of Polynomial Regression Models without Replications
Durban Watson for Testng the Lack-of-Ft of Polynomal Regresson Models wthout Replcatons Ruba A. Alyaf, Maha A. Omar, Abdullah A. Al-Shha ralyaf@ksu.edu.sa, maomar@ksu.edu.sa, aalshha@ksu.edu.sa Department
More informationJournal of Physics: Conference Series. Related content PAPER OPEN ACCESS
Journal of Physcs: Conference Seres PAPER OPEN ACCESS An ntegrated producton-nventory model for the snglevendor two-buyer problem wth partal backorder, stochastc demand, and servce level constrants To
More informationA PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS
HCMC Unversty of Pedagogy Thong Nguyen Huu et al. A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS Thong Nguyen Huu and Hao Tran Van Department of mathematcs-nformaton,
More informationSTOCHASTIC INVENTORY MODELS INVOLVING VARIABLE LEAD TIME WITH A SERVICE LEVEL CONSTRAINT * Liang-Yuh OUYANG, Bor-Ren CHUANG 1.
Yugoslav Journal of Operatons Research 10 (000), Number 1, 81-98 STOCHASTIC INVENTORY MODELS INVOLVING VARIABLE LEAD TIME WITH A SERVICE LEVEL CONSTRAINT Lang-Yuh OUYANG, Bor-Ren CHUANG Department of Management
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More informationQueueing Networks II Network Performance
Queueng Networks II Network Performance Davd Tpper Assocate Professor Graduate Telecommuncatons and Networkng Program Unversty of Pttsburgh Sldes 6 Networks of Queues Many communcaton systems must be modeled
More informationPortfolios with Trading Constraints and Payout Restrictions
Portfolos wth Tradng Constrants and Payout Restrctons John R. Brge Northwestern Unversty (ont wor wth Chrs Donohue Xaodong Xu and Gongyun Zhao) 1 General Problem (Very) long-term nvestor (eample: unversty
More informationCalculation of time complexity (3%)
Problem 1. (30%) Calculaton of tme complexty (3%) Gven n ctes, usng exhaust search to see every result takes O(n!). Calculaton of tme needed to solve the problem (2%) 40 ctes:40! dfferent tours 40 add
More informationEmbedded Systems. 4. Aperiodic and Periodic Tasks
Embedded Systems 4. Aperodc and Perodc Tasks Lothar Thele 4-1 Contents of Course 1. Embedded Systems Introducton 2. Software Introducton 7. System Components 10. Models 3. Real-Tme Models 4. Perodc/Aperodc
More information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More informationThe Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationNegative Binomial Regression
STATGRAPHICS Rev. 9/16/2013 Negatve Bnomal Regresson Summary... 1 Data Input... 3 Statstcal Model... 3 Analyss Summary... 4 Analyss Optons... 7 Plot of Ftted Model... 8 Observed Versus Predcted... 10 Predctons...
More informationChapter 14 Simple Linear Regression
Chapter 4 Smple Lnear Regresson Chapter 4 - Smple Lnear Regresson Manageral decsons often are based on the relatonshp between two or more varables. Regresson analss can be used to develop an equaton showng
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More information6. Stochastic processes (2)
Contents Markov processes Brth-death processes Lect6.ppt S-38.45 - Introducton to Teletraffc Theory Sprng 5 Markov process Consder a contnuous-tme and dscrete-state stochastc process X(t) wth state space
More informationFINAL REPORT. To: The Tennessee Department of Transportation Research Development and Technology Program
FINAL REPORT To: The Tennessee Department of Transportaton Research Development and Technology Program Project #: Truck Congeston Mtgaton through Freght Consoldaton n Volatle Mult-tem Supply Chans Prepared
More information6. Stochastic processes (2)
6. Stochastc processes () Lect6.ppt S-38.45 - Introducton to Teletraffc Theory Sprng 5 6. Stochastc processes () Contents Markov processes Brth-death processes 6. Stochastc processes () Markov process
More informationThe optimal delay of the second test is therefore approximately 210 hours earlier than =2.
THE IEC 61508 FORMULAS 223 The optmal delay of the second test s therefore approxmately 210 hours earler than =2. 8.4 The IEC 61508 Formulas IEC 61508-6 provdes approxmaton formulas for the PF for smple
More informationCopyright 2017 by Taylor Enterprises, Inc., All Rights Reserved. Adjusted Control Limits for P Charts. Dr. Wayne A. Taylor
Taylor Enterprses, Inc. Control Lmts for P Charts Copyrght 2017 by Taylor Enterprses, Inc., All Rghts Reserved. Control Lmts for P Charts Dr. Wayne A. Taylor Abstract: P charts are used for count data
More information8. Modelling Uncertainty
8. Modellng Uncertanty. Introducton. Generatng Values From Known Probablty Dstrbutons. Monte Carlo Smulaton 4. Chance Constraned Models 5 5. Markov Processes and Transton Probabltes 6 6. Stochastc Optmzaton
More informationCathy Walker March 5, 2010
Cathy Walker March 5, 010 Part : Problem Set 1. What s the level of measurement for the followng varables? a) SAT scores b) Number of tests or quzzes n statstcal course c) Acres of land devoted to corn
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationCHAPTER IV RESEARCH FINDING AND ANALYSIS
CHAPTER IV REEARCH FINDING AND ANALYI A. Descrpton of Research Fndngs To fnd out the dfference between the students who were taught by usng Mme Game and the students who were not taught by usng Mme Game
More informationMethods Lunch Talk: Causal Mediation Analysis
Methods Lunch Talk: Causal Medaton Analyss Taeyong Park Washngton Unversty n St. Lous Aprl 9, 2015 Park (Wash U.) Methods Lunch Aprl 9, 2015 1 / 1 References Baron and Kenny. 1986. The Moderator-Medator
More informationHongyi Miao, College of Science, Nanjing Forestry University, Nanjing ,China. (Received 20 June 2013, accepted 11 March 2014) I)ϕ (k)
ISSN 1749-3889 (prnt), 1749-3897 (onlne) Internatonal Journal of Nonlnear Scence Vol.17(2014) No.2,pp.188-192 Modfed Block Jacob-Davdson Method for Solvng Large Sparse Egenproblems Hongy Mao, College of
More informationfind (x): given element x, return the canonical element of the set containing x;
COS 43 Sprng, 009 Dsjont Set Unon Problem: Mantan a collecton of dsjont sets. Two operatons: fnd the set contanng a gven element; unte two sets nto one (destructvely). Approach: Canoncal element method:
More informationLecture 14: Bandits with Budget Constraints
IEOR 8100-001: Learnng and Optmzaton for Sequental Decson Makng 03/07/16 Lecture 14: andts wth udget Constrants Instructor: Shpra Agrawal Scrbed by: Zhpeng Lu 1 Problem defnton In the regular Mult-armed
More informationAn Economic Lot-Sizing Problem with Perishable Inventory and Economies of Scale Costs: Approximation Solutions and Worst Case Analysis
An Economc Lot-Szng Problem wth Pershable Inventory and Economes of Scale Costs: Approxmaton Solutons and Worst Case Analyss Leon Yang Chu, 1 Vernon Nng Hsu, 2 Zuo-Jun Max Shen 3 1 Department of Industral
More informationPredictive Analytics : QM901.1x Prof U Dinesh Kumar, IIMB. All Rights Reserved, Indian Institute of Management Bangalore
Sesson Outlne Introducton to classfcaton problems and dscrete choce models. Introducton to Logstcs Regresson. Logstc functon and Logt functon. Maxmum Lkelhood Estmator (MLE) for estmaton of LR parameters.
More informationComparison of Regression Lines
STATGRAPHICS Rev. 9/13/2013 Comparson of Regresson Lnes Summary... 1 Data Input... 3 Analyss Summary... 4 Plot of Ftted Model... 6 Condtonal Sums of Squares... 6 Analyss Optons... 7 Forecasts... 8 Confdence
More informationVARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES
VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES BÂRZĂ, Slvu Faculty of Mathematcs-Informatcs Spru Haret Unversty barza_slvu@yahoo.com Abstract Ths paper wants to contnue
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationLecture 3: Probability Distributions
Lecture 3: Probablty Dstrbutons Random Varables Let us begn by defnng a sample space as a set of outcomes from an experment. We denote ths by S. A random varable s a functon whch maps outcomes nto the
More informationAndreas C. Drichoutis Agriculural University of Athens. Abstract
Heteroskedastcty, the sngle crossng property and ordered response models Andreas C. Drchouts Agrculural Unversty of Athens Panagots Lazards Agrculural Unversty of Athens Rodolfo M. Nayga, Jr. Texas AMUnversty
More informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More informationDynamic Cost Allocation for Economic Lot Sizing Games
Dynamc Cost Allocaton for Economc Lot Szng Games Alejandro Torello H. Mlton Stewart School of Industral and Systems Engneerng Georga Insttute of Technology Atlanta, GA 30332 atorello@sye.gatech.edu elson
More informationWeek3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity
Week3, Chapter 4 Moton n Two Dmensons Lecture Quz A partcle confned to moton along the x axs moves wth constant acceleraton from x =.0 m to x = 8.0 m durng a 1-s tme nterval. The velocty of the partcle
More informationTopics in Probability Theory and Stochastic Processes Steven R. Dunbar. Classes of States and Stationary Distributions
Steven R. Dunbar Department of Mathematcs 203 Avery Hall Unversty of Nebraska-Lncoln Lncoln, NE 68588-0130 http://www.math.unl.edu Voce: 402-472-3731 Fax: 402-472-8466 Topcs n Probablty Theory and Stochastc
More informationLOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin
Proceedngs of the 007 Wnter Smulaton Conference S G Henderson, B Bller, M-H Hseh, J Shortle, J D Tew, and R R Barton, eds LOW BIAS INTEGRATED PATH ESTIMATORS James M Calvn Department of Computer Scence
More informationStatistics for Economics & Business
Statstcs for Economcs & Busness Smple Lnear Regresson Learnng Objectves In ths chapter, you learn: How to use regresson analyss to predct the value of a dependent varable based on an ndependent varable
More informationLINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity
LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 30 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 2 Remedes for multcollnearty Varous technques have
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationConvergence of random processes
DS-GA 12 Lecture notes 6 Fall 216 Convergence of random processes 1 Introducton In these notes we study convergence of dscrete random processes. Ths allows to characterze phenomena such as the law of large
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationMLE and Bayesian Estimation. Jie Tang Department of Computer Science & Technology Tsinghua University 2012
MLE and Bayesan Estmaton Je Tang Department of Computer Scence & Technology Tsnghua Unversty 01 1 Lnear Regresson? As the frst step, we need to decde how we re gong to represent the functon f. One example:
More informationNotes on Frequency Estimation in Data Streams
Notes on Frequency Estmaton n Data Streams In (one of) the data streamng model(s), the data s a sequence of arrvals a 1, a 2,..., a m of the form a j = (, v) where s the dentty of the tem and belongs to
More informationBALANCING OF U-SHAPED ASSEMBLY LINE
BALANCING OF U-SHAPED ASSEMBLY LINE Nuchsara Krengkorakot, Naln Panthong and Rapeepan Ptakaso Industral Engneerng Department, Faculty of Engneerng, Ubon Rajathanee Unversty, Thaland Emal: ennuchkr@ubu.ac.th
More informationTornado and Luby Transform Codes. Ashish Khisti Presentation October 22, 2003
Tornado and Luby Transform Codes Ashsh Khst 6.454 Presentaton October 22, 2003 Background: Erasure Channel Elas[956] studed the Erasure Channel β x x β β x 2 m x 2 k? Capacty of Noseless Erasure Channel
More informationChapter 2 - The Simple Linear Regression Model S =0. e i is a random error. S β2 β. This is a minimization problem. Solution is a calculus exercise.
Chapter - The Smple Lnear Regresson Model The lnear regresson equaton s: where y + = β + β e for =,..., y and are observable varables e s a random error How can an estmaton rule be constructed for the
More informationDepartment of Quantitative Methods & Information Systems. Time Series and Their Components QMIS 320. Chapter 6
Department of Quanttatve Methods & Informaton Systems Tme Seres and Ther Components QMIS 30 Chapter 6 Fall 00 Dr. Mohammad Zanal These sldes were modfed from ther orgnal source for educatonal purpose only.
More informationMULTI-ITEM FUZZY INVENTORY MODEL FOR DETERIORATING ITEMS WITH FINITE TIME-HORIZON AND TIME-DEPENDENT DEMAND
Yugoslav Journal of Operatons Research 16 (2006), Number 2, 161-176 MULI-IEM FUZZY INVENORY MODEL FOR DEERIORAING IEMS WI FINIE IME-ORIZON AND IME-DEPENDEN DEMAND S. KAR 1,. K. ROY 2, M. MAII 3 1 Department
More informationThe Ordinary Least Squares (OLS) Estimator
The Ordnary Least Squares (OLS) Estmator 1 Regresson Analyss Regresson Analyss: a statstcal technque for nvestgatng and modelng the relatonshp between varables. Applcatons: Engneerng, the physcal and chemcal
More informationComputing Correlated Equilibria in Multi-Player Games
Computng Correlated Equlbra n Mult-Player Games Chrstos H. Papadmtrou Presented by Zhanxang Huang December 7th, 2005 1 The Author Dr. Chrstos H. Papadmtrou CS professor at UC Berkley (taught at Harvard,
More informationDesign and Optimization of Fuzzy Controller for Inverse Pendulum System Using Genetic Algorithm
Desgn and Optmzaton of Fuzzy Controller for Inverse Pendulum System Usng Genetc Algorthm H. Mehraban A. Ashoor Unversty of Tehran Unversty of Tehran h.mehraban@ece.ut.ac.r a.ashoor@ece.ut.ac.r Abstract:
More informationCompilers. Spring term. Alfonso Ortega: Enrique Alfonseca: Chapter 4: Syntactic analysis
Complers Sprng term Alfonso Ortega: alfonso.ortega@uam.es nrque Alfonseca: enrque.alfonseca@uam.es Chapter : Syntactc analyss. Introducton. Bottom-up Analyss Syntax Analyser Concepts It analyses the context-ndependent
More informationLecture 12: Classification
Lecture : Classfcaton g Dscrmnant functons g The optmal Bayes classfer g Quadratc classfers g Eucldean and Mahalanobs metrcs g K Nearest Neghbor Classfers Intellgent Sensor Systems Rcardo Guterrez-Osuna
More informationThe Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction
ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also
More informationCHAPTER 17 Amortized Analysis
CHAPTER 7 Amortzed Analyss In an amortzed analyss, the tme requred to perform a sequence of data structure operatons s averaged over all the operatons performed. It can be used to show that the average
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More informationOrganizing Teacher Education In German Universities
An Operatons Research Approach Bob Grün Unversty of Kaserslautern Department of Mathematcs AG Optmzaton Research Semnar OptALI: Optmzaton and ts Applcatons n Learnng and Industry 28.2.2012 Outlne 1 Introducton
More informationSimulated Power of the Discrete Cramér-von Mises Goodness-of-Fit Tests
Smulated of the Cramér-von Mses Goodness-of-Ft Tests Steele, M., Chaselng, J. and 3 Hurst, C. School of Mathematcal and Physcal Scences, James Cook Unversty, Australan School of Envronmental Studes, Grffth
More informationMaximizing Overlap of Large Primary Sampling Units in Repeated Sampling: A comparison of Ernst s Method with Ohlsson s Method
Maxmzng Overlap of Large Prmary Samplng Unts n Repeated Samplng: A comparson of Ernst s Method wth Ohlsson s Method Red Rottach and Padrac Murphy 1 U.S. Census Bureau 4600 Slver Hll Road, Washngton DC
More informationOutline. Communication. Bellman Ford Algorithm. Bellman Ford Example. Bellman Ford Shortest Path [1]
DYNAMIC SHORTEST PATH SEARCH AND SYNCHRONIZED TASK SWITCHING Jay Wagenpfel, Adran Trachte 2 Outlne Shortest Communcaton Path Searchng Bellmann Ford algorthm Algorthm for dynamc case Modfcatons to our algorthm
More informationExperience with Automatic Generation Control (AGC) Dynamic Simulation in PSS E
Semens Industry, Inc. Power Technology Issue 113 Experence wth Automatc Generaton Control (AGC) Dynamc Smulaton n PSS E Lu Wang, Ph.D. Staff Software Engneer lu_wang@semens.com Dngguo Chen, Ph.D. Staff
More informationx i1 =1 for all i (the constant ).
Chapter 5 The Multple Regresson Model Consder an economc model where the dependent varable s a functon of K explanatory varables. The economc model has the form: y = f ( x,x,..., ) xk Approxmate ths by
More informationRandomness and Computation
Randomness and Computaton or, Randomzed Algorthms Mary Cryan School of Informatcs Unversty of Ednburgh RC 208/9) Lecture 0 slde Balls n Bns m balls, n bns, and balls thrown unformly at random nto bns usually
More informationECE559VV Project Report
ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate
More informationToward Understanding Heterogeneity in Computing
Toward Understandng Heterogenety n Computng Arnold L. Rosenberg Ron C. Chang Department of Electrcal and Computer Engneerng Colorado State Unversty Fort Collns, CO, USA {rsnbrg, ron.chang@colostate.edu}
More informationReport on Image warping
Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.
More informationCardamom Planters Association College, Bodinayakanur, Tamil Nadu, India
Internatonal Journal of Computatonal and Appled Mathematcs. ISSN 89-4966 Volume, Number (07) Research Inda Publcatons http://www.rpublcaton.com OPPTIMIZATION OF TWO-ECHELON INVENTORY SYSTEM WITH TWO SUPPLIERS
More informationCurve Fitting with the Least Square Method
WIKI Document Number 5 Interpolaton wth Least Squares Curve Fttng wth the Least Square Method Mattheu Bultelle Department of Bo-Engneerng Imperal College, London Context We wsh to model the postve feedback
More informationOperating conditions of a mine fan under conditions of variable resistance
Paper No. 11 ISMS 216 Operatng condtons of a mne fan under condtons of varable resstance Zhang Ynghua a, Chen L a, b, Huang Zhan a, *, Gao Yukun a a State Key Laboratory of Hgh-Effcent Mnng and Safety
More informationChapter 9: Statistical Inference and the Relationship between Two Variables
Chapter 9: Statstcal Inference and the Relatonshp between Two Varables Key Words The Regresson Model The Sample Regresson Equaton The Pearson Correlaton Coeffcent Learnng Outcomes After studyng ths chapter,
More information