Meta-heuristics for Multidimensional Knapsack Problems
|
|
- Jeffrey Gregory
- 5 years ago
- Views:
Transcription
1 2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department, The Unversty of Hull, Hull, UK Abstract. In ths research, we present the use of genetc algorthms and constrant handlng technques used n genetc algorthms to solve Multdmensonal Knapsack Problems (MKP). We also nvestgate and compare how the use of dfferent genetc algorthm operators and parameters could obtan dfferent solutons for the MKP. Three proposed genetc algorthms (basc GA, GA wth penalty functon1, and GA wth penalty functon2) are mplemented. The performance of these genetc algorthms s compared based on some small MKP. Fnally, a well-known MKP s modfed as a fcttous captal budgetng problem, and the results are reported. The experment results show that genetc algorthms are capable to solve MKP and captal budgetng problems. Keywords: Genetc Algorthm; Multdmensonal Knapsack Problem; Constrant Handlng Technques; Captal Budgetng Problem 1. Introducton The Multdmensonal Knapsack Problem (MKP) s a well-known NP-hard problem [1], whch arses n several practcal problems such as captal budgetng problem. The MKP can be defnes as follows: Maxmze p j x j (1) n j= 1 n Subject to rx b j j j= 1, = 1,, m, (2) x j {0,1}, j = 1,, n. (3) Where n s the number of tems, m s the number of constrants, p j 0 s the proft of the jth tem, r j 0, for = 1,, m, s the weght of the jth tem, and b 0, for = 1,, m, s the capacty of the knapsack. There are m constrants descrbed n equaton (2) and each of them s called a knapsack constrant, hence, the MKP s also called the m-dmensonal knapsack problem. Many practcal problems can be defned as a MKP. For example, n captal budgetng problem, project j has proft p j and consumes r j unts of resource. The goal s to fnd a subset of n projects such that the total proft s maxmzed wthout volatng all resource constrants. In last two decades, a number of papers nvolvng the use of Genetc Algorthms (GAs) to solve MKP. Genetc algorthms, sometmes called natural selecton, are search methods based on the prncples of survval of the fttest. It was ntroduced and orgnally developed extensvely by John Holland [6] n the + Correspondng author. Tel.: + (44) ; fax: +(44) E-mal address: Z.Man@2009.hull.ac.uk
2 mddle of 1970s. The readers are referred to [4, 5] for a detaled steps of constructon of a basc genetc algorthm. 2. Introducton of constrant handlng technques Constrants must not be volated. However, ether some encodng methods or after the use of recombnaton and mutaton operators, may cause llegal ndvduals. In many of the applcatons where GAs are ntended to be the problem of fndng a feasble soluton s tself NP-hard [2]. Mchalewcz [7] also ndcated that each evolutonary computaton technque used to a specfed problem should address the ssue of handlng unfeasble ndvduals. Two constrant handlng technques,.e., the use of penalty functons and repar algorthms wll be mplemented n our proposed GAs. (1) Penalty functons. One most advantage of penalty functon s that nfeasble solutons are allowed n a populaton so that one feasble and hghly ft soluton mght be generated by the combnaton of two nfeasble ndvduals. (2) Repar algorthm. In MKP, t s relatvely easy to repar an nfeasble soluton and transform t nto a feasble one. Repar functons are not only used to make an nfeasble soluton feasble, but also to mprove the ftness of solutons. 3. GAs for multdmensonal knapsack problem In ths secton, a complete mplementaton of genetc algorthms wll be ntroduced. The experments are based on those standard MKP test problems from OR-Lbrary ssued by [2] Populaton sze and ntal populaton For populaton sze, t s expected that the bgger the populaton s the better the results wll be found. However, a bgger populaton also leads to an addtonal computaton tme per generaton. We wll dscuss the dfferences between populaton sze equals to 100 and 200 later on. We adopt a random ntalsaton scheme n order to acheve suffcent dversfcaton. In the frst nstance, each of the ntal feasble soluton was randomly constructed. However, t s very dffcult to fnd a feasble soluton for those large test problems. We consder t s due to the fact that fndng a feasble soluton s tself NP-hard. Hence, a prmtve heurstc was used where a soluton wth all zeros s ntally generated and a varable s randomly selected repeatedly and set to one f the soluton s feasble. The heurstc termnates whle the selected varable cannot be added to the soluton. The pseudo-code for the ntalsaton as follows (see Algorthm 1). Algorthm 1. Intalse P(0) for the MKP Let: I = {1,, m} and J = {1,, n} ; Let: R = the accumulated resources of constrant n S ; /* S s soluton set*/ for k = 1 to N do set S k [ j] 0, j J ; set R = 0 ; set T J ; /*T s a dummy set*/ randomly select a j T and set T T j ; whle R + rj b, I do set S k [ j] 1; set R R + rj, I ; randomly select a j T and set T T j ; end whle end for
3 3.2. Selecton operators Parent selecton s the task of assgnng reproductve opportuntes to each ndvdual n the populaton. Two selecton strateges,.e., roulette-wheel selecton and tournament selecton, are mplemented n our experments and the expermental results wll be compared n secton Crossover operators The dea behnd the crossover s let offsprngs to nhert some both parents propertes. Two crossover operators are tested n our experment,.e., one-pont crossover and unform crossover Mutaton operator Once a chld soluton has been generated from crossover, a mutaton procedure s performed to change some selected bts n the chld soluton at random Replacement After applyng the above three operators, the new offsprngs have been generated. However, how to replace the old populaton (generaton) wth the new offsprngs s a queston. We adopt the steady-state-noduplcates strategy, whch replaces the worst one of the current populaton by the one new generated ndvdual, and checks that no duplcate offsprngs are added to the populaton. Ths adds the computatonal overhead but more search space s explored Penalty functons It s very lkely that one good soluton mght be generated by the combnaton of two nfeasble solutons. We tested two penalty functons (penalty functon 1 and 3) proposed n [9], and the experment results wll be analysed and dscussed n secton Construct the parameters and operators n GAs Table I shows the parameters and strateges used n our experments. Snce there s not one set of parameters that s sutable for all types of problems, we have to test durng the experment n order to fnd out the best set. Some of the parameters and strateges wll be set the same as those showed n the lterature [2, 3, and 8] snce they have been mproved to generate better solutons. 4. Experments and analysss Table. I: Parameters used n GAs parameters / strategy settng populaton sze 100 ntalsaton ntalse algorthm selecton (two optons) roulette wheel tournament (k = 2) crossover (two optons) one pont unform crossover probablty 0.9 mutaton bt flp mutaton probablty 2/n replacement strategy steady-state-no-duplcates stoppng crtera 6 run over 10 generatons mprovements penalty functon, repar operator, local mprovement operator 4.1. Selecton and crossover operators selecton We have conducted two selecton methods and two crossover methods. The am of ths experment s to fnd out one combnaton of these two methods n order to generate the best soluton. Fg. 1 shows the results based on one largest problem. In Fg. 1, the tournament selecton wth unform crossover ncreases fast and produces the best solutons. Hence, ths combnaton wll be chosen n our experment.
4 Fg. 1: Test case m=30, n=500, problem 29, proft wth dfferent selecton and crossover operators. Fg. 2: Test case m=30, n=500, problem 29, proft wth dfferent populaton szes Populaton sze selecton In ths secton, dfferent populaton szes (100 and 200) are tested based on some of largest problems. The fragment data for proft wth dfferent populaton szes from 10,000 to 1,000,000 generatons are dsplayed n Fg. 2. In Fg. 2, t can be seen that the genetc algorthm wth populaton sze equals to 200 ncreases faster and generates better solutons than those of populaton sze equals to 100. However, there s no sgnfcant gap between these two szes. We decde to choose 100 as the populaton sze to save experment tme Algorthms selecton Three GAs are mplemented n ths experment,.e., the basc GA, GA wth penalty functon 1, and GA wth penalty functon 2. The am of ths secton s to choose one of the best algorthms to solve the MKP. Fg. 3 shows the experment results n soluton qualty base on one small problem. Fg. 3: Dfferent GAs comparson regardng to proft based on problem WEISH13. For small problems, n most cases, classcal GA produces better performance snce t has the fastest ncrease at begnnng and fnds the optmal soluton very early. GA wth penalty functon 1 generally has the worst performance. GA wth penalty functon 2 also performed well n some cases. For example, n Fg. 3, the optmal soluton (proft: 6159) s found by both GA and GA wth penalty functon Case study In ths secton, we use the classcal GA to solve a smple fcttous captal budgetng problem. In order to smulate the real world captal budgetng problems, we add two more constrants to those orgnal constrants n MKP. One s called dependency constrant (e.g., f project 1 s chosen then project 5 should be chosen as well, and vce versa), the other s called exclusve constrant (e.g., f project 1 s selected then project 5 should not be selected, and vce versa). We smply change the problem SENTO1 (n OR-Lbrary, see the WWW address by addng the above constrants to a real captal budgetng problems. The experment result s shown as follows:
5 Frstly, before the extra constrants are added to ths problem, we found the well-known soluton values (7772) and the optmal soluton s dsplayed as follows: Next, the dependency constrant (project 1 and 5 are dependent n solutons) was added. The best soluton values (7703) were found after 10 runs. The best soluton s shown below, where both project 1 and 5 are selected: Fnally, the exclusve constrant (project 1 and 5 are exclusve n solutons) was added. Below s the optmal soluton (7772) we obtaned It s the same as the orgnal optmal soluton, because ths soluton s also feasble n exclusve case. Note that, ths s a smple example showng how to use GAs to solve real world project selecton and captal budgetng problems based on MKP. It s sure that there are more other complcated constrants n real world problems. 6. Summary and future work All three proposed GAs perform well for small problems. Although the best performance s obtaned from the classcal GA, t s hard to say whch s better compared wth others. Hence, further comparson s needed n large problems. Note that, although classcal GA performs well for small problems, some of the optmal solutons are not found. Ths means the performance of classcal GA need to mprove as well. Future work wll be based on testng the performance (both soluton qualty and CPU consumed tme) of GAs wth local mprovement. 7. References [1] Frevlle A., The multdmensonal 0 1 knapsack problem: An overvew, European Journal of Operatonal Research 155 (2004), pp [2] Chu P. and Beasley J., A genetc algorthm for the multdmensonal knapsack problem, Journal of Heurstcs 4 (1998), pp [3] Radl G.R., An mproved genetc algorthm for the multconstrant knapsack problem, n: Proceedngs of the 5th IEEE Internatonal Conference on Evolutonary Computaton, 1998, pp [4] Burke E. and Kendall G., Search Methodologes: Introductory tutorals n optmzaton and decson support technque, chapter , New York: Sprnger. [5] Negnevtsky M., Artfcal ntellgence: A gude to ntellgent systems. 2005, Harlow, England; New York: Addson-Wesley. [6] Holland J.H., Adaptaton n natural and artfcal systems: an ntroductory analyss wth applcatons to bology, control, and artfcal ntellgence. 1975, Ann Arbor: Unversty of Mchgan Press. [7] Mchalewcz Z., A survey of constrant handlng technques n evolutonary computaton Method. In 4th Annual Conference on Evolutonary Programmng. 1995, pp [8] Ackeln U., Genetc Algorthms for multple-choce Optmsaton Probems, n European Busness Management School. 1999, Unversty of Wales. [9] Djannaty F. and Doostdar S., A Hybrd Genetc Algorthm for the Multdmensonal Knapsack Problem, Int. J. Contemp. Math. Scences, Vol. 3, 2008, no. 9, pp
An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed
More informationPARETO BAYESIAN OPTIMIZATION ALGORITHM FOR THE MULTIOBJECTIVE 0/1 KNAPSACK PROBLEM
PARETO BAYESIAN OPTIMIZATION ALGORITHM FOR THE MULTIOBJECTIVE 0/ KNAPSACK PROBLEM Josef Schwarz Jří Očenáše Brno Unversty of Technology Faculty of Engneerng and Computer Scence Department of Computer Scence
More informationDetermining the Optimal Bandwidth Based on Multi-criterion Fusion
Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn
More informationSum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints
Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan
More informationSmoothing Spline ANOVA for variable screening
Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationNGPM -- A NSGA-II Program in Matlab
Verson 1.4 LIN Song Aerospace Structural Dynamcs Research Laboratory College of Astronautcs, Northwestern Polytechncal Unversty, Chna Emal: lsssswc@163.com 2011-07-26 Contents Contents... 1. Introducton...
More informationGSLM Operations Research II Fall 13/14
GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are
More informationMaximum Variance Combined with Adaptive Genetic Algorithm for Infrared Image Segmentation
Internatonal Conference on Logstcs Engneerng, Management and Computer Scence (LEMCS 5) Maxmum Varance Combned wth Adaptve Genetc Algorthm for Infrared Image Segmentaton Huxuan Fu College of Automaton Harbn
More informationAn Efficient Genetic Algorithm Based Approach for the Minimum Graph Bisection Problem
118 An Effcent Genetc Algorthm Based Approach for the Mnmum Graph Bsecton Problem Zh-Qang Chen, Rong-Long WAG and Kozo OKAZAKI Faculty of Engneerng, Unversty of Fuku, Bunkyo 3-9-1,Fuku-sh, Japan 910-8507
More informationSolving two-person zero-sum game by Matlab
Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by
More informationCHAPTER 4 OPTIMIZATION TECHNIQUES
48 CHAPTER 4 OPTIMIZATION TECHNIQUES 4.1 INTRODUCTION Unfortunately no sngle optmzaton algorthm exsts that can be appled effcently to all types of problems. The method chosen for any partcular case wll
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationA GENETIC ALGORITHM FOR PROCESS SCHEDULING IN DISTRIBUTED OPERATING SYSTEMS CONSIDERING LOAD BALANCING
A GENETIC ALGORITHM FOR PROCESS SCHEDULING IN DISTRIBUTED OPERATING SYSTEMS CONSIDERING LOAD BALANCING M. Nkravan and M. H. Kashan Department of Electrcal Computer Islamc Azad Unversty, Shahrar Shahreqods
More informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationS1 Note. Basis functions.
S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type
More informationAN IMPROVED GENETIC ALGORITHM FOR RECTANGLES CUTTING & PACKING PROBLEM. Wang Shoukun, Wang Jingchun, Jin Yihui
Copyrght 2002 IFAC 5th Trennal World Congress, Barcelona, Span A IPROVED GEETIC ALGORITH FOR RECTAGLES CUTTIG & PACKIG PROBLE Wang Shouun, Wang Jngchun, Jn Yhu Tsnghua Unversty, Beng 00084, P. R. Chna
More informationDegree-Constrained Minimum Spanning Tree Problem Using Genetic Algorithm
Degree-Constraned Mnmum Spannng Tree Problem Usng Genetc Algorthm Keke Lu, Zhenxang Chen, Ath Abraham *, Wene Cao and Shan Jng Shandong Provncal Key Laboratory of Network Based Intellgent Computng Unversty
More informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationOn the Virtues of Parameterized Uniform Crossover
On the Vrtues of Parameterzed Unform Crossover Wllam M. Spears Naval Research aboratory Washngton, D.C. 20375 USA spears@ac.nrl.navy.ml Kenneth A. De Jong George Mason Unversty Farfax, VA 22030 USA kdejong@ac.gmu.edu
More informationKent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming
CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems
More informationNUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More informationA mathematical programming approach to the analysis, design and scheduling of offshore oilfields
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and
More informationWishing you all a Total Quality New Year!
Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma
More informationComplexity Analysis of Problem-Dimension Using PSO
Proceedngs of the 7th WSEAS Internatonal Conference on Evolutonary Computng, Cavtat, Croata, June -4, 6 (pp45-5) Complexty Analyss of Problem-Dmenson Usng PSO BUTHAINAH S. AL-KAZEMI AND SAMI J. HABIB,
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationCHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION
24 CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION The present chapter proposes an IPSO approach for multprocessor task schedulng problem wth two classfcatons, namely, statc ndependent tasks and
More informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
More informationA Serial and Parallel Genetic Based Learning Algorithm for Bayesian Classifier to Predict Metabolic Syndrome
A Seral and Parallel Genetc Based Learnng Algorthm for Bayesan Classfer to Predct Metabolc Syndrome S. Dehur Department of Informaton and Communcaton Technology Fakr Mohan Unversty, Vyasa Vhar Balasore-756019,
More informationA Novel Approach for an Early Test Case Generation using Genetic Algorithm and Dominance Concept based on Use cases
Alekhya Varkut et al, / (IJCSIT) Internatonal Journal of Computer Scence and Informaton Technologes, Vol. 3 (3), 2012,4218-4224 A Novel Approach for an Early Test Case Generaton usng Genetc Algorthm and
More informationReliable and Efficient Routing Using Adaptive Genetic Algorithm in Packet Switched Networks
IJCSI Internatonal Journal of Computer Scence Issues, Vol. 9, Issue 1, No 3, January 2012 ISSN (Onlne): 1694-0814 www.ijcsi.org 168 Relable and Effcent Routng Usng Adaptve Genetc Algorthm n Packet Swtched
More informationSENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR
SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR Judth Aronow Rchard Jarvnen Independent Consultant Dept of Math/Stat 559 Frost Wnona State Unversty Beaumont, TX 7776 Wnona, MN 55987 aronowju@hal.lamar.edu
More informationDiscrete Cosine Transform Optimization in Image Compression Based on Genetic Algorithm
015 8th Internatonal Congress on Image and Sgnal Processng (CISP 015) Dscrete Cosne Transform Optmzaton n Image Compresson Based on Genetc Algorthm LIU Yuan-yuan 1 CHE He-xn 1 College of Communcaton Engneerng,
More informationResearch on Kruskal Crossover Genetic Algorithm for Multi- Objective Logistics Distribution Path Optimization
, pp.367-378 http://dx.do.org/.14257/jmue.215..8.36 Research on Kruskal Crossover Genetc Algorthm for Mult- Objectve Logstcs Dstrbuton Path Optmzaton Yan Zhang 1,2, Xng-y Wu 1 and Oh-kyoung Kwon 2, a,
More informationIntra-Parametric Analysis of a Fuzzy MOLP
Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral
More informationProblem Definitions and Evaluation Criteria for Computational Expensive Optimization
Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty
More informationThe Codesign Challenge
ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.
More informationHybrid Heuristics for the Maximum Diversity Problem
Hybrd Heurstcs for the Maxmum Dversty Problem MICAEL GALLEGO Departamento de Informátca, Estadístca y Telemátca, Unversdad Rey Juan Carlos, Span. Mcael.Gallego@urjc.es ABRAHAM DUARTE Departamento de Informátca,
More informationA Hybrid Genetic Algorithm for Routing Optimization in IP Networks Utilizing Bandwidth and Delay Metrics
A Hybrd Genetc Algorthm for Routng Optmzaton n IP Networks Utlzng Bandwdth and Delay Metrcs Anton Redl Insttute of Communcaton Networks, Munch Unversty of Technology, Arcsstr. 21, 80290 Munch, Germany
More informationGA-Based Learning Algorithms to Identify Fuzzy Rules for Fuzzy Neural Networks
Seventh Internatonal Conference on Intellgent Systems Desgn and Applcatons GA-Based Learnng Algorthms to Identfy Fuzzy Rules for Fuzzy Neural Networks K Almejall, K Dahal, Member IEEE, and A Hossan, Member
More informationDesign of Structure Optimization with APDL
Desgn of Structure Optmzaton wth APDL Yanyun School of Cvl Engneerng and Archtecture, East Chna Jaotong Unversty Nanchang 330013 Chna Abstract In ths paper, the desgn process of structure optmzaton wth
More informationAn Efficient Genetic Algorithm with Fuzzy c-means Clustering for Traveling Salesman Problem
An Effcent Genetc Algorthm wth Fuzzy c-means Clusterng for Travelng Salesman Problem Jong-Won Yoon and Sung-Bae Cho Dept. of Computer Scence Yonse Unversty Seoul, Korea jwyoon@sclab.yonse.ac.r, sbcho@cs.yonse.ac.r
More informationBiostatistics 615/815
The E-M Algorthm Bostatstcs 615/815 Lecture 17 Last Lecture: The Smplex Method General method for optmzaton Makes few assumptons about functon Crawls towards mnmum Some recommendatons Multple startng ponts
More informationK-means Optimization Clustering Algorithm Based on Hybrid PSO/GA Optimization and CS validity index
Orgnal Artcle Prnt ISSN: 3-6379 Onlne ISSN: 3-595X DOI: 0.7354/jss/07/33 K-means Optmzaton Clusterng Algorthm Based on Hybrd PSO/GA Optmzaton and CS valdty ndex K Jahanbn *, F Rahmanan, H Rezae 3, Y Farhang
More informationClustering Algorithm Combining CPSO with K-Means Chunqin Gu 1, a, Qian Tao 2, b
Internatonal Conference on Advances n Mechancal Engneerng and Industral Informatcs (AMEII 05) Clusterng Algorthm Combnng CPSO wth K-Means Chunqn Gu, a, Qan Tao, b Department of Informaton Scence, Zhongka
More informationCracking of the Merkle Hellman Cryptosystem Using Genetic Algorithm
Crackng of the Merkle Hellman Cryptosystem Usng Genetc Algorthm Zurab Kochladze 1 * & Lal Besela 2 1 Ivane Javakhshvl Tbls State Unversty, 1, I.Chavchavadze av 1, 0128, Tbls, Georga 2 Sokhum State Unversty,
More informationAnt Colony Optimization Applied to Minimum Weight Dominating Set Problem
Ant Colony Optmzaton Appled to Mnmum Weght Domnatng Set Problem Raa JOVANOVIC Mlan TUBA Dana SIMIAN Texas AM Unversty Faculty of Computer Scence Department of Computer Scence at Qatar Megatrend Unversty
More informationAn Evolvable Clustering Based Algorithm to Learn Distance Function for Supervised Environment
IJCSI Internatonal Journal of Computer Scence Issues, Vol. 7, Issue 5, September 2010 ISSN (Onlne): 1694-0814 www.ijcsi.org 374 An Evolvable Clusterng Based Algorthm to Learn Dstance Functon for Supervsed
More informationMIXED INTEGER-DISCRETE-CONTINUOUS OPTIMIZATION BY DIFFERENTIAL EVOLUTION Part 1: the optimization method
MIED INTEGER-DISCRETE-CONTINUOUS OPTIMIZATION BY DIFFERENTIAL EVOLUTION Part : the optmzaton method Joun Lampnen Unversty of Vaasa Department of Informaton Technology and Producton Economcs P. O. Box 700
More informationVirtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory
Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memory-management methods normally requres the entre process
More informationConcurrent Apriori Data Mining Algorithms
Concurrent Apror Data Mnng Algorthms Vassl Halatchev Department of Electrcal Engneerng and Computer Scence York Unversty, Toronto October 8, 2015 Outlne Why t s mportant Introducton to Assocaton Rule Mnng
More informationEVALUATION OF THE PERFORMANCES OF ARTIFICIAL BEE COLONY AND INVASIVE WEED OPTIMIZATION ALGORITHMS ON THE MODIFIED BENCHMARK FUNCTIONS
Academc Research Internatonal ISS-L: 3-9553, ISS: 3-9944 Vol., o. 3, May 0 EVALUATIO OF THE PERFORMACES OF ARTIFICIAL BEE COLOY AD IVASIVE WEED OPTIMIZATIO ALGORITHMS O THE MODIFIED BECHMARK FUCTIOS Dlay
More informationA Method to Improve Routing and Determining the Shortest Traveling Pathway between PADs in the Automatic Drilling of PCBs Based on Genetic Algorithm
A Method to Improve Routng and Determnng the Shortest Travelng Pathway between PADs n the Automatc Drllng of PCBs Based on Genetc Algorthm A.R. MohammadnaOranj 1 A. Khademzadeh 2 A. Jall Iran 3 H. Ebrahman
More informationResearch of Neural Network Classifier Based on FCM and PSO for Breast Cancer Classification
Research of Neural Network Classfer Based on FCM and PSO for Breast Cancer Classfcaton Le Zhang 1, Ln Wang 1, Xujewen Wang 2, Keke Lu 2, and Ajth Abraham 3 1 Shandong Provncal Key Laboratory of Network
More informationMathematics 256 a course in differential equations for engineering students
Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the
More informationOPTIMIZATION OF SKELETAL STRUCTURES USING IMPROVED GENETIC ALGORITHM BASED ON PROPOSED SAMPLING SEARCH SPACE IDEA
INTERNATIONAL JOURNAL OF OPTIMIZATION IN CIVIL ENGINEERING Int. J. Optm. Cvl Eng., 2018; 8(3): 415-432 OPTIMIZATION OF SKELETAL STRUCTURES USING IMPROVED GENETIC ALGORITHM BASED ON PROPOSED SAMPLING SEARCH
More informationTPL-Aware Displacement-driven Detailed Placement Refinement with Coloring Constraints
TPL-ware Dsplacement-drven Detaled Placement Refnement wth Colorng Constrants Tao Ln Iowa State Unversty tln@astate.edu Chrs Chu Iowa State Unversty cnchu@astate.edu BSTRCT To mnmze the effect of process
More informationEdge Detection in Noisy Images Using the Support Vector Machines
Edge Detecton n Nosy Images Usng the Support Vector Machnes Hlaro Gómez-Moreno, Saturnno Maldonado-Bascón, Francsco López-Ferreras Sgnal Theory and Communcatons Department. Unversty of Alcalá Crta. Madrd-Barcelona
More informationPhenotype Building Blocks and Geometric Crossover in Structural Optimisation
Paper 5 Cvl-Comp Press, 22 Proceedngs of the Eghth Internatonal Conference on Engneerng Computatonal Technology, B.H.V. Toppng, (Edtor), Cvl-Comp Press, Strlngshre, Scotland Phenotype Buldng Blocks and
More informationThe Research of Support Vector Machine in Agricultural Data Classification
The Research of Support Vector Machne n Agrcultural Data Classfcaton Le Sh, Qguo Duan, Xnmng Ma, Me Weng College of Informaton and Management Scence, HeNan Agrcultural Unversty, Zhengzhou 45000 Chna Zhengzhou
More informationElsevier Editorial System(tm) for Expert Systems With Applications Manuscript Draft
Elsever Edtoral System(tm) for Expert Systems Wth Applcatons Manuscrpt Draft Manuscrpt Number: ESWA-D-08-00701 tle: An Ordnal Optmzaton heory Based Algorthm for a Class of Smulaton Optmzaton Problems and
More informationAPPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT
3. - 5. 5., Brno, Czech Republc, EU APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT Abstract Josef TOŠENOVSKÝ ) Lenka MONSPORTOVÁ ) Flp TOŠENOVSKÝ
More informationJournal of Chemical and Pharmaceutical Research, 2014, 6(6): Research Article. A selective ensemble classification method on microarray data
Avalable onlne www.ocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(6):2860-2866 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 A selectve ensemble classfcaton method on mcroarray
More informationA Facet Generation Procedure. for solving 0/1 integer programs
A Facet Generaton Procedure for solvng 0/ nteger programs by Gyana R. Parja IBM Corporaton, Poughkeepse, NY 260 Radu Gaddov Emery Worldwde Arlnes, Vandala, Oho 45377 and Wlbert E. Wlhelm Teas A&M Unversty,
More informationHigh-Boost Mesh Filtering for 3-D Shape Enhancement
Hgh-Boost Mesh Flterng for 3-D Shape Enhancement Hrokazu Yagou Λ Alexander Belyaev y Damng We z Λ y z ; ; Shape Modelng Laboratory, Unversty of Azu, Azu-Wakamatsu 965-8580 Japan y Computer Graphcs Group,
More informationK-means and Hierarchical Clustering
Note to other teachers and users of these sldes. Andrew would be delghted f you found ths source materal useful n gvng your own lectures. Feel free to use these sldes verbatm, or to modfy them to ft your
More informationQuality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation
Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationRecommended Items Rating Prediction based on RBF Neural Network Optimized by PSO Algorithm
Recommended Items Ratng Predcton based on RBF Neural Network Optmzed by PSO Algorthm Chengfang Tan, Cayn Wang, Yuln L and Xx Q Abstract In order to mtgate the data sparsty and cold-start problems of recommendaton
More informationSLAM Summer School 2006 Practical 2: SLAM using Monocular Vision
SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,
More informationConfiguration Management in Multi-Context Reconfigurable Systems for Simultaneous Performance and Power Optimizations*
Confguraton Management n Mult-Context Reconfgurable Systems for Smultaneous Performance and Power Optmzatons* Rafael Maestre, Mlagros Fernandez Departamento de Arqutectura de Computadores y Automátca Unversdad
More informationSpam Filtering Based on Support Vector Machines with Taguchi Method for Parameter Selection
E-mal Spam Flterng Based on Support Vector Machnes wth Taguch Method for Parameter Selecton We-Chh Hsu, Tsan-Yng Yu E-mal Spam Flterng Based on Support Vector Machnes wth Taguch Method for Parameter Selecton
More informationAvailable online at Available online at Advanced in Control Engineering and Information Science
Avalable onlne at wwwscencedrectcom Avalable onlne at wwwscencedrectcom Proceda Proceda Engneerng Engneerng 00 (2011) 15000 000 (2011) 1642 1646 Proceda Engneerng wwwelsevercom/locate/proceda Advanced
More informationResolving Ambiguity in Depth Extraction for Motion Capture using Genetic Algorithm
Resolvng Ambguty n Depth Extracton for Moton Capture usng Genetc Algorthm Yn Yee Wa, Ch Kn Chow, Tong Lee Computer Vson and Image Processng Laboratory Dept. of Electronc Engneerng The Chnese Unversty of
More informationProgramming in Fortran 90 : 2017/2018
Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values
More informationOptimization of Truss Structures Using Genetic Algorithms with Domain Trimming (GADT)
Optmzaton of Truss Structures Usng Genetc Algorthms wth Doman Trmmng (GADT) Samer Barakat and Omar Nassf Abstract Ths paper presents evolutonary-based least-weght optmzaton procedure for desgnng truss
More information5 The Primal-Dual Method
5 The Prmal-Dual Method Orgnally desgned as a method for solvng lnear programs, where t reduces weghted optmzaton problems to smpler combnatoral ones, the prmal-dual method (PDM) has receved much attenton
More informationTsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance
Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for
More informationOptimization of integrated circuits by means of simulated annealing. Jernej Olenšek, Janez Puhan, Árpád Bűrmen, Sašo Tomažič, Tadej Tuma
Optmzaton of ntegrated crcuts by means of smulated annealng Jernej Olenšek, Janez Puhan, Árpád Bűrmen, Sašo Tomažč, Tadej Tuma Unversty of Ljubljana, Faculty of Electrcal Engneerng, Tržaška 25, Ljubljana,
More informationEECS 730 Introduction to Bioinformatics Sequence Alignment. Luke Huan Electrical Engineering and Computer Science
EECS 730 Introducton to Bonformatcs Sequence Algnment Luke Huan Electrcal Engneerng and Computer Scence http://people.eecs.ku.edu/~huan/ HMM Π s a set of states Transton Probabltes a kl Pr( l 1 k Probablty
More informationYuan Xu School of automation, Northwestern Polytechnical University, Xian , China. Huifeng Xue. Ailong Liu*
Rev. Téc. Ing. Unv. Zula. Vol. 39, Nº 7, 80-86, 2016 do:10.21311/001.39.7.10 A Parallel Genetc Algorthm for the Verfyng Smulaton of the Performance Prototype Yuan Xu School of automaton, Northwestern Polytechncal
More informationLearning-Based Top-N Selection Query Evaluation over Relational Databases
Learnng-Based Top-N Selecton Query Evaluaton over Relatonal Databases Lang Zhu *, Wey Meng ** * School of Mathematcs and Computer Scence, Hebe Unversty, Baodng, Hebe 071002, Chna, zhu@mal.hbu.edu.cn **
More informationX- Chart Using ANOM Approach
ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are
More informationexpermental results on NRP nstances. Secton V dscusses some related wor and Secton VI concludes ths paper. II. PRELIMINARIES Ths secton gves the defnt
A Hybrd ACO Algorthm for the Next Release Problem He Jang School of Software Dalan Unversty of Technology Dalan 116621, Chna janghe@dlut.edu.cn Jngyuan Zhang School of Software Dalan Unversty of Technology
More informationImproving Low Density Parity Check Codes Over the Erasure Channel. The Nelder Mead Downhill Simplex Method. Scott Stransky
Improvng Low Densty Party Check Codes Over the Erasure Channel The Nelder Mead Downhll Smplex Method Scott Stransky Programmng n conjuncton wth: Bors Cukalovc 18.413 Fnal Project Sprng 2004 Page 1 Abstract
More informationA Load-balancing and Energy-aware Clustering Algorithm in Wireless Ad-hoc Networks
A Load-balancng and Energy-aware Clusterng Algorthm n Wreless Ad-hoc Networks Wang Jn, Shu Le, Jnsung Cho, Young-Koo Lee, Sungyoung Lee, Yonl Zhong Department of Computer Engneerng Kyung Hee Unversty,
More informationContent Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers
IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth
More informationAssignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.
Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton
More informationSHAPE OPTIMIZATION OF STRUCTURES BY MODIFIED HARMONY SEARCH
INTERNATIONAL JOURNAL OF OPTIMIZATION IN CIVIL ENGINEERING Int. J. Optm. Cvl Eng., 2011; 3:485-494 SHAPE OPTIMIZATION OF STRUCTURES BY MODIFIED HARMONY SEARCH S. Gholzadeh *,, A. Barzegar and Ch. Gheyratmand
More informationLoad Balancing for Hex-Cell Interconnection Network
Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,
More informationOptimal Scheduling of Capture Times in a Multiple Capture Imaging System
Optmal Schedulng of Capture Tmes n a Multple Capture Imagng System Tng Chen and Abbas El Gamal Informaton Systems Laboratory Department of Electrcal Engneerng Stanford Unversty Stanford, Calforna 9435,
More informationSolitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis
Internatonal Mathematcal Forum, Vol. 6,, no. 7, 8 Soltary and Travelng Wave Solutons to a Model of Long Range ffuson Involvng Flux wth Stablty Analyss Manar A. Al-Qudah Math epartment, Rabgh Faculty of
More informationType-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data
Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES
More informationMulti-objective Optimization Using Self-adaptive Differential Evolution Algorithm
Mult-objectve Optmzaton Usng Self-adaptve Dfferental Evoluton Algorthm V. L. Huang, S. Z. Zhao, R. Mallpedd and P. N. Suganthan Abstract - In ths paper, we propose a Multobjectve Self-adaptve Dfferental
More informationA fast algorithm for color image segmentation
Unersty of Wollongong Research Onlne Faculty of Informatcs - Papers (Arche) Faculty of Engneerng and Informaton Scences 006 A fast algorthm for color mage segmentaton L. Dong Unersty of Wollongong, lju@uow.edu.au
More informationA fair buffer allocation scheme
A far buffer allocaton scheme Juha Henanen and Kalev Klkk Telecom Fnland P.O. Box 228, SF-330 Tampere, Fnland E-mal: juha.henanen@tele.f Abstract An approprate servce for data traffc n ATM networks requres
More informationA Genetic Programming-PCA Hybrid Face Recognition Algorithm
Journal of Sgnal and Informaton Processng, 20, 2, 70-74 do:0.4236/jsp.20.23022 Publshed Onlne August 20 (http://www.scrp.org/journal/jsp) A Genetc Programmng-PCA Hybrd Face Recognton Algorthm Behzad Bozorgtabar,
More informationAN EFFICIENT AND ROBUST GENETIC ALGORITHM APPROACH FOR AUTOMATED MAP LABELING
AN EFFICIENT AND ROBUST GENETIC ALGORITHM APPROACH FOR AUTOMATED MAP LABELING Fan Hong * Lu Kaun 2 Zhang Zuxun Natonal Laboratory of Informaton Engneerng n Surveyng Mappng and Remote Sensng of Wuhan Unversty
More informationRandom Kernel Perceptron on ATTiny2313 Microcontroller
Random Kernel Perceptron on ATTny233 Mcrocontroller Nemanja Djurc Department of Computer and Informaton Scences, Temple Unversty Phladelpha, PA 922, USA nemanja.djurc@temple.edu Slobodan Vucetc Department
More informationA New Token Allocation Algorithm for TCP Traffic in Diffserv Network
A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network S. Sudha and N. Ammasagounden Natonal Insttute of Technology, Truchrappall,
More information