A Hybrid Differential Evolution Algorithm Game Theory for the Berth Allocation Problem
|
|
- Howard Bailey
- 5 years ago
- Views:
Transcription
1 A Hybrd Dfferental Evoluton Algorthm ame Theory for the Berth Allocaton Problem Nasser R. Sabar, Sang Yew Chong, and raham Kendall The Unversty of Nottngham Malaysa Campus, Jalan Broga, Semenyh, Selangor, Malaysa Abstract. The berth allocaton problem (BAP) s an mportant and challengng problem n the martme transportaton ndustry. BAP can be defned as the problem of assgnng a berth poston and servce tme to a gven set of vessels whle ensurng that all BAP constrants are respected. The goal s to mnmze the total watng tme of all vessels. In ths paper, we propose a dfferental evoluton (DE) algorthm for the BAP. DE s a nature-nspred metaheurstc that has been shown to be an effectve method to addresses contnuous optmzaton problems. It nvolves a populaton of solutons that undergo the process of selecton and varaton. In DE, the mutaton operator s consdered the man varaton operator responsble for generatng new solutons. Several mutaton operators have been proposed and they have shown that dfferent operators are more sutable for dfferent problem nstances and even dfferent stages n the search process. In ths paper, we propose an enhanced DE that utlzes several mutaton operators and employs game theory to control the selecton of mutaton operators durng the search process. The BAP benchmark nstances that have been used by other researchers are used to assess the performance of the proposed algorthm. Our expermental results reveal that the proposed DE can obtan compettve results wth less computatonal tme compared to exstng algorthms for all tested problem nstances. Keywords: Dfferental evoluton, berth allocaton problem, meta-heurstcs, optmzaton. 1 Introducton Martme transportaton has experenced a tremendous growth of contaner usage over the last two decades [1], [2]. Port managers face great challenges n provdng effectve and effcent servces. The berth allocaton problem (BAP) s one of the man challenges confrontng port managers. Provdng an effcent soluton to the BAP plays an mportant role n mprovng port effectveness [2]. BAP seeks to assgn, for each vessel, a berth poston and servce tme on the selected berth. The goal s to mnmze the total watng tme of all vessels as far as possble [1]. BAP s an NP-hard problem [1]. Small nstances can be solved optmalty usng exact methods. However, they become mpractcal as the sze of the nstances n- Sprnger Internatonal Publshng Swtzerland 2015 H. Handa et al. (eds.), Proc. of the 18th Asa Pacfc Symp. on Intell. & Evol. Systems Vol. 2, Proceedngs n Adaptaton, Learnng and Optmzaton 2, DOI: / _7 77
2 78 N.R. Sabar, S.Y. Chong, and. Kendall creases [2]. As such, researchers have utlzed meta-heurstc algorthms to deal wth large-scale nstances as they can often provde good qualty solutons wthn realstc computatonal tmes. Examples of meta-heurstc algorthms beng utlzed for BAP nclude: tabu search [1], clusterng search [3] partcle swarm optmzaton [4] and hybrd column generaton approach [5]. In ths paper, we propose a dfferental evoluton (DE) algorthm for the BAP. DE s a nature-nspred populaton-based meta-heurstc that has been demonstrated to be effcent and effectve for many hard contnuous optmzaton problems. DE operates on a populaton of solutons and teratvely mproves them. In each teratve step or generaton, a new soluton s generated usng two varaton operators: mutaton and crossover. The mutaton operator n DE s consdered the prmary varaton operator and several mutaton operators have been ntroduced. However, t s not known n advance whch operator should be used as dfferent operators work well for dfferent problem nstances wth dfferent characterstcs and n dfferent stages of the search process [6], [7], [8], [9]. In ths paper, we propose an enhanced DE that utlzes a varaton operator wth multple mutaton operators for the BAP. We utlze game theory to provde a mechansm to control the selecton of mutaton operators throughout the search process of DE. The performance of the proposed algorthm has been assessed usng the exstng BAP benchmark nstances [1]. The expermental results reveal that the proposed algorthm can obtan compettve results wth less computatonal tme when compared wth exstng algorthms. 2 Problem Descrpton Berwrth and Mesel [2] has classfed BAP nto two types accordng to the berth type and the vessel s arrval tme. The berth type s categorzed as dscrete f the quay has been parttoned nto a set of berth sectons and contnuous f the quay s not parttoned. The vessel s arrval tme s categorzed as dynamc f the vessels can arrve at any tme durng the plannng horzon, and statc f all vessels have arrved at the port before the berth plannng begns. We focus on the dscrete dynamc BAP [2], [10]. For ths BAP, there are a set of berth sectons wth predefned lengths and a set of vessels. Each vessel has an arrval tme, prorty, vessel length and handlng tme [2]. Some of them can be allocated to any berths based on vessel lengths whle others can only be allocated to a subset of berths. The vessel handlng tme s dfferent from one berth to another. The overall goal s to allocate for each vessel a berth secton and servce tme (berthng tme) on the allocated berth whle respectng the followng constrants [1]: Each vessel s allocated to exactly one berth. There s no more than one vessel allocated to the same berth at the same tme (same servce tme). Each berth can handle at most one vessel at any gven tme.
3 A Hybrd Dfferental Evoluton Algorthm 79 The man role of the optmzaton algorthm s to mnmze the total watng tme of all vessels whch s calculated as follows (objectve functon) [1]: mn v n k m T k k a ++t where - n : number of vessels - m : number of berths - v : the prorty of vessel - k T : the bertng tme of a vessel at berth k. - a : the arrval tme of vessel. - k t : the handlng tme of vessel at berth k. k x j j n (1) - x j k : decson varable, x j k =1 f vessel j s servced by berth k after the vessel and x j k = 0 otherwse. 3 Proposed Methodology In ths secton, we frst present the basc DE algorthm that s followed by the proposed approach to enhance DE for the BAP problem. 3.1 Basc Dfferental Evoluton Algorthm The DE algorthm was proposed n [11] to deal wth contnuous optmzaton problems (real-valued ftness functons). It belongs to a class of nature-nspred, populaton-based meta-heurstc algorthms [12]. A general DE algorthm starts wth a populaton of solutons and then apples evolutonary operators of varaton (mutaton and crossover) and selecton to mprove the populaton of solutons teratvely over a certan number of generatons. For every soluton n the populaton, DE generates a new soluton usng the mutaton operator that randomly selects three dfferent solutons from the current populaton and combnes them accordng to a prescrbed operaton. The new generated soluton s then combned wth the parent soluton usng the crossover operator to generate an offsprng. The selecton step frst calculates the ftness of the offsprng and then replaces t wth the parent soluton f t has a better ftness. Ths process s repeated for a predefned number of generatons. Over the years, many DE varants that use dfferent mutaton or crossover operators have been proposed. A general DE scheme use the notaton DE/x/y/z, where x
4 80 N.R. Sabar, S.Y. Chong, and. Kendall represents the base soluton to be mutated, y defnes the number of dfferent solutons to be used to perturb x, and z denotes the crossover type, bnomal or exponental [11], [12]. A well-known DE varant s the DE/rand/1/bn, where DE s Dfferental Evoluton, rand means the solutons wll be randomly selected, 1 ndcates the number of pars of solutons and bn ndcates that bnomal crossover wll be used. The basc steps of the DE/rand/1/bn are as follows [11]: Step 1: Randomly generate a populaton of solutons, NP. Step 2: Calculate the ftness, f, of the populaton. Step 3: For each parent soluton ( x ) n the current populaton NP ( s the soluton ndex and s the current generaton) generate a new soluton ( m ) usng (2): m = x + F * ( x x ), j {1,..., n} (2), j 1, j 2, j 3, j where j represents the ndex of current decson varable, n s the maxmum number of decson varables n a gven problem nstance, F s the scalng factor (F [0, 1]) and x 1, x 2 and x 3 are three randomly chosen solutons from the current populaton where x1 x2 x3. Step 4: Apply the crossover operator to combne the soluton ( m ) generated by the mutaton operator wth the parent soluton ( x ) based on the crossover rate 1 CR (CR [0, 1]) n order to generate a new offsprng ( m + ) as follows (3): m, ( ) ( ) 1 j f Rand j CRor j = Rnd m +, j = (3) x, j f Rand ( j ) > CR and j Rnd ( ) j {1,..., n}, {1,..., NP } where Rand(j) s a random number (Rand(j) [0, 1]) selected for the j th decson varable, Rnd() s a random decson varable ndex (Rnd() {1,, n}). 1 Rnd ensure that m + gets at least one decson varable from m. 1 Step 5: Calculate the ftness of m + and compare t wth x. Replace x wth 1 m + 1 f m + ftness s better than x as follows (4): m ( ) ( ) 1 f f m f x + x = + 1 x f f ( m ) > f ( x ) {1,..., NP } (4)
5 A Hybrd Dfferental Evoluton Algorthm 81 Step 6: If the termnaton crteron s satsfed (the number of generatons), stop and return the best soluton. Otherwse, go to Step 3. 4 The Proposed Algorthm The varety of problem nstances havng dfferent characterstcs, or those wth complex structures (e.g., dfferent sectons havng dfferent structures), makes t challengng to know n advance the best varaton operator to use (.e., blackbox optmzaton) [12]. Each one has ts own strength and weakness and may work well for certan nstances or at a certan stages n the search process. Consequently, several DE frameworks that utlze a set of mutaton operators have been proposed [6], [7], [8], [9]. These frameworks seek to combne the strength of several mutaton operators n one framework that can effectvely solve the gven problem nstances [13], [14], [15]. In ths paper, we propose a DE algorthm that utlzes several mutaton operators to solve the BAP. The proposed DE makes use of game theory n the desgn of the selecton mechansm that chooses the operator to be used at the current search stage. In the followng, we frst descrbe the soluton representaton and the populaton generaton method, and later the utlzed mutaton operators and proposed selecton mechansm. 4.1 Soluton Representaton and the Populaton eneraton Method DE was orgnally proposed to solve contnuous optmzaton problems [12]. To deal wth combnatoral optmzaton problems such as BAP, a sutable soluton representaton or a decodng scheme s needed to convert the real numbers nto ntegers [12]. In BAP, each vessel has to be assgned to a berth secton and beng gven a servce tme on the selected berth. Ths mples that we need to deal wth the assgnment problem that s responsble for assgnng for each vessel a berth secton and the schedulng problem that assgns a servce tme for each vessel. In ths paper, we avod modfyng the DE mutaton operator by havng a decmal representaton of BAP solutons a 0.a 1 a 2...where the nteger part a 0 represents assgned berth sectons whle the fracton parts a 1 a 2... represent the order of ths vessel on ths berth [16]. Fgure 1 shows an example of BAP soluton representaton. Here, an nstance of BAP has 6 vessels (n=6) that are needed to be assgned to 3 berths. If we assgn numbers for the vessels from 1 to 6, the decson varables wll be (1, 2, 3, 4, 5, 6), as shown n the frst row of Table 1. Next, we generate for each decson varable a random number r (r [1, 3])), as shown n second row of Table 1. Table 1 can be decoded nto a BAP soluton as follows: vessel 1 s assgned to the second berth and s second n order on ths berth, vessel 2 s assgned to the frst berth and s frst n order on ths berth, vessel 3 s assgned to the frst berth and s second n order on ths berth, and so on. Next, on each berth we sort the assgned vessels n an ascendng order based on ther arrval tme. In ths paper, the ntal populaton of solutons of DE s randomly generated by assgnng each decson varable a random value between 1 and the maxmum number of vessels n a gven problem nstance. The generated solutons are assgned ftness values usng equaton (1).
6 82 N.R. Sabar, S.Y. Chong, and. Kendall Table 1. BAP soluton representaton Vessel ndex Decson varables Mutaton Operators and the Selecton Mechansm In ths paper, the proposed DE makes use of the followng mutaton operators [11], [12]: - M 1 : DE/rand/1/bn, m = x1 + F *( x2 x3) - M 2 : DE /best /1/bn, m = xbest + F *( x1 x2) - M 3 : DE /parent-to- best/1, m = x + F *( xbest x) + F *( x1 x2) - M 4 : DE /best /2/ bn, m = xbest + F *( x1 x2) + F *( x3 x4) where parent (x ) s the parent soluton to be perturbed, best ndcates the best soluton n the populaton and x 1, x 2, x 3 and x 4 are randomly selected solutons from the current populaton where x 1 x 2 x 3 x 4 x x best In ths paper, each parent soluton s assocated wth a set of mutaton operators and, at each generaton, one of them s selected to generate a new soluton. We employ a game theoretc concept to desgn the selecton mechansm of the mutaton operators for each parent. Each strategy s assocated wth a profle that keeps the hstory of the strategy performance. As n [17], we model the selecton mechansm n the context of a two-player game. The DE populaton of solutons s dvded nto two to play two-player game. Each soluton represents a player wth a set of mutaton operators (M 1, M 2, M 3 and M 4 ) representng strateges that can be played. Each strategy wll be assgned a payoff representng the mprovement obtaned by the selected strategy. Accordng to the strategy probablty dstrbuton, each player selects one strategy to play aganst another strategy. Based on the obtaned result, the player wll update the strategy profle and the payoff. In ths paper, the strategy profle keeps the accumulated payoff of each one and t s updated at every generaton. The payoff of each strategy s calculated as follows: let S [] be the array of the probablty of selectng the strategy, f p and f n represents the ftness values of the parent and generated solutons, NS represents the number of strateges. Then, f the applcaton of the -th strategy mproves the ftness value of the parent soluton, the payoff of the -th strategy s updated as follows: S[]=S[]+ where =(f p f n )/ ( f p + f n ), j {1,,NS} and j, S[j]=S[j]-( /(NS-1)). Otherwse (f the soluton cannot be mproved), S[]=S[]- ( *α) where α=current_enetraon/total_eneratons, j {1,,NS} and j, S[j]=S[j]+( *α/(ns-1)). Intally, the selecton probablty of each strategy s set to 1/NS.
7 A Hybrd Dfferental Evoluton Algorthm 83 5 Expermental Setup The BAP benchmark nstances that have been ntroduced n [1] are used to valdate the performance of the proposed algorthm. The benchmark nvolves 30 dfferent nstances (denoted as 1 to 30); each nstance has 30 vessels and 13 berths [1]. In all nstances, the vessel characterstcs such as length and the arrval tme as well as berth lengths are dfferent. Table 2 shows the parameter settngs of proposed algorthm. These settngs were determned based on prelmnary experments. In ths paper, we executed the proposed algorthm 31 tmes for each nstance usng dfferent random seeds. Table 2. The Parameter Settngs # Parameter Value 1 No. Of generatons Populaton sze, NP 20 3 Scalng Factor, F Crossover Rate, CR The Computatonal Results We have carred out two types of experments. The goal of the frst one s to evaluate the mpact of the proposed mult-mutaton operators on the performance of DE n solvng BAP through a comparson wth a standard, baselne DE (DE/rand/1/bn). The goal of second experment s to compare the results of the proposed algorthm aganst the state of the art algorthms. 6.1 The Computatonal Comparsons of DE wth and wthout the ame Theory Concept In ths secton, we compare the computatonal results of DE wth and wthout the game theory concept (denoted as DET and DE, respectvely) usng the same parameter settngs, stoppng condton and computer resources. Both algorthms (DET and DE) are executed for 31 ndependent runs and the results are compared usng the Wlcoxon statstcal test wth a sgnfcance level of The p-value of DET aganst DE for all nstances s presented n Table 3. In ths table, + ndcates DET s statstcally better than DE (p-value < 0.05), - ndcates DE s statstcally better than DET (p-value > 0.05), and = ndcates both DET and DE have the same performance (p-value = 0.05). As Table 3 reflects, DET s statstcally better than DE on 21 nstances and preforms the same as DE on 2 out of 30 tested nstances. Ths table also reveals that on 7 out of 30 tested nstances, DET s not statstcally better than DE. Although the results show that DET s not statstcally better than DE on all tested nstances, the overall fndng justfes the beneft of ntegratng the game theory concept wth DE algorthm. Indeed, the use of the game theory concept can effectvely enhance the performance of DE to obtan very good results for all tested nstances.
8 84 N.R. Sabar, S.Y. Chong, and. Kendall Table 3. The p-value of DET compared to DE DET vs. DE Instance p-value = 06 = The Computatonal Comparsons of DET wth State of the Art Algorthms In ths secton, we compare the computatonal results of DET wth the current state of the art algorthms. The algorthms that we compare aganst are: - eneralzed set partton programmng (SPP) [18]. - Tabu search (TS) algorthm [1]. - Column generaton (C) algorthm [5]. - Clusterng search (CS) [3]. - Partcle swarm optmzaton (PSO) [4].
9 A Hybrd Dfferental Evoluton Algorthm 85 Table 4 gves the results of DET over 31 runs as well as the compared algorthms. For each nstance, we present the best obtaned results (best objectve value) and the computatonal tme (seconds) obtaned by DET and the compared algorthms. In Table 4, the thrd column (Opt.) ndcates the optmal value for each nstance [18], the last row represents the average overall nstances (Avg.) and boldfont ndcates the best obtaned results. Table 4. The results of DET compared to the state of the art methods Inst. DET SPP TS C CS PSO Best Tme Opt. Tme Best Best Tme Best Tme Best Tme Avg As can be seen from Table 4, DET obtaned the optmal values for all tested nstances. In partcular, DET best results are the same as those produced by the SPP. Wth respect to ndvdual comparsons, DET best results are the same as CS, PSO, TS and C on 30, and 24 out of 30 tested nstances, respectvely. DET obtaned better results than TS on 18 and C on 4 nstances. In addton, the average result of all nstances (last row n Table 4) of DET s better (or the same) than the compared algorthms. As for the computatonal tme comparsons, Table 4 shows that, on all tested nstances, the computatonal tme of DET s lower than SPP, CS, PSO, TS and C. The overall results demonstrate that DET s an effectve and effcent algorthm for the BAP as t obtaned very good results for all tested nstances wthn a small computatonal tme when compared to prevously reported algorthms.
10 86 N.R. Sabar, S.Y. Chong, and. Kendall 7 Concluson In ths paper, we have presented a DE algorthm to solve the BAP. DE s a populaton based algorthm that seeks to mprove the populaton of solutons through the use of mutaton operator(s), crossover operator and selecton rule. To further enhance the performance of the DE, we coupled t wth a several mutaton operators n order to combne strength of dfferent operators n one framework. ame theory s used to control the selecton of whch mutaton operator should be used at any decson pont. The computatonal results are carred out usng the exstng BAP benchmark nstances. The obtaned results reveal that the proposed algorthm obtaned very good results when compared to DE wthout game theory as well as the state of the art algorthms. In addton, the computatonal tme of proposed algorthm s lower than the compared algorthms, ndcatng that proposed algorthm s an effectve algorthm for the berth allocaton benchmark nstances. References 1. Cordeau, J.-F., Laporte,., Legato, P., Mocca, L.: Models and tabu search heurstcs for the berth-allocaton problem. Transportaton Scence 39(4), (2005) 2. Berwrth, C., Mesel, F.: A survey of berth allocaton and quay crane schedulng problems n contaner termnals. European Journal of Operatonal Research 202(3), (2010) 3. de Olvera, R.M., Maur,.R., Noguera Lorena, L.A.: Clusterng Search for the Berth Allocaton Problem. Expert Systems wth Applcatons 39(5), (2012) 4. Tng, C.-J., Wu, K.-C., Chou, H.: Partcle swarm optmzaton algorthm for the berth allocaton problem. Expert Systems wth Applcatons 41(4), (2014) 5. Maur,.R., Olvera, A.C.M., Lorena, L.A.N.: A hybrd column generaton approach for the berth allocaton problem. In: van Hemert, J., Cotta, C. (eds.) EvoCOP LNCS, vol. 4972, pp Sprnger, Hedelberg (2008) 6. Mallpedd, R., Suganthan, P.N., Pan, Q.-K., Tasgetren, M.F.: Dfferental evoluton algorthm wth ensemble of parameters and mutaton strateges. Appled Soft Computng 11(2), (2011) 7. Qn, A.K., Suganthan, P.N.: Self-adaptve dfferental evoluton algorthm for numercal optmzaton. In: The 2005 IEEE Congress on Evolutonary Computaton, pp IEEE (2005) 8. Brest, J., Boškovć, B., rener, S., Žumer, V., Maučec, M.S.: Performance comparson of self-adaptve and adaptve dfferental evoluton algorthms. Soft Computng 11(7), (2007) 9. Zhang, J., Sanderson, A.C.: JADE: adaptve dfferental evoluton wth optonal external archve. IEEE Transactons on Evolutonary Computaton 13(5), (2009) 10. Sabar, N.R., Kendall,., Ayob, M.: An Exponental Monte-Carlo Local Search Algorthm for the Berth Allocaton Problem. In: 10th Internatonal Conference on the Practce and Theory of Automated Tmetablng (PATAT 2010), York, UK, August 26-29, 2014, pp (2014) 11. Storn, R., Prce, K.: Dfferental evoluton a smple and effcent heurstc for global optmzaton over contnuous spaces. Journal of lobal Optmzaton 11(4), (1997)
11 A Hybrd Dfferental Evoluton Algorthm Das, S., Suganthan, P.N.: Dfferental evoluton: A survey of the state-of-the-art. IEEE Transactons on Evolutonary Computaton 15(1), 4 31 (2011) 13. Sabar, N.R., Ayob, M., Kendall,., Rong, Q.: rammatcal Evoluton Hyper-Heurstc for Combnatoral Optmzaton Problems. IEEE Transactons on Evolutonary Computaton 17(6), (2013), do: /tevc Sabar, N.R., Ayob, M., Kendall,., Qu, R.: A Dynamc Multarmed Bandt-ene Expresson Programmng Hyper-Heurstc for Combnatoral Optmzaton Problems. IEEE Transactons on Cybernetcs PP(99), 1 (2014), do: /tcyb Sabar, N.R., Ayob, M., Kendall,., Qu, R.: The Automatc Desgn of Hyper-heurstc Framework wth ene Expresson Programmng for Combnatoral Optmzaton problems. IEEE Transactons on Evolutonary Computaton PP(99), 1 (2014), do: /tevc Sabar, N.R., Kendall,.: Arcraft Landng Problem usng Hybrd Dfferental Evoluton and Smple Descent Algorthm. Paper presented at the 2014 IEEE Congress on Evolutonary Computaton (CEC 2014), pp (2014)
Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
Smultaneous Optmzaton of Berth Allocaton, Quay Crane Assgnment and Quay Crane Schedulng Problems n Contaner Termnals Necat Aras, Yavuz Türkoğulları, Z. Caner Taşkın, Kuban Altınel Abstract In ths work,
More informationThe Study of Teaching-learning-based Optimization Algorithm
Advanced Scence and Technology Letters Vol. (AST 06), pp.05- http://dx.do.org/0.57/astl.06. The Study of Teachng-learnng-based Optmzaton Algorthm u Sun, Yan fu, Lele Kong, Haolang Q,, Helongang Insttute
More informationComputing Correlated Equilibria in Multi-Player Games
Computng Correlated Equlbra n Mult-Player Games Chrstos H. Papadmtrou Presented by Zhanxang Huang December 7th, 2005 1 The Author Dr. Chrstos H. Papadmtrou CS professor at UC Berkley (taught at Harvard,
More informationA PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS
HCMC Unversty of Pedagogy Thong Nguyen Huu et al. A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS Thong Nguyen Huu and Hao Tran Van Department of mathematcs-nformaton,
More informationAnnexes. EC.1. Cycle-base move illustration. EC.2. Problem Instances
ec Annexes Ths Annex frst llustrates a cycle-based move n the dynamc-block generaton tabu search. It then dsplays the characterstcs of the nstance sets, followed by detaled results of the parametercalbraton
More informationDifferential Evolution Algorithm with a Modified Archiving-based Adaptive Tradeoff Model for Optimal Power Flow
1 Dfferental Evoluton Algorthm wth a Modfed Archvng-based Adaptve Tradeoff Model for Optmal Power Flow 2 Outlne Search Engne Constrant Handlng Technque Test Cases and Statstcal Results 3 Roots of Dfferental
More informationA New Evolutionary Computation Based Approach for Learning Bayesian Network
Avalable onlne at www.scencedrect.com Proceda Engneerng 15 (2011) 4026 4030 Advanced n Control Engneerng and Informaton Scence A New Evolutonary Computaton Based Approach for Learnng Bayesan Network Yungang
More informationMulti-agent system based on self-adaptive differential evolution for solving dynamic optimization problems
Mult-agent system based on self-adaptve dfferental evoluton for solvng dynamc optmzaton problems Aleš Čep Faculty of Electrcal Engneerng and Computer Scence Unversty of Marbor ales.cep@um.s ABSTRACT Ths
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationSelf-adaptive Differential Evolution Algorithm for Constrained Real-Parameter Optimization
26 IEEE Congress on Evolutonary Computaton Sheraton Vancouver Wall Centre Hotel, Vancouver, BC, Canada July 16-21, 26 Self-adaptve Dfferental Evoluton Algorthm for Constraned Real-Parameter Optmzaton V.
More informationCombining Examinations to Accelerate Timetable Construction
Combnng Examnatons to Accelerate Tmetable Constructon Graham Kendall Jawe L School of Computer Scence, Unversty of Nottngham, UK {gxk wl}@cs.nott.ac.uk Abstract: In ths paper we propose a novel approach
More informationA HYBRID DIFFERENTIAL EVOLUTION -ITERATIVE GREEDY SEARCH ALGORITHM FOR CAPACITATED VEHICLE ROUTING PROBLEM
IJCMA: Vol. 6, No. 1, January-June 2012, pp. 1-19 Global Research Publcatons A HYBRID DIFFERENTIAL EVOLUTION -ITERATIVE GREEDY SEARCH ALGORITHM FOR CAPACITATED VEHICLE ROUTING PROBLEM S. Kavtha and Nrmala
More informationOptimal Solution to the Problem of Balanced Academic Curriculum Problem Using Tabu Search
Optmal Soluton to the Problem of Balanced Academc Currculum Problem Usng Tabu Search Lorna V. Rosas-Téllez 1, José L. Martínez-Flores 2, and Vttoro Zanella-Palacos 1 1 Engneerng Department,Unversdad Popular
More informationAn Admission Control Algorithm in Cloud Computing Systems
An Admsson Control Algorthm n Cloud Computng Systems Authors: Frank Yeong-Sung Ln Department of Informaton Management Natonal Tawan Unversty Tape, Tawan, R.O.C. ysln@m.ntu.edu.tw Yngje Lan Management Scence
More informationAmiri s Supply Chain Model. System Engineering b Department of Mathematics and Statistics c Odette School of Business
Amr s Supply Chan Model by S. Ashtab a,, R.J. Caron b E. Selvarajah c a Department of Industral Manufacturng System Engneerng b Department of Mathematcs Statstcs c Odette School of Busness Unversty of
More informationChapter - 2. Distribution System Power Flow Analysis
Chapter - 2 Dstrbuton System Power Flow Analyss CHAPTER - 2 Radal Dstrbuton System Load Flow 2.1 Introducton Load flow s an mportant tool [66] for analyzng electrcal power system network performance. Load
More informationJournal of Applied Research and Technology ISSN: Centro de Ciencias Aplicadas y Desarrollo Tecnológico.
Journal of Appled Research and Technology ISSN: 1665-6423 jart@aleph.cnstrum.unam.mx Centro de Cencas Aplcadas y Desarrollo Tecnológco Méxco Lu Chun-Lang; Chu Shh-Yuan; Hsu Chh-Hsu; Yen Sh-Jm Enhanced
More informationReal-Time Systems. Multiprocessor scheduling. Multiprocessor scheduling. Multiprocessor scheduling
Real-Tme Systems Multprocessor schedulng Specfcaton Implementaton Verfcaton Multprocessor schedulng -- -- Global schedulng How are tasks assgned to processors? Statc assgnment The processor(s) used for
More informationInteractive Bi-Level Multi-Objective Integer. Non-linear Programming Problem
Appled Mathematcal Scences Vol 5 0 no 65 3 33 Interactve B-Level Mult-Objectve Integer Non-lnear Programmng Problem O E Emam Department of Informaton Systems aculty of Computer Scence and nformaton Helwan
More informationSingle-Facility Scheduling over Long Time Horizons by Logic-based Benders Decomposition
Sngle-Faclty Schedulng over Long Tme Horzons by Logc-based Benders Decomposton Elvn Coban and J. N. Hooker Tepper School of Busness, Carnege Mellon Unversty ecoban@andrew.cmu.edu, john@hooker.tepper.cmu.edu
More informationElectromagnetic Algorithm for tuning the structure and parameters of Neural Networks
Electromagnetc Algorthm for tunng the structure and parameters of Neural Networks Ayad Mashaan Turky, Salwan Abdullah and Nasser R. Sabar Abstract Electromagnetc algorthm s a populaton based meta-heurstc
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More informationAppendix B: Resampling Algorithms
407 Appendx B: Resamplng Algorthms A common problem of all partcle flters s the degeneracy of weghts, whch conssts of the unbounded ncrease of the varance of the mportance weghts ω [ ] of the partcles
More informationMarkov Chain Monte Carlo Lecture 6
where (x 1,..., x N ) X N, N s called the populaton sze, f(x) f (x) for at least one {1, 2,..., N}, and those dfferent from f(x) are called the tral dstrbutons n terms of mportance samplng. Dfferent ways
More informationDesign and Optimization of Fuzzy Controller for Inverse Pendulum System Using Genetic Algorithm
Desgn and Optmzaton of Fuzzy Controller for Inverse Pendulum System Usng Genetc Algorthm H. Mehraban A. Ashoor Unversty of Tehran Unversty of Tehran h.mehraban@ece.ut.ac.r a.ashoor@ece.ut.ac.r Abstract:
More informationEntropy Generation Minimization of Pin Fin Heat Sinks by Means of Metaheuristic Methods
Indan Journal of Scence and Technology Entropy Generaton Mnmzaton of Pn Fn Heat Snks by Means of Metaheurstc Methods Amr Jafary Moghaddam * and Syfollah Saedodn Department of Mechancal Engneerng, Semnan
More informationThe Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More informationUtilizing cumulative population distribution information in differential evolution
Utlzng cumulatve populaton dstrbuton nformaton n dfferental evoluton Yong Wang a,b, Zh-Zhong Lu a, Janbn L c, Han-Xong L d, e, Gary G. Yen f a School of Informaton Scence and Engneerng, Central South Unversty,
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationSolving of Single-objective Problems based on a Modified Multiple-crossover Genetic Algorithm: Test Function Study
Internatonal Conference on Systems, Sgnal Processng and Electroncs Engneerng (ICSSEE'0 December 6-7, 0 Duba (UAE Solvng of Sngle-objectve Problems based on a Modfed Multple-crossover Genetc Algorthm: Test
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationAn Adaptive Learning Particle Swarm Optimizer for Function Optimization
An Adaptve Learnng Partcle Swarm Optmzer for Functon Optmzaton Changhe L and Shengxang Yang Abstract Tradtonal partcle swarm optmzaton (PSO) suffers from the premature convergence problem, whch usually
More informationWinter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan
Wnter 2008 CS567 Stochastc Lnear/Integer Programmng Guest Lecturer: Xu, Huan Class 2: More Modelng Examples 1 Capacty Expanson Capacty expanson models optmal choces of the tmng and levels of nvestments
More informationParticle Swarm Optimization with Adaptive Mutation in Local Best of Particles
1 Internatonal Congress on Informatcs, Envronment, Energy and Applcatons-IEEA 1 IPCSIT vol.38 (1) (1) IACSIT Press, Sngapore Partcle Swarm Optmzaton wth Adaptve Mutaton n Local Best of Partcles Nanda ulal
More informationUncertain Models for Bed Allocation
www.ccsenet.org/ghs Global Journal of Health Scence Vol., No. ; October 00 Uncertan Models for Bed Allocaton Lng Gao (Correspondng author) College of Scence, Guln Unversty of Technology Box 733, Guln 54004,
More informationOn the Multicriteria Integer Network Flow Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of
More informationECE559VV Project Report
ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate
More informationResource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud
Resource Allocaton wth a Budget Constrant for Computng Independent Tasks n the Cloud Wemng Sh and Bo Hong School of Electrcal and Computer Engneerng Georga Insttute of Technology, USA 2nd IEEE Internatonal
More informationConductor selection optimization in radial distribution system considering load growth using MDE algorithm
ISSN 1 746-7233, England, UK World Journal of Modellng and Smulaton Vol. 10 (2014) No. 3, pp. 175-184 Conductor selecton optmzaton n radal dstrbuton system consderng load growth usng MDE algorthm Belal
More informationChapter 2 Real-Coded Adaptive Range Genetic Algorithm
Chapter Real-Coded Adaptve Range Genetc Algorthm.. Introducton Fndng a global optmum n the contnuous doman s challengng for Genetc Algorthms (GAs. Tradtonal GAs use the bnary representaton that evenly
More informationBoostrapaggregating (Bagging)
Boostrapaggregatng (Baggng) An ensemble meta-algorthm desgned to mprove the stablty and accuracy of machne learnng algorthms Can be used n both regresson and classfcaton Reduces varance and helps to avod
More informationUsing Immune Genetic Algorithm to Optimize BP Neural Network and Its Application Peng-fei LIU1,Qun-tai SHEN1 and Jun ZHI2,*
Advances n Computer Scence Research (ACRS), volume 54 Internatonal Conference on Computer Networks and Communcaton Technology (CNCT206) Usng Immune Genetc Algorthm to Optmze BP Neural Network and Its Applcaton
More informationDiscrete Particle Swarm Optimization for TSP: Theoretical Results and Experimental Evaluations
Dscrete Partcle Swarm Optmzaton for TSP: Theoretcal Results and Expermental Evaluatons Matthas Hoffmann, Mortz Mühlenthaler, Sabne Helwg, Rolf Wanka Department of Computer Scence, Unversty of Erlangen-Nuremberg,
More informationVQ widely used in coding speech, image, and video
at Scalar quantzers are specal cases of vector quantzers (VQ): they are constraned to look at one sample at a tme (memoryless) VQ does not have such constrant better RD perfomance expected Source codng
More informationA Bayes Algorithm for the Multitask Pattern Recognition Problem Direct Approach
A Bayes Algorthm for the Multtask Pattern Recognton Problem Drect Approach Edward Puchala Wroclaw Unversty of Technology, Char of Systems and Computer etworks, Wybrzeze Wyspanskego 7, 50-370 Wroclaw, Poland
More informationThe Convergence Speed of Single- And Multi-Objective Immune Algorithm Based Optimization Problems
The Convergence Speed of Sngle- And Mult-Obectve Immune Algorthm Based Optmzaton Problems Mohammed Abo-Zahhad Faculty of Engneerng, Electrcal and Electroncs Engneerng Department, Assut Unversty, Assut,
More informationOutline and Reading. Dynamic Programming. Dynamic Programming revealed. Computing Fibonacci. The General Dynamic Programming Technique
Outlne and Readng Dynamc Programmng The General Technque ( 5.3.2) -1 Knapsac Problem ( 5.3.3) Matrx Chan-Product ( 5.3.1) Dynamc Programmng verson 1.4 1 Dynamc Programmng verson 1.4 2 Dynamc Programmng
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationCOMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
More informationEEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming
EEL 6266 Power System Operaton and Control Chapter 3 Economc Dspatch Usng Dynamc Programmng Pecewse Lnear Cost Functons Common practce many utltes prefer to represent ther generator cost functons as sngle-
More informationAn Improved Clustering Based Genetic Algorithm for Solving Complex NP Problems
Journal of Computer Scence 7 (7): 1033-1037, 2011 ISSN 1549-3636 2011 Scence Publcatons An Improved Clusterng Based Genetc Algorthm for Solvng Complex NP Problems 1 R. Svaraj and 2 T. Ravchandran 1 Department
More informationMaximizing Overlap of Large Primary Sampling Units in Repeated Sampling: A comparison of Ernst s Method with Ohlsson s Method
Maxmzng Overlap of Large Prmary Samplng Unts n Repeated Samplng: A comparson of Ernst s Method wth Ohlsson s Method Red Rottach and Padrac Murphy 1 U.S. Census Bureau 4600 Slver Hll Road, Washngton DC
More informationx = , so that calculated
Stat 4, secton Sngle Factor ANOVA notes by Tm Plachowsk n chapter 8 we conducted hypothess tests n whch we compared a sngle sample s mean or proporton to some hypotheszed value Chapter 9 expanded ths to
More informationIntegrated approach in solving parallel machine scheduling and location (ScheLoc) problem
Internatonal Journal of Industral Engneerng Computatons 7 (2016) 573 584 Contents lsts avalable at GrowngScence Internatonal Journal of Industral Engneerng Computatons homepage: www.growngscence.com/ec
More informationResearch Article An Enhanced Differential Evolution with Elite Chaotic Local Search
Computatonal Intellgence and Neuroscence Volume 215, Artcle ID 583759, 11 pages http://dx.do.org/1.1155/215/583759 Research Artcle An Enhanced Dfferental Evoluton wth Elte Chaotc Local Search Zhaolu Guo,
More informationSpeeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem
H.K. Pathak et. al. / (IJCSE) Internatonal Journal on Computer Scence and Engneerng Speedng up Computaton of Scalar Multplcaton n Ellptc Curve Cryptosystem H. K. Pathak Manju Sangh S.o.S n Computer scence
More informationA Hybrid Variational Iteration Method for Blasius Equation
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method
More informationTHE SUMMATION NOTATION Ʃ
Sngle Subscrpt otaton THE SUMMATIO OTATIO Ʃ Most of the calculatons we perform n statstcs are repettve operatons on lsts of numbers. For example, we compute the sum of a set of numbers, or the sum of the
More informationAn Extended Hybrid Genetic Algorithm for Exploring a Large Search Space
2nd Internatonal Conference on Autonomous Robots and Agents Abstract An Extended Hybrd Genetc Algorthm for Explorng a Large Search Space Hong Zhang and Masum Ishkawa Graduate School of L.S.S.E., Kyushu
More informationComparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method
Appled Mathematcal Scences, Vol. 7, 0, no. 47, 07-0 HIARI Ltd, www.m-hkar.com Comparson of the Populaton Varance Estmators of -Parameter Exponental Dstrbuton Based on Multple Crtera Decson Makng Method
More informationParametric fractional imputation for missing data analysis. Jae Kwang Kim Survey Working Group Seminar March 29, 2010
Parametrc fractonal mputaton for mssng data analyss Jae Kwang Km Survey Workng Group Semnar March 29, 2010 1 Outlne Introducton Proposed method Fractonal mputaton Approxmaton Varance estmaton Multple mputaton
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationAssignment 5. Simulation for Logistics. Monti, N.E. Yunita, T.
Assgnment 5 Smulaton for Logstcs Mont, N.E. Yunta, T. November 26, 2007 1. Smulaton Desgn The frst objectve of ths assgnment s to derve a 90% two-sded Confdence Interval (CI) for the average watng tme
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationResearch on Route guidance of logistic scheduling problem under fuzzy time window
Advanced Scence and Technology Letters, pp.21-30 http://dx.do.org/10.14257/astl.2014.78.05 Research on Route gudance of logstc schedulng problem under fuzzy tme wndow Yuqang Chen 1, Janlan Guo 2 * Department
More informationOptimum Design of Steel Frames Considering Uncertainty of Parameters
9 th World Congress on Structural and Multdscplnary Optmzaton June 13-17, 211, Shzuoka, Japan Optmum Desgn of Steel Frames Consderng ncertanty of Parameters Masahko Katsura 1, Makoto Ohsak 2 1 Hroshma
More informationAn Integrated Asset Allocation and Path Planning Method to to Search for a Moving Target in in a Dynamic Environment
An Integrated Asset Allocaton and Path Plannng Method to to Search for a Movng Target n n a Dynamc Envronment Woosun An Mansha Mshra Chulwoo Park Prof. Krshna R. Pattpat Dept. of Electrcal and Computer
More information= z 20 z n. (k 20) + 4 z k = 4
Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5
More informationQueueing Networks II Network Performance
Queueng Networks II Network Performance Davd Tpper Assocate Professor Graduate Telecommuncatons and Networkng Program Unversty of Pttsburgh Sldes 6 Networks of Queues Many communcaton systems must be modeled
More informationSolving Nonlinear Differential Equations by a Neural Network Method
Solvng Nonlnear Dfferental Equatons by a Neural Network Method Luce P. Aarts and Peter Van der Veer Delft Unversty of Technology, Faculty of Cvlengneerng and Geoscences, Secton of Cvlengneerng Informatcs,
More informationVARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES
VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES BÂRZĂ, Slvu Faculty of Mathematcs-Informatcs Spru Haret Unversty barza_slvu@yahoo.com Abstract Ths paper wants to contnue
More informationA New Quantum Behaved Particle Swarm Optimization
A New Quantum Behaved Partcle Swarm Optmzaton Mlle Pant Department of Paper Technology IIT Roorkee, Saharanpur Inda mllfpt@tr.ernet.n Radha Thangaraj Department of Paper Technology IIT Roorkee, Saharanpur
More informationCapacitor Placement In Distribution Systems Using Genetic Algorithms and Tabu Search
Capactor Placement In Dstrbuton Systems Usng Genetc Algorthms and Tabu Search J.Nouar M.Gandomar Saveh Azad Unversty,IRAN Abstract: Ths paper presents a new method for determnng capactor placement n dstrbuton
More informationLecture 14: Bandits with Budget Constraints
IEOR 8100-001: Learnng and Optmzaton for Sequental Decson Makng 03/07/16 Lecture 14: andts wth udget Constrants Instructor: Shpra Agrawal Scrbed by: Zhpeng Lu 1 Problem defnton In the regular Mult-armed
More informationGlobal Optimization Using Hybrid Approach
Tng-Yu Chen, Y Lang Cheng Global Optmzaton Usng Hybrd Approach TING-YU CHEN, YI LIANG CHENG Department of Mechancal Engneerng Natonal Chung Hsng Unversty 0 Kuo Kuang Road Tachung, Tawan 07 tyc@dragon.nchu.edu.tw
More informationHYBRID FUZZY MULTI-OBJECTIVE EVOLUTIONARY ALGORITHM: A NOVEL PARETO-OPTIMIZATION TECHNIQUE
Internatonal Journal of Fuzzy Logc Systems (IJFLS) Vol.2, No., February 22 HYBRID FUZZY MULTI-OBJECTIVE EVOLUTIONARY ALGORITHM: A NOVEL PARETO-OPTIMIZATION TECHNIQUE Amt Saraswat and Ashsh San 2 Department
More informationJoint Statistical Meetings - Biopharmaceutical Section
Iteratve Ch-Square Test for Equvalence of Multple Treatment Groups Te-Hua Ng*, U.S. Food and Drug Admnstraton 1401 Rockvlle Pke, #200S, HFM-217, Rockvlle, MD 20852-1448 Key Words: Equvalence Testng; Actve
More informationYong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )
Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often
More informationA Novel Evolutionary Algorithm for Capacitor Placement in Distribution Systems
DOI.703/s40707-013-0003-x STF Journal of Engneerng Technology (JET), Vol. No. 3, Dec 013 A Novel Evolutonary Algorthm for Capactor Placement n Dstrbuton Systems J-Pyng Chou and Chung-Fu Chang Abstract
More informationLOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin
Proceedngs of the 007 Wnter Smulaton Conference S G Henderson, B Bller, M-H Hseh, J Shortle, J D Tew, and R R Barton, eds LOW BIAS INTEGRATED PATH ESTIMATORS James M Calvn Department of Computer Scence
More information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More informationA Simple Inventory System
A Smple Inventory System Lawrence M. Leems and Stephen K. Park, Dscrete-Event Smulaton: A Frst Course, Prentce Hall, 2006 Hu Chen Computer Scence Vrgna State Unversty Petersburg, Vrgna February 8, 2017
More informationA FAST HEURISTIC FOR TASKS ASSIGNMENT IN MANYCORE SYSTEMS WITH VOLTAGE-FREQUENCY ISLANDS
Shervn Haamn A FAST HEURISTIC FOR TASKS ASSIGNMENT IN MANYCORE SYSTEMS WITH VOLTAGE-FREQUENCY ISLANDS INTRODUCTION Increasng computatons n applcatons has led to faster processng. o Use more cores n a chp
More informationCHAPTER 2 MULTI-OBJECTIVE GENETIC ALGORITHM (MOGA) FOR OPTIMAL POWER FLOW PROBLEM INCLUDING VOLTAGE STABILITY
26 CHAPTER 2 MULTI-OBJECTIVE GENETIC ALGORITHM (MOGA) FOR OPTIMAL POWER FLOW PROBLEM INCLUDING VOLTAGE STABILITY 2.1 INTRODUCTION Voltage stablty enhancement s an mportant tas n power system operaton.
More informationTHE general problem tackled using an optimization
Hgh-Dmensonal Real-Parameter Optmzaton usng Self-Adaptve Dfferental Evoluton Algorthm wth Populaton Sze Reducton Janez Brest, Member, IEEE, Aleš Zamuda, Student Member, IEEE, BorkoBoškovć, Student Member,
More informationFuzzy Boundaries of Sample Selection Model
Proceedngs of the 9th WSES Internatonal Conference on ppled Mathematcs, Istanbul, Turkey, May 7-9, 006 (pp309-34) Fuzzy Boundares of Sample Selecton Model L. MUHMD SFIIH, NTON BDULBSH KMIL, M. T. BU OSMN
More informationLinear Regression Analysis: Terminology and Notation
ECON 35* -- Secton : Basc Concepts of Regresson Analyss (Page ) Lnear Regresson Analyss: Termnology and Notaton Consder the generc verson of the smple (two-varable) lnear regresson model. It s represented
More informationA Novel Hybrid Bat Algorithm for the Multilevel Thresholding Medical Image Segmentation
RESEARCH ARTICLE Copyrght 2015 Amercan Scentfc Publshers All rghts reserved Prnted n the Unted States of Amerca Journal of Medcal Imagng and Health Informatcs Vol. 5, 1 5, 2015 A Novel Hybrd Bat Algorthm
More informationAn Interactive Optimisation Tool for Allocation Problems
An Interactve Optmsaton ool for Allocaton Problems Fredr Bonäs, Joam Westerlund and apo Westerlund Process Desgn Laboratory, Faculty of echnology, Åbo Aadem Unversty, uru 20500, Fnland hs paper presents
More informationGeneralized Linear Methods
Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set
More informationLecture 4: November 17, Part 1 Single Buffer Management
Lecturer: Ad Rosén Algorthms for the anagement of Networs Fall 2003-2004 Lecture 4: November 7, 2003 Scrbe: Guy Grebla Part Sngle Buffer anagement In the prevous lecture we taled about the Combned Input
More informationTurbulence classification of load data by the frequency and severity of wind gusts. Oscar Moñux, DEWI GmbH Kevin Bleibler, DEWI GmbH
Turbulence classfcaton of load data by the frequency and severty of wnd gusts Introducton Oscar Moñux, DEWI GmbH Kevn Blebler, DEWI GmbH Durng the wnd turbne developng process, one of the most mportant
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationCS-433: Simulation and Modeling Modeling and Probability Review
CS-433: Smulaton and Modelng Modelng and Probablty Revew Exercse 1. (Probablty of Smple Events) Exercse 1.1 The owner of a camera shop receves a shpment of fve cameras from a camera manufacturer. Unknown
More informationA discrete differential evolution algorithm for multi-objective permutation flowshop scheduling
A dscrete dfferental evoluton algorthm for mult-objectve permutaton flowshop schedulng M. Baolett, A. Mlan, V. Santucc Dpartmento d Matematca e Informatca Unverstà degl Stud d Peruga Va Vanvtell, 1 Peruga,
More informationANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)
Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationMulti-Robot Formation Control Based on Leader-Follower Optimized by the IGA
IOSR Journal of Computer Engneerng (IOSR-JCE e-issn: 2278-0661,p-ISSN: 2278-8727, Volume 19, Issue 1, Ver. III (Jan.-Feb. 2017, PP 08-13 www.osrjournals.org Mult-Robot Formaton Control Based on Leader-Follower
More informationA new Approach for Solving Linear Ordinary Differential Equations
, ISSN 974-57X (Onlne), ISSN 974-5718 (Prnt), Vol. ; Issue No. 1; Year 14, Copyrght 13-14 by CESER PUBLICATIONS A new Approach for Solvng Lnear Ordnary Dfferental Equatons Fawz Abdelwahd Department of
More informationMODIFIED PARTICLE SWARM OPTIMIZATION FOR OPTIMIZATION PROBLEMS
Journal of Theoretcal and Appled Informaton Technology 3 st ecember 0. Vol. No. 005 0 JATIT & LLS. All rghts reserved. ISSN: 9985 www.jatt.org EISSN: 87395 MIFIE PARTICLE SARM PTIMIZATIN FR PTIMIZATIN
More information