Research Article Enhanced Two-Step Method via Relaxed Order of α-satisfactory Degrees for Fuzzy Multiobjective Optimization
|
|
- Avice Black
- 8 years ago
- Views:
Transcription
1 Hndaw Publshng Corporaton Mathematcal Problems n Engneerng Artcle ID pages Research Artcle Enhanced Two-Step Method va Relaxed Order of α-satsfactory Degrees for Fuzzy Multobjectve Optmzaton Na Wang 2 Chaofang Hu 3 Wux Sh 2 Chunbo Xu 2 and Yme Chen 2 School of Electrcal Engneerng and Automaton Tanjn Polytechnc Unversty Tanjn Chna 2 Key Laboratory of Advanced Electrcal Engneerng and Energy Technology Tanjn Polytechnc Unversty Tanjn Chna 3 School of Electrcal Engneerng and Automaton Tanjn Unversty Tanjn Chna Correspondence should be addressed to Chaofang Hu; cfhu@tjueducn Receved 6 September 203; Revsed 3 December 203; Accepted 4 January 204; Publshed 2 March 204 Academc Edtor: Km-Hua Tan Copyrght 204 Na Wang et al Ths s an open access artcle dstrbuted under the Creatve Commons Attrbuton Lcense whch permts unrestrcted use dstrbuton and reproducton n any medum provded the orgnal work s properly cted An enhanced two-step method va relaxed order of satsfactory degrees for fuzzy multobjectve optmzaton s proposed n ths paper By ntroducng the concept of fuzzy numbers and α-level set theory fuzzy parameters are taken as varables and all the objectves are transformed nto fuzzy goals nvolvng three fuzzy relatons The order of α-satsfactory degrees whch means the objectves wth hgher prorty achevng hgher satsfactory degree s appled to model preemptve prorty requrement Ths strct order constrant s relaxed by prorty varable to fnd the preferred soluton satsfyng optmzaton and prorty The orgnal optmzaton problem s dvded nto two steps to be solved teratvely The M-α-Pareto optmalty of the soluton s ensured and the satsfactorysoluton can be acqured by regulatng the slack parameterδδ or changng α The numercal examples demonstrate the power of the proposed method Introducton In recent years Multobjectve Optmzaton (MOO) problem has become more and more obvous and mportant n producton and economy where multple objectves are conflctng noncommensurable and mprecse Many researchers are nterested n ts study and development [ 4] In the real world MOO problem often takes place n uncertan envronment [5 6] In the early works research on randomness s devoted to uncertanty [7 8] However there s a qualtatvely dfferent type of mprecson whch cannot be equated wth probablty Therefore t may lead to a fuzzy understandng for Decson Maker (DM) to the optmzaton problem [9 0] For example the goals or parameters of the objectves and constrants are not known precsely n vagueenvronmentethertheperspectvegoalsaregven by mprecse DM s judgment or the parameters cannot be determned accurately Therefore fuzzy set theory s ntroduced to represent uncertanty[0 2] where the targets or parameters are modeled usng membershp functons Such a MOO problem s called Fuzzy Multobjectve Optmzaton (FMOO) problem [3 4] Its research ncludes dfferent types of FMOO and dfferent preferences [5] In MOO problem the fnal soluton s usually dependent upon DM s preference whch refers to the opnon of DM concernng ponts n crteron space Accordng to the way that DM artculates or ncorporates preference s categorzed nto pror posteror and progressve artculaton Wheren mportance s the commonly pror artculaton of preference In real lfe especally for FMOO problem mportance has become the most nterestng preference and has attracted many researchers [6 7] It represents the opnon of DM for dfferent objectves and s gven by DM n advance In order to get the preferred result analyzer needs to model the mportance preference mathematcally Generally weghted method s a tradtonal strategy about mportance where a scalarcrteronsformulatedbasedonp-norm ( p ) [8] As a specal case of mportance preemptve prorty requrement s used frequently n practce It means that all the objectves are classfed nto the dfferent levels accordng to DM s requrement and then they are optmzed step by
2 2 Mathematcal Problems n Engneerng step Beng the most conventonal strategy the lexcographc method requres that multple subproblems consstng of dfferent objectves are solved n lexcographc order [9 20] However ths may lead to heavy computaton burden Even degeneratve optmzaton may happen when some objectves wth hgher prorty have obtaned the optmum result but the remaned ones are not optmzed snce the soluton keeps dentcal Thus Chen and Tsa [2] proposetheprncple that the objectves wth hgher prorty should have hgher satsfactory degree to model the preemptve prorty by means of fuzzy theory Although the multstep optmzaton procedure s avoded the satsfactory even feasble soluton may not exst because the prorty order constrants are too strct In order to guarantee the feasblty of optmzaton Aköz and Petrovc [22] use fuzzy bnary relatons to represent mprecse prorty; however they only consder the nequalty fuzzy relatons In addton Hu and L [23]present enhanced nteractve satsfyng optmzaton method va goal programmng and L et al [24] also desgn generalzed varyng-doman optmzaton approach Nevertheless the nonlnearty of the orgnal problem s strengthened and the more optmzaton varables are ntroduced n ther methods Ths ncreases computaton burden Therefore L and Hu [25] propose a two-step satsfactory method for FMOO to acqure the satsfactory soluton Usually FMOO problem ncludes two cases: MOO wth fuzzy goals and MOO wth fuzzy parameters Although the orgnal research s resulted from fuzzy goals [0] actually more and more FMOO problems are manly orented from fuzzy parameters Fuzzy parameters of the constrants wll nfluence the feasble feld and fuzzy parameters of the objectves wll decde the optmzaton result So they produce more complcated optmzaton problem than MOOwthfuzzygoalsThsrequresDMtopartcpaten the optmzaton procedure to provde more nformaton whch brngs about more dffculty to obtan the preferred soluton Therefore more researchers focus on progressve artculaton of preference n MOO wth fuzzy parameters such that dfferent nteractve methods [4 26] are studed Nevertheless fndng the preferred soluton becomes more dffcult when prorty preference s requred The above early works [9 25] about prorty only adapt to MOO wth fuzzy goals and they are not appled drectly to fuzzy parameters For example n [25] we have proposed the two-step satsfactory method to handle preemptve prorty requrement usng relaxed prorty constrants But t only consders the case that the goals are vague The uncertan objectve functons and constrants (e feasble feld) that resulted from fuzzy parameters are not nvolved Ths leads to that the prevous method cannot be used to solve the MOO model wth fuzzy parameters Moreover the optmalty of soluton s not guaranteed for the approach n [25] where there may exst the weak M-Pareto optmal soluton Ths probably leads to the unreasonable optmzaton result In ths paper the MOO problem wth fuzzy parameters and preemptve prorty s concerned where fuzzy parameters have possblstc dstrbutons The two-step satsfactory method n [25] s ntroduced and enhanced Fuzzy parameters are treated as fuzzy numbers Usng the concept of αlevel set fuzzy parameters are defned as varables and all the objectves are regarded as fuzzy goals ncludng three types of fuzzy relatons Then the FMOO problem usng α-level sets s formulated nto an α-fmoo problem For preemptve prorty requrement the relaxed order of αsatsfactory degrees denotng that the objectve wth hgher prorty acheves the hgher α-satsfactory degree s appled Moreover the orgnal FMOO problem s reformulated nto two models that s the prelmnary optmzaton model and theprortymodelthetwomodelsaresolvedteratvely The soluton of the frst model that s α-maxmum overall satsfactory degree s obtaned and then t s decreased n the second model for balance between optmzaton and prorty In addton the value of α also nfluences the fnal result and helps to fnd the optmum value Thus the satsfactory soluton can be acqured by relaxng α-maxmum overall satsfactory degree or changng α where the M-α-Pareto optmaltyofthesolutonsensuredbymeansoftestmodel Wth our method DM can easly get the preferred result In ths paper Secton 2 descrbes MOO problem wth fuzzy parameters and preemptve prorty requrement The enhanced two-step method va relaxed order of α-satsfactory degrees s proposed n Secton 3 Secton 4 demonstrates ts powerbythenumercalexamplesinsecton 5 the concluson s drawn 2 α-fmoo wth Preemptve Prorty 2 MOO wth Fuzzy Parameters In practce the possble values about the parameters of the objectves or constrants are often consdered to be mprecse snce they often nvolve the ambguty of DM s understandng of the real system These parameters are called fuzzy parameters Then the MOO problem wth fuzzy parameters s descrbed n the followng [4 27]: mn (f (x ã )f k (x ã k )) st x G( b) =x g j (x b j ) 0j=m} where f (x) ( = k) are multple objectve functons to be mnmzed and G R n s system constrants ã = ( a a 2 a r ) and b j = ( b j b j2 b jsj ) denote fuzzy parameter vectors Usually they are characterzed as the fuzzy numbers [4 27] It s reasonable to treat a real fuzzy number as a convex contnuous fuzzy subset There are usually varous knds of membershp functons for fuzzy numbers All of them are contnuously mappng monotonously ncreasng or decreasng For example fuzzy number c s shown n Fgure ()
3 Mathematcal Problems n Engneerng 3 Its membershp functon s wrtten as c 2 c c c 2 c c c 2 c μ c (c) = 2 c c 3 c c 3 c c 4 c 3 c c otherwse Then α-level set of fuzzy parameter (ã b) s defned as (ã b) α = (a b) μ ad (a d (b ) αμ bje je ) α =2k;d=2r j=2m;e=2s j where a =(a a 2 a k ) and b =(b b 2 b m ) are taken asthedecsonvarablesaboutα Snce fuzzy parameters wll brng about or ncrease the mprecsenatureofdm sjudgmentaboutthegoalsofthe objectves they wll result n the fuzzy goals under an αlevel set Therefore DM can gve ther mplct targets to the objectves The fuzzy decson s presented as [ ] fnd (x a) such that st f (x a ) f =k x G(b) =x g j (x b j ) 0j=m} (a b) (ã b) α where f s the perspectve goal value for the fuzzy objectve functon f (x ã ) and denotes three types of fuzzy relatons that s (fuzzy mnmzaton) (fuzzy maxmzaton) and = (fuzzy equal) Correspondngly they mean that the th fuzzy objectve s approxmately less than or equal to f approxmately more than or equal to f and n the vcnty of f In ths paper the conventonal lnear trangle-lke membershp functons are adopted to defne fuzzy goals of the objectve functons wth dfferent fuzzy relatons For (a b) (ã b) α the membershp functon under α-level set s called α-membershp functon and ts value s called also αsatsfactory degree of the fuzzy objectve For fuzzy mnmzaton the tolerant nterval for the fuzzy objectve f (x ã ) s regarded as (f f max ) f max s the tolerant lmt Then the α-membershp functon μ f (x a ) s defned as μ f (x a ) f (x a ) f = f (x a ) f f max f f f (x a ) f max 0 f (x a ) f max It s shown n Fgure 2 (2) (3) (4) (5) For fuzzy maxmzaton the tolerant nterval s (f mn f ) Equaton (6) s ts α-membershp functon Fgure 3 llustrates the graph of ths fuzzy relaton: μ f (x a ) f (x a ) f = f f (x a ) f f mn f mn f (x a ) f 0 f (x a ) f mn For = (f mn f max ) s the tolerant nterval (see Fgure 4) The α-membershp functon s μ f (x a ) 0 f (x a ) f max f (x a ) f f max f f = f (x a )=f f (x a ) f f f (x a ) f max f mn f mn 0 f (x a ) f mn f (x a ) f Introducng the α-membershp functons of fuzzy goals nto (4) FMOO problem s reformulated nto the followng α-fmoo problem: max (x a ) (x a 2 )μ fk (x a k ) st x G(b) =x g j (x b j ) 0j=m} (a b) (ã b) α For general MOO or MOO under α-level set there s usually Pareto or α-pareto optmalty of the soluton [4 28] Correspondngly the defnton of M-α-Pareto optmalty for α-fmoo problem (8)sgven Defnton (M-α-Pareto optmal soluton see [27]) A pont x G(b )where(a b ) (ã b) α sm-α-pareto optmal soluton f and only f there does not ext another soluton x G(b) and (a b) (ã b) α suchthatμ f (x a ) μ f (x a ) for all ( = k)and μ fh (x a )>μ fh (x a ) foratleast one h h k} Smlarly we can defne the concept of Weak M-α-Pareto optmal soluton Defnton 2 (weak M-α-Pareto optmal soluton) A pont x G(b )where(a b ) (ã b) α sweakm-α-pareto optmal soluton f and only f there does not ext another soluton x G(b) and (a b) (ã b) α suchthatμ f (x a )> μ f (x a ) for all (=k) 22 Preemptve Prorty In real MOO problem preemptve prorty requrement s generally descrbed usng lngustc form For example suppose the prorty of the objectve f s (x ã s ) s hgher than that of f s (x ã s ) (s s (6) (7) (8)
4 4 Mathematcal Problems n Engneerng μ c (c) μ f (x a ) c =(c c 2 c 3 c 4 ) α c c 2 c 3 c 4 f (x a ) Fgure : Fuzzy number c f mn f μ f (x a ) Fgure 3: α-membershp functon μ f (x a ) for fuzzy relaton μ f (x a ) f f max f (x a ) f (x a ) Fgure 2: α-membershp functon μ f (x a ) for fuzzy relaton f mn f f max k}s = s )Thatsf s (x ã s ) should be optmzed before f s (x ã s ) Thuswecanseethatpreemptveprortyhas strcter requrement than common mportance It usually requres that all the objectves must be optmzed n sequence accordng to ther mportance Ths means that the objectves wth the hghest prorty must be satsfed frstly and then the other objectves havng the lower prorty are consdered based on the obtaned results Therefore all the objectves need to be grouped accordng to ther prorty where there wll be dfferent levels ncludng one or several objectves Consequently the α-fmoo problem wth preemptve prorty can be formulated as follows [25]: max [P (μ f (x a )μ f l (x a l )) st P L (μ f L (x a L )μ f L l L (x a L l L ))] x G(b) =x g j (x b j ) 0j=m} (a b) (ã b) α where P ( = L) s the prorty factor and P >> P + ThsmeanstheobjectvesbelongngtoP have hgher prorty than those of P + f (x ã )f l (x ã l ) represent the objectves belongng to th prortylevel (9) Fgure 4: α-membershp functon μ f (x a ) for fuzzy relaton = 3 Enhanced Two-Step Method va Relaxed Order of α-satsfactory Degrees 3 Relaxed Order of α-satsfactory Degrees For (9) the tradtonal strategy s lexcographc optmzaton [20]whose multstep optmzaton procedure may result n complex computaton even degeneratve optmzaton Accordng to Chen and Tsa [2] the objectve wth hgher prorty should have hgher satsfactory degree by whch prorty can be presented as the order of satsfactory degrees It can convert the multstep optmzaton nto a sngle formulaton Ths strategy not only adapts to general FMOO but also can be used to α-fmoo For the example about prorty n Secton 22 f s (x ã s ) has the hgher prorty than f s (x ã s ) we can get that the former has the hgher α-satsfactory degree than the latter Then the preemptve prorty requrement s modeled nto the followng order of α-satsfactory degrees: μ fs (x a s ) μ f s (x a s ) ss k} s =s (a b) (ã b) α (0)
5 Mathematcal Problems n Engneerng 5 However the order (0) s too strct If t s taken as the constrant the satsfactory even feasble soluton maybe cannot be obtaned In addton the prorty dfference between the objectves cannot be quantfed from (0) Ths means that the prorty requrement may not be reflected accurately when the α-satsfactory degrees are the same Thus the new prorty formulaton n [25] μ fs (x) μ f s (x) γ s adopted where the prorty varable γ ( γ ) s ntroduced to relax strct comparson between the satsfactory degrees For MOO wth fuzzy parameters ths formulaton s mproved to relax the order of α-satsfactory degrees Then the enhanced preemptve prorty s reformulated as follows: μ fs (x a s ) μ f s (x a s ) γ ss k} s =s (a b) (ã b) α () When γ 0 () denotes that the relaxed order of α-satsfactory degrees conforms to the basc preemptve prorty order It s noted that γ=0s a specal case where prorty of all the objectves wll be the same On the contrary the prorty requrement wll be volated f γ > 0By() prorty dfference can be quantfed 32 Enhanced Two-Step Method 32 The Frst Step In MOO problem optmzaton and prorty requrements need to be balanced Therefore the two-step satsfactory method [25] sntroducedhowever fuzzy parameters and three types of fuzzy relatons are consdered n ths paper Ths s sgnfcantly dfferent from [25] whch only focuses on fuzzy goals wth the relaton of fuzzy mnmzaton Therefore the orgnal two-step method needs a great mprovement In ths paper by means of α-level set of fuzzy parameters (3) and the relaxed order of α-satsfactory degrees () α-fmoo problem wth preemptve prorty (9) s dvded nto two models whch consst of the prelmnary optmzaton model and the prorty model They wll be solved teratvely The purpose of the prelmnary optmzaton model s to optmze all the objectves smultaneously as much as possble regardless of prorty Thus the frst step s to construct and solve the prelmnary optmzaton model Based on max-mn decson the prelmnary optmzaton model s presented n the followng: max λ st μ f (x a ) λ =k μ f (x a ) x G(b) =x g j (x b j ) 0j=m} (a b) (ã b) α (2) where λ s called α-overall satsfactory degree It s equal to the mnmum α-satsfactory degree of all the objectves when preference s not consdered Accordng to max-mn decson the optmal soluton of (2) λ s the maxmum value of α-overall satsfactory degree whch denotes that all the objectves are optmzed fully Therefore t s called α-maxmum overall satsfactory degree and t wll be treated as the gven condton of the next step optmzaton 322 The Second Step On bass of the frst step we have to consder preemptve prorty requrement Consequently the prorty model s constructed to balance optmzaton and the prorty order n the second step After solvng (2) the feasble feld of orgnal α-fmoo has become very small In order to acqure more potental solutons satsfyng prorty requrement t s necessary to enlarge the decreased feasble feld by the followng equatons: μ f (x a ) λ Δδ =k (3) where Δδ (Δδ 0) s slack parameter by whch the αmaxmum overall satsfactory degree λ canbedecreased Ths means that there wll be more solutons f the constrant (3) s relaxed Then DM can choose the most satsfactory soluton from the new feld For realzng preemptve prorty requrement the relaxed order of α-satsfactory degrees () stakenasanew constrant Combnng the orgnal system constrants of (4) the prorty model s constructed as follows: mn γ st μ f (x a ) λ Δδ =k μ fs (x a s ) μ f s (x a s ) γ s s k} s=s γ x G(b) =x g j (x b j ) 0j=m} (a b) (ã b) α (4) In (4) the prorty varable γ s mnmzed to enlarge prorty dfference Durng solvng the slack parameter Δδ s regulated n order to acqure the satsfactory soluton of α-fmoo In addton to Δδ the feasble feld can also be ncreased by decreasng α These ways provde more regulatng freedoms than the orgnal two-step approach n [25] Therefore the preferred soluton can be found by regulatng Δδ or changng α If γ >0 the soluton does not conform to prorty λ needs to be decreased through ncreasng Δδ tll γ 0and DM s satsfed where Δδ s determned by the nteracton between DM and the analyzer If the result stll remans unsatsfactory after regulatng Δδwecandecreaseα 323 Maxmum Stable Relaxaton From (3) we know that the feasblty s enlarged contnually by ncreasng Δδ such that the smaller γ canbeobtanedwhenδδ s ncreased to equal Δδ (3) wll become nactve constrant Ths means γ wll reman dentcal That s prorty dfference wll not
6 6 Mathematcal Problems n Engneerng change when Δδ > Δδ ThusΔδ s called maxmum stable relaxaton μ f = μ f μ f k } sthevectorofalltheαsatsfactory degrees about the optmal soluton Δδ can be acqured by the followng algorthm Step Let Δδ = λ and assgn a value to α andthensolve model (4)toobtantheoptmalsolutonx μ f and γ Step 2 Compare the elements of μ f fnd the mnmum one as μ f m andletδδ =λ μ f m Δδ s taken as a pror knowledge by whch the case of arbtrary enlargng of the feasble feld can be avoded 33 M-α-Pareto Optmalty Test From Secton 32weknow that the prelmnary optmzaton model of the frst step s max-mn decson on -norm and the α-maxmum overall satsfactory degree n the prorty model of the second step s relaxed It cannot be guaranteed that each objectve under preemptve prorty requrement s optmzed as much as possble fnally although the optmal soluton satsfes the prorty order Accordng to Defnton the expected satsfactory soluton must be M-α-Pareto optmal Thus the followng M-α-Pareto optmalty test model s proposed By means of the model the M-α-Pareto optmalty of the solutoncanbeensured: max k ε st μ f (x a ) ε =μ f (x a ) =k If at least one ε h s not zero then x must be the M-α- Pareto optmal soluton Or else there wll exst an M-α- Pareto optmal soluton xand t must be the optmalsoluton of (5) Ths s contrary to the fact that x s the optmal soluton Therefore x must be M-α-Pareto optmal 34 Algorthm The specfc algorthm of enhanced two-step method s summarzed as follows Step (ntalzaton) Formulate the α-level set of fuzzy parameters and calculate the ndvdual f mn and f max of the objectve functon f (x ã ) (=k)under the gven constrants respectvely when α=0and α= Step 2 Determne the desrable targets and the tolerances construct the α-membershp functons of all the objectves andaskdmtoselectthentalvalueofα Step 3 Solve the prelmnary optmzaton model (2)ofthe frst step and get the α-maxmum overall satsfactory degree λ Step 4 Formulate and solve the prorty model (4) ofthe second step accordng to preemptve prorty requrement and test M-Pareto optmalty of the soluton by (5) Step 5 Judge: f γ > 0 go to next step If γ 0butthe soluton s not satsfactory also go to Step 6 Otherwsestop optmzaton and the satsfactory soluton s acqured Step 6 Relax λ by ncreasng Δδ f Δδ Δδ andgoback to Step 4Ordecreaseα and go back to Step 3 μ fs (x a s ) μ f s (x a s ) γ s s k} s=s (5) 35 Analyss of Feasblty By the followng Theorem t s proven that there must be the feasble soluton n our approach x G(b) =x g j (x b j ) 0j=m} (a b) (ã b) α ε 0 where ε ( = k) are the error varables and (x γ ) s the optmzaton soluton of (4) Let x be the optmal soluton of (5) The theorem about M-α-Pareto optmalty test s gven Theorem 3 If ε (=k)are zero then x s M-α-Pareto optmal Otherwse f at least one ε h h k}s not zero x s the M-α-Pareto optmal soluton Proof If x s not M-α-Pareto optmal when all ε are zero then the optmal soluton x must be M-α-Pareto optmal Because μ f (x a ) μ f (x a ) ( = k)must hold and μ fh (x a )>μ fh (x a ) for at least one h h k}ths means there must be one nonzero ε h at least whch s contrary to the fact that all ε are zero So x s M-α-Pareto optmal f ε (=k)are all zero Theorem 4 Forenhancedtwo-stepmethodconsstngofthe prelmnary optmzaton model (2) and the prorty model (4) there must exst an optmal soluton when G( b) s nonempty Proof Frstly the prelmnary optmzaton model (2) of the frst step must be feasble because G( b) s nonempty Secondly for the prorty model (4) of the second step the relaxed order of α-satsfactory degrees () can be rewrtten as (μ fs (x a s ) μ f s (x a s ) γ) = Z where Z s the number of the prorty constrants ncludng actve constrants and nactve constrants Then we have γ=max [(μ (x a fs s ) μ f s (x a s )) ] (6) Thus (4)canbereformulatedas mn max [(μ (x a fs s ) μ f s (x a s )) ] st μ f (x a ) λ Δδ =k max [(μ (x a fs s ) μ f s (x a s )) ]
7 Mathematcal Problems n Engneerng 7 Table : Fuzzy parameters n Example c (c c 2 c 3 c 4 ) a ( 2 0) a 2 (2334) a 2 ( 0 0 ) x G(b) =x g j (x b j ) 0j=m} (a b) (ã b) α (7) Therefore the prorty model (4)sequvalentto(7) Snce λ satsfes the constrants of the prelmnary optmzaton model (2) (3) must hold Thus there must be optmal soluton for (7) That s the optmal result also exsts n the model (4) Then both of the frst step and the second step arefeasblesotheoptmalsolutoncanbeobtanedbythe enhanced two-step method when G( b) s nonempty 4 Numercal Examples We demonstrate the effectveness of the proposed optmzaton method by the followng numercal examples Example (see [25]) The example n [25] s consdered where some parameters of the objectves are mprecse: mn f (x ã )= a x +3x 2 + a 2 x 3 mn f 2 (x ã 2 )=(x ) 2 +2(x 2 3) 2 + a 2 (x 3 2) 2 st x +x 2 +x x x 2 x 3 0 (8) ã =(ã ã 2 ) s fuzzy parameter vector where ã =( a a 2 ) and ã 2 =( a 2 ) Ther dstrbutons are gven n Table Preemptve prorty requrement s as follows: ( 20 40) and ( 4503)respectvelyThecorrespondngαmembershp functons are presented n the followng (x a )= (40 a x 3x 2 a 2 x 3 ) 60 (x a 2 )= (03 (x ) 2 2(x 2 3) 2 a 3 (x 3 2) 2 ) 48 (9) (B) The prelmnary model of the frst step s wrtten n the followng expresson: max λ st μ f (x a ) λ μ f (x a ) = 2 (x a )= (40 a x 3x 2 a 2 x 3 ) 60 (x a 2 ) = (03 (x ) 2 2(x 2 3) 2 x +x 2 +x x x 2 x 3 0 a (ã) α a 2 (x 3 2) 2 ) (48) (20) (C) Accordng to the gven prorty the relaxed order of α-satsfactory degrees s constructed: (x a ) (x a 2 ) γ (2) Consequently the second step model s formulated as level : f 2 (x ã 2 ) level 2: f (x ã ) Frstly optmzaton smulaton s mplemented for the gven prorty and varous results wth regard to dfferent Δδ and α are presented Then maxmum stable relaxaton Δδ s computed Fnally senstvty analyss s consdered by changng the prorty order to valdate the senstveness of our approach ()OptmzatonforGvenPrortyOn bass of the proposed method Example s solved step by step (A) The membershp functons of ã are formulated by (2) accordngtotable and the correspondng constrants about α-level set are constructed as a (ã) α usng (3) The four optmum values of each objectve functon are computed when α = 0 and α = Thus the aspraton values and the tolerant lmts of the two objectves are determned as mn γ st μ f (x a ) λ Δδ = 2 (x a ) (x a 2 ) γ (x a )= (40 a x 3x 2 a 2 x 3 ) 60 (x a 2 ) = (03 (x ) 2 2(x 2 3) 2 x +x 2 +x x x 2 x 3 0 γ a (ã) α a 2 (x 3 2) 2 ) (48) (22)
8 8 Mathematcal Problems n Engneerng Table 2: Optmzaton results of Example for gven prorty α λ Δδ γ f (x ã ) f 2 (x ã 2 ) (x a ) (x a 2 ) (D) The M-Pareto optmalty test model s wrtten n the followng max ε +ε 2 st μ f (x a ) ε =μ f (x a ) =2 (x a ) (x a 2 ) γ (x a )= (40 a x 3x 2 a 2 x 3 ) 60 (x a 2 ) = (03 (x ) 2 2(x 2 3) 2 x +x 2 +x x x 2 x 3 0 ε 0 a (ã) α a 2 (x 3 2) 2 ) (48) (23) Accordng to the algorthm the above models are solved teratvely The correspondng optmzaton results are gven ntable 2 Comparng the results lsted n Table 2tsknownthat the values of γ arelessthan0andthechangngofγ conforms to that of Δδ Thsmeansthatthepreemptve prorty requrement s reasonable and all the results satsfy t Then DM can choose the preferred soluton from them accordng to hs requrement (2) Computaton of Maxmum Stable Relaxaton Δδ From Secton 323weknowthatthesolutonwllkeepunchanged when Δδ > Δδ Therefore there must exst maxmum stable relaxaton Δδ durng solvng Example Fordfferentα Δδ s correspondngly dfferent For example when α = 085 and Δδ = λ = μ f = ( ) are obtaned by solvng (4) where μ f s mnmum Therefore Δδ = whch means that the result wll reman unchanged when Δδ > (3) Senstvty Analyss For demonstratng the senstveness of the proposed method senstvty analyss s constructed by changng the orgnal prorty order nto the new one f (x ã ) s hgher than f 2 (x ã 2 ) Then the abovemodelsareupdatedusngthenewprortyconstrant (x a 2 ) (x a ) γ They are solved teratvely The correspondngoptmzatonresultsarepresentedntable 3 From Table 3t s seen that the order of α-satsfactory degrees changes wth alternaton of prorty requrement That denotes that our method s senstve to the prorty requrement Example 2 (see [26 27]) In order to verfy the effectveness of our method further the example wth more objectves from [26 27]susedItsfuzzyparametersconsstntheobjectves and the constrants whch makes t more complcated than Example : mn f (x ã )=(x +5) 2 + a x (x 3 a 2 ) 2 mn f 2 (x ã 2 )= a 2 (x 45) 2 mn f 3 (x ã 3 )= a 3 (x + 20) 2 +(x 2 + 5) 2 +3(x 3 + a 22 ) 2 + a 32 (x 2 45) 2 +(x 3 + 5) 2 st g(x b )= b x 2 + b 2 x b 3 x x x 2 x 3 0 (24) ã = (ã ã 2 ã 3 ) and b are fuzzy parameter vectors and ã = ( a a 2 ) ã 2 = ( a 2 a 22 ) ã 3 = ( a 3 a 32 )and b = ( b b 2 b 3 ) Ther characterstcs are presented n Table 4 Preemptve prorty requrement s as follows: level : f (x ã ) and f 3 (x ã 3 ) level 2: f 2 (x ã 2 ) (A) Frstly the fuzzy parameters ã and b are formulated nto membershp functons about α-level set by (3) Then the aspraton values and the tolerant lmts of the three objectves are determned as ( ) ( ) and( )respectvelybymeansofthemnmum and maxmum values at α = 0 and α = Therαmembershp functons are defned as
9 Mathematcal Problems n Engneerng 9 Table 3: Optmzaton results ofexample for senstvty analyss α Δδ γ f (x ã ) f 2 (x ã 2 ) (x a ) (x a 2 ) Table 4: Fuzzy parameters n Example 2 c (c c 2 c 3 c 4 ) c (c c 2 c 3 c 4 ) a ( ) a 32 ( ) a 2 ( ) b (09) a 2 (852222) b2 (08 2) a 22 ( ) b3 (085 5) a 3 (293335) (C) For prorty requrement the relaxed formulaton s wrtten as (x a 2 ) (x a ) γ (x a 2 ) μ f3 (x a 3 ) γ The second step model s formulated as (27) mn γ (x a )= (59324 (x +5) 2 a x 2 2 2(x 3 a 2 ) 2 ) (x a 2 ) = (79974 a 2 (x 45) 2 (x 2 + 5) 2 3(x 3 +a 22 ) 2 ) (4524) μ f3 (x a 3 ) = (4008 a 3 (x + 20) 2 a 32 (x 2 45) 2 st μ f (x a ) λ Δδ = 2 3 (x a 2 ) (x a ) γ (x a 2 ) μ f3 (x a 3 ) γ (x a ) = (59324 (x +5) 2 a x 2 2 2(x 3 a 2 ) 2 ) (29429) (x 3 + 5) 2 ) (68655) (B) The prelmnary model of the frst step s max λ st μ f (x a ) λ μ f (x a ) = 2 3 (25) (x a 2 ) = (79974 a 2 (x 45) 2 (x 2 + 5) 2 3(x 3 +a 22 ) 2 ) (4524) μ f3 (x a 3 ) = (4008 a 3 (x + 20) 2 a 32 (x 2 45) 2 (x 3 + 5) 2 ) (68655) (x a ) = (59324 (x +5) 2 a x 2 2 2(x 3 a 2 ) 2 ) (29429) (x a 2 ) = (79974 a 2 (x 45) 2 (x 2 + 5) 2 3(x 3 +a 22 ) 2 ) (4524) b x 2 +b 2x 2 2 +b 3x x x 2 x 3 0 γ (a b ) (ã b ) α (28) μ f3 (x a 3 ) = (4008 a 3 (x + 20) 2 a 32 (x 2 45) 2 (x 3 + 5) 2 ) (68655) (D) The correspondng M-Pareto optmalty test model s gven n the followng b x 2 +b 2x 2 2 +b 3x x x 2 x 3 0 (a b ) (ã b ) α (26) max ε +ε 2 +ε 3 st μ f (x a ) ε =μ f (x a ) = 2 3 (x a 2 ) (x a ) γ (x a 2 ) μ f3 (x a 3 ) γ
10 0 Mathematcal Problems n Engneerng Table 5: Optmzaton results of Example 2 α λ Δδ γ f (x ã ) f 2 (x ã 2 ) f 3 (x ã 3 ) (x a ) (x a 2 ) μ f3 (x a 3 ) (x a ) = (59324 (x +5) 2 a x 2 2 2(x 3 a 2 ) 2 ) (29429) (x a 2 ) = (79974 a 2 (x 45) 2 (x 2 + 5) 2 3(x 3 +a 22 ) 2 ) (4524) μ f3 (x a 3 ) = (4008 a 3 (x + 20) 2 a 32 (x 2 45) 2 (x 3 + 5) 2 ) (68655) b x 2 +b 2x 2 2 +b 3x x x 2 x 3 0 ε 0 (a b ) (ã b ) α (29) When α = 09 and α = 08 the models n (B) (C) and (D) are solved teratvely The optmzaton results are shown n Table 5 From Table 5 we know that all the results satsfy the preemptveprortyrequrementdmcanchoosethepreferred soluton from them For example when α = 08 and Δδ = 02 thesatsfactorydegreesare and07049andthe values of the objectves are and 9682 Ths may be regarded as the most reasonable result Remark 5 The prorty varable γ wll decrease wth the ncrement of Δδ How to change Δδ can be determned accordng to the real optmzaton problem Usually t s proper to change Δδ about 0 every tme 5 Concluson Ths paper addresses the problem of FMOO that resulted from fuzzy parameters Although the approach n [25] can work wth preemptve prorty requrement t only focuses on fuzzy goals but not fuzzy parameters Therefore the orgnal two-step method s greatly mproved for fuzzy parameters andprortyinthsworktheconceptoffuzzynumber and α-level set theory are ntroduced to adapt to fuzzy parameters Only nequalty fuzzy relatons are consdered n [25] However the enhanced method s extended to three relatons nvolvng fuzzy mnmzaton fuzzy maxmzaton and fuzzy equal Based on the prevous approach [25] the strct preemptve prorty structure s modeled by the relaxed order of α-satsfactory degrees Moreover there s the possblty of exstence of the weak M-Pareto optmal soluton n the orgnal approach Nevertheless the M-Pareto optmalty can be guaranteed by ths work The examples show that regulatng Δδ and α provdes more optmzaton freedoms than the prevous work durng solvng the two-step models teratvely Thus balance between optmzaton and prortycanberealzedwhenfuzzyparametersarenvolved However we stll need to note that the results of some FMOO problems may be so nsenstve to the change of Δδ or α that t s dffcult to seek the satsfactory soluton Therefore the senstvty research on regulatng Δδ or α wll be studed n the future Conflct of Interests The authors declare that there s no conflct of nterests regardng the publcaton of ths paper Acknowledgments Ths work was supported by the Natonal Nature Scence Foundaton of Chna under Grant nos and Nature Scence Foundaton of Tanjn 2JCZDJC30300 and JCYBJC07000 and the Key Laboratory of Advanced Electrcal Engneerng and Energy Technology Tanjn Polytechnc Unversty The authors are grateful to the anonymous revewers for ther helpful comments and constructve suggestons wth regard to ths paper References [] Y J La and C L Hwang Fuzzy Multple Objectve Decson Makng: Methods and Applcatons Sprnger Berln Germany 994 [2] C T Bornsten N Maculan M Pascoal and L L Pnto Multobjectve combnatoral optmzaton problems wth a cost and several bottleneck objectve functons: an algorthm wth reoptmzaton Computers & Operatons Researchvol39 no9pp [3] S-J Wu C-T Wu and J-Y Chang Fuzzy-based selfnteractve multobjectve evoluton optmzaton for reverse engneerng of bologcal networks IEEE Transactons on Fuzzy Systemsvol20no5pp
11 Mathematcal Problems n Engneerng [4] C J Carmona P González M J del Jesus and F Herrera NMEEF-SD: non-domnated multobjectve evolutonary algorthm for extractng fuzzy rules n subgroup dscovery IEEE Transactons on Fuzzy Systems vol 8 no 5 pp [5] O Crespo J E Bergez and F Garca Multobjectve optmzaton subject to uncertanty: applcaton to rrgaton strategy management Computers and Electroncs n Agrculturevol74 no pp [6] A Detz A Agular-Lasserre C Azzaro-Pantel L Pbouleau and S Domenech A fuzzy multobjectve algorthm for multproduct batch plant: applcaton to proten producton Computers and Chemcal Engneerng vol 32 no -2 pp [7] A Adeyefa and M Luhandjula Multobjectve stochastc lnear programmng: an overvew Amercan Operatons Research vol no 4 pp [8] F B Abdelazz and H Masr A compromse soluton for the multobjectve stochastc lnear programmng under partal uncertanty EuropeanJournalofOperatonalResearchvol202 no pp [9] M K Luhandjula and M J Rangoaga An approach for solvng a fuzzy multobjectve programmng problem European Journal of Operatonal Researchvol232no2pp [0] R E Bellman and L A Zadeh Decson-makng n a fuzzy envronment Management Scence vol 7 no 4 pp [] H-J Zmmermann Fuzzy programmng and lnear programmng wth several objectve functons Fuzzy Sets and Systems vol no pp [2]HTanakaTOkudaandKAsa Onfuzzymathematcal programmng Cybernetcs vol3no4pp [3] Y Gao G Q Zhang J Ma and J Lu A bmλ-cut and goal-programmng-based algorthm for fuzzy-lnear multpleobjectve blevel optmzaton IEEE Transactons on Fuzzy Systemsvol8nopp 3200 [4] S L and C Hu An nteractve satsfyng method based on alternatve tolerance for multple objectve optmzaton wth fuzzy parameters IEEE Transactons on Fuzzy Systems vol 6 no 5 pp [5] R T Marler and J S Arora Survey of mult-objectve optmzaton methods for engneerng Structural and Multdscplnary Optmzatonvol26no6pp [6] C-C Ln A weghted max-mn model for fuzzy goal programmng Fuzzy Sets and Systems vol 42 no 3 pp [7] S L and C Hu Satsfyng optmzaton method based on goal programmng for fuzzy multple objectve optmzaton problem EuropeanJournalofOperatonalResearchvol97no 2 pp [8] J-B Yang Mnmax reference pont approach and ts applcaton for multobjectve optmzaton European Operatonal Research vol 26 no 3 pp [9] R N Twar S Dharmar and J R Rao Fuzzy goal programmng an addtve model Fuzzy Sets and Systemsvol 24nopp [20] B B Pal and B N Motra A goal programmng procedure for solvng problems wth multple fuzzy goals usng dynamc programmng European Operatonal Research vol 44no3pp [2] L-H Chen and F-C Tsa Fuzzy goal programmng wth dfferent mportance and prortes European Operatonal Researchvol33no3pp [22] O Aköz and D Petrovc A fuzzy goal programmng method wth mprecse goal herarchy European Operatonal Researchvol8no3pp [23] C Hu and S L Enhanced nteractve satsfyng optmzaton approach to multple objectve optmzaton wth preemptve prortes Internatonal Informaton Technology & Decson Makngvol5nopp [24] S L Y Yang and C Teng Fuzzy goal programmng wth multple prortes va generalzed varyng-doman optmzaton method IEEE Transactons on Fuzzy Systems vol2no 5pp [25] S L and C Hu Two-step nteractve satsfactory method for fuzzy multple objectve optmzaton wth preemptve prortes IEEE Transactons on Fuzzy Systems vol 5 no 3 pp [26] C Mohan and H T Nguyen Reference drecton nteractve method for solvng multobjectve fuzzy programmng problems European Operatonal Researchvol07no3 pp [27] M Sakawa and H Yano An nteractve fuzzy satsfcng method for multobjectve nonlnear programmng problems wth fuzzy parameters Fuzzy Sets and Systems vol 30 no 3 pp [28] M Sakawa H Yano and T Yumne An nteractve fuzzy satsfcng method for multobjectve lnear-programmng problems and ts applcaton IEEE Transactons on Systems Man and Cybernetcsvol7no4pp
12 Advances n Operatons Research Hndaw Publshng Corporaton Advances n Decson Scences Hndaw Publshng Corporaton Appled Mathematcs Algebra Hndaw Publshng Corporaton Hndaw Publshng Corporaton Probablty and Statstcs The Scentfc World Journal Hndaw Publshng Corporaton Hndaw Publshng Corporaton Internatonal Dfferental Equatons Hndaw Publshng Corporaton Submt your manuscrpts at Internatonal Advances n Combnatorcs Hndaw Publshng Corporaton Mathematcal Physcs Hndaw Publshng Corporaton Complex Analyss Hndaw Publshng Corporaton Internatonal Mathematcs and Mathematcal Scences Mathematcal Problems n Engneerng Mathematcs Hndaw Publshng Corporaton Hndaw Publshng Corporaton Hndaw Publshng Corporaton Dscrete Mathematcs Hndaw Publshng Corporaton Dscrete Dynamcs n Nature and Socety Functon Spaces Hndaw Publshng Corporaton Abstract and Appled Analyss Hndaw Publshng Corporaton Hndaw Publshng Corporaton Internatonal Stochastc Analyss Optmzaton Hndaw Publshng Corporaton Hndaw Publshng Corporaton
Performance Management and Evaluation Research to University Students
631 A publcaton of CHEMICAL ENGINEERING TRANSACTIONS VOL. 46, 2015 Guest Edtors: Peyu Ren, Yancang L, Hupng Song Copyrght 2015, AIDIC Servz S.r.l., ISBN 978-88-95608-37-2; ISSN 2283-9216 The Italan Assocaton
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 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 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 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 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 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 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 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 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 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 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 informationPower-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 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 informationA Secure Password-Authenticated Key Agreement Using Smart Cards
A Secure Password-Authentcated Key Agreement Usng Smart Cards Ka Chan 1, Wen-Chung Kuo 2 and Jn-Chou Cheng 3 1 Department of Computer and Informaton Scence, R.O.C. Mltary Academy, Kaohsung 83059, Tawan,
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 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 informationHow Sets of Coherent Probabilities May Serve as Models for Degrees of Incoherence
1 st Internatonal Symposum on Imprecse Probabltes and Ther Applcatons, Ghent, Belgum, 29 June 2 July 1999 How Sets of Coherent Probabltes May Serve as Models for Degrees of Incoherence Mar J. Schervsh
More information8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by
6 CHAPTER 8 COMPLEX VECTOR SPACES 5. Fnd the kernel of the lnear transformaton gven n Exercse 5. In Exercses 55 and 56, fnd the mage of v, for the ndcated composton, where and are gven by the followng
More informationv a 1 b 1 i, a 2 b 2 i,..., a n b n i.
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 455 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces we have studed thus far n the text are real vector spaces snce the scalars are
More informationFuzzy TOPSIS Method in the Selection of Investment Boards by Incorporating Operational Risks
, July 6-8, 2011, London, U.K. Fuzzy TOPSIS Method n the Selecton of Investment Boards by Incorporatng Operatonal Rsks Elssa Nada Mad, and Abu Osman Md Tap Abstract Mult Crtera Decson Makng (MCDM) nvolves
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 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 informationResearch Article A Time Scheduling Model of Logistics Service Supply Chain with Mass Customized Logistics Service
Hndaw Publshng Corporaton Dscrete Dynamcs n Nature and Socety Volume 01, Artcle ID 48978, 18 pages do:10.1155/01/48978 Research Artcle A Tme Schedulng Model of Logstcs Servce Supply Chan wth Mass Customzed
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 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 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 informationFuzzy Set Approach To Asymmetrical Load Balancing In Distribution Networks
Fuzzy Set Approach To Asymmetrcal Load Balancng n Dstrbuton Networks Goran Majstrovc Energy nsttute Hrvoje Por Zagreb, Croata goran.majstrovc@ehp.hr Slavko Krajcar Faculty of electrcal engneerng and computng
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 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 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 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 informationStudy on Model of Risks Assessment of Standard Operation in Rural Power Network
Study on Model of Rsks Assessment of Standard Operaton n Rural Power Network Qngj L 1, Tao Yang 2 1 Qngj L, College of Informaton and Electrcal Engneerng, Shenyang Agrculture Unversty, Shenyang 110866,
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 informationDuality for nonsmooth mathematical programming problems with equilibrium constraints
uu et al. Journal of Inequaltes and Applcatons (2016) 2016:28 DOI 10.1186/s13660-016-0969-4 R E S E A R C H Open Access Dualty for nonsmooth mathematcal programmng problems wth equlbrum constrants Sy-Mng
More informationA Probabilistic Theory of Coherence
A Probablstc Theory of Coherence BRANDEN FITELSON. The Coherence Measure C Let E be a set of n propostons E,..., E n. We seek a probablstc measure C(E) of the degree of coherence of E. Intutvely, we want
More informationAn Analysis of Central Processor Scheduling in Multiprogrammed Computer Systems
STAN-CS-73-355 I SU-SE-73-013 An Analyss of Central Processor Schedulng n Multprogrammed Computer Systems (Dgest Edton) by Thomas G. Prce October 1972 Techncal Report No. 57 Reproducton n whole or n part
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 informationNEURO-FUZZY INFERENCE SYSTEM FOR E-COMMERCE WEBSITE EVALUATION
NEURO-FUZZY INFERENE SYSTEM FOR E-OMMERE WEBSITE EVALUATION Huan Lu, School of Software, Harbn Unversty of Scence and Technology, Harbn, hna Faculty of Appled Mathematcs and omputer Scence, Belarusan State
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 informationConversion between the vector and raster data structures using Fuzzy Geographical Entities
Converson between the vector and raster data structures usng Fuzzy Geographcal Enttes Cdála Fonte Department of Mathematcs Faculty of Scences and Technology Unversty of Combra, Apartado 38, 3 454 Combra,
More informationAn Integrated Approach of AHP-GP and Visualization for Software Architecture Optimization: A case-study for selection of architecture style
Internatonal Journal of Scentfc & Engneerng Research Volume 2, Issue 7, July-20 An Integrated Approach of AHP-GP and Vsualzaton for Software Archtecture Optmzaton: A case-study for selecton of archtecture
More informationEnabling P2P One-view Multi-party Video Conferencing
Enablng P2P One-vew Mult-party Vdeo Conferencng Yongxang Zhao, Yong Lu, Changja Chen, and JanYn Zhang Abstract Mult-Party Vdeo Conferencng (MPVC) facltates realtme group nteracton between users. Whle P2P
More informationExtending Probabilistic Dynamic Epistemic Logic
Extendng Probablstc Dynamc Epstemc Logc Joshua Sack May 29, 2008 Probablty Space Defnton A probablty space s a tuple (S, A, µ), where 1 S s a set called the sample space. 2 A P(S) s a σ-algebra: a set
More informationRESEARCH ON DUAL-SHAKER SINE VIBRATION CONTROL. Yaoqi FENG 1, Hanping QIU 1. China Academy of Space Technology (CAST) yaoqi.feng@yahoo.
ICSV4 Carns Australa 9- July, 007 RESEARCH ON DUAL-SHAKER SINE VIBRATION CONTROL Yaoq FENG, Hanpng QIU Dynamc Test Laboratory, BISEE Chna Academy of Space Technology (CAST) yaoq.feng@yahoo.com Abstract
More informationSelecting Best Employee of the Year Using Analytical Hierarchy Process
J. Basc. Appl. Sc. Res., 5(11)72-76, 2015 2015, TextRoad Publcaton ISSN 2090-4304 Journal of Basc and Appled Scentfc Research www.textroad.com Selectng Best Employee of the Year Usng Analytcal Herarchy
More informationDynamic Pricing for Smart Grid with Reinforcement Learning
Dynamc Prcng for Smart Grd wth Renforcement Learnng Byung-Gook Km, Yu Zhang, Mhaela van der Schaar, and Jang-Won Lee Samsung Electroncs, Suwon, Korea Department of Electrcal Engneerng, UCLA, Los Angeles,
More informationA Lyapunov Optimization Approach to Repeated Stochastic Games
PROC. ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, OCT. 2013 1 A Lyapunov Optmzaton Approach to Repeated Stochastc Games Mchael J. Neely Unversty of Southern Calforna http://www-bcf.usc.edu/
More informationForecasting the Direction and Strength of Stock Market Movement
Forecastng the Drecton and Strength of Stock Market Movement Jngwe Chen Mng Chen Nan Ye cjngwe@stanford.edu mchen5@stanford.edu nanye@stanford.edu Abstract - Stock market s one of the most complcated systems
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 informationRate Monotonic (RM) Disadvantages of cyclic. TDDB47 Real Time Systems. Lecture 2: RM & EDF. Priority-based scheduling. States of a process
Dsadvantages of cyclc TDDB47 Real Tme Systems Manual scheduler constructon Cannot deal wth any runtme changes What happens f we add a task to the set? Real-Tme Systems Laboratory Department of Computer
More informationThe Application of Fractional Brownian Motion in Option Pricing
Vol. 0, No. (05), pp. 73-8 http://dx.do.org/0.457/jmue.05.0..6 The Applcaton of Fractonal Brownan Moton n Opton Prcng Qng-xn Zhou School of Basc Scence,arbn Unversty of Commerce,arbn zhouqngxn98@6.com
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 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 informationOn the Interaction between Load Balancing and Speed Scaling
On the Interacton between Load Balancng and Speed Scalng Ljun Chen and Na L Abstract Speed scalng has been wdely adopted n computer and communcaton systems, n partcular, to reduce energy consumpton. An
More informationA Performance Analysis of View Maintenance Techniques for Data Warehouses
A Performance Analyss of Vew Mantenance Technques for Data Warehouses Xng Wang Dell Computer Corporaton Round Roc, Texas Le Gruenwald The nversty of Olahoma School of Computer Scence orman, OK 739 Guangtao
More informationA GENETIC ALGORITHM-BASED METHOD FOR CREATING IMPARTIAL WORK SCHEDULES FOR NURSES
82 Internatonal Journal of Electronc Busness Management, Vol. 0, No. 3, pp. 82-93 (202) A GENETIC ALGORITHM-BASED METHOD FOR CREATING IMPARTIAL WORK SCHEDULES FOR NURSES Feng-Cheng Yang * and We-Tng Wu
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 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 informationSoftware project management with GAs
Informaton Scences 177 (27) 238 241 www.elsever.com/locate/ns Software project management wth GAs Enrque Alba *, J. Francsco Chcano Unversty of Málaga, Grupo GISUM, Departamento de Lenguajes y Cencas de
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 informationSingle and multiple stage classifiers implementing logistic discrimination
Sngle and multple stage classfers mplementng logstc dscrmnaton Hélo Radke Bttencourt 1 Dens Alter de Olvera Moraes 2 Vctor Haertel 2 1 Pontfíca Unversdade Católca do Ro Grande do Sul - PUCRS Av. Ipranga,
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 informationWhat is Candidate Sampling
What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble
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 informationBERNSTEIN POLYNOMIALS
On-Lne Geometrc Modelng Notes BERNSTEIN POLYNOMIALS Kenneth I. Joy Vsualzaton and Graphcs Research Group Department of Computer Scence Unversty of Calforna, Davs Overvew Polynomals are ncredbly useful
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 informationERP Software Selection Using The Rough Set And TPOSIS Methods
ERP Software Selecton Usng The Rough Set And TPOSIS Methods Under Fuzzy Envronment Informaton Management Department, Hunan Unversty of Fnance and Economcs, No. 139, Fengln 2nd Road, Changsha, 410205, Chna
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 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 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 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 informationCHOLESTEROL REFERENCE METHOD LABORATORY NETWORK. Sample Stability Protocol
CHOLESTEROL REFERENCE METHOD LABORATORY NETWORK Sample Stablty Protocol Background The Cholesterol Reference Method Laboratory Network (CRMLN) developed certfcaton protocols for total cholesterol, HDL
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 informationCan Auto Liability Insurance Purchases Signal Risk Attitude?
Internatonal Journal of Busness and Economcs, 2011, Vol. 10, No. 2, 159-164 Can Auto Lablty Insurance Purchases Sgnal Rsk Atttude? Chu-Shu L Department of Internatonal Busness, Asa Unversty, Tawan Sheng-Chang
More informationFisher Markets and Convex Programs
Fsher Markets and Convex Programs Nkhl R. Devanur 1 Introducton Convex programmng dualty s usually stated n ts most general form, wth convex objectve functons and convex constrants. (The book by Boyd and
More informationPAS: A Packet Accounting System to Limit the Effects of DoS & DDoS. Debish Fesehaye & Klara Naherstedt University of Illinois-Urbana Champaign
PAS: A Packet Accountng System to Lmt the Effects of DoS & DDoS Debsh Fesehaye & Klara Naherstedt Unversty of Illnos-Urbana Champagn DoS and DDoS DDoS attacks are ncreasng threats to our dgtal world. Exstng
More informationPOLYSA: A Polynomial Algorithm for Non-binary Constraint Satisfaction Problems with and
POLYSA: A Polynomal Algorthm for Non-bnary Constrant Satsfacton Problems wth and Mguel A. Saldo, Federco Barber Dpto. Sstemas Informátcos y Computacón Unversdad Poltécnca de Valenca, Camno de Vera s/n
More informationHow To Improve Delay Throughput In Wireless Networks With Multipath Routing And Channel Codeing
Delay-Throughput Enhancement n Wreless Networs wth Mult-path Routng and Channel Codng Kevan Ronas, Student Member, IEEE, Amr-Hamed Mohsenan-Rad, Member, IEEE, Vncent W.S. Wong, Senor Member, IEEE, Sathsh
More informationAvailability-Based Path Selection and Network Vulnerability Assessment
Avalablty-Based Path Selecton and Network Vulnerablty Assessment Song Yang, Stojan Trajanovsk and Fernando A. Kupers Delft Unversty of Technology, The Netherlands {S.Yang, S.Trajanovsk, F.A.Kupers}@tudelft.nl
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 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 informationExamensarbete. Rotating Workforce Scheduling. Caroline Granfeldt
Examensarbete Rotatng Workforce Schedulng Carolne Granfeldt LTH - MAT - EX - - 2015 / 08 - - SE Rotatng Workforce Schedulng Optmerngslära, Lnköpngs Unverstet Carolne Granfeldt LTH - MAT - EX - - 2015
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 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 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 informationOpen Access A Load Balancing Strategy with Bandwidth Constraint in Cloud Computing. Jing Deng 1,*, Ping Guo 2, Qi Li 3, Haizhu Chen 1
Send Orders for Reprnts to reprnts@benthamscence.ae The Open Cybernetcs & Systemcs Journal, 2014, 8, 115-121 115 Open Access A Load Balancng Strategy wth Bandwdth Constrant n Cloud Computng Jng Deng 1,*,
More informationMAC Layer Service Time Distribution of a Fixed Priority Real Time Scheduler over 802.11
Internatonal Journal of Software Engneerng and Its Applcatons Vol., No., Aprl, 008 MAC Layer Servce Tme Dstrbuton of a Fxed Prorty Real Tme Scheduler over 80. Inès El Korb Ecole Natonale des Scences de
More informationSolving Factored MDPs with Continuous and Discrete Variables
Solvng Factored MPs wth Contnuous and screte Varables Carlos Guestrn Berkeley Research Center Intel Corporaton Mlos Hauskrecht epartment of Computer Scence Unversty of Pttsburgh Branslav Kveton Intellgent
More informationResearch on Evaluation of Customer Experience of B2C Ecommerce Logistics Enterprises
3rd Internatonal Conference on Educaton, Management, Arts, Economcs and Socal Scence (ICEMAESS 2015) Research on Evaluaton of Customer Experence of B2C Ecommerce Logstcs Enterprses Yle Pe1, a, Wanxn Xue1,
More informationAN APPOINTMENT ORDER OUTPATIENT SCHEDULING SYSTEM THAT IMPROVES OUTPATIENT EXPERIENCE
AN APPOINTMENT ORDER OUTPATIENT SCHEDULING SYSTEM THAT IMPROVES OUTPATIENT EXPERIENCE Yu-L Huang Industral Engneerng Department New Mexco State Unversty Las Cruces, New Mexco 88003, U.S.A. Abstract Patent
More informationIMPACT ANALYSIS OF A CELLULAR PHONE
4 th ASA & μeta Internatonal Conference IMPACT AALYSIS OF A CELLULAR PHOE We Lu, 2 Hongy L Bejng FEAonlne Engneerng Co.,Ltd. Bejng, Chna ABSTRACT Drop test smulaton plays an mportant role n nvestgatng
More informationAllocating Time and Resources in Project Management Under Uncertainty
Proceedngs of the 36th Hawa Internatonal Conference on System Scences - 23 Allocatng Tme and Resources n Project Management Under Uncertanty Mark A. Turnqust School of Cvl and Envronmental Eng. Cornell
More informationAnswer: A). There is a flatter IS curve in the high MPC economy. Original LM LM after increase in M. IS curve for low MPC economy
4.02 Quz Solutons Fall 2004 Multple-Choce Questons (30/00 ponts) Please, crcle the correct answer for each of the followng 0 multple-choce questons. For each queston, only one of the answers s correct.
More informationEfficient Project Portfolio as a tool for Enterprise Risk Management
Effcent Proect Portfolo as a tool for Enterprse Rsk Management Valentn O. Nkonov Ural State Techncal Unversty Growth Traectory Consultng Company January 5, 27 Effcent Proect Portfolo as a tool for Enterprse
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 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 informationMultiple-Period Attribution: Residuals and Compounding
Multple-Perod Attrbuton: Resduals and Compoundng Our revewer gave these authors full marks for dealng wth an ssue that performance measurers and vendors often regard as propretary nformaton. In 1994, Dens
More informationOn Multi-controller Placement Optimization in Software Defined Networking - based WANs
On Mult-controller Placement Optmzaton n Software Defned Networkng - based WANs Eugen Borcoc, Radu Badea, Serban Georgca Obreja, Marus Vochn Unversty POLITEHNICA of Bucharest - UPB Bucharest, Romana eugen.borcoc@elcom.pub.ro,
More informationSngle Snk Buy at Bulk Problem and the Access Network
A Constant Factor Approxmaton for the Sngle Snk Edge Installaton Problem Sudpto Guha Adam Meyerson Kamesh Munagala Abstract We present the frst constant approxmaton to the sngle snk buy-at-bulk network
More information