Evaluating the Quality of Railway Timetables from Passenger Point of View
|
|
- Shanna Watson
- 5 years ago
- Views:
Transcription
1 CASPT 2015 Evaluatng the Qualty of Ralway Tmetables from Passenger Pont of Vew Tomáš Robenek Shad Sharf Azadeh Mchel Berlare Abstract In the ralway passenger servce plannng, the man focus s often on the feasblty of the solutons and/or the assocated costs of the Tran Operatng Company (TOC). The costs of TOCs are the drver for the noncyclc verson of the Tran Tmetablng Problem (TTP), whereas feasblty s the man concern of the cyclc verson of the same problem. Usually, the passengers for whom the servce s desgned are not taken nto consderaton, when creatng the tmetables. Ths could be one of the man reasons for whch the wllngness of passengers to use trans as ther mean of transport has reduced. In ths research, a choce based optmzaton approach s ntroduced that addresses ths ssue from passenger satsfacton pont of vew. We valdate our model usng a sem-real data of a major European ralway company. Keywords Ralway Passenger Servce Ideal Tmetable Cyclc vs. Non-Cyclc 1 Introducton In ths study, we gve attenton to the problematc of provdng the passenger servce n ralways. The offered product n ths case s the tmetable and the consumer s the passengers. However, the passenger demand s subject to the human behavor that ncorporates several factors, to lst a few: senstvty to the tme of the departure related to the trp purpose (weekday peak hours for work or school, weekends for lesure, etc.), comfort, percepton and others. Moreover the passenger servce has to compete wth other transportaton Transport and Moblty Laboratory (TRANSP-OR), School of Archtecture, Cvl and Envronmental Engneerng (ENAC), École Polytechnque Fédérale de Lausanne (EPFL), Staton 18, CH-1015 Lausanne, Swtzerland, E-mal: {tomas.robenek, shad.sharfazadeh, mchel.berlare}@epfl.ch
2 modes (car, natonal ar routes, etc.) and thus faces even hgher pressure to create good qualty tmetables. STRATEGIC - several years TACTICAL - >= 1 year OPERATIONAL - < 1 year Actual Tmetables Tran Platformng Platform Assgnments Demand Lne Plannng Lnes Tran Tmetablng Actual Tmetables Rollng Stock Plannng Tran Assgnments Actual Tmetables Crew Plannng Crew Assgnments TOC Infrastructure Manager Fg. 1 Plannng overvew of ralway operaton The current TOC plannng horzon as descrbed by Caprara et al (2007) s vsualzed on Fgure 1. In the frst stage, the Lne Plannng Problem (LPP) decdes on whch lnes wll be operated and wth what frequences. The LPP s the only problem n the plannng horzon that actually takes nto account the demand n the form of an hourly Orgn Destnaton (OD) flows (Schöbel (2012)). The second stage n the plannng horzon, s the Tran Tmetablng problem (TTP), where two dfferent models exst: non-cyclc (Caprara et al (2002)) and cyclc (Peeters (2003)). The non-cyclc TTP takes as nput the deal tmetables and tres to resolve the track conflcts by mnmzng the tmetable shfts needed. However, the orgn of the deal tmetables s unclear as well as the punshment for the shfts. Smlarly, n the cyclc problem, the model takes as an nput the cycle and creates ether arbtrary feasble solutons or a feasble solutons based on user defned objectve functon. Typcally, the user defned functons are rather smplfed such as mnmzaton of travel tme, whch can not properly account for the passenger behavor. Both of the models can secure connectons between two trans, however wth no ncentve f the connecton s actually needed as none of the models takes passengers nto account. In the surveyed lterature, a model that ntegrates mode choce and cyclc verson of the TTP s presented (Cordone and Redaell (2011)). The objectve functon s maxmzaton of the demand captured by the ralway mode as opposed to other modes. The constrant that estmates the demand captured by the tmetable s usng a logt model, whose attrbutes form the total trp
3 length. The resultng formulaton s non-lnear and non-convex and s solved usng heurstcs. In our study, we propose to ntegrate the Route Choce Model (RCM) and the TTP formng a new plannng phase called the Ideal Tran Tmetablng Problem (ITTP). The ITTP s usng the output of the LPP and serves as an nput to the tradtonal TTP and hence, t s placed between the two respectve problems (Fgure 2). In ths problem, we mmc the RCM by ntroducng a passenger cost related to a concerned tmetable. The objectve functon of ths problem s the passenger cost mnmzaton. The model wll allow tmetables of the TOC s tran lnes to take the form of the non-cyclc or cyclc schedule. Moreover, we ntroduce a demand nduced connectons. The connectons between the trans are not pre-defned, but are subject to the demand (va passengers costs). STRATEGIC - several years TACTICAL - >= 1 year OPERATIONAL - < 1 year Actual Tmetables Tran Platformng Platform Assgnments Demand Lne Plannng Lnes Ideal Tran Tmetablng Ideal Tmetables Tran Tmetablng Actual Tmetables Rollng Stock Plannng Tran Assgnments Actual Tmetables Crew Plannng Crew Assgnments TOC Infrastructure Manager Fg. 2 Modfed overvew of ralway operaton The structure of the manuscrpt s as follows: we ntroduce a defnton of a passenger cost (Secton 2), followed by a problem defnton and ts mathematcal formulaton (Secton 3). The model s tested on a Swss case study (Secton 4). The paper s fnalzed by drawng some conclusons and dscusson of possble extensons (Secton 5). 2 Passenger Cost In order to fnd a good tmetable from the passenger pont of vew, we need to take nto account passenger behavor. Such a behavor can be modeled usng dscrete choce theory (Ben-Akva and Lerman (1985)). The base assumpton n dscrete choce theory s that the passengers maxmze ther utlty,.e. mnmze the cost assocated wth each alternatve and select the best one. We propose the followng costs assocated wth deal passenger tmetable: n-vehcle-tme (VT)
4 watng tme (WT) number of transfers (NT) scheduled delay (SD) The n-vehcle-tme s the (total) tme passengers spend on board of (each) tran. Ths tme allows the passengers to dstngush between the slow and the fast servces. The watng tme s the tme passengers spend watng between two consecutve trans n ther respectve transfer ponts. The cost percepton related to the watng tme s evaluated as double and a half of the n-vehcle-tme (see Wardman (2004)). The transfer(s) am at dstngushng between drect and nterchange servces. In lterature and practce, t s by addng extra travel (n-vehcle) tme to the overall journey. In our case, we have followed the example of Dutch Ralways (NS), where penalty of 10 mnutes per transfer s appled (see de Kezer et al (2012)). Even though varety of studes show that number of nterchanges, dstance walked, weather, etc. play effect n the process, t s rather dffcult to ncorporate n optmzaton models. Thus usng the appled value (by NS) wll brng ths research closer to the ndustry. The scheduled delay s ndcatng the tme of the day passengers want to travel,.e. followng the assumpton that the demand s tme dependent. For example: most of the people have to be at ther workplace at 8 a.m. Snce t s mpossble to provde servce that would secure deal arrval tme to the destnaton for everyone, scheduled delay functons are appled (Fgure 3). Scheduled Delay f_2 Ideal Tme f_1 Tme Fg. 3 Scheduled Delay Functons As shown n Small (1982), the passengers are wllng to s hft ther arrval tme by 1 to 2 mnutes earler, f t wll save them 1 mnute of the n-vehcletme, smlarly they would shft ther arrval by 1/3 to 1 mnute later for the same n-vehcle-tme savng. If we would consder the boundary case, the lateness (f 1 = 1) s perceved equal to the n-vehcle-tme and earlness (f 2 = 0.5) has half of the value (as seen on Fgure 3). To estmate the perceved cost (qualty) of the selected tnerary n a gven tmetable for a sngle passenger, we sum up all the characterstcs: C = V T W T + 10 NT + SD [mn] (1)
5 WT 1 WT 2 Transfer 1 Transfer 2 VT 2 VT 1 VT 3 Orgn Destnaton Fg. 4 Example Network For a better understandng, consder the followng example usng network on Fgure 4: passenger s tnerary conssts of takng 3 consecutve trans n order to go from hs orgn to hs destnaton, he has to change tran twce. If he arrves to hs destnaton earler than hs deal tme, hs SD wll be: ( ) deal tme arrval tme SD e = argmax, 0 (2) 2 We use argmax functon as one tran lne has several trans per day scheduled and the passenger selects the one closest to hs desred travelng tme. On the other hand, f he arrves later than hs deal tme, then hs SD wll be: SD l = argmax (0, arrval tme deal tme) (3) The overall scheduled delay s then formed: SD = argmn (SD e, SD l ) (4) Hs overall perceved cost wll be the followng: C = V T W T + 10 NT + SD [mn] (5) trans transfers The resultng value s n mnutes, however t s often desrable to estmate the cost n monetary values for prcng purposes. In such a case, natonal surveys estmatng respectve naton s value of tme (VOT) exst. The VOT s gven n naton s currency per hour, for nstance n Swtzerland the VOT for commuters usng publc transport s swss francs per hour (Axhausen et al (2008)). To make the cost n monetary unts, smply multply the whole Equaton 1 by the VOT/60. The am of our research s not to calbrate the weghts n Equaton 1, but to provde better tmetables n terms of the departure tmes. The weghts serve as an nput for our problem and thus can be changed at any tme. Addng everythng up, the deal passenger tmetable can be defned as follows: The deal passenger tmetable conssts of tran departure tmes that passengers global costs are mnmzed,.e. the most convenent path to go from an orgn to a destnaton traded-off by a tmely arrval to the destnaton for every passenger.
6 Smlar concept, mprovng qualty of tmetables has been done n Vansteenwegen and Oudheusden (2006, 2007). Ther approach has been focused on relable connectons for transferrng passengers, whereas n our framework we focus on the overall satsfacton of every passenger. Other concept smlar to ours has been used n the delay management, namely n Kana et al (2011) and Sato et al (2013). However ther defnton of dssatsfacton of passengers omts the scheduled delay. 3 Mathematcal Formulaton In ths secton, we present a mxed nteger programmng formulaton for the Ideal Tran Tmetablng Problem. The am of ths problem s to provde the deal tmetables,.e. to mnmze the passenger cost. The nput of the ITTP s the demand that takes the form of the amount of passengers that want to travel between OD par I and that want to arrve to ther destnaton at ther deal tme t T. Apart of that, there s a pool of lnes l L and ts segments g G l. Segment s a part of the lne between two statons, where the tran does not stop. Each lne has an assgned frequency expressed as the avalable trans v V l (lnes, segments and frequences are the output of the LPP). Based on the pool of lnes, the set of paths between every OD par p P can be generated. The path s called an ordered sequence of lnes to get from an orgn to a destnaton ncludng detals such as the runnng tme from the orgn of the lne to the orgn of the OD par h pl (where l = 1), the runnng tme from an orgn of the OD par to a transferrng pont between two lnes r pl (where l = 1), the runnng tme from the orgn of the lne to the transferrng pont n the path h pl (where l > 1 and l < L p ), the runnng tme from one transferrng pont to another r pl (where l > 1 and l < L p ) and the runnng tme from the last transferrng pont to a destnaton of the OD par r pl (where l = L p ). Note that the ndex p s always present as dfferent lnes usng the same track mght have dfferent runnng tmes. Part of the ITTP s the routng of the passengers through the ralway network. Usng a decson varable x tp, we secure that each passenger (combnaton of ndces t) can use at most one path. If there s no path assgned to a gven passenger (due to the lmted capacty of the trans), t s assumed that the passenger would take the earlest possble shortest path outsde of the plannng horzon H. Wthn the path tself, passenger can use exactly one tran on every lne n the path (decson varable y tplv ). These decson varables, among others, allow us to backtrace the exact tnerary of every passenger. The tmetable s understood as a set of departures for every tran on every lne (values of d l v). The tmetable can take form of a non-cyclc or a cyclc verson (dependng f the cyclcty constrants are actve, see below). Snce we know the exact tnerary of every passenger, we can measure the tran occupaton o l vg of every tran v of every lne l on each of ts segment g. Derved from the occupaton, number of tran unts u l v s assgned to each
7 tran. Ths value can be equal to zero, whch means that the tran s not runnng and the frequency of the lne can be reduced. We can formulate the ITTP as follows: Sets Followng s the lst of sets used n the model: I set of orgn-destnaton pars T set of deal tmes for OD par P set of possble paths between OD par L set of operated lnes L p set of lnes n the path p V l set of avalable trans for the lne l (frequency) G l set of segments on lne l Input Parameters Followng s the lst of parameters used n the model: H end of the plannng horzon [mn] M suffcently large number (can take the value of H) m mnmum transfer tme [mn] c cycle [mn] π t deal arrval tme of a passenger t to hs destnaton [mn] r pl runnng tme between OD par on path p usng lne l [mn] h pl tme to arrve from the startng staton of the lne l to the orgn/transferrng pont of the OD par n the path p [mn] D t demand between OD par wth deal tme t [passengers] q value of the n vehcle tme [monetary unts per mnute] q w value of the watng tme n the relaton to the VOT [untless] f 1 coeffcent of beng late n the relaton to the VOT [untless] f 2 coeffcent of beng early n the relaton to the VOT [untless] a penalty for havng a tran transfer [mn] β capacty of a sngle tran unt [passengers] j maxmum length of the tran [tran unts] γ n-vehcle-tme of the shortest path between OD par [mn] η number of transfers n the shortest path for OD par [untless] C t penalty cost for not servng passenger t nsde of the plannng horzon H [monetary unts] Decson Varables Followng s the lst of decson varables used n the model: C t the total cost of a passenger wth deal tme t between OD par
8 w t the total watng tme of a passenger wth deal tme t between OD par w tp the total watng tme of a passenger wth deal tme t between OD par usng path p w tpl the watng tme of a passenger wth deal tme t between OD par on the lne l that s part of the path p,.e. the watng tme n the transferrng pont, when transferrng to lne l x tp 1 f passenger wth deal tme t between OD par chooses path p; 0 otherwse s t the value of the scheduled delay of a passenger wth deal tme t between OD par s tp the value of the scheduled delay of a passenger wth deal tme t between OD par travelng on the path p d l v the departure tme of a tran v on the lne l (from ts frst staton) y tplv 1 f a passenger wth deal tme t between OD par on the path p takes the tran v on the lne l; 0 otherwse zv l dummy varable to help modelng the cyclcty correspondng to a tran v on the lne l o l vg tran occupaton of a tran v of the lne l on a segment g u l v number of tran unts of a tran v on the lne l αv l 1 f a tran v on the lne l s beng operated; 0 otherwse Routng Model The ITTP model can be decomposed nto 2 parts: routng and cost estmaton. The routng takes care of the feasblty of the soluton, whereas cost estmaton takes care of the passenger cost attrbutes. At frst, we present the Routng Model (RM): o l vg = I mn D t C t (6) I t T x tp 1, I, t T, (7) p P = x tp, I, t T, p P, l L p, (8) y tplv v V l ( d l v d l ) v 1 = c z l v, l L, v V l : v > 1, (9) t T p P y tplv D t, l L, v V l, g G l, (10) u l v β o l vg, l L, v V l, g G l, (11) α l v j u l v, l L, v V l, (12) C t 0, I, t T, (13) d l v 0, l L, v V l, (14) x tp (0, 1), I, t T, p P, (15)
9 y tplv (0, 1), I, t T, p P, l L p, v V l, (16) o l vg 0, l L, v V l, g G l, (17) u l v (0, j), l L, v V l, (18) α l v (0, 1), l L, v V l, (19) z l v N, l L, v V l. (20) The objectve functon (6) ams at mnmzng the passenger cost. Constrants (7) secure that every passenger s usng at most one path to get from hs/her orgn to hs/her destnaton. Smlarly constrants (8) make sure that every passenger takes exactly one tran on each of the lnes n hs/her path, f ths path s beng used. Constrants (9) model the cyclcty usng nteger dvson. When solvng the non-cyclc verson of the problem, these constrants have to be removed. Constrants (10) keep track of a tran occupaton. Constrants (11) verfy that the tran capacty s not exceeded on every stretch/segment of the lne. Constrants (12) assgn tran drvers,.e. f a tran v on the lne l s beng operated or not. Constrants (13) (20) set the domans of decson varables. Cost Estmatng Constrants To make the ITTP complete, we need to expand the Routng Model wth the cost estmatng constrants. We wll add the cost related constrants n blocks of attrbutes that create the cost of a passenger. s tp f 1 s t s tp (( d L v + h L ( ( s tp f 2 π t d L v M (1 x tp ), ) ) I, t T, p P, (21) + r p L π t ( ) M 1 y tp L v, I, t T, p P, v V L, )) (22) + r p L + h L ( M 1 y tp L v ), I, t T, p P, v V L, (23) s t 0, I, t T, (24) s tp 0, I, t T, p P. (25) The frst block of constrants takes care of the scheduled delay (SD). In our model we have 2 types of scheduled delay: SD for every path (constrants (25)) and SD that s lnked to the path, whch wll be the fnal selected path of a gven passenger(s) wth a gven deal tme (constrants (24)). As descrbed n the Secton 2, the constrants (22) model the earlness of the passengers (Equaton 2) and constrants (23) model the lateness (Equaton 3). Constrants (21) make sure that only one SD s selected (Equaton 4)
10 not necessarly the lowest one as t depends on the cost of the whole tnerary (constrants (33)),.e. the path wth the smallest overall cost wll be selected for the gven OD par wth a gven deal tme. These constrants also allow us to avod the non-lnearty n the estmaton of the fnal passenger cost (constrants (33)). w tpl w tpl w t w tp M (1 x tp ), I, t T, p P, w tp = l L p \1 (( ) d l v + h pl (d l v + hpl + r pl ) ( M (1 y tpl v M (( ) d l v + h pl (d l v + hpl + r pl ) ( +M (1 y tpl v + M w tpl, I, t T, p P, )) + m 1 y tplv )) + m 1 y tplv (26) (27) I, t T, p P, ), l L p : l > 1, l = l 1, v V l, v V l, (28) I, t T, p P, ), l L p : l > 1, l = l 1, v V l, v V l, (29) w t 0, I, t T, (30) w tp 0, I, t T, p P, (31) w tpl 0, I, t T, p P, l L p. (32) The second block of constrants s modelng the watng tme (WD). There are 3 types of watng tme: the fnal selected watng tme n the best path (constrants (30)), the total watng tme of every path (constrants (31)) and the watng tme at every transferrng pont n every path (constrants (32)). The constrants (28) and (29) are complementary constrants that model the watng tme n the transferrng ponts n every path. In other words, these two constrants fnd the two best connected trans n the two tran lnes n the passengers path. Constrants (27) add up all the watng tmes n one path to estmate the total watng tme n a gven path. Constrants (26) make sure that only one WT s selected (smlarly as constrants (21) for SD). C t q q w w t + q a p P +q p P r pl l L p x tp ( L p 1) x tp + q s t, I, t T, (33)
11 C t 1 x tp C t, I, t T, (34) p P C t = q q w (m + c + η ) + q a η + q γ + ( H + c + γ + a η π t ) f1 q, I, t T. (35) At last, constrants (33) combne all the attrbutes together as n Equaton 5 multpled by the VOT. If a passenger t can not be served wthn the plannng horzon, the constrants (34) become actve and penalze the passenger wth a cost assocated to hs shortest path realzed wth the frst possble path outsde of the plannng horzon (n the next cycle) constrants (35). 4 Case Study In order to test the ITTP model, we have selected the network of S-trans n canton Vaud, Swtzerland as our case study. The reduced network s represented on Fgure 5 (as of tmetable 2014). We consder only the man statons n the network (n total 13 statons). A smple algorthm n Java has been coded, n order to fnd all the possble paths between every OD par. The algorthm allowed maxmum of 3 consecutve lnes to get from an orgn to a destnaton. The travelng tmes have been extracted from the Swss Federal Ralways (SBB) webste. The mnmum transfer tme between two trans has been set to 4 mnutes. Vallorbe 13 Yverdon-Les-Bans 12 Payerne 1 S1 S2 S3 S4 S11 S21 S31 Cossonay 11 2 Palézeux 3 Pudoux-Chexbres Lausanne Renens 8 7 Montreux 9 Morges Vevey Allaman Vlleneuve 4 Fg. 5 Network of S-trans n canton Vaud, Swtzerland
12 Lne ID From To Departures S1 S2 S3 S4 S11 S21 S31 1 Yverdon-les-Bans Vlleneuve 6:19 7:19 8:19 2 Vlleneuve Yverdon-les-Bans 5:24 6:24 7:24 8:24 3 Vallorbe Palézeux 5:43 6:43 7:43 8:43 4 Palézeux Vallorbe 6:08 7:08 8:08 5 Allaman Vlleneuve 6:08 7:08 8:08 6 Vlleneuve Allaman 6:53 7:53 8:53 7 Allaman Palézeux 5:41 6:41 7:41 8:41 8 Palézeux Allaman 6:35 7:35 8:35 9 Yverdon-les-Bans Lausanne 5:26* 6:34 7:34 8:34 10 Lausanne Yverdon-les-Bans 5:55 6:55 7:55 8:55 11 Payerne Lausanne 5:39 6:39 7:38* 8:39 12 Lausanne Payerne 5:24 6:24 7:24 8:24 13 Vevey Pudoux-Chexbres 6:09 7:09 8:09 14 Pudoux-Chexbres Vevey 6:31* 7:36 8:36 Table 4 Lst of S-tran lnes n canton Vaud, Swtzerland In Table 4, you can fnd the lst of all S-tran lnes of the canton Vaud n the tmetable of There are 7 lnes that run n both drectons. Each combnaton of a lne and ts drecton has ts unque ID number. Column from marks the orgn staton of the lne as well as column to marks ts destnaton. The columns departures show the currently operated tmetable (.e. departures from the orgn of the lne) n the mornng peak hour (5 a.m. to 9 a.m.), whch s the tme horzon used n our study. Trans that dd not follow the cycle (marked wth a star *) were set to a cycle value, n order to not volate the cyclcty constrants (the tmetables n Swtzerland are cyclc wth a cycle of one hour). The SBB s operatng the Stadler Flrt tran unts on the lnes S1, S2, S3 and S4. In our case study, we have homogenzed the fleet and thus use ths type of a tran also for the rest of the lnes. The capacty of ths unt s 160 seats and 220 standng people. The maxmum amount of tran unts per tran s 2 (as SBB never uses more unts). The amount of tran unts per tran remans the same along the lne, but t mght change at the end statons (we don t go nto further detals as ths s the task of the Rollng Stock Problem). The demand and ts dstrbuton has been estmated based on the SBB report and observaton (more detals n Appendx A). In total there are passengers n the network for the current stuaton. The coeffcents of the passenger cost are as descrbed n Secton Results In all of the experments, we have run 3 types of the ITTP model: current, cyclc and non-cyclc. The current model reflects the currently operated SBB tmetable as n Table 4 (the decson varables d have been set to the values n the table). Subsequently, the cyclc model does not have the departure tmes as a hard constrant and thus the CPLEX can look for better values than those
13 120 3 Passenger Coverage [%] Passenger Cost [MCHF] Number of Passengers (a) Passenger coverage as a functon of the demand for the current model Number of Passengers [thousands] (b) Passenger cost as a functon of the demand for the current model at ɛ 100*% Dffernce n Pax Cost [kchf] non-cyclc cyclc Number of Passengers [thousands] (c) The dfference n passenger cost of the cyclc and non-cyclc model as compared to the current model at ɛ 100*% Fg. 6 Results of the SBB. The non-cyclc model dffers from the cyclc one by removng the cyclcty constrants. In order to speed up CPLEX, we would frst solve the current verson and gve ts soluton as a warm start for the cyclc model and solve t. Further along, we would gve the soluton of the cyclc model as a warm start to the non-cyclc model. Moreover, we have run the models for several levels of passenger densty, startng from the real-lke volume up untl the pont where the passenger coverage decreases to a level of 70%. The passenger coverage as a functon of the demand for the current model (the coverage s more or less the same for the other two models) can be found on Fgure 6(a). As t can be seen, the congeston starts at the amount of cca passengers and that the coverage goes down almost lnearly. The total passenger cost growth can be observed on Fgure 6(b) (we plot only the current model as the other two models yeld smlar values). The passenger cost grows rather exponentally and ts functon can be splt nto two lnear parts: non-congested (gradual slope) and congested (steep slope). Ths mght be useful for practtoners as t would allow them to predct the
14 passenger cost. Subsequently, we plot the relatve dfference of cyclc and noncyclc tmetables as opposed to the current tmetable on Fgure 6(c). In general, the cyclc model tends to fnd slghtly better tmetables than the current model (n the congested cases the beneft even dramatcally ncreases). The non-cyclc tmetable, on the other hand, s more flexble and copes the functon of the total passenger cost (Fgure 6(b)) and acheves more sgnfcant savngs. Ths s due to the fact that the trans do not have to follow the cyclc frequency and thus are more densely scheduled, for nstance n the most congested case, the average headway between two consecutve trans on a same lne s 22.6 mnutes, wth mnmum value of 1 mnute and maxmum value of 238 mnutes. 5 Conclusons and Future Work In ths research, we defne a new way, how to measure the qualty of a tmetable from the passenger pont of vew and ntroduce a defnton of an deal tmetable. We then present a formulaton of a mxed nteger lnear problem that can desgn the deal tmetables. The new Ideal Tran Tmetablng Problem fts nto the current plannng horzon of ralway passenger servce and s n lne wth the new market structure and the current trend of puttng passengers back nto consderaton, when plannng a ralway servce. The novel approach not only desgns tmetables that ft the best the passengers, but that also creates by tself connectons between two trans, when needed. Moreover, the output conssts of the routng of the passengers and thus the tran occupaton can be extracted and be used effcently, when plannng the rollng stock assgnment (.e. the Rollng Stock Plannng Problem). The ITTP can create both non-cyclc and cyclc tmetables. We test the model on a sem-real data of the S-tran network of Canton Vaud n Swtzerland. Our model was able to fnd a better tmetable compared to the current SBB tmetable, where the acheved savngs, whlst keepng the tmetables cyclc, were around CHF and around CHF, n the case of the non-cyclc tmetable. Furthermore, we have focused on explotng the passenger congeston. Our study shows that two lnear functons, for congested and uncongested network, can be constructed and thus the passenger cost can be predcted. Most nterestngly, we show that the mprovements of the noncyclc tmetables as compared to the cyclc tmetables, are flexble (they copy the total passenger cost functons) due to the fact that these tmetables allow hgher tran densty. The average tran headway of the most congested case was reduced from the cycle (60 mnutes) down to 22 mnutes. Moreover the non-cyclc model was able to acheve around CHF of savngs even though the network s dense. These savngs are expected to be even hgher for less dense networks. Due to ths fact, we would propose to combne the ITTP wth the Lne Plannng Problem n the future. In the future work, we wll focus on effcent solvng of the problem and extenson of the plannng horzon,.e. to be able to solve the problem for a whole day. Ths would allow us to explore, f the non-cyclc tmetables could
15 perform better off-peak hours and n the context of the whole day. The new defnton of a qualty of a tmetable (the passenger pont of vew) creates a lot of opportuntes for future research: effcent handlng of the TOC s fleet, better delay management, robust tran tmetablng passenger-wse or ntegraton wth other phases of the plannng horzon. References Axhausen KW, Hess S, Köng A, Abay G, Bates JJ, Berlare M (2008) Income and dstance elastctes of values of travel tme savngs: New swss results. Transport Polcy 15(3): , DOI Ben-Akva M, Lerman S (1985) Dscrete Choce Analyss. The MIT Press, Cambrdge Massachusetts Caprara A, Fschett M, Toth P (2002) Modelng and solvng the tran tmetablng problem. Operatons Research 50(5): , DOI Caprara A, Kroon LG, Monac M, Peeters M, Toth P (2007) Passenger ralway optmzaton. In: Barnhart C, Laporte G (eds) Handbooks n Operatons Research and Management Scence, vol 14, Elsever, chap 3, pp Cordone R, Redaell F (2011) Optmzng the demand captured by a ralway system wth a regular tmetable. Transportaton Research Part B: Methodologcal 45(2): , DOI URL Kana S, Shna K, Harada S, Tom N (2011) An optmal delay management algorthm from passengers vewponts consderng the whole ralway network. Journal of Ral Transport Plannng & Management 1(1):25 37, DOI robust Modellng of Capacty, Delays and Reschedulng n Regonal Networks de Kezer B, Geurs K, Haarsman G (2012) Interchanges n tmetable desgn of ralways: A closer look at customer resstance to nterchange between trans. In: AET (ed) Proceedngs of the European Transport Conference, Glasgow, 8-10 October 2012 (onlne), AET Peeters L (2003) Cyclc Ralway Tmetable Optmzaton. ERIM Ph.D. seres Research n Management, Erasmus Research nst. of Management (ERIM) Sato K, Tamura K, Tom N (2013) A mp-based tmetable reschedulng formulaton and algorthm mnmzng further nconvenence to passengers. Journal of Ral Transport Plannng & Management 3(3):38 53, DOI robust Reschedulng and Capacty Use Schöbel A (2012) Lne plannng n publc transportaton: models and methods. OR Spectrum 34: , DOI /s Small KA (1982) The schedulng of consumer actvtes: Work trps. The Amercan Economc Revew 72(3):pp
16 Swss Federal Ralways (2013) SBB: Facts and Fgures Tech. rep. Vansteenwegen P, Oudheusden DV (2006) Developng ralway tmetables whch guarantee a better servce. European Journal of Operatonal Research 173(1): , DOI Vansteenwegen P, Oudheusden DV (2007) Decreasng the passenger watng tme for an ntercty ral network. Transportaton Research Part B: Methodologcal 41(4): , DOI Wardman M (2004) Publc transport values of tme. Transport Polcy 11(4): , DOI A Demand Generaton The total amount of passengers n the network has been estmated n the followng manner: the populaton of Swtzerland s habtants and the populaton of Canton Vaud s habtants, whch leads to a rough rato of 1:10. Applyng ths rato to a reported amount of passenger journeys per day by SBB (n total one mllon for the whole SBB network), we arrve to a demand volume of passenger journeys per day n canton Vaud. However not all of these journeys are beng realzed usng S-trans. Snce almost all of the trans n Canton Vaud have to pass through ts captal cty Lausanne, we can derve the rato, between the S-trans and other class trans passng through Lausanne, of 40:60 percent, whch leaves us wth a passenger journeys per day usng S-trans n Canton Vaud. Furthermore, the SBB report provdes hourly dstrbuton of passengers on a regonal servces from Monday to Frday. Accordng to ths report 25 percent of the journeys are beng realzed n the mornng peak hour, whch gves us cca passenger journeys n the mornng peak hour for the S-tran network of Canton Vaud a.m. 6 a.m. 7 a.m. 8 a.m. 9 a.m. Fg. 7 The hourly dstrbuton of the passenger groups In order to ease the sze of the generated lp fle(s), the passengers have been splt nto passenger groups (ndces t) of varyng szes. These groups have been dvded nto hourly rates (Fgure 7) accordng to the SBB report (Swss Federal Ralways (2013)) and smoothed nto mnutes usng non-homogenous Posson process. Snce we use concept of an deal arrval tme to the destnaton, the generated arrval tme at the orgn has been shfted, by addng up the shortest path travel tme between the OD par, to the destnaton of the passengers. In order to generate real-lke OD flows (ndex ), we consder the followng probabltes: p(d = 7) = 0.5 probablty of a destnaton beng Lausanne p(d = 8) = 0.2 probablty of a destnaton beng Renens p(d = other) = 0.3 probablty of a destnaton beng other than Lausanne or Renens p(o = any) = 1/12 probablty of an orgn beng any staton (except the already selected destnaton)
17 Snce Lausanne s the bggest cty n the Canton wth all the lnes, except the lne 13 and 14, passng through t, t has the largest probablty of beng a destnaton (many people also use Lausanne as a transfer pont to hgher class trans). The cty wth the second hghest probablty s Renens, because t s the closest staton to one of the bggest unverstes n Swtzerland and from the network dagram (Fgure 5), we can see the most of the lnes stop there, whch suggests hgh demand. The rest of the statons have equal probablty of beng a destnaton (0.3/11), whch s rather small as n the mornng peak hour people travel towards ther work/school n bg ctes. On the other hand, the probablty of beng an orgn s unformly dstrbuted and dependent on ts destnaton (orgn can not be the same as a destnaton). The fnal probablty p(o = o, D = d) for every OD par can be seen n Table 6. In order to reach the total demand, the average sze of a group should be ρ = the total demand dvded by the number of groups. In the current scenaro ρ = /1 000 = 10. In our study, we use 3 dfferent classes of groups: small, medum and large. The sze of the small group s drawn from the unform dstrbuton U(1, 0.6ρ) and appled to ODs wth a probablty p(o = o, D = d) [0, 1.5) %. The sze of the medum group follows U(0.6ρ+1, ρ) and s appled to ODs wth a probablty p(o = o, D = d) [1.5, 3) %. The largest group sze follows a dstrbuton U(ρ+1, 2ρ) and s appled to a probablty p(o = o, D = d) [3, 4.5) %.
18 Table 6 Orgn Destnaton dstrbutons
The Ideal Train Timetabling Problem
The Ideal Tran Tmetablng Problem Tomáš Robenek a,1, Shad Sharf Azadeh a, Janghang Chen b, Mchel Berlare a, Yousef Maknoon a a Transport and Moblty Laboratory (TRANSP-OR), School of Archtecture, Cvl and
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 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 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 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 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 informationCIE4801 Transportation and spatial modelling Trip distribution
CIE4801 ransportaton and spatal modellng rp dstrbuton Rob van Nes, ransport & Plannng 17/4/13 Delft Unversty of echnology Challenge the future Content What s t about hree methods Wth specal attenton for
More informationAnnexes. EC.1. Cycle-base move illustration. EC.2. Problem Instances
ec Annexes Ths Annex frst llustrates a cycle-based move n the dynamc-block generaton tabu search. It then dsplays the characterstcs of the nstance sets, followed by detaled results of the parametercalbraton
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 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 informationModule 9. Lecture 6. Duality in Assignment Problems
Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept
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 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 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 informationQuestion No. 1 (12 points)
Fnal Exam (3 rd Year Cvl) ransportaton lannng & rac Engneerng Date: uesday 4 June 20 otal Grade: 00 onts me: 09:30am 2:30pm Instructor: Dr. Mostaa Abo-Hashema, roessor Notes:. Answer all questons and assume
More informationThe Ideal Train Timetabling Problem
The Ideal Tran Tmetablng Problem Tomáš Robenek Janghang Chen Mchel Berlare Transport and Moblty Laboratory, EPFL May 2014 The Ideal Tran Tmetablng Problem May 2014 Transport and Moblty Laboratory, EPFL
More informationLinear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
More informationAssortment Optimization under MNL
Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.
More informationEn Route Traffic Optimization to Reduce Environmental Impact
En Route Traffc Optmzaton to Reduce Envronmental Impact John-Paul Clarke Assocate Professor of Aerospace Engneerng Drector of the Ar Transportaton Laboratory Georga Insttute of Technology Outlne 1. Introducton
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More informationCOS 521: Advanced Algorithms Game Theory and Linear Programming
COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton
More information2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification
E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton
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 informationGeneralized Linear Methods
Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set
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 information= z 20 z n. (k 20) + 4 z k = 4
Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5
More informationCOMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
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 informationFUZZY GOAL PROGRAMMING VS ORDINARY FUZZY PROGRAMMING APPROACH FOR MULTI OBJECTIVE PROGRAMMING PROBLEM
Internatonal Conference on Ceramcs, Bkaner, Inda Internatonal Journal of Modern Physcs: Conference Seres Vol. 22 (2013) 757 761 World Scentfc Publshng Company DOI: 10.1142/S2010194513010982 FUZZY GOAL
More information4 Analysis of Variance (ANOVA) 5 ANOVA. 5.1 Introduction. 5.2 Fixed Effects ANOVA
4 Analyss of Varance (ANOVA) 5 ANOVA 51 Introducton ANOVA ANOVA s a way to estmate and test the means of multple populatons We wll start wth one-way ANOVA If the populatons ncluded n the study are selected
More informationAnalysis of Queuing Delay in Multimedia Gateway Call Routing
Analyss of Queung Delay n Multmeda ateway Call Routng Qwe Huang UTtarcom Inc, 33 Wood Ave. outh Iseln, NJ 08830, U..A Errol Lloyd Computer Informaton cences Department, Unv. of Delaware, Newark, DE 976,
More informationChapter 13: Multiple Regression
Chapter 13: Multple Regresson 13.1 Developng the multple-regresson Model The general model can be descrbed as: It smplfes for two ndependent varables: The sample ft parameter b 0, b 1, and b are used to
More informationAn Interactive Optimisation Tool for Allocation Problems
An Interactve Optmsaton ool for Allocaton Problems Fredr Bonäs, Joam Westerlund and apo Westerlund Process Desgn Laboratory, Faculty of echnology, Åbo Aadem Unversty, uru 20500, Fnland hs paper presents
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 informationCIS526: Machine Learning Lecture 3 (Sept 16, 2003) Linear Regression. Preparation help: Xiaoying Huang. x 1 θ 1 output... θ M x M
CIS56: achne Learnng Lecture 3 (Sept 6, 003) Preparaton help: Xaoyng Huang Lnear Regresson Lnear regresson can be represented by a functonal form: f(; θ) = θ 0 0 +θ + + θ = θ = 0 ote: 0 s a dummy attrbute
More informationCopyright 2017 by Taylor Enterprises, Inc., All Rights Reserved. Adjusted Control Limits for U Charts. Dr. Wayne A. Taylor
Taylor Enterprses, Inc. Adjusted Control Lmts for U Charts Copyrght 207 by Taylor Enterprses, Inc., All Rghts Reserved. Adjusted Control Lmts for U Charts Dr. Wayne A. Taylor Abstract: U charts are used
More informationCredit Card Pricing and Impact of Adverse Selection
Credt Card Prcng and Impact of Adverse Selecton Bo Huang and Lyn C. Thomas Unversty of Southampton Contents Background Aucton model of credt card solctaton - Errors n probablty of beng Good - Errors n
More informationLINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity
LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 31 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 6. Rdge regresson The OLSE s the best lnear unbased
More informationA Robust Method for Calculating the Correlation Coefficient
A Robust Method for Calculatng the Correlaton Coeffcent E.B. Nven and C. V. Deutsch Relatonshps between prmary and secondary data are frequently quantfed usng the correlaton coeffcent; however, the tradtonal
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 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 informationChapter - 2. Distribution System Power Flow Analysis
Chapter - 2 Dstrbuton System Power Flow Analyss CHAPTER - 2 Radal Dstrbuton System Load Flow 2.1 Introducton Load flow s an mportant tool [66] for analyzng electrcal power system network performance. Load
More informationCSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography
CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve
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 informationLimited Dependent Variables
Lmted Dependent Varables. What f the left-hand sde varable s not a contnuous thng spread from mnus nfnty to plus nfnty? That s, gven a model = f (, β, ε, where a. s bounded below at zero, such as wages
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 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 informationSection 8.3 Polar Form of Complex Numbers
80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the
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 informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
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 informationCorrelation and Regression. Correlation 9.1. Correlation. Chapter 9
Chapter 9 Correlaton and Regresson 9. Correlaton Correlaton A correlaton s a relatonshp between two varables. The data can be represented b the ordered pars (, ) where s the ndependent (or eplanator) varable,
More informationPricing and Resource Allocation Game Theoretic Models
Prcng and Resource Allocaton Game Theoretc Models Zhy Huang Changbn Lu Q Zhang Computer and Informaton Scence December 8, 2009 Z. Huang, C. Lu, and Q. Zhang (CIS) Game Theoretc Models December 8, 2009
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 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 informationSee Book Chapter 11 2 nd Edition (Chapter 10 1 st Edition)
Count Data Models See Book Chapter 11 2 nd Edton (Chapter 10 1 st Edton) Count data consst of non-negatve nteger values Examples: number of drver route changes per week, the number of trp departure changes
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationPsychology 282 Lecture #24 Outline Regression Diagnostics: Outliers
Psychology 282 Lecture #24 Outlne Regresson Dagnostcs: Outlers In an earler lecture we studed the statstcal assumptons underlyng the regresson model, ncludng the followng ponts: Formal statement of assumptons.
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 informationBasically, if you have a dummy dependent variable you will be estimating a probability.
ECON 497: Lecture Notes 13 Page 1 of 1 Metropoltan State Unversty ECON 497: Research and Forecastng Lecture Notes 13 Dummy Dependent Varable Technques Studenmund Chapter 13 Bascally, f you have a dummy
More informationReal-Time Systems. Multiprocessor scheduling. Multiprocessor scheduling. Multiprocessor scheduling
Real-Tme Systems Multprocessor schedulng Specfcaton Implementaton Verfcaton Multprocessor schedulng -- -- Global schedulng How are tasks assgned to processors? Statc assgnment The processor(s) used for
More informationCS : Algorithms and Uncertainty Lecture 17 Date: October 26, 2016
CS 29-128: Algorthms and Uncertanty Lecture 17 Date: October 26, 2016 Instructor: Nkhl Bansal Scrbe: Mchael Denns 1 Introducton In ths lecture we wll be lookng nto the secretary problem, and an nterestng
More informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More informationSampling Theory MODULE VII LECTURE - 23 VARYING PROBABILITY SAMPLING
Samplng heory MODULE VII LECURE - 3 VARYIG PROBABILIY SAMPLIG DR. SHALABH DEPARME OF MAHEMAICS AD SAISICS IDIA ISIUE OF ECHOLOGY KAPUR he smple random samplng scheme provdes a random sample where every
More informationA LINEAR PROGRAM TO COMPARE MULTIPLE GROSS CREDIT LOSS FORECASTS. Dr. Derald E. Wentzien, Wesley College, (302) ,
A LINEAR PROGRAM TO COMPARE MULTIPLE GROSS CREDIT LOSS FORECASTS Dr. Derald E. Wentzen, Wesley College, (302) 736-2574, wentzde@wesley.edu ABSTRACT A lnear programmng model s developed and used to compare
More informationOn the Multicriteria Integer Network Flow Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of
More informationThe Second Anti-Mathima on Game Theory
The Second Ant-Mathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2-player 2-acton zero-sum games 2. 2-player
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 informationComparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method
Appled Mathematcal Scences, Vol. 7, 0, no. 47, 07-0 HIARI Ltd, www.m-hkar.com Comparson of the Populaton Varance Estmators of -Parameter Exponental Dstrbuton Based on Multple Crtera Decson Makng Method
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 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 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 informationAnalysis of Discrete Time Queues (Section 4.6)
Analyss of Dscrete Tme Queues (Secton 4.6) Copyrght 2002, Sanjay K. Bose Tme axs dvded nto slots slot slot boundares Arrvals can only occur at slot boundares Servce to a job can only start at a slot boundary
More information1 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations
Physcs 171/271 -Davd Klenfeld - Fall 2005 (revsed Wnter 2011) 1 Dervaton of Rate Equatons from Sngle-Cell Conductance (Hodgkn-Huxley-lke) Equatons We consder a network of many neurons, each of whch obeys
More information/ n ) are compared. The logic is: if the two
STAT C141, Sprng 2005 Lecture 13 Two sample tests One sample tests: examples of goodness of ft tests, where we are testng whether our data supports predctons. Two sample tests: called as tests of ndependence
More informationAssignment 5. Simulation for Logistics. Monti, N.E. Yunita, T.
Assgnment 5 Smulaton for Logstcs Mont, N.E. Yunta, T. November 26, 2007 1. Smulaton Desgn The frst objectve of ths assgnment s to derve a 90% two-sded Confdence Interval (CI) for the average watng tme
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 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 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 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 informationA 2D Bounded Linear Program (H,c) 2D Linear Programming
A 2D Bounded Lnear Program (H,c) h 3 v h 8 h 5 c h 4 h h 6 h 7 h 2 2D Lnear Programmng C s a polygonal regon, the ntersecton of n halfplanes. (H, c) s nfeasble, as C s empty. Feasble regon C s unbounded
More informationEconomics 101. Lecture 4 - Equilibrium and Efficiency
Economcs 0 Lecture 4 - Equlbrum and Effcency Intro As dscussed n the prevous lecture, we wll now move from an envronment where we looed at consumers mang decsons n solaton to analyzng economes full of
More informationExercises. 18 Algorithms
18 Algorthms Exercses 0.1. In each of the followng stuatons, ndcate whether f = O(g), or f = Ω(g), or both (n whch case f = Θ(g)). f(n) g(n) (a) n 100 n 200 (b) n 1/2 n 2/3 (c) 100n + log n n + (log n)
More informationHomework Assignment 3 Due in class, Thursday October 15
Homework Assgnment 3 Due n class, Thursday October 15 SDS 383C Statstcal Modelng I 1 Rdge regresson and Lasso 1. Get the Prostrate cancer data from http://statweb.stanford.edu/~tbs/elemstatlearn/ datasets/prostate.data.
More informationNP-Completeness : Proofs
NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem
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 informationMaximal Margin Classifier
CS81B/Stat41B: Advanced Topcs n Learnng & Decson Makng Mamal Margn Classfer Lecturer: Mchael Jordan Scrbes: Jana van Greunen Corrected verson - /1/004 1 References/Recommended Readng 1.1 Webstes www.kernel-machnes.org
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 informationParametric fractional imputation for missing data analysis. Jae Kwang Kim Survey Working Group Seminar March 29, 2010
Parametrc fractonal mputaton for mssng data analyss Jae Kwang Km Survey Workng Group Semnar March 29, 2010 1 Outlne Introducton Proposed method Fractonal mputaton Approxmaton Varance estmaton Multple mputaton
More informationHMMT February 2016 February 20, 2016
HMMT February 016 February 0, 016 Combnatorcs 1. For postve ntegers n, let S n be the set of ntegers x such that n dstnct lnes, no three concurrent, can dvde a plane nto x regons (for example, S = {3,
More informationLecture 6: Introduction to Linear Regression
Lecture 6: Introducton to Lnear Regresson An Manchakul amancha@jhsph.edu 24 Aprl 27 Lnear regresson: man dea Lnear regresson can be used to study an outcome as a lnear functon of a predctor Example: 6
More informationA Bayes Algorithm for the Multitask Pattern Recognition Problem Direct Approach
A Bayes Algorthm for the Multtask Pattern Recognton Problem Drect Approach Edward Puchala Wroclaw Unversty of Technology, Char of Systems and Computer etworks, Wybrzeze Wyspanskego 7, 50-370 Wroclaw, Poland
More informationAn (almost) unbiased estimator for the S-Gini index
An (almost unbased estmator for the S-Gn ndex Thomas Demuynck February 25, 2009 Abstract Ths note provdes an unbased estmator for the absolute S-Gn and an almost unbased estmator for the relatve S-Gn for
More informationStanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011
Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected
More informationOnline Appendix. t=1 (p t w)q t. Then the first order condition shows that
Artcle forthcomng to ; manuscrpt no (Please, provde the manuscrpt number!) 1 Onlne Appendx Appendx E: Proofs Proof of Proposton 1 Frst we derve the equlbrum when the manufacturer does not vertcally ntegrate
More informationSolving Nonlinear Differential Equations by a Neural Network Method
Solvng Nonlnear Dfferental Equatons by a Neural Network Method Luce P. Aarts and Peter Van der Veer Delft Unversty of Technology, Faculty of Cvlengneerng and Geoscences, Secton of Cvlengneerng Informatcs,
More information9 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations
Physcs 171/271 - Chapter 9R -Davd Klenfeld - Fall 2005 9 Dervaton of Rate Equatons from Sngle-Cell Conductance (Hodgkn-Huxley-lke) Equatons We consder a network of many neurons, each of whch obeys a set
More informationUncertainty in measurements of power and energy on power networks
Uncertanty n measurements of power and energy on power networks E. Manov, N. Kolev Department of Measurement and Instrumentaton, Techncal Unversty Sofa, bul. Klment Ohrdsk No8, bl., 000 Sofa, Bulgara Tel./fax:
More informationNotes prepared by Prof Mrs) M.J. Gholba Class M.Sc Part(I) Information Technology
Inverse transformatons Generaton of random observatons from gven dstrbutons Assume that random numbers,,, are readly avalable, where each tself s a random varable whch s unformly dstrbuted over the range(,).
More informationChapter 3 Describing Data Using Numerical Measures
Chapter 3 Student Lecture Notes 3-1 Chapter 3 Descrbng Data Usng Numercal Measures Fall 2006 Fundamentals of Busness Statstcs 1 Chapter Goals To establsh the usefulness of summary measures of data. The
More information