SIMULATION OPTIMIZER AND OPTIMIZATION METHODS TESTING ON DISCRETE EVENT SIMULATIONS MODELS AND TESTING FUNCTIONS
|
|
- Harry Giles Austin
- 6 years ago
- Views:
Transcription
1 SIMULATION OPTIMIZER AND OPTIMIZATION METHODS TESTING ON DISCRETE EVENT SIMULATIONS MODELS AND TESTING UNCTIONS Pavel Raska (a), Zdenek Ulrych (b), Petr Horesi (c) (a) Department o Industrial Engineering - aculty o Mechanical Engineering, University o West Bohemia, Univerzitni, Pilsen (b) Department o Industrial Engineering - aculty o Mechanical Engineering, University o West Bohemia, Univerzitni, Pilsen (c) Department o Industrial Engineering - aculty o Mechanical Engineering, University o West Bohemia, Univerzitni, Pilsen (a) praska@kpv.zcu.cz, (b) ulrychz@kpv.zcu.cz, (c) tucnak@kpv.zcu.cz ABSTRACT The paper deals with testing o selected optimization methods used or optimization o speciied obective unctions o three discrete event simulation models and our selected testing unctions. The developed simulation optimizer uses modiied optimization methods which automatically adapt input parameters o discrete event simulation models. Random Search, Hill Climbing, Tabu Search, Local Search, Downhill Simplex, Simulated Annealing, Dierential Evolution and Evolution Strategy were modiied in such a way that they are applicable or discrete event simulation optimization purposes. The other part o the application is ocused on testing the implemented optimization methods. We have proposed some evaluation techniques which express the success o the optimization method in dierent ways. These techniques use calculated box plot characteristics rom the series o optimization experiments. Keywords: simulation optimization, heuristic optimization methods, discrete event simulation models, testing unction 1. INTRODUCTION Many o today s industrial companies try to design their own production system as eectively as possible. The problem is that this intention is aected by many actors. We can say the problem is NP-a hard problem in most cases. A possible answer to the problem is using discrete event simulation and simulation optimization. The use o discrete event simulation ocuses on the invisible problems in the production system many times and also avoids bad decisions made by the human actor. The next question is eectively inding a suitable solution to the modelled problem. We can use a simulation optimizer to ind an optimal/suboptimal easible solution respecting the deined model constraints. The basic problem o global optimization can be ormulated as ollows: X ~ ~ X arg min ~ X X : X X X X (1) where X X X denotes the global minimum o the obective X unction; denotes the obective unction value o the candidate solution the range includes real X ~ numbers; denotes the Search space. This optimal solution is represented by the best coniguration (input parameters values) o the simulation model. Current simulation sotware (Arena, Witness, PlantSimulation etc.) uses its own simulation optimizers. These integrated optimization modules are black-boxes but many o them use similar optimization methods. We have tested the ollowing optimization methods: Random Search, Hill Climbing, Tabu Search, Local Search, Downhill Simplex, Simulated Annealing, Dierential Evolution and Evolution Strategy. These methods were modiied in such a way that they are applicable or discrete event simulation optimization purposes. The goal o our research is to compare some o these widely used optimization methods. Hence we have designed our own simulation optimizer. We have to say that it is not possible to implement exactly the same optimization methods which are used in these simulation optimizers. Another reason or testing the optimization methods and designing our own simulation optimizer was that our department ocuses on modelling and optimizing production and non-production processes in industrial companies (Kopecek, 01; Votava, Ulrych, Edl, Korecky and Trkovsky, 008). Some proects have to be solved with diiculty without the use o special simulation optimization tools because o the large complexity o the discrete event simulation model. The problem is that some integrated simulation optimizers cannot aect all the parameter types o the designed simulation model. Proceedings o the European Modeling and Simulation Symposium, 01 50
2 . SELECTED OPTIMIZATION METHODS We have transormed some o the selected optimization methods to use the principle o evolutionary algorithms. These optimization methods generate a whole population (instead o one possible solution) in order to avoid getting stuck on a local optimum. Previous testing o optimization methods conirms that generating one solution leads to premature convergence in most cases (depending on obective unction type). Dierent variants o selected optimization methods obtained rom a literature review were united into the algorithm. The user can combine dierent variants o optimization methods by setting the optimization method parameters..1. Random Search A new candidate solution is generated in the search space with uniorm distribution (Monte Carlo method). This method is suitable or cases where the user has no inormation about the obective unction type. The user is able to perorm a number o simulation experiments... Downhill Simplex This method uses a set o n + 1 linearly independent candidate solutions (n denotes search space dimension) - Simplex. The method uses our basic phases Relection, Expansion, Contraction and Reduction. (Tvrdík 004; Weise 009).. Stochastic Hill Climbing Candidate solutions are generated (populated) in the neighbourhood o the best candidate solution rom the previous population. Generating new possible solutions is perormed by mutation. This method belongs to the amily o local search methods..4. Stochastic Tabu Search The newly generated candidate solution is an element o the Tabu List during the optimization process. This candidate solution cannot be visited again i the aspiration criterion is not satisied (this eature prevents the method rom becoming stuck at a local optimum). The method uses the IO method o removing the candidate solution rom the Tabu List. The user can set whether the new candidate solution is generated using mutation o the best candidate solution rom the previous population or the new solution is generated using mutation o the best ound candidate solution. (Monticelli, Romero and Asada 008; Weise 009).5. Stochastic Simulated Annealing A candidate solution is generated in the neighbourhood o the candidate solution rom the previous iteration. This generating could be perormed through the mutation o a randomly selected gene or through the mutation o all genes. Acceptance o the worse candidate solution depends on the temperature. Temperature is reduced i the random number is smaller than the acceptance probability or the temperature is reduced i and only i a worse candidate solution is generated. I the temperature alls below the speciied minimum temperature, temperature is set to the initial temperature. (Monticelli, Romero and Asada 008; Weise 009).6. Stochastic Local Search A candidate solution is generated in the neighbourhood o the best candidate solution..7. Evolution Strategy This optimization method uses Steady State Evolution population consists o children and parents with good itness. A candidate solution (child) is generated in the neighbourhood o the candidate solution (parent) and it is based on the Rechenberg 1/5th-rule. The population is sorted according to the obective values (Rank-Based itness Assignment). The optimization method uses Tournament selection. (Koblasa, Manlig and Vavruska 01; Miranda 008; Tvrdík 004).8. Dierential Evolution Selection is carried out between the parent and its ospring. The ospring is created through a crossover between the parent and the new candidate solution (individual) which was created through the mutation o our selected individuals and the best one selected rom the population BEST method. The optimization method uses General Evolution and the Ali and Törn adaptive rule. The user can deine the probability o a crossover between the new candidate solution and the parent. (Tvrdík 004; Wong, Dong, 008). DEVELOPED APPLICATION We have developed our own simulation optimization application which addresses the problems listed in the irst chapter. The application contains seven dierent global optimization methods. This application contains two modules. The irst module is a simulation optimizer which enables optimization o developed simulation models in ARENA or PlantSimulation simulation sotware. The obective unction o the models is speciied within the discrete simulation models. The user can also test a speciied obective unction without the need o creating the simulation model igure 1. Best ound solution obective unction value Speciied constraints Optimization process Evolution Strategy Speciied obective unction igure 1: Graphical user interace o simulation optimizer - irst module Proceedings o the European Modeling and Simulation Symposium, 01 51
3 The application was created in Visual Basic 010. This programming language was used or connection to ARENA simulation sotware and Microsot Access database. The data rom simulation experiments results and settings are stored in this database. The ile contains inormation about: 1. Controls identiication, names, low and high boundaries, type (discrete vs. continuous), initial values o controls and comments.. Constraints speciication o the constraint unction through using the mathematical operator buttons and the list o controls. User can validate the built expression.. Obective unction - speciication o the obective unction without the need o a simulation sotware tool. Obective unction is composed o mathematical operators and selected controls rom the list o all controls. User can validate the built expression. 4. Optimization experiment setting minimization vs. maximization o obective unction, Termination criterion (Value to reach, number o simulation experiments, speciied time, sub-optimum improvement ratio etc.), parameters settings o selected optimization method, low and high boundaries o selected optimization method parameters, number o replications, creation o a knowledge base o a simulation model, etc. The second module is designed or testing the behaviour o the implemented optimization method in terms o setting the parameters or the optimization method. The user can speciy the range o optimization method parameters. Ater inishing the number o optimization experiments replications (series o concrete optimization method setting) the data are exported to MS Excel workbook. We have also developed an application which enables D visualization o simulation experiments when there are two controls and one obective unction. Simulation experiments are represented by the points in the D chart o the obective unction. The obective unction surace is generated rom the data obtained rom simulation experiments. Another possibility is to generate a whole D chart rom the data obtained rom the simulation runs o all possible settings o the simulation model input parameters complete search space. 4. DISCRETE EVENT SIMULATION MODELS AND OBJECTIVE UNCTIONS The testing o optimization methods which search or global optima was applied to three discrete event simulation models. These models relect real production systems o industrial companies. Discrete event simulation models were built in Arena simulation sotware. We speciied dierent obective unctions considering the simulated system. All possible solutions and their obective unction values were mapped to ind the global optimum in the search space The Manuacturing System and Logistics This discrete event simulation model represents the production o dierent types o car lights in a whole production system. The complex simulation model describes many processes; or example, logistics in three warehouses, production lines, 8 assembly lines, painting, etc. The obective unction is aected by the sum o the average utilization o all assembly lines and average transport utilization. The obective unction is maximized. Controls are the number o orklits responsible or: transport o small parts rom the warehouse to the production lines and assembly lines, transport o large parts rom the warehouse to the assembly lines and the transport o the inal product rom the assembly lines to the warehouse. The obective unction landscape o this model when the number o orklits or transport o large parts = 14 is shown in igure. Obective unction value Number o orklits - inal parts Number o orklits - inal parts igure : Obective unction - The Manuacturing System And Logistics Discrete Event Simulation Model - Number o orklits or Large Parts = The Penalty This simulation model represents a production line which consists o eight workstations. Each workstation contains a dierent number o machines. Each product has a speciic sequence o manuacturing processes and machining times. The product is penalized i the product exceeds the speciied production time. A penalty also occurs i the production time value is smaller than the speciied constant. The penalty unction is shown in igure where T denotes production time; T min denotes required minimum production time; T max denotes required maximum production time; T crit denotes critical production time; k denotes the penalty or early production (slope o the line - constant); k denotes the penalty or exceeding 1 the speciied production time (slope o the line - constant); P denotes the penalty or exceeding the 1 speciied production time (constant); P denotes the penalty or exceeding the speciied critical production time (constant); P denotes the penalty o the product. Proceedings o the European Modeling and Simulation Symposium, 01 5
4 igure : Penalty unction This rule is deined because premature production leads to increasing storage costs the JIT product. The obective unction is aected by the total time spent by the product in the manuacturing system. The obective unction is minimized. Controls o the production line simulation model are the arrival times o each product in the system. The obective unction is shown in igure 4. igure 5: Obective unction - The Assembly Line discrete event simulation model 5. TESTING UNCTIONS We also tested implemented optimization methods on our standard testing unctions. All testing unctions are minimized De Jong s unction It is a continuous, convex and unimodal testing unction. The unction deinition: n x 1 X () X where denotes the obective unction; denotes index o control; n denotes the dimension o the search space; x denotes the value o control. The obective unction is shown in igure 6. igure 4: Obective unction The Penalty Discrete Event Simulation Model 4.. The Assembly Line This model represents an assembly line. Products are conveyed by conveyor belt. The assembly line consists o eleven assembly workplaces. Six o these workplaces have their own machine operator. The rest o the workplaces are automated. A speciic scrap rate is deined or each workplace. At the end o the production line is a sorting process or deective products. The obective unction relects the penalty which is aected by the number o deective products and the palettes in the system. The obective unction is maximized. The obective unction is shown in igure 5. The input simulation model parameters (controls) are the numbers o ixtures in the system and the number o ixtures when the operator has to move rom the irst workplace to the eleventh workplace to assemble waiting parts on the conveyor belt. igure 6: Obective unction - De Jong s unction 5.. Rosenbrock s unction Rosenbrock s (Rosenbrock's valley, Rosenbrock's banana) unction is a continuous, unimodal and non-convex testing unction. The unction deinition: n1 X () 100 ( x x 1) 1 x 1 The obective unction is shown in igure 7. Proceedings o the European Modeling and Simulation Symposium, 01 5
5 igure 7: Obective unction - Rosenbrock s unction 5.. Michalewicz s unction Michalewicz s unction is a multimodal test unction (n! local optima). The parameter m deines the "steepness" o the valleys or edges. Larger m leads to a more diicult search. or very large m the unction behaves like a needle in a haystack (the unction values or points in the space outside the narrow peaks give very little inormation on the location o the global optimum). (Pohlheim 006) m n x (4) X sin( x ) sin 1 1 : n, 0 x (5) We selected m 5 in our simulation model. The obective unction is shown in igure 8. igure 8: Obective unction - Michalewicz s unction 5.4. Ackley s unctions Ackley s unction is a multimodal test unction. This unction is a widely used testing unction or premature convergence. (Tvrdík 004) 1 n n 1 n X 0exp 0.0 x exp cos x 0 exp 1 1 n 1 (6) 1: n, 0 x 0 (7) The obective unction is shown in igure 9. igure 9: Obective unction - Ackley s unction 6. EVALUATION METHOD Simulation experiments results are saved to a database ile during simulation experiments i the user uses a simulation optimizer. Simulation experiments results are visualized in the obective unction chart and stored in the table placed in the application. The graphical user interace o the irst module is shown in igure 1. I the second module is used the simulation experiments data are exported to MS Excel workbook ater inishing the series (series - replications o optimization experiments with concrete optimization method setting). Excel was selected because o its wide usage Considering the number o simulation experiments we can divide the number o simulation experiments igure 10: 1. Simulation experiment simulation run o simulation model.. Optimization experiment perormed with concrete optimization method setting to ind optimum o obective unction.. Series replication o optimization experiments with concrete optimization method setting. The second module ocuses on testing the behaviour o the implemented optimization method in terms o setting the parameters or the optimization method. The user can set up the parameters o a selected optimization method, low and high boundaries o the selected optimization method parameters, number o replications, and export the obective unction chart to image igure 11. The same conditions had to be satisied or each optimization method, e.g. the same termination criteria, the same search space. I the optimization method has the same parameters as another optimization method, we set up both parameters with the same boundaries (same step, low and high boundaries). Proceedings o the European Modeling and Simulation Symposium, 01 54
6 igure 10: The Number o Simulation Experiments X 0 denotes the ound optimum (local in this case). These characteristics are visualized in the box plot chart igure 1. Three box plot charts are generated - Best obective unction value, Range o provided unction obective values during the simulation experiments, and Number o experiments required to ind global (local) optimum. Visualization can help the user to ind a suitable setting o optimization method more quickly. Due to the large volume o data (over 4 billion simulation experiments) we have to propose evaluation techniques (criteria) which express the ailure o the optimization method in dierent ways. Each criterion value is between [0, 1]. I the ailure is 100[%] the criterion equals 1 thereore we try to minimize all speciied criteria. We implemented the graphical user interace to MS Excel workbook which enables the user to set up the weights o each criterion and other parameters o the evaluation. These parameters are automatically loaded rom the simulation experiments results. We used the VBA or MS Excel Optimization Method Success The irst criterion 1 is the value o not inding the known VTR (value to reach). This value is expressed by: s n 1 s succ (8) igure 11: GUI o the Second Module Box plot characteristics (the smallest observation sample minimum Q 1, lower quartile Q, median Q, upper quartile Q 4, and largest observation - sample maximum Q 5) are calculated or each perormed setting o the optimization method parameters igure 1. where s denotes the number o perormed series, n succ denotes the series where the VTR was ound. Simulation runs o all possible settings o simulation model input parameters were perormed. This means that we have evaluated all possible solutions o the search space hence we can determine the global optimum (VTR) in the search space. Average Method Success o inding Optimum can be ormulated as ollows: avg 1 s i1 s 1i 100 % (9) igure 1: Example o Results rom Simulation Optimization Experiments Provided by Evolution Strategy Displayed in Box Plot Chart The Assembly Line Simulation Model where i denotes the index o one series, 1 denotes the i value o the irst criterion (Optimization method success the best value is zero), s denotes the number o perormed series. The average optimization method success o inding the optimum o testing unctions is shown in igure 1. Proceedings o the European Modeling and Simulation Symposium, 01 55
7 We can see that the Evolution Strategy and Simulated Annealing are successul optimization methods. Random Search also achieves good results. It was aected by doing many simulation experiments by this method. The probability o inding the optimum increases with a high number o simulation experiments. This strategy is simply random and i the search space is huge (NP-hard) we can say it is lucky to ind the optimum. This method is usable when the user has no inormation about the obective unction type. We have to evaluate each possible solution in the search space to obtain the optimum hence the search space cannot be too huge. igure 1: Average Optimization Method Success Simulation Optimization Results o Testing unctions Average optimization method success o inding the optimum o discrete event simulation models is shown in igure 14. We can say that Simulated Annealing and Evolution Strategy are quite successul optimization methods again. Random Search was not successul in the case o the Penalty model because o the larger search space. The Penalty discrete event simulation model has a complicated obective unction landscape. The area around the optimum is straight and the method could not obtain inormation about rising or decreasing the obective unction terrain. igure 14: Average Method Success Simulation Optimization Results o Discrete Event Simulation Models Previous charts express the average success o optimization methods o all optimization methods settings. These charts also contain bad settings thereore we separated the bad series rom the good series. The next chart contains the iltered series with the best ound irst criterion value only (in this case 1 = 0 so the optimum was ound in each optimization experiment). The percentage o absolutely successul series compared to all perormed series is shown in igure 15. It is obvious that the avourite, Evolution Strategy, has problems with the multimodal Ackley unction. The success o this method was aected by the number o individuals randomly chosen rom the population or the tournament exploration vs. exploitation o the search space. The irst approach is to generate other new solutions which have not been investigated beore - exploration. Since computers have only limited memory, the already evaluated solution candidates usually have to be discarded in order to accommodate new ones. Exploration is a metaphor or the procedure which allows search operations to ind new and maybe better solution structures. Exploitation, on the other hand, is the process o improving and combining the traits o the currently known solutions, as done by the crossover operator in evolutionary algorithms, or instance. Exploitation operations oten incorporate small changes into already tested individuals leading to new, very similar solution candidates or try to merge building blocks o dierent, promising individuals. They usually have the disadvantage that other, possibly better, solutions located in distant areas o the problem space will not be discovered. (Michalewicz 004) The behaviour o Hill Climbing, Local Search and Tabu Search is similar considering the similar pseudo gradient principle. Substandard results were achieved with the Downhill Simplex method. This optimization method works by calculating the points o the centroid (center o gravity o the simplex). We have to modiy this optimization method in such a way that it is applicable or discrete event simulation optimization purposes where the step in the search space is deined. We use the rounding o coordinates o the vector (new calculated point) to the nearest easible coordinates in the search space and this leads to deviation rom the original direction. We perormed other simulation experiments with smaller steps and the success o inding the optimum was higher than beore. This problem can be solved by using a calculation with the original points and the obective unction value will be calculated by the approximations o the obective value o the nearest easible points in the search. Dierential Evolution uses the elitism strategy in our case. This leads to copying o identical individuals which suppresses the diversity o new promising individuals. Random Search looks successul, but there were only two possible settings generating the same individual possibility. This evaluation can be modiied by using the coeicient which recalculates the value o success depending on the number o perormed series. The termination criterion was the number o possible Proceedings o the European Modeling and Simulation Symposium, 01 56
8 solutions in the search space when there is little search space. This led to increasing the probability o success o this optimization method. the obective unction value o the best solution ound in concrete series; denotes obective unction value o the worst solution (element) o the search space. X Worst The dierence between the optimum and the local extreme is shown in igure 17 (testing unctions) and igure 18 (discrete event simulation models). The charts contain only series where the 1 = 0 (no optimum was ound in the series). The average o second criterion is shown or each optimization method these values express the ailure o the optimization method. Output. o unction can take value 0,1 igure 15: Percentage o Absolutely Successul Series Compared To All Perormed Series - Testing unctions igure 17: Average o the Second Criterion - Dierence between Optimum and Local Extreme - Testing unctions igure 16: Percentage o Absolutely Successul Series Considering All Perormed Series - Discrete Event Simulation Models 6.. The Dierence between Optimum and Local Extreme The second criterion is useul when there is no series which contains any optimum or the solution whose obective unction value is within the tolerance o optimum obective unction value. The irst criterion 1 equals zero in this case. The unction where the output o the unction can take value 0,1. This unction evaluates the dierence between the obective unction value o the best solution ound in the series and the optimum obective unction value. The eort is to minimize. The list o ound optimums considering obective unction value using the comparator unction is sorted in ascending order. Ater that the value o the second criterion is calculated using the ormula: X Best X X Worst X (10) where X denotes the obective unction value o the global optimum o the search space; X Best denotes igure 18: Average o the Second Criterion - Dierence between Optimum and Local Extreme - Discrete Event Simulation Models 6.. The Distances o Quartiles Third criterion expresses the distance between quartiles o a concrete series. Weights are used or evaluation purposes. These weights penalize the solutions) placed in quartiles. Values o the weights were deined based on the results o the simulation experiments. The user can deine the weight value. The sum o weights equals one. The third criterion when the obective unction is minimized can be ormulated as ollows: Proceedings o the European Modeling and Simulation Symposium, 01 57
9 Q1 X w4 Q1 Q w Q Q w Q Q4 w1 Q 4 Q (10) 5 X X Worst where denotes the obective unction value o the global optimum o the search space; X w 4 denotes the weight (penalty) o obective unction values between sample minimum Q 1 and lower quartile Q ; w denotes the weight o obective unction values between lower quartile Q and median Q ; w denotes the weight o obective unction values between median Q and upper quartile Q 4; denotes the weight o w1 obective unction values between upper quartile Q 4 and largest observation - sample maximum Q 5; X Worst denotes obective unction value o the worst solution (element) o the search space. The evaluation o optimization experiments using the third criterion is shown in igure 19 and in igure 0. igure 19: Average o the Third Criterion - Distances o Quartiles - Testing unctions worst optimization results o all tested optimization methods due to rounding the coordinates. Pseudo gradient optimization methods ound solutions o similar quality. Simulated Annealing provides a worse solution than the Evolution Strategy The Number o Simulation Experiments Until the Optimum Was ound The ourth criterion 4 evaluates the speed o inding the optimum the number o perormed simulation experiments until the optimum/best solution was ound in each series. The eort is to minimize 4 ( ). The ourth criterion when the obective unction is minimized can be ormulated as ollows: ~ X 4 0,1 Q1 1 w4 Q1 Q w Q Q w Q Q4 w1 Q4 Q m where w 4 4 (11) denotes the weight (penalty) o number o simulation experiments until the optimum was ound between sample minimum Q 1 and lower quartile Q ; w 4 denotes the weight o number o simulation experiments until the optimum was ound between lower quartile Q and median Q ; w denotes the weight o number o simulation experiments until the optimum was ound between median Q and upper quartile Q 4; denotes the weight o number o w 1 4 simulation experiments until the optimum was ound between upper quartile Q 4 and largest observation - sample maximum Q 5; denotes the number o m ~ X easible solutions in the search space. The evaluation o optimization experiments using the third criterion is shown in igure 1 and in igure. 4 igure 0: Average o the Third Criterion - Distances o Quartiles - Discrete Event Simulation Models 0,1 ). I the irst criterion equals zero 1 then the third criterion equals zero 0 (absolutely successul series). The Downhill Simplex optimization method provided the The eort is to minimize ( igure 1: Average o the ourth Criterion 4 - Number o Simulation Experiments until the Optimum Was ound - Testing unctions Proceedings o the European Modeling and Simulation Symposium, 01 58
10 and with the subsidy o the Motivation System (POSTDOC) o University o West Bohemia. The paper uses the results o the proect CZ.1.07/..00/ carried out with the support o Ministry o Education, Youth and Sports. igure : Average o The ourth Criterion 4 - Discrete Event Simulation Models 7. CONCLUSION The goal o our research is to compare selected modiied optimization methods (Random Search, Hill Climbing, Tabu Search, Local Search, Downhill Simplex, Simulated Annealing, Dierential Evolution and Evolution Strategy) used in the developed simulation optimizer and used in the second module which is ocused on testing the implemented optimization methods. Optimization methods generate whole populations instead o one possible solution which prevents premature convergence. The success o optimization methods depends on the obective unction landscape. Evolution Strategy is a suitable optimization method or all the tested obective unctions (a little propensity to bad tuning o the method parameters). This optimization method achieves good values or speciied criteria. The alternative to Evolution Strategy optimization methods is Simulated Annealing. Simulated Annealing has the ability to escape rom the local extreme thanks to the implemented approach o setting the temperature to the initial temperature. We can expect to ind good results using Random Search i there is a small search space. I the dimension o the search space is bigger, there is little probability o success. Optimization methods based on pseudogradient searching such as Hill-Climbing, Local Search, Tabu Search achieve almost the same results or the simple obective unction landscape due to their similar nature. Dierential Evolution avoids repressing the diversity o solutions (elitism - an advantage o this approach is the aster inding o a easible solution but not the inding o the global optimum). The range o provided simulation optimization results using this optimization method is better than the optimization methods based on pseudo-gradient searching. ACKNOWLEDGEMENTS This paper was created with the subsidy o the proect SGS Integrated production system design as a meta product with use o a multidisciplinary approach and virtual reality carried out with the support o the Internal Grant Agency o University o West Bohemia REERENCES Koblasa,., Manlig,., Vavruska, J., 01. Evolution Algorithm or Job Shop Scheduling Problem Constrained bythe Optimization Timespan. Applied Mechanics and Materials, 09, Kopecek, P, 01. Heuristic Approach to Job Shop Scheduling. DAAAM International Scientiic Book 01, pp October 4-7, Zadar (Croatia). Michalewicz, Z., ogel, D. B., 004. How to Solve It: Modern Heuristics, Berlin: Springer, Miranda, V., 008. undamentals o Evolution Strategies and Evolutionary Programming. In: El-Hawary, M.E., ed. Modern heuristic optimization techniques. New Jersey: John Wiley & Sons, Monticelli, A.J., Romero, R., Asada, E., 008. undamentals o Tabu Search. In: El-Hawary, M.E., ed. Modern heuristic optimization techniques. New Jersey: John Wiley & Sons, Monticelli, A.J., Romero, R., Asada, E., 008. undamentals o Simulated Annealing. In: El-Hawary, M.E., ed. Modern heuristic optimization techniques. New Jersey: John Wiley & Sons, Pohlheim, H., 006. Genetic and Evolutionary Algorithm Toolbox or use with MATLAB. GEATbx. Available rom: [accessed 0 November 011] Tvrdik, J., 004. Evolutionary Algorithms - textbook. Virtual inormation center or Ph.D. students, Ostrava University. Available rom: olutionary_algorithms.pd [accessed 6 ebruary, 011] Votava, V., Ulrych, Z., Edl, M., Korecky, M., Trkovsky, V., 008. Analysis and Optimization o Complex Small-lot Production in new Manuacturing acilities Based on Discrete Simulation. Proceedings o 0th European Modeling & Simulation Symposium EMSS 008, pp September 17-19, Campora San Giovanni (Amantea, Italy). Weise, T., 009. Global Optimization Algorithms - Theory and Application nd Edition. Thomas Weise - Proects. Available rom: [accessed ebruary, 01] Wong, K.P., Dong, Z.Y., 008. Dierential Evolution. In: El-Hawary, M.E., ed. Modern heuristic optimization techniques. New Jersey: John Wiley & Sons, Proceedings o the European Modeling and Simulation Symposium, 01 59
ScienceDirect. Testing Optimization Methods on Discrete Event Simulation Models and Testing Functions
Available online at www.sciencedirect.com ScienceDirect Procedia Engineering 69 ( 2014 ) 768 777 24th DAAAM International Symposium on Intelligent Manuacturing and Automation, 2013 Testing Optimization
More informationA Proposed Approach for Solving Rough Bi-Level. Programming Problems by Genetic Algorithm
Int J Contemp Math Sciences, Vol 6, 0, no 0, 45 465 A Proposed Approach or Solving Rough Bi-Level Programming Problems by Genetic Algorithm M S Osman Department o Basic Science, Higher Technological Institute
More informationA Novel Accurate Genetic Algorithm for Multivariable Systems
World Applied Sciences Journal 5 (): 137-14, 008 ISSN 1818-495 IDOSI Publications, 008 A Novel Accurate Genetic Algorithm or Multivariable Systems Abdorreza Alavi Gharahbagh and Vahid Abolghasemi Department
More informationKANGAL REPORT
Individual Penalty Based Constraint handling Using a Hybrid Bi-Objective and Penalty Function Approach Rituparna Datta Kalyanmoy Deb Mechanical Engineering IIT Kanpur, India KANGAL REPORT 2013005 Abstract
More informationMobile Robot Static Path Planning Based on Genetic Simulated Annealing Algorithm
Mobile Robot Static Path Planning Based on Genetic Simulated Annealing Algorithm Wang Yan-ping 1, Wubing 2 1. School o Electric and Electronic Engineering, Shandong University o Technology, Zibo 255049,
More informationNeighbourhood Operations
Neighbourhood Operations Neighbourhood operations simply operate on a larger neighbourhood o piels than point operations Origin Neighbourhoods are mostly a rectangle around a central piel Any size rectangle
More informationNon-deterministic Search techniques. Emma Hart
Non-deterministic Search techniques Emma Hart Why do local search? Many real problems are too hard to solve with exact (deterministic) techniques Modern, non-deterministic techniques offer ways of getting
More informationJob Shop Scheduling Problem (JSSP) Genetic Algorithms Critical Block and DG distance Neighbourhood Search
A JOB-SHOP SCHEDULING PROBLEM (JSSP) USING GENETIC ALGORITHM (GA) Mahanim Omar, Adam Baharum, Yahya Abu Hasan School of Mathematical Sciences, Universiti Sains Malaysia 11800 Penang, Malaysia Tel: (+)
More informationPerformance Assessment of the Hybrid Archive-based Micro Genetic Algorithm (AMGA) on the CEC09 Test Problems
Perormance Assessment o the Hybrid Archive-based Micro Genetic Algorithm (AMGA) on the CEC9 Test Problems Santosh Tiwari, Georges Fadel, Patrick Koch, and Kalyanmoy Deb 3 Department o Mechanical Engineering,
More informationAutomated Planning for Feature Model Configuration based on Functional and Non-Functional Requirements
Automated Planning or Feature Model Coniguration based on Functional and Non-Functional Requirements Samaneh Soltani 1, Mohsen Asadi 1, Dragan Gašević 2, Marek Hatala 1, Ebrahim Bagheri 2 1 Simon Fraser
More informationReflection and Refraction
Relection and Reraction Object To determine ocal lengths o lenses and mirrors and to determine the index o reraction o glass. Apparatus Lenses, optical bench, mirrors, light source, screen, plastic or
More informationScalable Test Problems for Evolutionary Multi-Objective Optimization
Scalable Test Problems or Evolutionary Multi-Objective Optimization Kalyanmoy Deb Kanpur Genetic Algorithms Laboratory Indian Institute o Technology Kanpur PIN 8 6, India deb@iitk.ac.in Lothar Thiele,
More informationCS5401 FS2015 Exam 1 Key
CS5401 FS2015 Exam 1 Key This is a closed-book, closed-notes exam. The only items you are allowed to use are writing implements. Mark each sheet of paper you use with your name and the string cs5401fs2015
More informationCOMPARISON OF ALGORITHMS FOR NONLINEAR REGRESSION ESTIMATES
COMPSTAT 2004 Symposium c Physica-Verlag/Springer 2004 COMPARISON OF ALGORITHMS FOR NONLINEAR REGRESSION ESTIMATES Tvrdík J. and Křivý I. Key words: Global optimization, evolutionary algorithms, heuristics,
More informationHimanshu Jain and Kalyanmoy Deb, Fellow, IEEE
An Evolutionary Many-Objective Optimization Algorithm Using Reerence-point Based Non-dominated Sorting Approach, Part II: Handling Constraints and Extending to an Adaptive Approach Himanshu Jain and Kalyanmoy
More informationIntroduction to Stochastic Optimization Methods (meta-heuristics) Modern optimization methods 1
Introduction to Stochastic Optimization Methods (meta-heuristics) Modern optimization methods 1 Efficiency of optimization methods Robust method Efficiency Specialized method Enumeration or MC kombinatorial
More informationAn evolutionary annealing-simplex algorithm for global optimisation of water resource systems
FIFTH INTERNATIONAL CONFERENCE ON HYDROINFORMATICS 1-5 July 2002, Cardiff, UK C05 - Evolutionary algorithms in hydroinformatics An evolutionary annealing-simplex algorithm for global optimisation of water
More informationREAL-CODED GENETIC ALGORITHMS CONSTRAINED OPTIMIZATION. Nedim TUTKUN
REAL-CODED GENETIC ALGORITHMS CONSTRAINED OPTIMIZATION Nedim TUTKUN nedimtutkun@gmail.com Outlines Unconstrained Optimization Ackley s Function GA Approach for Ackley s Function Nonlinear Programming Penalty
More informationReducing the Bandwidth of a Sparse Matrix with Tabu Search
Reducing the Bandwidth o a Sparse Matrix with Tabu Search Raael Martí a, Manuel Laguna b, Fred Glover b and Vicente Campos a a b Dpto. de Estadística e Investigación Operativa, Facultad de Matemáticas,
More informationPiecewise polynomial interpolation
Chapter 2 Piecewise polynomial interpolation In ection.6., and in Lab, we learned that it is not a good idea to interpolate unctions by a highorder polynomials at equally spaced points. However, it transpires
More informationStructured Parallel Programming with Deterministic Patterns
Structured Parallel Programming with Deterministic Patterns May 14, 2010 USENIX HotPar 2010, Berkeley, Caliornia Michael McCool, Sotware Architect, Ct Technology Sotware and Services Group, Intel Corporation
More informationMATRIX ALGORITHM OF SOLVING GRAPH CUTTING PROBLEM
UDC 681.3.06 MATRIX ALGORITHM OF SOLVING GRAPH CUTTING PROBLEM V.K. Pogrebnoy TPU Institute «Cybernetic centre» E-mail: vk@ad.cctpu.edu.ru Matrix algorithm o solving graph cutting problem has been suggested.
More informationUsing VCS with the Quartus II Software
Using VCS with the Quartus II Sotware December 2002, ver. 1.0 Application Note 239 Introduction As the design complexity o FPGAs continues to rise, veriication engineers are inding it increasingly diicult
More informationAn Evolutionary Algorithm for Minimizing Multimodal Functions
An Evolutionary Algorithm for Minimizing Multimodal Functions D.G. Sotiropoulos, V.P. Plagianakos and M.N. Vrahatis University of Patras, Department of Mamatics, Division of Computational Mamatics & Informatics,
More information9.8 Graphing Rational Functions
9. Graphing Rational Functions Lets begin with a deinition. Deinition: Rational Function A rational unction is a unction o the orm P where P and Q are polynomials. Q An eample o a simple rational unction
More information2. Design Planning with the Quartus II Software
November 2013 QII51016-13.1.0 2. Design Planning with the Quartus II Sotware QII51016-13.1.0 This chapter discusses key FPGA design planning considerations, provides recommendations, and describes various
More informationAUTOMATING THE DESIGN OF SOUND SYNTHESIS TECHNIQUES USING EVOLUTIONARY METHODS. Ricardo A. Garcia *
AUTOMATING THE DESIGN OF SOUND SYNTHESIS TECHNIQUES USING EVOLUTIONARY METHODS Ricardo A. Garcia * MIT Media Lab Machine Listening Group 20 Ames St., E5-49, Cambridge, MA 0239 rago@media.mit.edu ABSTRACT
More informationMAPI Computer Vision. Multiple View Geometry
MAPI Computer Vision Multiple View Geometry Geometry o Multiple Views 2- and 3- view geometry p p Kpˆ [ K R t]p Geometry o Multiple Views 2- and 3- view geometry Epipolar Geometry The epipolar geometry
More information336 THE STATISTICAL SOFTWARE NEWSLETTER where z is one (randomly taken) pole of the simplex S, g the centroid of the remaining d poles of the simplex
THE STATISTICAL SOFTWARE NEWSLETTER 335 Simple Evolutionary Heuristics for Global Optimization Josef Tvrdk and Ivan Krivy University of Ostrava, Brafova 7, 701 03 Ostrava, Czech Republic Phone: +420.69.6160
More informationMulti-Objective Evolutionary Algorithms
Multi-Objective Evolutionary Algorithms Kalyanmoy Deb a Kanpur Genetic Algorithm Laboratory (KanGAL) Indian Institute o Technology Kanpur Kanpur, Pin 0806 INDIA deb@iitk.ac.in http://www.iitk.ac.in/kangal/deb.html
More informationHybridization EVOLUTIONARY COMPUTING. Reasons for Hybridization - 1. Naming. Reasons for Hybridization - 3. Reasons for Hybridization - 2
Hybridization EVOLUTIONARY COMPUTING Hybrid Evolutionary Algorithms hybridization of an EA with local search techniques (commonly called memetic algorithms) EA+LS=MA constructive heuristics exact methods
More information9. Reviewing Printed Circuit Board Schematics with the Quartus II Software
November 2012 QII52019-12.1.0 9. Reviewing Printed Circuit Board Schematics with the Quartus II Sotware QII52019-12.1.0 This chapter provides guidelines or reviewing printed circuit board (PCB) schematics
More informationLecture 4. Convexity Robust cost functions Optimizing non-convex functions. 3B1B Optimization Michaelmas 2017 A. Zisserman
Lecture 4 3B1B Optimization Michaelmas 2017 A. Zisserman Convexity Robust cost functions Optimizing non-convex functions grid search branch and bound simulated annealing evolutionary optimization The Optimization
More informationExploration vs. Exploitation in Differential Evolution
Exploration vs. Exploitation in Differential Evolution Ângela A. R. Sá 1, Adriano O. Andrade 1, Alcimar B. Soares 1 and Slawomir J. Nasuto 2 Abstract. Differential Evolution (DE) is a tool for efficient
More informationApplication of Six Sigma Robust Optimization in Sheet Metal Forming
Application o Six Sigma Robust Optimization in Sheet Metal Forming Y. Q. Li, Z. S. Cui, X. Y. Ruan, D. J. Zhang National Die and Mold CAD Engineering Research Center, Shanghai Jiao Tong University, Shanghai,
More informationAutomated Modelization of Dynamic Systems
Automated Modelization o Dynamic Systems Ivan Perl, Aleksandr Penskoi ITMO University Saint-Petersburg, Russia ivan.perl, aleksandr.penskoi@corp.imo.ru Abstract Nowadays, dierent kinds o modelling settled
More informationMeta- Heuristic based Optimization Algorithms: A Comparative Study of Genetic Algorithm and Particle Swarm Optimization
2017 2 nd International Electrical Engineering Conference (IEEC 2017) May. 19 th -20 th, 2017 at IEP Centre, Karachi, Pakistan Meta- Heuristic based Optimization Algorithms: A Comparative Study of Genetic
More informationA New Algorithm for Determining Ultimate Pit Limits Based on Network Optimization
IJMGE Int. J. Min.& Geo-Eng. Vol.47, No.2, Dec. 2013, pp. 129-137 A New Algorithm or Determining Ultimate Pit Limits Based on Network Optimization Ali Asghar Khodayari School o Mining Engineering, College
More informationHYBRID GENETIC ALGORITHM WITH GREAT DELUGE TO SOLVE CONSTRAINED OPTIMIZATION PROBLEMS
HYBRID GENETIC ALGORITHM WITH GREAT DELUGE TO SOLVE CONSTRAINED OPTIMIZATION PROBLEMS NABEEL AL-MILLI Financial and Business Administration and Computer Science Department Zarqa University College Al-Balqa'
More informationDigital Image Processing. Image Enhancement in the Spatial Domain (Chapter 4)
Digital Image Processing Image Enhancement in the Spatial Domain (Chapter 4) Objective The principal objective o enhancement is to process an images so that the result is more suitable than the original
More informationLuo, W., and Li, Y. (2016) Benchmarking Heuristic Search and Optimisation Algorithms in Matlab. In: 22nd International Conference on Automation and Computing (ICAC), 2016, University of Essex, Colchester,
More informationEscaping Local Optima: Genetic Algorithm
Artificial Intelligence Escaping Local Optima: Genetic Algorithm Dae-Won Kim School of Computer Science & Engineering Chung-Ang University We re trying to escape local optima To achieve this, we have learned
More informationCS485/685 Computer Vision Spring 2012 Dr. George Bebis Programming Assignment 2 Due Date: 3/27/2012
CS8/68 Computer Vision Spring 0 Dr. George Bebis Programming Assignment Due Date: /7/0 In this assignment, you will implement an algorithm or normalizing ace image using SVD. Face normalization is a required
More informationFractal Art: Fractal Image and Music Generator
Proceedings o the 7th WSEAS Int. Con. on Signal Processing, Computational Geometry & Artiicial Vision, Athens, Greece, August 4-6, 007 159 Fractal Art: Fractal Image and Music Generator RAZVAN TANASIE
More informationArtificial Intelligence
Artificial Intelligence Informed Search and Exploration Chapter 4 (4.3 4.6) Searching: So Far We ve discussed how to build goal-based and utility-based agents that search to solve problems We ve also presented
More informationHeuristic Optimization Introduction and Simple Heuristics
Heuristic Optimization Introduction and Simple Heuristics José M PEÑA (jmpena@fi.upm.es) (Universidad Politécnica de Madrid) 1 Outline 1. What are optimization problems? 2. Exhaustive vs. Heuristic approaches
More informationGenetic Algorithms Coding Primer
Genetic Algorithms Coding Primer A.I. Khan Lecturer in Computing and Inormation Technology Heriot-Watt University, Riccarton, Edinburgh, EH14 4AS, United Kingdom Introduction In this article the concept
More informationSuppose you have a problem You don t know how to solve it What can you do? Can you use a computer to somehow find a solution for you?
Gurjit Randhawa Suppose you have a problem You don t know how to solve it What can you do? Can you use a computer to somehow find a solution for you? This would be nice! Can it be done? A blind generate
More informationChapter 3 Image Enhancement in the Spatial Domain
Chapter 3 Image Enhancement in the Spatial Domain Yinghua He School o Computer Science and Technology Tianjin University Image enhancement approaches Spatial domain image plane itsel Spatial domain methods
More informationAn Introduction to Evolutionary Algorithms
An Introduction to Evolutionary Algorithms Karthik Sindhya, PhD Postdoctoral Researcher Industrial Optimization Group Department of Mathematical Information Technology Karthik.sindhya@jyu.fi http://users.jyu.fi/~kasindhy/
More informationIntroduction to Optimization
Introduction to Optimization Approximation Algorithms and Heuristics November 21, 2016 École Centrale Paris, Châtenay-Malabry, France Dimo Brockhoff Inria Saclay Ile-de-France 2 Exercise: The Knapsack
More informationComputer Data Analysis and Plotting
Phys 122 February 6, 2006 quark%//~bland/docs/manuals/ph122/pcintro/pcintro.doc Computer Data Analysis and Plotting In this lab we will use Microsot EXCEL to do our calculations. This program has been
More information10. SOPC Builder Component Development Walkthrough
10. SOPC Builder Component Development Walkthrough QII54007-9.0.0 Introduction This chapter describes the parts o a custom SOPC Builder component and guides you through the process o creating an example
More informationLocal Search and Optimization Chapter 4. Mausam (Based on slides of Padhraic Smyth, Stuart Russell, Rao Kambhampati, Raj Rao, Dan Weld )
Local Search and Optimization Chapter 4 Mausam (Based on slides of Padhraic Smyth, Stuart Russell, Rao Kambhampati, Raj Rao, Dan Weld ) 1 Outline Local search techniques and optimization Hill-climbing
More informationCS 188: Artificial Intelligence
CS 188: Artificial Intelligence CSPs II + Local Search Prof. Scott Niekum The University of Texas at Austin [These slides based on those of Dan Klein and Pieter Abbeel for CS188 Intro to AI at UC Berkeley.
More informationClassifier Evasion: Models and Open Problems
. In Privacy and Security Issues in Data Mining and Machine Learning, eds. C. Dimitrakakis, et al. Springer, July 2011, pp. 92-98. Classiier Evasion: Models and Open Problems Blaine Nelson 1, Benjamin
More informationMetamodeling for Multimodal Selection Functions in Evolutionary Multi-Objective Optimization
Metamodeling or Multimodal Selection Functions in Evolutionary Multi-Objective Optimization Proteek Roy, Rayan Hussein, and Kalyanmoy Deb Michigan State University East Lansing. MI 48864, USA Email: {royprote,husseinr,kdeb}@msu.edu
More informationAn Efficient Configuration Methodology for Time-Division Multiplexed Single Resources
An Eicient Coniguration Methodology or Time-Division Multiplexed Single Resources Benny Akesson 1, Anna Minaeva 1, Přemysl Šůcha 1, Andrew Nelson 2 and Zdeněk Hanzálek 1 1 Czech Technical University in
More informationUsing a Projected Subgradient Method to Solve a Constrained Optimization Problem for Separating an Arbitrary Set of Points into Uniform Segments
Using a Projected Subgradient Method to Solve a Constrained Optimization Problem or Separating an Arbitrary Set o Points into Uniorm Segments Michael Johnson May 31, 2011 1 Background Inormation The Airborne
More informationAI Programming CS S-08 Local Search / Genetic Algorithms
AI Programming CS662-2013S-08 Local Search / Genetic Algorithms David Galles Department of Computer Science University of San Francisco 08-0: Overview Local Search Hill-Climbing Search Simulated Annealing
More informationEvolutionary Computation Algorithms for Cryptanalysis: A Study
Evolutionary Computation Algorithms for Cryptanalysis: A Study Poonam Garg Information Technology and Management Dept. Institute of Management Technology Ghaziabad, India pgarg@imt.edu Abstract The cryptanalysis
More informationDefects Detection of Billet Surface Using Optimized Gabor Filters
Proceedings o the 7th World Congress The International Federation o Automatic Control Deects Detection o Billet Surace Using Optimized Gabor Filters Jong Pil Yun* SungHoo Choi* Boyeul Seo* Chang Hyun Park*
More informationPATH PLANNING OF UNMANNED AERIAL VEHICLE USING DUBINS GEOMETRY WITH AN OBSTACLE
Proceeding o International Conerence On Research, Implementation And Education O Mathematics And Sciences 2015, Yogyakarta State University, 17-19 May 2015 PATH PLANNING OF UNMANNED AERIAL VEHICLE USING
More informationFormalizing Cardinality-based Feature Models and their Staged Configuration
Formalizing Cardinality-based Feature Models and their Staged Coniguration Krzyszto Czarnecki, Simon Helsen, and Ulrich Eisenecker 2 University o Waterloo, Canada 2 University o Applied Sciences Kaiserslautern,
More informationAn Improved Greedy Genetic Algorithm for Solving Travelling Salesman Problem
2009 Fith International Conerence on Natural Computation An Improved Greedy Genetic Algorithm or Solving Travelling Salesman roblem Zhenchao Wang, Haibin Duan, and Xiangyin Zhang School o Automation Science
More informationACONM: A hybrid of Ant Colony Optimization and Nelder-Mead Simplex Search
ACONM: A hybrid of Ant Colony Optimization and Nelder-Mead Simplex Search N. Arun & V.Ravi* Assistant Professor Institute for Development and Research in Banking Technology (IDRBT), Castle Hills Road #1,
More informationComputational Intelligence
Computational Intelligence Module 6 Evolutionary Computation Ajith Abraham Ph.D. Q What is the most powerful problem solver in the Universe? ΑThe (human) brain that created the wheel, New York, wars and
More informationHeuristic Optimisation
Heuristic Optimisation Revision Lecture Sándor Zoltán Németh http://web.mat.bham.ac.uk/s.z.nemeth s.nemeth@bham.ac.uk University of Birmingham S Z Németh (s.nemeth@bham.ac.uk) Heuristic Optimisation University
More informationMath-3 Lesson 1-7 Analyzing the Graphs of Functions
Math- Lesson -7 Analyzing the Graphs o Functions Which unctions are symmetric about the y-axis? cosx sin x x We call unctions that are symmetric about the y -axis, even unctions. Which transormation is
More informationSection II. Nios II Software Development
Section II. Nios II Sotware Development This section o the Embedded Design Handbook describes how to most eectively use the Altera tools or embedded system sotware development, and recommends design styles
More informationA Requirement Specification Language for Configuration Dynamics of Multiagent Systems
A Requirement Speciication Language or Coniguration Dynamics o Multiagent Systems Mehdi Dastani, Catholijn M. Jonker, Jan Treur* Vrije Universiteit Amsterdam, Department o Artiicial Intelligence, De Boelelaan
More informationIntelligent Reduction of Tire Noise
Intelligent Reduction of Tire Noise Matthias Becker and Helena Szczerbicka University Hannover Welfengarten 3067 Hannover, Germany xmb@sim.uni-hannover.de Abstract. In this paper we report about deployment
More informationClassifier Evasion: Models and Open Problems
Classiier Evasion: Models and Open Problems Blaine Nelson 1, Benjamin I. P. Rubinstein 2, Ling Huang 3, Anthony D. Joseph 1,3, and J. D. Tygar 1 1 UC Berkeley 2 Microsot Research 3 Intel Labs Berkeley
More informationIntroduction to Optimization
Introduction to Optimization Approximation Algorithms and Heuristics November 6, 2015 École Centrale Paris, Châtenay-Malabry, France Dimo Brockhoff INRIA Lille Nord Europe 2 Exercise: The Knapsack Problem
More informationJoint Congestion Control and Scheduling in Wireless Networks with Network Coding
Title Joint Congestion Control and Scheduling in Wireless Networks with Network Coding Authors Hou, R; Wong Lui, KS; Li, J Citation IEEE Transactions on Vehicular Technology, 2014, v. 63 n. 7, p. 3304-3317
More informationLocal Search and Optimization Chapter 4. Mausam (Based on slides of Padhraic Smyth, Stuart Russell, Rao Kambhampati, Raj Rao, Dan Weld )
Local Search and Optimization Chapter 4 Mausam (Based on slides of Padhraic Smyth, Stuart Russell, Rao Kambhampati, Raj Rao, Dan Weld ) 1 2 Outline Local search techniques and optimization Hill-climbing
More informationLocal Search and Optimization Chapter 4. Mausam (Based on slides of Padhraic Smyth, Stuart Russell, Rao Kambhampati, Raj Rao, Dan Weld )
Local Search and Optimization Chapter 4 Mausam (Based on slides of Padhraic Smyth, Stuart Russell, Rao Kambhampati, Raj Rao, Dan Weld ) 1 2 Outline Local search techniques and optimization Hill-climbing
More informationA Fault Model Centered Modeling Framework for Self-healing Computing Systems
A Fault Model Centered Modeling Framework or Sel-healing Computing Systems Wei Lu 1, Yian Zhu 1, Chunyan Ma 1, and Longmei Zhang 2 1 Department o Sotware and Microelectronics, Northwestern Polytechnical
More information4 INFORMED SEARCH AND EXPLORATION. 4.1 Heuristic Search Strategies
55 4 INFORMED SEARCH AND EXPLORATION We now consider informed search that uses problem-specific knowledge beyond the definition of the problem itself This information helps to find solutions more efficiently
More informationLagrangian relaxations for multiple network alignment
Noname manuscript No. (will be inserted by the editor) Lagrangian relaxations or multiple network alignment Eric Malmi Sanjay Chawla Aristides Gionis Received: date / Accepted: date Abstract We propose
More informationMarch 19, Heuristics for Optimization. Outline. Problem formulation. Genetic algorithms
Olga Galinina olga.galinina@tut.fi ELT-53656 Network Analysis and Dimensioning II Department of Electronics and Communications Engineering Tampere University of Technology, Tampere, Finland March 19, 2014
More informationThe Genetic Algorithm for finding the maxima of single-variable functions
Research Inventy: International Journal Of Engineering And Science Vol.4, Issue 3(March 2014), PP 46-54 Issn (e): 2278-4721, Issn (p):2319-6483, www.researchinventy.com The Genetic Algorithm for finding
More informationCS 331: Artificial Intelligence Local Search 1. Tough real-world problems
CS 331: Artificial Intelligence Local Search 1 1 Tough real-world problems Suppose you had to solve VLSI layout problems (minimize distance between components, unused space, etc.) Or schedule airlines
More informationITU - Telecommunication Standardization Sector. G.fast: Far-end crosstalk in twisted pair cabling; measurements and modelling ABSTRACT
ITU - Telecommunication Standardization Sector STUDY GROUP 15 Temporary Document 11RV-22 Original: English Richmond, VA. - 3-1 Nov. 211 Question: 4/15 SOURCE 1 : TNO TITLE: G.ast: Far-end crosstalk in
More informationIntelligent Optimization Methods for High-Dimensional Data Classification for Support Vector Machines
Intelligent Inormation Management, 200, 2, ***-*** doi:0.4236/iim.200.26043 Published Online June 200 (http://www.scirp.org/journal/iim) Intelligent Optimization Methods or High-Dimensional Data Classiication
More informationMulti-objective Optimization
Some introductory figures from : Deb Kalyanmoy, Multi-Objective Optimization using Evolutionary Algorithms, Wiley 2001 Multi-objective Optimization Implementation of Constrained GA Based on NSGA-II Optimization
More informationChapter 14 Global Search Algorithms
Chapter 14 Global Search Algorithms An Introduction to Optimization Spring, 2015 Wei-Ta Chu 1 Introduction We discuss various search methods that attempts to search throughout the entire feasible set.
More informationWhat is GOSET? GOSET stands for Genetic Optimization System Engineering Tool
Lecture 5: GOSET 1 What is GOSET? GOSET stands for Genetic Optimization System Engineering Tool GOSET is a MATLAB based genetic algorithm toolbox for solving optimization problems 2 GOSET Features Wide
More informationInternational Journal of Digital Application & Contemporary research Website: (Volume 1, Issue 7, February 2013)
Performance Analysis of GA and PSO over Economic Load Dispatch Problem Sakshi Rajpoot sakshirajpoot1988@gmail.com Dr. Sandeep Bhongade sandeepbhongade@rediffmail.com Abstract Economic Load dispatch problem
More informationSUPER RESOLUTION IMAGE BY EDGE-CONSTRAINED CURVE FITTING IN THE THRESHOLD DECOMPOSITION DOMAIN
SUPER RESOLUTION IMAGE BY EDGE-CONSTRAINED CURVE FITTING IN THE THRESHOLD DECOMPOSITION DOMAIN Tsz Chun Ho and Bing Zeng Department o Electronic and Computer Engineering The Hong Kong University o Science
More informationGenetic Algorithms Variations and Implementation Issues
Genetic Algorithms Variations and Implementation Issues CS 431 Advanced Topics in AI Classic Genetic Algorithms GAs as proposed by Holland had the following properties: Randomly generated population Binary
More informationCONCEPTUAL DESIGN AND OPTIMIZATION OF A HIGH ASPECT RATIO UAV WING MADE OF COMPOSITE MATERIAL
ICAS 000 CONGRESS CONCEPTUAL DESIGN AND OPTIMIZATION OF A HIGH ASPECT RATIO UAV WING MADE OF COMPOSITE MATERIAL K. Widmaier, F. M. Catalano Aircrat Laboratory University o São Paulo Brail Abstract The
More informationIntelligent knowledge-based system for the automated screwing process control
Intelligent knowledge-based system or the automated screwing process control YULIYA LEBEDYNSKA yuliya.lebedynska@tu-cottbus.de ULRICH BERGER Chair o automation Brandenburg University o Technology Cottbus
More informationTopological Machining Fixture Layout Synthesis Using Genetic Algorithms
Topological Machining Fixture Layout Synthesis Using Genetic Algorithms Necmettin Kaya Uludag University, Mechanical Eng. Department, Bursa, Turkey Ferruh Öztürk Uludag University, Mechanical Eng. Department,
More information2. Getting Started with the Graphical User Interface
February 2011 NII52017-10.1.0 2. Getting Started with the Graphical User Interace NII52017-10.1.0 The Nios II Sotware Build Tools (SBT) or Eclipse is a set o plugins based on the popular Eclipse ramework
More informationCHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM
20 CHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM 2.1 CLASSIFICATION OF CONVENTIONAL TECHNIQUES Classical optimization methods can be classified into two distinct groups:
More informationUsing Genetic Algorithm with Triple Crossover to Solve Travelling Salesman Problem
Proc. 1 st International Conference on Machine Learning and Data Engineering (icmlde2017) 20-22 Nov 2017, Sydney, Australia ISBN: 978-0-6480147-3-7 Using Genetic Algorithm with Triple Crossover to Solve
More informationAn Efficient Constraint Handling Method for Genetic Algorithms
An Efficient Constraint Handling Method for Genetic Algorithms Kalyanmoy Deb Kanpur Genetic Algorithms Laboratory (KanGAL) Department of Mechanical Engineering Indian Institute of Technology Kanpur Kanpur,
More informationA new approach for ranking trapezoidal vague numbers by using SAW method
Science Road Publishing Corporation Trends in Advanced Science and Engineering ISSN: 225-6557 TASE 2() 57-64, 20 Journal homepage: http://www.sciroad.com/ntase.html A new approach or ranking trapezoidal
More informationBinary recursion. Unate functions. If a cover C(f) is unate in xj, x, then f is unate in xj. x
Binary recursion Unate unctions! Theorem I a cover C() is unate in,, then is unate in.! Theorem I is unate in,, then every prime implicant o is unate in. Why are unate unctions so special?! Special Boolean
More information