A Binary Particle Swarm Optimization Algorithm for Lot Sizing Problem
|
|
- Owen Richardson
- 8 years ago
- Views:
Transcription
1 Journal o Economc and Socal Research 5 (2), -2 A Bnary Partcle Swarm Optmzaton Algorthm or Lot Szng Problem M. Fath Taşgetren & Yun-Cha Lang Abstract. Ths paper presents a bnary partcle swarm optmzaton algorthm or the lot szng problem. The problem s to nd order quanttes whch wll mnmze the total orderng and holdng costs o orderng decsons. Test problems are constructed randomly, and solved optmally by Wagner and Whtn Algorthm. Then a bnary partcle swarm optmzaton algorthm and a tradtonal genetc algorthm are coded and used to solve the test problems n order to compare them wth those o optmal solutons by the Wagner and Whtn algorthm. Expermental results show that the bnary partcle swarm optmzaton algorthm s capable o ndng optmal results n almost all cases. Key Words: Partcle swarm optmzaton; Lot szng; Genetc algorthm; Evolutonary Algorthms. Jel Codes: C6, C6.. Introducton The lot-szng problem attracted attenton because o ts mpact on the nventory levels and, hence the nventory holdng cost and the setup/orderng cost. It s bascally concerned wth ndng order quanttes mnmzng the total cost o lot szng decsons. Lot quantty mght be ether an amount o purchase or producton dependng on the problem doman on hand n order to Management Department, Fath Unversty, 345 Buyucemece, Istanbul, Turey. Emal: tasgetren@ath.edu.tr Department o Industral Engneerng and Management, Yuan Ze Unversty No 35 Yuan-Tung Road, Chung-L, Taoyuan County, Tawan 32, R.O.C.
2 2 M. Fath Taşgetren & Yun-Cha Lang meet the net requrements o the customer demand. In lot szng problems, tme horzon s dened as gven tme bucets n whch quantty decsons are generally gven at the begnnng o each tme bucet. Lot szng decsons are made n such a way that all customer requrements are met at the end o the tme horzon. In general, lot quanttes are determned as the total requrement or a number o perods n whch the total cost s mnmzed. It balances the tradeo between the orderng and the holdng costs. In other words, t depends on the requrement n the current perod plus the requrements or the uture perods. So the order quantty s determned by groupng the net requrements or a number o perods ahead. There exst derent technques to determne the lot quanttes. Most popular one s the lot-or-lot where whatever needed s ordered. One other strategy s to order a xed order quantty, whch s common n ndustry, at each perod regardless o any varaton n the demand requrements. Another technque s to cover the net requrements or a number o uture perods, called xed perods. In addton, t s also possble to combne the derent strateges together. Several actors should be consdered when lot-szng decsons are gven. These actors are orderng cost, holdng cost, shortage cost, capacty constrants, mnmum order quantty, maxmum order quantty, quantty dscounts and so on. Combnaton o these actors results n derent models to analyze and derent soluton procedures are used dependng on the model employed. The model and ts soluton procedure can be made complcated by consderng these actors n the models, whch can be classed as capactated or uncapactated, sngle-level or mult-level, sngle-tem or mult-tem models. In ths paper, we consder the uncapactated, sngle-tem, no shortages-allowed and sngle-level lot szng model and solve t by a bnary partcle swarm optmzaton (PSO) algorthm. The rest o the paper s organzed as ollows: The next secton ormulates the problem, ollowed by a lterature revew. Then the bnary PSO algorthm appled to lot szng problem s gven along wth a tradtonal genetc algorthm, ollowed by some expermental results. Fnally, concluson and uture wor s presented.
3 A Bnary Partcle Swarm Optmzaton Algorthm or Lot Szng Problem 3 2. Problem Formulaton The mathematcal ormulaton o the lot szng model consdered n ths paper s gven as ollows: ( Ax ) n mn = ci + subject to : I = (2) I + x Q I = R I (4) Q (5) x {, } (6) () (3) Where n =number o perods A =orderng/setup cost per perod c =holdng cost per unt per perod R =net requrement or perod Q =Order quantty or perod I =projected nventory balance or perod x = an order s placed n perod, = otherwse. x In the objectve uncton (), a penalty A s charged or each order placed along wth a penalty c or each unt carred n nventory over the next perod. Equaton (2) guarantes that no ntal nventory s avalable. Equaton (3) s the nventory balance equaton n whch the order quantty covers all the requrements untl the next order. Equaton (4) satses the condton that no shortages are allowed. And nally, equaton (5) shows the decson varable to be ether (place an order) or (do not place an order). It x should be noted that ntal nventory s zero, I =, such that x = by equaton (3) R >. Because o the mnmzaton nature o the problem, Q
4 4 M. Fath Taşgetren & Yun-Cha Lang the endng nventory at each perod s mnmzed to avod the penalty charge c, partcularly I n =. 3. Lterature Revew Derent soluton procedures are avalable to determne the lot quanttes. The most popular one s the economc order quantty, EOQ (Mennell, 96). Theoretcally, EOQ mnmzes the orderng and holdng cost, but assumes that the requrements are constant or statonary rom perod to perod. For the case o dynamc requrements n whch the requrements are sgncantly varable over the perods, Slver and Meal (973) presented a heurstc, so called Slver-Meal heurstc. The heurstc tres to mnmze the orderng and holdng costs per unt o tme. Other heurstcs are common n most producton text boos such as Least Unt Cost, LUC and Part Perod Balancng, P. See Spper and Buln (997) or detals. Wagner and Whtn, WW (958) provded a dynamc programmng to solve the problem optmally. 4. Bnary PSO Algorthm For Lot Szng Problem Partcle Swarm Optmzaton (PSO) s one o the evolutonary optmzaton methods nspred by nature whch nclude evolutonary strategy (ES), evolutonary programmng (EP), genetc algorthm (GA), and genetc programmng (GP). PSO s dstnctly derent rom other evolutonary-type methods n that t does not use the lterng operaton (such as crossover and/or mutaton) and the members o the entre populaton are mantaned through the search procedure. In PSO algorthm, each member s called partcle, and each partcle les around n the mult-dmensonal search space wth a velocty, whch s constantly updated by the partcle s own experence and the experence o the partcle s neghbors. Snce PSO was rst ntroduced by Kennedy and Eberhart (995, 2), t has been successully appled to optmze varous contnuous nonlnear unctons. Although the applcatons o PSO on combnatoral optmzaton problems are stll lmted, PSO has ts mert n the smple concept and economc computatonal cost. The man dea behnd the development o PSO s the socal sharng o normaton among ndvduals o a populaton. In PSO algorthms, search s
5 A Bnary Partcle Swarm Optmzaton Algorthm or Lot Szng Problem 5 conducted by usng a populaton o partcles, correspondng to ndvduals as n the case o evolutonary algorthms. Unle GA, there s no operator o natural evoluton whch s used to generate new solutons or uture generaton. Instead, PSO s based on the exchange o normaton between ndvduals, so called partcles, o the populaton, so called swarm. Each partcle adjusts ts own poston towards ts prevous experence and towards the best prevous poston obtaned n the swarm. Memorzng ts best own poston establshes the partcle s experence mplyng a local search along wth global search emergng rom the neghborng experence or the experence o the whole swarm. Two varants o the PSO algorthm were developed, one wth a global neghborhood, and other one wth a local neghborhood. Accordng to the global neghborhood, each partcle moves towards ts best prevous poston and towards the best partcle n the whole swarm, called gbest model. On the other hand, accordng to the local varant, called lbest model, each partcle moves towards ts best prevous poston and towards the best partcle n ts restrcted neghborhood (Kennedy, 2). Kennedy and Eberhart (997) also developed the dscrete bnary verson o the PSO. PSO has been successully appled to a wde range o applcatons such as power and voltage control (Abdo, 22), mass-sprng system (Brandstatter & Baumgartner, 22), and tas assgnment (Salman et al., 23). The comprehensve survey o the PSO algorthms and applcatons can be ound n Kennedy et al. (2). In ths paper, we use the global varant wth bnary verson appled to the smple lot szng problem. A. PSO algorthm Pseudo code o the general PSO s gven n Fgure. In a PSO algorthm, populaton s ntated randomly wth partcles and evaluated to compute tnesses together wth ndng the partcle best (best value o each ndvdual so ar) and global best (best partcle n the whole swarm). Intally, each ndvdual wth ts dmensons and tness value s assgned to ts partcle best. The best ndvdual among partcle best populaton, wth ts dmenson and tness value s, on the other hand, assgned to the global best. Then a loop starts to converge to an optmum soluton. In the loop, partcle and global bests are determned to update the velocty rst. Then the current poston o each partcle s updated wth the current velocty. Evaluaton s agan perormed to compute the tness o the partcles n the swarm. Ths loop s termnated wth a stoppng crteron predetermned n advance.
6 6 M. Fath Taşgetren & Yun-Cha Lang Intalze parameters Intalze populaton Evaluate Do{ Fnd partclebest Fnd globalbest Update velocty Update poston Evaluate }Whle (Termnaton) Fgure. Smple PSO algorthm The basc elements o PSO algorthm s summarzed as ollows: Partcle: s a canddate soluton n swarm at teraton. The partcle o the swarm s represented by a d-dmensonal vector and can be dened as = x, x,..., x, where x s are the optmzed parameters and x d 2 d s the poston o the th partcle wth respect to d th dmenson. In other words, t s the value d th optmzed parameter n the th canddate soluton. Populaton: pop s the set o n partcles n the swarm at teraton,.e. pop =,,..., 2 n Partcle velocty: V s the velocty o partcle at teraton. It can be descrbed as = V v, where s the velocty wth respect to v, v,..., v 2 d d d th dmenson. Partcle best: s the best value o the partcle obtaned untl teraton. The best poston assocated wth the best tness value o the partcle obtaned so ar s called partcle best and dened as = pb pb pb wth the tness uncton,,..., 2 d Global best: GB s the best poston among all partcles n the swarm, whch s acheved so ar and can be expressed as GB = gb, gb,..., gb wth the tness uncton GB 2 th d
7 A Bnary Partcle Swarm Optmzaton Algorthm or Lot Szng Problem 7 Termnaton crteron: t s a condton that the search process wll be termnated. In ths study, search s termnated when the number o teraton reaches a predetermned value, called maxmum number o teraton. B. Soluton representaton Soluton representaton o partcle,, or the bnary PSO s gven n Fgure 2. Ths representaton s due to Hernandez and Suer (999). Each partcle has d dmensons reerrng to as the number o perods n the lot szng problem. The dmenson ndcates an order s placed or partcle n perod d at x d teraton. In other words, s a bnary value such that lot szng x x = d d decson s gven, x = otherwse. R denotes the net requrements or the d d perod d. v s the velocty o the partcle n perod d at teraton. Q s d the lot sze o the partcle n perod d at teraton and s the nventory balance o partcle n perod d at teraton. Then the calculaton o the cost o the orderng plan s trval as shown n Fgure 2 assumng the c=$ per unt per perod and A=$ per order. d R d x d v d d d d d Q I ci Ax I d ( ) C Fgure 2. Representaton o the Soluton d
8 8 M. Fath Taşgetren & Yun-Cha Lang C. Intal Populaton A populaton o partcles s constructed randomly or the bnary PSO algorthm or lot szng problem. The values o dmensons are establshed randomly. For each dmenson o a partcle, a bnary value o or s assgned wth a probablty o.5. In partcular, else U (,) x d >.5, = then x d = Velocty values are restrcted to some mnmum and maxmum values, namely = V, V = 4, where V = V. The velocty o partcle n the d [ ] [ 4 V mn max ] mn v d max th dmenson s establshed by V + ( V V )* rand () =. Ths lmt enhances the local search exploraton o the problem space. Populaton sze s twce the number o dmensons. As the ormulaton o the lot szng problem suggests, the objectve s to mnmze the total orderng and holdng costs, the tness uncton value or the partcle s gven as ollows: d = Ax j = j + ci j. mn max mn D. Fndng new solutons Snce the bnary verson o the PSO algorthm s employed n ths study, we need to use two useul unctons or generatng new solutons, namely a sgmod uncton to orce the real values between and, and a pece-wse lnear uncton to orce velocty values to be nsde the maxmum and mnmum allowable values. So whenever a velocty value s computed, the V,, s ollowng pece-wse uncton, whose range s closed nterval [ ] used to restrct them to mnmum and maxmum value. V max, h v = v, d d V, mn v > V d max v d Vmax v < V d mn mn V max Ater applyng the pece-wse lnear uncton, the ollowng sgmod uncton s used to scale the veloctes between and, whch s then used or convertng them to the bnary values. That s,
9 A Bnary Partcle Swarm Optmzaton Algorthm or Lot Szng Problem 9 sgmod v = d v + e d. So, new solutons are ound by updatng the velocty and dmenson respectvely. Frst, we compute the change n the velocty v d such that v = c r + pb x c r gb x d d d 2 2 d d Then we update the velocty v d such that v = h v + v. d d d by usng the pece-wse lnear uncton Fnally we update the dmenson d o the partcle such that x d, =, (,) U < sgmod v otherwse d. The complete computatonal low o the bnary PSO algorthm s gven below: Step : Intalzaton Set =, n=twce the number o dmensons Generate n partcles randomly as explaned beore, {,,2,..., n} =,,..., x x x 2 d. =, where Generate the ntal veloctes o all partcles randomly, { V,,2,..., n} =, where V = v, v,..., v. v s generated randomly wth v d = V + mn 2 d ( V V )* rand () max mn d Evaluate each partcle n the swarm usng the objectve uncton,. For each partcle n the swarm, set =, where = =, =,..., = pb x pb x pb x 2 2 d d = n,,2,..., along wth ts best tness value, gbest Set the global best to, GB = mn, =,2,..., n wth [ gb, gb gb ] GB =,..., 2 d
10 M. Fath Taşgetren & Yun-Cha Lang Step 2: Update teraton counter = + Step 3: Update velocty by usng the pece-wse lnear uncton v = c r pb x + c r gb x d d d 2 2 d v d = h v + v d d c and c 2 are socal and cogntve parameters and r and r 2 are unorm random numbers between (,) Step 4: Update dmenson (poston) by usng the sgmod uncton x d, =, (,) U < sgmod v d otherwse Step 5: Update partcle best Each partcle s evaluated agan wth respect to ts updated poston to see partcle best wll change. That s, I then else <, =,2,..., n =, =,2,..., n =, =,2,..., n Step 6: Update global best, =,2,..., n, =,2,..., n, =,2,..., n gbest gbest else GB = mn lbest =,,2,..., n < gbest GB GB, then gbest GB = GB = gbest GB GB gbest gbest Step 7: Stoppng crteron
11 A Bnary Partcle Swarm Optmzaton Algorthm or Lot Szng Problem I the number o teraton exceeds the maxmum number teraton, then stop, otherwse go to step Numercal Example In order to llustrate how the bnary PSO algorthm solves the lot szng problem, the ollowng problem wth d=5 perods, c=$, A=$ s constructed as well as the net requrements gven n Fgure 2. The complete computatonal low or llustraton purpose s gven below: Step : Intalzaton =, and n=3 The ntal partcles n the swarm generated randomly are,, and,, and correspondng veloctes V, V, and, V 2 3, whch are gven as ollows: d V 2 V 2 3 V 3 x d v d x 2 d v d x 3 d v d Detals o the computaton o the tness uncton or the partcles are gven n Fgure 2. Now consderng the rst 5 perods o Fgure 2, the tness values o the partcles n the swarm are: = 58, = 47, 2 2 = For each partcle n the swarm, set the partcle best to: = pb = p, pb = x,..., pb = x 2 2 d d wth = = 58
12 2 M. Fath Taşgetren & Yun-Cha Lang = pb = x, pb = x,..., pb = x d 2d 2 wth = = = pb = x, pb = x,..., pb = x, d 3d wth 44 3 = 3 3 =, so d 2 d 3 d Set the global best to: d ( ) pb 58 pb 2 47 pb 3 44 gbest GB = mn wth GB [ gb, gb,..., gb ] = = =. So 2 d d gbest (GB ) GB gb d 44 Step 2: Update the teraton number = + = Step 3: Update velocty by usng the pece-wse lnear uncton. Assume c = c = r = r =.5. As an example or partcle, second dmenson s updated as ollows: v 2 v 2 2 v 2 =.5 *.5 pb 2 =.5 *.5 2 ( ) +.5 *.5( ) ( ) +.5 *.5( ) ( + ) = h(.6 + (.25 )) =. 35 = h v 2 v 2 x 2 gb 2 =.25 x 2
13 A Bnary Partcle Swarm Optmzaton Algorthm or Lot Szng Problem 3 Step 4: Update poston by usng the sgmod uncton Snce U x 2 = (,) =.99 < sgmod ( =.35 ) v 2 =.79 Ater completng all the calculatons or velocty and dmensons we have the ollowng partcles updated n the rst teraton: d V d 2 2d V 2 2d 3 3d V 3 3d d x v sg v d u (,) x v sg v 2d u (,) x v sg v 3d u (,) Step 5: Update partcle best Each partcle updated s evaluated or rst ts new postons and then or ndng the partcle best as ollows: = 42, = 44, 2 2 = Snce = 42 < = = 58, = = 42 wth =.
14 4 M. Fath Taşgetren & Yun-Cha Lang Snce = 44 < = = 47, = = 44 wth 2 = Snce = 44 = = = 44, = = 44 wth = Note that neutral moves are allowed. Ater completng the smlar comparsons or the other partcles, we have 2 d 3 Step 6: Update global best 2 3 d ( ) pb d 42 pb 2 44 pb 3 d 44 gbest GB mn,, = = = gbest sn, gbest ce GB = 42 < GB = 44, then gbest gbest GB = GB = 42 wth GB = { gb, gb,..., gb } 2 d So, the global best s: Step7: Stoppng crteron else stop d gbest (GB ) GB gb d 42 < max teraton, goto step
15 A Bnary Partcle Swarm Optmzaton Algorthm or Lot Szng Problem 5 6. Expermental Results The bnary PSO algorthm presented or the uncapactated lot szng problem s coded n C and run on an Intel P4 2.6 GHz, 256 machne. The perormance o the bnary PSO s measured wth a tradtonal GA and the optmal Wagner and Whtn algorthm. For ths purpose, a tradtonal GA s coded n C and test problems are generated randomly or expermentaton. The GA s a tradtonal one wth a unorm crossover, smple nverson mutaton and a tournament selecton o sze 2. We used the ollowng parameters or the bnary PSO and the tradtonal GA. For the bnary PSO, the sze o the populaton n the swarm s taen as the twce the number o perods. Socal and cogntve parameters are taen as c = c2 = 2 consstent wth the lterature. For the GA, the populaton sze s the same as the bnary PSO. The crossover and the mutaton rates are.7 and. respectvely. Both GA and PSO algorthms are run or generatons/teratons. Frst test sut consstng o problem nstances wth net requrements or 5 perods s generated rom a unorm dstrbuton, UNIF(5,25), and the second test sut consstng o problem nstances wth net requrements or 5 perods s generated rom a unorm dstrbuton, UNIF(,25). The total 2 problem nstances are run or both GA and the bnary PSO wth holdng cost o c=$.5 and orderng cost o A=$ n order to compare the results wth those optmals by the Wagner-Whtn algorthm. For each problem nstance, replcatons are conducted. Mnmum, maxmum, average, and standard devaton are gven together wth the CPU tmes. As can be seen rom Table and 2, the bnary PSO produced comparable results wth GA, and t even produced better results. The GA was able to nd the 4 optmal solutons out o 2 whle the bnary PSO was able nd the 9 optmal solutons out o 2 even though the average standard devaton o the GA over 2 replcatons was slghtly better than the bnary PSO,.e., σ GA = 6.48, σ PSO = In terms o the computatonal tme, the GA too approxmately seconds or each nstance whle PSO too 6 seconds, whch s computatonally expensve than GA. But PSO s good perormance on ndng optmal solutons more than GA compensates ts computatonal necency.
16 6 M. Fath Taşgetren & Yun-Cha Lang 7. Conclusons and Future Wors We do realze that the problem presented here can be solved to optmalty by Wagner and Whtn (958) algorthm. Most research on the PSO concentrates on the contnuous optmzaton problems. The objectve o ths paper s to present the potental power o the bnary PSO to solve the bnary/dscrete optmzaton problems, whch has a varety o applcatons n the real world. Durng the past several years, the PSO has been successully appled to the contnuous optmzaton problems. To the best o our nowledge, ths s the rst reported applcaton o the bnary PSO appled to the lot szng problem. The results are encouragng to apply the bnary PSO to the combnatoral optmzaton problems ormulated as (, ) nteger programmng. In addton, we hope that ths wor leads to the applcaton o the PSO to the much more complex, NP-hard lot szng problems. The advantages o the PSO are very ew parameters to deal wth and the large number o processng elements, so called dmensons, whch enable to ly around the soluton space eectvely. On the other hand, t converges to a soluton very qucly whch should be careully dealth wth when usng t or combnatoral optmzaton problems. As a uture wor, the bnary PSO can be appled to the capactated, mult-tem, mult-level lot szng problems.
17 A Bnary Partcle Swarm Optmzaton Algorthm or Lot Szng Problem 7 Table. PSO Results WW PSO P Opt Best Max Avg Std P P P P P P P P P P P P P P P P P P P P
18 8 M. Fath Taşgetren & Yun-Cha Lang Table 2. GA Results WW GA P Opt Best Max Avg Std P P P P P P P P P P P P P P P P P P P P
19 A Bnary Partcle Swarm Optmzaton Algorthm or Lot Szng Problem 9 REFERENCES Abdo M. A., Optmal Power Flow Usng Partcle Swarm Optmzaton, Electrcal Power and Energy Systems, 24(22) Brandstatter B. and Baumgartner U., Partcle Swarm Optmzaton Mass- Sprng System Analogon, IEEE Transactons on Magnetcs, vol.38, pp.997-, 22. Spper and Buln, Producton Plannng, Control and Integraton, McGraw-Hll, 997. Hernandez W. and Suer G. A, Genetc Algorthms n Lot Szng Decsons, Proceedngs o the Congress on Evolutonary Computaton CEC99, pp , 999. Kennedy J.and Eberhard R. C., Partcle Swarm Optmzaton, Proc. o IEEE Int l Con. on Neural Networs, Pscataway, NJ, USA, pp , 995. Kennedy J. and Eberhart R. C., A Dscrete Bnary Verson o the Partcle Swarm Optmzaton, Proc. O the conerence on Systems, Man, and Cybernetcs SMC97, pp , 997. Kennedy J., Eberhart R. C. and Sh Y., Swarm Intellgence, Morgan Kaumann, San Mateo, 2, CA Mennell, R. F, Early Hstory o the Economcal Lot Sze, APICS Quarterly Bulletn, Vol.2, No.2, 96 Salman A., Ahmad I., and Al-Madan S., Partcle Swarm Optmzaton or Tas Assgnment Problem, Mcroprocessors and Mcrosystems, 26(22) Slver E. A and Meal H. C, A Heurstc or Selectng Lot Sze Requrements or the Case o A Determnstc Tme-Varyng Demand Rate and Dscrete Opportuntes or Replenshment, Producton and Inventory Management, Vol. 4, No. 2, 973
20 2 M. Fath Taşgetren & Yun-Cha Lang Wagner H. M and Whtn T. M, Dynamc Verson o the Economc Lot Sze Model, Management Scence, Vol. 5, 958
Power-of-Two Policies for Single- Warehouse Multi-Retailer Inventory Systems with Order Frequency Discounts
Power-of-wo Polces for Sngle- Warehouse Mult-Retaler Inventory Systems wth Order Frequency Dscounts José A. Ventura Pennsylvana State Unversty (USA) Yale. Herer echnon Israel Insttute of echnology (Israel)
More informationProject Networks With Mixed-Time Constraints
Project Networs Wth Mxed-Tme Constrants L Caccetta and B Wattananon Western Australan Centre of Excellence n Industral Optmsaton (WACEIO) Curtn Unversty of Technology GPO Box U1987 Perth Western Australa
More informationAn MILP model for planning of batch plants operating in a campaign-mode
An MILP model for plannng of batch plants operatng n a campagn-mode Yanna Fumero Insttuto de Desarrollo y Dseño CONICET UTN yfumero@santafe-concet.gov.ar Gabrela Corsano Insttuto de Desarrollo y Dseño
More informationNON-CONSTANT SUM RED-AND-BLACK GAMES WITH BET-DEPENDENT WIN PROBABILITY FUNCTION LAURA PONTIGGIA, University of the Sciences in Philadelphia
To appear n Journal o Appled Probablty June 2007 O-COSTAT SUM RED-AD-BLACK GAMES WITH BET-DEPEDET WI PROBABILITY FUCTIO LAURA POTIGGIA, Unversty o the Scences n Phladelpha Abstract In ths paper we nvestgate
More informationSCHEDULING OF CONSTRUCTION PROJECTS BY MEANS OF EVOLUTIONARY ALGORITHMS
SCHEDULING OF CONSTRUCTION PROJECTS BY MEANS OF EVOLUTIONARY ALGORITHMS Magdalena Rogalska 1, Wocech Bożeko 2,Zdzsław Heduck 3, 1 Lubln Unversty of Technology, 2- Lubln, Nadbystrzycka 4., Poland. E-mal:rogalska@akropols.pol.lubln.pl
More informationOn the Optimal Control of a Cascade of Hydro-Electric Power Stations
On the Optmal Control of a Cascade of Hydro-Electrc Power Statons M.C.M. Guedes a, A.F. Rbero a, G.V. Smrnov b and S. Vlela c a Department of Mathematcs, School of Scences, Unversty of Porto, Portugal;
More informationA DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATION-BASED OPTIMIZATION. Michael E. Kuhl Radhamés A. Tolentino-Peña
Proceedngs of the 2008 Wnter Smulaton Conference S. J. Mason, R. R. Hll, L. Mönch, O. Rose, T. Jefferson, J. W. Fowler eds. A DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATION-BASED OPTIMIZATION
More informationMooring Pattern Optimization using Genetic Algorithms
6th World Congresses of Structural and Multdscplnary Optmzaton Ro de Janero, 30 May - 03 June 005, Brazl Moorng Pattern Optmzaton usng Genetc Algorthms Alonso J. Juvnao Carbono, Ivan F. M. Menezes Luz
More informationAnts Can Schedule Software Projects
Ants Can Schedule Software Proects Broderck Crawford 1,2, Rcardo Soto 1,3, Frankln Johnson 4, and Erc Monfroy 5 1 Pontfca Unversdad Católca de Valparaíso, Chle FrstName.Name@ucv.cl 2 Unversdad Fns Terrae,
More informationbenefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).
REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or
More informationA hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm
Avalable onlne www.ocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(7):1884-1889 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 A hybrd global optmzaton algorthm based on parallel
More informationSOLVING CARDINALITY CONSTRAINED PORTFOLIO OPTIMIZATION PROBLEM BY BINARY PARTICLE SWARM OPTIMIZATION ALGORITHM
SOLVIG CARDIALITY COSTRAIED PORTFOLIO OPTIMIZATIO PROBLEM BY BIARY PARTICLE SWARM OPTIMIZATIO ALGORITHM Aleš Kresta Klíčová slova: optmalzace portfola, bnární algortmus rojení částc Key words: portfolo
More informationSimulation and optimization of supply chains: alternative or complementary approaches?
Smulaton and optmzaton of supply chans: alternatve or complementary approaches? Chrstan Almeder Margaretha Preusser Rchard F. Hartl Orgnally publshed n: OR Spectrum (2009) 31:95 119 DOI 10.1007/s00291-007-0118-z
More informationInformation Sciences
Informaton Scences 0 (013) 45 441 Contents lsts avalable at ScVerse ScenceDrect Informaton Scences journal homepage: www.elsever.com/locate/ns A hybrd method of fuzzy smulaton and genetc algorthm to optmze
More informationPreventive Maintenance and Replacement Scheduling: Models and Algorithms
Preventve Mantenance and Replacement Schedulng: Models and Algorthms By Kamran S. Moghaddam B.S. Unversty of Tehran 200 M.S. Tehran Polytechnc 2003 A Dssertaton Proposal Submtted to the Faculty of the
More informationSorting Online Reviews by Usefulness Based on the VIKOR Method
Assocaton or Inormaton Systems AIS Electronc Lbrary (AISeL) Eleventh Wuhan Internatonal Conerence on e- Busness Wuhan Internatonal Conerence on e-busness 5-26-2012 Sortng Onlne Revews by Useulness Based
More informationThe Development of Web Log Mining Based on Improve-K-Means Clustering Analysis
The Development of Web Log Mnng Based on Improve-K-Means Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.
More information2008/8. An integrated model for warehouse and inventory planning. Géraldine Strack and Yves Pochet
2008/8 An ntegrated model for warehouse and nventory plannng Géraldne Strack and Yves Pochet CORE Voe du Roman Pays 34 B-1348 Louvan-la-Neuve, Belgum. Tel (32 10) 47 43 04 Fax (32 10) 47 43 01 E-mal: corestat-lbrary@uclouvan.be
More informationA Binary Quantum-behaved Particle Swarm Optimization Algorithm with Cooperative Approach
IJCSI Internatonal Journal of Computer Scence Issues, Vol., Issue, No, January 3 ISSN (Prnt): 694-784 ISSN (Onlne): 694-84 www.ijcsi.org A Bnary Quantum-behave Partcle Swarm Optmzaton Algorthm wth Cooperatve
More informationMaintenance Scheduling by using the Bi-Criterion Algorithm of Preferential Anti-Pheromone
Leonardo ournal of Scences ISSN 583-0233 Issue 2, anuary-une 2008 p. 43-64 Mantenance Schedulng by usng the B-Crteron Algorthm of Preferental Ant-Pheromone Trantafyllos MYTAKIDIS and Arstds VLACHOS Department
More informationInstitute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic
Lagrange Multplers as Quanttatve Indcators n Economcs Ivan Mezník Insttute of Informatcs, Faculty of Busness and Management, Brno Unversty of TechnologCzech Republc Abstract The quanttatve role of Lagrange
More information行 政 院 國 家 科 學 委 員 會 補 助 專 題 研 究 計 畫 成 果 報 告 期 中 進 度 報 告
行 政 院 國 家 科 學 委 員 會 補 助 專 題 研 究 計 畫 成 果 報 告 期 中 進 度 報 告 畫 類 別 : 個 別 型 計 畫 半 導 體 產 業 大 型 廠 房 之 設 施 規 劃 計 畫 編 號 :NSC 96-2628-E-009-026-MY3 執 行 期 間 : 2007 年 8 月 1 日 至 2010 年 7 月 31 日 計 畫 主 持 人 : 巫 木 誠 共 同
More informationLuby s Alg. for Maximal Independent Sets using Pairwise Independence
Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent
More informationThe Greedy Method. Introduction. 0/1 Knapsack Problem
The Greedy Method Introducton We have completed data structures. We now are gong to look at algorthm desgn methods. Often we are lookng at optmzaton problems whose performance s exponental. For an optmzaton
More informationAnt Colony Optimization for Economic Generator Scheduling and Load Dispatch
Proceedngs of the th WSEAS Int. Conf. on EVOLUTIONARY COMPUTING, Lsbon, Portugal, June 1-18, 5 (pp17-175) Ant Colony Optmzaton for Economc Generator Schedulng and Load Dspatch K. S. Swarup Abstract Feasblty
More informationGlobal Optimization Algorithms with Application to Non-Life Insurance
Global Optmzaton Algorthms wth Applcaton to Non-Lfe Insurance Problems Ralf Kellner Workng Paper Char for Insurance Economcs Fredrch-Alexander-Unversty of Erlangen-Nürnberg Verson: June 202 GLOBAL OPTIMIZATION
More informationA New Task Scheduling Algorithm Based on Improved Genetic Algorithm
A New Task Schedulng Algorthm Based on Improved Genetc Algorthm n Cloud Computng Envronment Congcong Xong, Long Feng, Lxan Chen A New Task Schedulng Algorthm Based on Improved Genetc Algorthm n Cloud Computng
More informationIntelligent Method for Cloud Task Scheduling Based on Particle Swarm Optimization Algorithm
Unversty of Nzwa, Oman December 9-11, 2014 Page 39 THE INTERNATIONAL ARAB CONFERENCE ON INFORMATION TECHNOLOGY (ACIT2014) Intellgent Method for Cloud Task Schedulng Based on Partcle Swarm Optmzaton Algorthm
More informationModule 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..
More informationJ. Parallel Distrib. Comput.
J. Parallel Dstrb. Comput. 71 (2011) 62 76 Contents lsts avalable at ScenceDrect J. Parallel Dstrb. Comput. journal homepage: www.elsever.com/locate/jpdc Optmzng server placement n dstrbuted systems n
More informationDocument Clustering Analysis Based on Hybrid PSO+K-means Algorithm
Document Clusterng Analyss Based on Hybrd PSO+K-means Algorthm Xaohu Cu, Thomas E. Potok Appled Software Engneerng Research Group, Computatonal Scences and Engneerng Dvson, Oak Rdge Natonal Laboratory,
More informationOptimal Provisioning of Resource in a Cloud Service
ISSN (Onlne): 169-081 95 Optmal Provsonng of Resource n a Cloud Servce Yee Mng Chen 1 Shn-Yng Tsa Department of Industral Engneerng and Management Yuan Ze Unversty 135 Yuan-Tung Rd. Chung-L Tao-Yuan Tawan
More informationDynamic Constrained Economic/Emission Dispatch Scheduling Using Neural Network
Dynamc Constraned Economc/Emsson Dspatch Schedulng Usng Neural Network Fard BENHAMIDA 1, Rachd BELHACHEM 1 1 Department of Electrcal Engneerng, IRECOM Laboratory, Unversty of Djllal Labes, 220 00, Sd Bel
More informationA COPMARISON OF PARTICLE SWARM OPTIMIZATION AND THE GENETIC ALGORITHM
A COPMARISON OF PARTICLE SWARM OPTIMIZATION AND THE GENETIC ALGORITHM Rana Hassan * Babak Cohanm Olver de Weck Massachusetts Insttute of Technology, Cambrdge, MA, 39 Gerhard Venter Vanderplaats Research
More informationA Novel Methodology of Working Capital Management for Large. Public Constructions by Using Fuzzy S-curve Regression
Novel Methodology of Workng Captal Management for Large Publc Constructons by Usng Fuzzy S-curve Regresson Cheng-Wu Chen, Morrs H. L. Wang and Tng-Ya Hseh Department of Cvl Engneerng, Natonal Central Unversty,
More informationResearch Article Enhanced Two-Step Method via Relaxed Order of α-satisfactory Degrees for Fuzzy Multiobjective Optimization
Hndaw Publshng Corporaton Mathematcal Problems n Engneerng Artcle ID 867836 pages http://dxdoorg/055/204/867836 Research Artcle Enhanced Two-Step Method va Relaxed Order of α-satsfactory Degrees for Fuzzy
More informationThe Stochastic Guaranteed Service Model with Recourse for Multi-Echelon Warehouse Management
The Stochastc Guaranteed Servce Model wth Recourse for Mult-Echelon Warehouse Management Jörg Rambau, Konrad Schade 1 Lehrstuhl für Wrtschaftsmathematk Unverstät Bayreuth Bayreuth, Germany Abstract The
More informationPeriod and Deadline Selection for Schedulability in Real-Time Systems
Perod and Deadlne Selecton for Schedulablty n Real-Tme Systems Thdapat Chantem, Xaofeng Wang, M.D. Lemmon, and X. Sharon Hu Department of Computer Scence and Engneerng, Department of Electrcal Engneerng
More informationChapter 4 ECONOMIC DISPATCH AND UNIT COMMITMENT
Chapter 4 ECOOMIC DISATCH AD UIT COMMITMET ITRODUCTIO A power system has several power plants. Each power plant has several generatng unts. At any pont of tme, the total load n the system s met by the
More informationGENETIC ALGORITHM FOR PROJECT SCHEDULING AND RESOURCE ALLOCATION UNDER UNCERTAINTY
Int. J. Mech. Eng. & Rob. Res. 03 Fady Safwat et al., 03 Research Paper ISS 78 049 www.jmerr.com Vol., o. 3, July 03 03 IJMERR. All Rghts Reserved GEETIC ALGORITHM FOR PROJECT SCHEDULIG AD RESOURCE ALLOCATIO
More informationThe OC Curve of Attribute Acceptance Plans
The OC Curve of Attrbute Acceptance Plans The Operatng Characterstc (OC) curve descrbes the probablty of acceptng a lot as a functon of the lot s qualty. Fgure 1 shows a typcal OC Curve. 10 8 6 4 1 3 4
More informationFeature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College
Feature selecton for ntruson detecton Slobodan Petrovć NISlab, Gjøvk Unversty College Contents The feature selecton problem Intruson detecton Traffc features relevant for IDS The CFS measure The mrmr measure
More informationSciences Shenyang, Shenyang, China.
Advanced Materals Research Vols. 314-316 (2011) pp 1315-1320 (2011) Trans Tech Publcatons, Swtzerland do:10.4028/www.scentfc.net/amr.314-316.1315 Solvng the Two-Obectve Shop Schedulng Problem n MTO Manufacturng
More informationLITERATURE REVIEW: VARIOUS PRIORITY BASED TASK SCHEDULING ALGORITHMS IN CLOUD COMPUTING
LITERATURE REVIEW: VARIOUS PRIORITY BASED TASK SCHEDULING ALGORITHMS IN CLOUD COMPUTING 1 MS. POOJA.P.VASANI, 2 MR. NISHANT.S. SANGHANI 1 M.Tech. [Software Systems] Student, Patel College of Scence and
More informationActivity Scheduling for Cost-Time Investment Optimization in Project Management
PROJECT MANAGEMENT 4 th Internatonal Conference on Industral Engneerng and Industral Management XIV Congreso de Ingenería de Organzacón Donosta- San Sebastán, September 8 th -10 th 010 Actvty Schedulng
More informationSurvey on Virtual Machine Placement Techniques in Cloud Computing Environment
Survey on Vrtual Machne Placement Technques n Cloud Computng Envronment Rajeev Kumar Gupta and R. K. Paterya Department of Computer Scence & Engneerng, MANIT, Bhopal, Inda ABSTRACT In tradtonal data center
More informationVehicle Routing Problem with Time Windows for Reducing Fuel Consumption
3020 JOURNAL OF COMPUTERS, VOL. 7, NO. 12, DECEMBER 2012 Vehcle Routng Problem wth Tme Wndows for Reducng Fuel Consumpton Jn L School of Computer and Informaton Engneerng, Zhejang Gongshang Unversty, Hangzhou,
More informationFigure 1. Inventory Level vs. Time - EOQ Problem
IEOR 54 Sprng, 009 rof Leahman otes on Eonom Lot Shedulng and Eonom Rotaton Cyles he Eonom Order Quantty (EOQ) Consder an nventory tem n solaton wth demand rate, holdng ost h per unt per unt tme, and replenshment
More information"Research Note" APPLICATION OF CHARGE SIMULATION METHOD TO ELECTRIC FIELD CALCULATION IN THE POWER CABLES *
Iranan Journal of Scence & Technology, Transacton B, Engneerng, ol. 30, No. B6, 789-794 rnted n The Islamc Republc of Iran, 006 Shraz Unversty "Research Note" ALICATION OF CHARGE SIMULATION METHOD TO ELECTRIC
More informationInvestigation of Modified Bee Colony Algorithm with Particle and Chaos Theory
Internatonal Journal of Control and Automaton, pp. 311-3 http://dx.do.org/10.1457/jca.015.8..30 Investgaton of Modfed Bee Colony Algorthm wth Partcle and Chaos Theory Guo Cheng Shangluo College, Zhangye,
More informationFault tolerance in cloud technologies presented as a service
Internatonal Scentfc Conference Computer Scence 2015 Pavel Dzhunev, PhD student Fault tolerance n cloud technologes presented as a servce INTRODUCTION Improvements n technques for vrtualzaton and performance
More informationHeuristic Static Load-Balancing Algorithm Applied to CESM
Heurstc Statc Load-Balancng Algorthm Appled to CESM 1 Yur Alexeev, 1 Sher Mckelson, 1 Sven Leyffer, 1 Robert Jacob, 2 Anthony Crag 1 Argonne Natonal Laboratory, 9700 S. Cass Avenue, Argonne, IL 60439,
More informationRecurrence. 1 Definitions and main statements
Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.
More informationANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING
ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING Matthew J. Lberatore, Department of Management and Operatons, Vllanova Unversty, Vllanova, PA 19085, 610-519-4390,
More informationRobust Design of Public Storage Warehouses. Yeming (Yale) Gong EMLYON Business School
Robust Desgn of Publc Storage Warehouses Yemng (Yale) Gong EMLYON Busness School Rene de Koster Rotterdam school of management, Erasmus Unversty Abstract We apply robust optmzaton and revenue management
More informationLogical Development Of Vogel s Approximation Method (LD-VAM): An Approach To Find Basic Feasible Solution Of Transportation Problem
INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME, ISSUE, FEBRUARY ISSN 77-866 Logcal Development Of Vogel s Approxmaton Method (LD- An Approach To Fnd Basc Feasble Soluton Of Transportaton
More informationOptimization of network mesh topologies and link capacities for congestion relief
Optmzaton of networ mesh topologes and ln capactes for congeston relef D. de Vllers * J.M. Hattngh School of Computer-, Statstcal- and Mathematcal Scences Potchefstroom Unversty for CHE * E-mal: rwddv@pu.ac.za
More informationPatterns Antennas Arrays Synthesis Based on Adaptive Particle Swarm Optimization and Genetic Algorithms
IJCSI Internatonal Journal of Computer Scence Issues, Vol. 1, Issue 1, No 2, January 213 ISSN (Prnt): 1694-784 ISSN (Onlne): 1694-814 www.ijcsi.org 21 Patterns Antennas Arrays Synthess Based on Adaptve
More information1. Fundamentals of probability theory 2. Emergence of communication traffic 3. Stochastic & Markovian Processes (SP & MP)
6.3 / -- Communcaton Networks II (Görg) SS20 -- www.comnets.un-bremen.de Communcaton Networks II Contents. Fundamentals of probablty theory 2. Emergence of communcaton traffc 3. Stochastc & Markovan Processes
More informationOptimal Bidding Strategies for Generation Companies in a Day-Ahead Electricity Market with Risk Management Taken into Account
Amercan J. of Engneerng and Appled Scences (): 8-6, 009 ISSN 94-700 009 Scence Publcatons Optmal Bddng Strateges for Generaton Companes n a Day-Ahead Electrcty Market wth Rsk Management Taken nto Account
More informationSupport Vector Machines
Support Vector Machnes Max Wellng Department of Computer Scence Unversty of Toronto 10 Kng s College Road Toronto, M5S 3G5 Canada wellng@cs.toronto.edu Abstract Ths s a note to explan support vector machnes.
More informationA multi-start local search heuristic for ship scheduling a computational study
Computers & Operatons Research 34 (2007) 900 917 www.elsever.com/locate/cor A mult-start local search heurstc for shp schedulng a computatonal study Ger BrZnmo a,b,, Marelle Chrstansen b, Kjetl Fagerholt
More informationSUPPLIER FINANCING AND STOCK MANAGEMENT. A JOINT VIEW.
SUPPLIER FINANCING AND STOCK MANAGEMENT. A JOINT VIEW. Lucía Isabel García Cebrán Departamento de Economía y Dreccón de Empresas Unversdad de Zaragoza Gran Vía, 2 50.005 Zaragoza (Span) Phone: 976-76-10-00
More informationJoint Scheduling of Processing and Shuffle Phases in MapReduce Systems
Jont Schedulng of Processng and Shuffle Phases n MapReduce Systems Fangfe Chen, Mural Kodalam, T. V. Lakshman Department of Computer Scence and Engneerng, The Penn State Unversty Bell Laboratores, Alcatel-Lucent
More informationHybrid-Learning Methods for Stock Index Modeling
Hybrd-Learnng Methods for Stock Index Modelng 63 Chapter IV Hybrd-Learnng Methods for Stock Index Modelng Yuehu Chen, Jnan Unversty, Chna Ajth Abraham, Chung-Ang Unversty, Republc of Korea Abstract The
More informationSIMULATION OF INVENTORY CONTROL SYSTEM FOR SUPPLY CHAIN PRODUCER WHOLESALER CLIENT IN EXTENDSIM ENVIRONMENT
SIMULATION OF INVENTOY CONTOL SYSTEM FO SUPPLY CHAIN PODUCE WHOLESALE CLIENT IN EXTENDSIM ENVIONMENT Eugene Kopytov and Avars Muravjovs Transport and Telecommuncaton Insttute, Lomonosov Street, ga, LV-09,
More informationA Simple Approach to Clustering in Excel
A Smple Approach to Clusterng n Excel Aravnd H Center for Computatonal Engneerng and Networng Amrta Vshwa Vdyapeetham, Combatore, Inda C Rajgopal Center for Computatonal Engneerng and Networng Amrta Vshwa
More informationMethod for Production Planning and Inventory Control in Oil
Memors of the Faculty of Engneerng, Okayama Unversty, Vol.41, pp.20-30, January, 2007 Method for Producton Plannng and Inventory Control n Ol Refnery TakujImamura,MasamKonshandJunIma Dvson of Electronc
More informationEuropean Journal of Operational Research
European Journal of Operatonal Research 221 (2012) 317 327 Contents lsts avalable at ScVerse ScenceDrect European Journal of Operatonal Research journal homepage: www.elsever.com/locate/ejor Producton,
More informationAn ACO Algorithm for. the Graph Coloring Problem
Int. J. Contemp. Math. Scences, Vol. 3, 2008, no. 6, 293-304 An ACO Algorthm for the Graph Colorng Problem Ehsan Salar and Kourosh Eshgh Department of Industral Engneerng Sharf Unversty of Technology,
More informationForecasting the Demand of Emergency Supplies: Based on the CBR Theory and BP Neural Network
700 Proceedngs of the 8th Internatonal Conference on Innovaton & Management Forecastng the Demand of Emergency Supples: Based on the CBR Theory and BP Neural Network Fu Deqang, Lu Yun, L Changbng School
More informationSelfish Constraint Satisfaction Genetic Algorithm for Planning a Long-distance Transportation Network
JOURNAL OF COMPUTERS, VOL. 3, NO. 8, AUGUST 2008 77 Selfsh Constrant Satsfacton Genetc Algorthm for Plannng a Long-dstance Transportaton Network Takash Onoyama and Takuya Maekawa Htach Software Engneerng
More informationLogistic Regression. Lecture 4: More classifiers and classes. Logistic regression. Adaboost. Optimization. Multiple class classification
Lecture 4: More classfers and classes C4B Machne Learnng Hlary 20 A. Zsserman Logstc regresson Loss functons revsted Adaboost Loss functons revsted Optmzaton Multple class classfcaton Logstc Regresson
More informationUsing Multi-objective Metaheuristics to Solve the Software Project Scheduling Problem
Usng Mult-obectve Metaheurstcs to Solve the Software Proect Schedulng Problem Francsco Chcano Unversty of Málaga, Span chcano@lcc.uma.es Francsco Luna Unversty of Málaga, Span flv@lcc.uma.es Enrque Alba
More informationAn Evaluation of the Extended Logistic, Simple Logistic, and Gompertz Models for Forecasting Short Lifecycle Products and Services
An Evaluaton of the Extended Logstc, Smple Logstc, and Gompertz Models for Forecastng Short Lfecycle Products and Servces Charles V. Trappey a,1, Hsn-yng Wu b a Professor (Management Scence), Natonal Chao
More informationOmega 39 (2011) 313 322. Contents lists available at ScienceDirect. Omega. journal homepage: www.elsevier.com/locate/omega
Omega 39 (2011) 313 322 Contents lsts avalable at ScenceDrect Omega journal homepage: www.elsever.com/locate/omega Supply chan confguraton for dffuson of new products: An ntegrated optmzaton approach Mehd
More informationA Genetic Programming Based Stock Price Predictor together with Mean-Variance Based Sell/Buy Actions
Proceedngs of the World Congress on Engneerng 28 Vol II WCE 28, July 2-4, 28, London, U.K. A Genetc Programmng Based Stock Prce Predctor together wth Mean-Varance Based Sell/Buy Actons Ramn Rajaboun and
More informationFormulating & Solving Integer Problems Chapter 11 289
Formulatng & Solvng Integer Problems Chapter 11 289 The Optonal Stop TSP If we drop the requrement that every stop must be vsted, we then get the optonal stop TSP. Ths mght correspond to a ob sequencng
More informationMulti-Period Resource Allocation for Estimating Project Costs in Competitive Bidding
Department of Industral Engneerng and Management Techncall Report No. 2014-6 Mult-Perod Resource Allocaton for Estmatng Project Costs n Compettve dng Yuch Takano, Nobuak Ish, and Masaak Murak September,
More informationFaraday's Law of Induction
Introducton Faraday's Law o Inducton In ths lab, you wll study Faraday's Law o nducton usng a wand wth col whch swngs through a magnetc eld. You wll also examne converson o mechanc energy nto electrc energy
More informationAn Interest-Oriented Network Evolution Mechanism for Online Communities
An Interest-Orented Network Evoluton Mechansm for Onlne Communtes Cahong Sun and Xaopng Yang School of Informaton, Renmn Unversty of Chna, Bejng 100872, P.R. Chna {chsun,yang}@ruc.edu.cn Abstract. Onlne
More informationDEFINING %COMPLETE IN MICROSOFT PROJECT
CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMI-SP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,
More informationNPAR TESTS. One-Sample Chi-Square Test. Cell Specification. Observed Frequencies 1O i 6. Expected Frequencies 1EXP i 6
PAR TESTS If a WEIGHT varable s specfed, t s used to replcate a case as many tmes as ndcated by the weght value rounded to the nearest nteger. If the workspace requrements are exceeded and samplng has
More informationRetailers must constantly strive for excellence in operations; extremely narrow profit margins
Managng a Retaler s Shelf Space, Inventory, and Transportaton Gerard Cachon 300 SH/DH, The Wharton School, Unversty of Pennsylvana, Phladelpha, Pennsylvana 90 cachon@wharton.upenn.edu http://opm.wharton.upenn.edu/cachon/
More informationCredit Limit Optimization (CLO) for Credit Cards
Credt Lmt Optmzaton (CLO) for Credt Cards Vay S. Desa CSCC IX, Ednburgh September 8, 2005 Copyrght 2003, SAS Insttute Inc. All rghts reserved. SAS Propretary Agenda Background Tradtonal approaches to credt
More informationIn some supply chains, materials are ordered periodically according to local information. This paper investigates
MANUFACTURING & SRVIC OPRATIONS MANAGMNT Vol. 12, No. 3, Summer 2010, pp. 430 448 ssn 1523-4614 essn 1526-5498 10 1203 0430 nforms do 10.1287/msom.1090.0277 2010 INFORMS Improvng Supply Chan Performance:
More informationThe Retail Planning Problem Under Demand Uncertainty
Vol., No. 5, September October 013, pp. 100 113 ISSN 1059-1478 EISSN 1937-5956 13 05 100 DOI 10.1111/j.1937-5956.01.0144.x 013 Producton and Operatons Management Socety The Retal Plannng Problem Under
More informationAn efficient constraint handling methodology for multi-objective evolutionary algorithms
Rev. Fac. Ing. Unv. Antoqua N. 49. pp. 141-150. Septembre, 009 An effcent constrant handlng methodology for mult-objectve evolutonary algorthms Una metodología efcente para manejo de restrccones en algortmos
More informationOptimal Joint Replenishment, Delivery and Inventory Management Policies for Perishable Products
Optmal Jont Replenshment, Delvery and Inventory Management Polces for Pershable Products Leandro C. Coelho Glbert Laporte May 2013 CIRRELT-2013-32 Bureaux de Montréal : Bureaux de Québec : Unversté de
More informationStochastic Inventory Management for Tactical Process Planning under Uncertainties: MINLP Models and Algorithms
Stochastc Inventory Management for Tactcal Process Plannng under Uncertantes: MINLP Models and Algorthms Fengq You, Ignaco E. Grossmann Department of Chemcal Engneerng, Carnege Mellon Unversty Pttsburgh,
More informationNONLINEAR OPTIMIZATION FOR PROJECT SCHEDULING AND RESOURCE ALLOCATION UNDER UNCERTAINTY
NONLINEAR OPTIMIZATION FOR PROJECT SCHEDULING AND RESOURCE ALLOCATION UNDER UNCERTAINTY A Dssertaton Presented to the Faculty of the Graduate School of Cornell Unversty In Partal Fulfllment of the Requrements
More informationA SURVEY ON REACTIVE POWER OPTIMIZATION AND VOLTAGE STABILITY IN POWER SYSTEMS
Internatonal Journal on Techncal and Physcal Problems of Engneerng (IJTPE) Publshed by Internatonal Organzaton of IOTPE ISSN 077-358 IJTPE Journal www.otpe.com jtpe@otpe.com March 014 Issue 18 Volume 6
More informationBrigid Mullany, Ph.D University of North Carolina, Charlotte
Evaluaton And Comparson Of The Dfferent Standards Used To Defne The Postonal Accuracy And Repeatablty Of Numercally Controlled Machnng Center Axes Brgd Mullany, Ph.D Unversty of North Carolna, Charlotte
More informationDamage detection in composite laminates using coin-tap method
Damage detecton n composte lamnates usng con-tap method S.J. Km Korea Aerospace Research Insttute, 45 Eoeun-Dong, Youseong-Gu, 35-333 Daejeon, Republc of Korea yaeln@kar.re.kr 45 The con-tap test has the
More informationTesting and Debugging Resource Allocation for Fault Detection and Removal Process
Internatonal Journal of New Computer Archtectures and ther Applcatons (IJNCAA) 4(4): 93-00 The Socety of Dgtal Informaton and Wreless Communcatons, 04 (ISSN: 0-9085) Testng and Debuggng Resource Allocaton
More informationAPPLICATION OF COMPUTER PROGRAMMING IN OPTIMIZATION OF TECHNOLOGICAL OBJECTIVES OF COLD ROLLING
Journal Journal of Chemcal of Chemcal Technology and and Metallurgy, 50, 6, 50, 2015, 6, 2015 638-643 APPLICATION OF COMPUTER PROGRAMMING IN OPTIMIZATION OF TECHNOLOGICAL OBJECTIVES OF COLD ROLLING Abdrakhman
More informationA DATA MINING APPLICATION IN A STUDENT DATABASE
JOURNAL OF AERONAUTICS AND SPACE TECHNOLOGIES JULY 005 VOLUME NUMBER (53-57) A DATA MINING APPLICATION IN A STUDENT DATABASE Şenol Zafer ERDOĞAN Maltepe Ünversty Faculty of Engneerng Büyükbakkalköy-Istanbul
More informationAn Alternative Way to Measure Private Equity Performance
An Alternatve Way to Measure Prvate Equty Performance Peter Todd Parlux Investment Technology LLC Summary Internal Rate of Return (IRR) s probably the most common way to measure the performance of prvate
More informationRisk Model of Long-Term Production Scheduling in Open Pit Gold Mining
Rsk Model of Long-Term Producton Schedulng n Open Pt Gold Mnng R Halatchev 1 and P Lever 2 ABSTRACT Open pt gold mnng s an mportant sector of the Australan mnng ndustry. It uses large amounts of nvestments,
More informationA method for a robust optimization of joint product and supply chain design
DOI 10.1007/s10845-014-0908-5 A method for a robust optmzaton of jont product and supply chan desgn Bertrand Baud-Lavgne Samuel Bassetto Bruno Agard Receved: 10 September 2013 / Accepted: 21 March 2014
More information