Parallel implementation of Evolutionary Algorithm for QAP
|
|
- Vivian Tucker
- 6 years ago
- Views:
Transcription
1 XII International PhD Workshop OWD 2010, 2326 October 2010 Parallel implementation of Evolutionary Algorithm for QAP Anna Obr czka, AGH University of Science and Technology Abstract In this paper the implementation and tests of parellel Evolutionary Algorithm (EA) was presented. The algorithm was implemented as a island model of EA and the OpenMP was used to obtain parallelization. There was also used an interesting model of migration from [5], which was rst time customized to Quadratic Assignment Problem (QAP). Keywords: EA, QAP, parallelization, Open- MP 1. Quadratic Assignment Problem Quadratic Assignment Problem (QAP) was formulated in 1957 by Koopsman and Beckman. QAP is optimalization problem and it belongs to NP-hard problems class. Moreover, nding approximate solution of QAP is NP-hard too. QAP can be present as a mathematical model. Lets consider a set N = {1, 2,..., n} and two n n matrices: D = [d i,k ], F = [f j,l ]. As Π the set of permutations of N can be signied. Now the quadratic assignment problem with coecients matrices D and F can be formulated as follows [2]: min π Π n i=1 j=1 n d π(i),π(j) f i,j. (1) According to this, QAP is a problem of nding this permutation π Π, which minimizes the double sum in (1). It can be dened a function φ(π), which is called objective function [2]: n n φ(π) = d π(i),π(j) f i,j. (2) i=1 j=1 The optimal solution of QAP is permutation π 0, minimizing function (2), and the corresponding objective function value φ(π 0 ) is called an optimal value of QAP. Usually, elements of matrix D are called distances between locations, elements of F are called ows between facilities and π(i) means number of facility assigns to location i. Solution methods for QAP can be divide into two groups: exact algorithms and heuristics. Three main exact techniques are: dynamic programming, cutting planes method and branch and bound procedure and the most eective is the last. This method has been improved since 1962, when Gilmore solved the QAP of size n = 8. In 2000 the solution of nug30 (n = 30) from QAPLIB [3] was nd by Anstreicher. QAP is said to be one of the hardest combinatorial optimalization and operations research problem [4]. Because of their high computational complexity, currently size of QAP solved by exact methods is no more then n = 30. For example, if n = 8, set Π contain n! = 8! = permutations, if n = 30 amount of permutation is This is the reason to apply heuristic algorithms for greater instances of QAP. A heuristic is an algorithm used to nd a solution quickly, but without quarantee to be correct or, in optimalization, to be optimal. Heuristics are used when the exact algorithms are unknown or they aren't suciently eective. It can be mentioned: local search, constructive methods, simulated annealing, tabu search, greedy randomized adaptive search pro- 127
2 cedure, ant colony algorithms and genetic algorithms. There are many practical applications of the QAP like architecture planninig, analysis of economic dependencies, electrical wiring problems especially VLSI, assign machines to jobs [1], ranking of archeological data, ranking of a team in a relay race or scheduling parallel production lines [4]. 2. Evolutionary Algorithms Evolutionary Algorithms (EA) are the heuristic algorithms inspired by Theory of Evolution. They operate on set of solutions and, using selection and genetic operators, create new set of better solutions and replace the old ones. The set of solutions we call population and single solution individual. To evaluate a quality of solution we dene the objective function. The object of EA is optimalization value of objective function. First trials, solving QAP by EA, were the hybrid realizations. They mixed classic EA with other heuristics like tabu search or simulated annealing. In 2000 Ahuja, Orlin and Tiwari propsed greedy genetic algorithm, which coped very well with big instances of QAP. In 2003 Drezner obtained even better results, applying his EA mixed with tabu search and special crossover operator. This new genetic algorithm is currently one of the best heuristics to solve QAPs [4]. Very promising in the led of EA are parallel realizations, because parallelism can speed up computations. In 1981 Grefenstette already considered rst teoretical ideas of parallel EA. Now, the most popular and the most often applied is the island model, which is implemented in this work too. The island model divides the whole population into smaller groups subpopulations called islands. There is two new elements in island model: migration and topology. In each island the basic EA work independently and migartion and topology decide about way of communication between them. This communication means exchange of individuals or sometimes informations about parameters of EA. Depend on migration strategy, individuals to exchange are choosen randomly, with any kind of selection or they are the best of current subpopulation. Emigrated individuals can by copy or sent to other island. Similar, immigarants can be added or can repleace some of individuals (for example the worsts). We should also determine values of migration rate and migration size, which means, appropriately, frequency and number of individuals to exchange. Topology denes islands structure and the way of connection between them. Practically, there is no restriction, so we can design whatever we want. We also have no limitations with size and number of subpopulations. It can be equal or dierent number of individuals in each subpopulation and the number of subpopulations can be large or small. This freedom gives a possibility of produce dierent realizations of island model algorithm. 3. Implementation description In this work the island model of EA for QAP was implemented. Because of the QAP is a permutation problem, some elements of algorithm must be adapt to it. It was choosen the permutation encoding for individuals instead of binary. This allows to reduce representation of solution 4 times, for the same size of instance [1]. Besides it is more intuitive. Fig. 1 shows the representation of example solution for size n = 10. Facilities: Locations: Fig. 1. Representation of example solution in QAP Topology Topology is based on the super star-shape model [5]. Four star-shaped structure subpopulations create a universe U. Universes are connected through their central subpopulations. This topology, for three universes, is shown on 128
3 g. 2. The arrows means possible directions of migration. Parent1: Child1: Parent2: Child2: Fig. 3. Example of PMX operator. For example from g. 4, if there was choosen positions: 2, 3, 5, 9, 10, the mapping is: 2 5, 5 10, 8 8, 6 4, 4 7. Fig. 2. Super star-shape topology. Parent1: Child1: Parent2: Child2: Operators To obtain a child population the genetic operators, like crossover and mutation, was used. For permutation problems, usually the specic operators was used, which can preserved permutational character of solutions. In my algorithm the two crossover operators: PMX and UX was implemented and one mutation operator: EM. For each of them there was dened a probability of appear, mark appropriately: p P MX, p UX and p EM. They must fulll condition: p P MX + p UX + p EM = 1 (3) The PMX (partially-mapped crossover) operator can be describe in 3 steps: 1. Choose the subsequence in Parent1 and copy it to Child1. 2. From Parent2 copy this position to Child2, which are not yet in it. 3. Rest of position ll basing on mapping. Mapping is created after choose the subsequence. It makes a pairs of values occuring in the same position in subsequence in both parent. For example from g. 3 the mapping is: 9 1, 8 8, 7 9, 3 2, 1 6, 6 4. The UX (uniform crossover) operator is similar to PMX. Main dierence between them is in the rst step couple positions instead of subsequence was choosen. Rest steps is like in PMX. Fig. 4. Example of UX operator. The EM (exchange mutation) operator is very simple. There was choosen two positions and then the values between this positions was exchange. In g. 5 is shown example of this operator. The positions to exchange are: 4 and 7. Parent: Migration Fig. 5. Example of EM operator. Child: Implemented migration strategy was drawn from [5], but in this work they are rst time adapt to QAP. The main parameter is value θ called threshold, and: 0 θ max{ fit i fit j }, (4) where fit k means the best individual's tness value in subpopulation k. We dene α: { 1, for f it > θ, α = (5) 0, for f it θ, where fit = fit i fit j. In each generation, for two subpopulations: i and j, for which migration is possible, there was evaluated a value of α and then there was completed this steps: 129
4 1. On the basis of fit it can be described the direction of migration. If fit < 0 migration succeed from subpopulation i to j, if fit > 0 migration has the oposite direction, and if fit = 0 there is no migration. 2. If α = 1, S individuals were choosen to migrate, with tournament selection method, else there is no migration. 3. From target subpopulation S worst individuals were removed and the imigrants can be received. Value S is equal subpopulation size. Additionaly there was distinguished two kind of migration: local and global. Local migration is the migration between subpopulations in one universum and it is evaluated in each iteration. Global migration is the migration between universes, which mean migration between central subpopulations and it is evaluated in every 10 iteration. Values of thresholds may be dierent for local and global migration and it was marked: θ L and θ G respectively Parallelism In implemented algorithm an OpenMP was used to obtain a real parallelism. OpenMP (Open Multi-Processing) is an Application Program Interface (API) for C, C++ and Fortran that may be used to explicitly direct multithreaded, shared memory parallelism [6]. Open- MP can be used in any multi-processor, shared memory envirnment, both Unix/Linux and Microsoft Windows platforms. It provides a simple and intuitive pre-processor directives. They de- ne how to divide the code between processors, which parts should be make sequentially and which parellel and the rules of data sharing. Using OpenMP the code was divided to parallel section: the basic island EA with local migration on each universum, and short sequential section: global migartion between universes. It is clearly ilustrated on g. 6, which contain the pseudo code for implemented algorithm. 4. Experiments The algorithm was implemented in C++, compiled and ran on computer with dual core processor: Intel Core 2 Duo T GHz, with begin Init t = 0 while not STOPCondition do foreach U do parallel begin BasicEA(t) LocalMigration(t) end for if (t%10 = 0) GlobalMigration(t) end if t = t + 1 end while end return BestSolution Fig. 6. Pseudo code for implemented algorithm Linux Gentoo system based on kernel and the compiler was gcc All tests was made on the instances from QAPLIB [3]. QAPLIB is the library of QAP instances. It can be found at: It contain more then 100 tests examples, their authors and best known solutions. Moreover, it is good source of knowledge about current research of QAP and contacts to people, who do this research Migration Some experiments were designed to choose good values for migration parameters. Migration parameters are: local (θ L ) and global (θ G ) thresholds and number of universes (U). For each instance and each combination of parameters the algorithm was ran 10 times and there was compared average and best obtaining solution F EA. First there was tested local and global migration thresholds θ L and θ G. There must fulll condition 4, which means there can't be greater than the greatest dierence between best subpopulations solutions. However, for various instances, objective function was eveluated from various matrixes D and F. This fact makes big divergence in obtained values of this 130
5 function. To compare values of θ L a new parameter ψ describing an instance, was dened: ψ = max{d i,j } max{f i,j } (6) The threshold θ G was set to be equal to ψ. Number of universes U was set to 4. We tested 32 instances for θ L equal 10%, 50%, 100% and 200% of ψ. We obtained the best solutions in the shortest time for θ L = 10%ψ. Also for θ L = 1/2ψ algorithm found good solutions, it means that frequent migration improve computations. Second experiments was similar to previous one, because the inuece of global migration frequent was tested. The same parameter ψ de- ned at 6 was used too. The local migration threshold was set to 1/2ψ and number of universes U was still 4. The same 32 instances was tested for θ G equal 10%, 50%, 100% and 200% of ψ. Result of this test shown that the best solutions was obtained for θ G = 1/2ψ. It is compromise between fast convergence and diversity among universes. Last tested thing in migration was number of universes. The θ G was set to ψ and θ L = 1/2ψ. The value of U was changed - rst it was 2, then 3 and 4. Conclusion from this test was very simple - algorithm found better solutions for greater value of U. More details about tests are in [7] Parallelism As was described in sec. 3 the OpenMP was used to parallelize code. Parallel and sequential version of the algorithm was tested to calculate obtained acceleration. Experiment was ran in environment described at the top of this section. Tested instace was nug25. In tab. 1 are the times of computation for sequential and parallel version of code. There are sum of 20 runs T 20 and the average time of one run T av. The acceleration can be evaluated according to equation: S p = T 1 T p, (7) where p processors number, T 1 time of run sequential algorithm, T p time of run parallel Tab. 1. Comparision of sequential and parallel version of algorithm. version T 20 [s] T av [s] sequential parallel version of algorithm on p processors. Obtained acceleration S 2 was: on dual-core processor. S 2 = = 1.67 (8) The processor load was also checked. Fig. 7 shows cores load while the sequential version was running, and g. 8 cores load while parallel version is runinig. It is simple to see that Fig. 7. Processor load while sequential version is running. Fig. 8. Processor load while parallel version is running. parallel version of code use both core in the same time and it end quicker than sequential version General evaluation In tab. 2 are results of our experiments. F best is the best solution from QAPLIB, F EA is the best solution obtained during three described previous tests and e is the percentage deviations over the F best : e = F EA F best F best 100%. (9) 131
6 Tab. 2. Comparision between best known solutions from QAPLIB and our best obtained solutions. name F best F EA e [%] esc32a esc32b esc32c esc32d esc32e esc32g esc32h esc64a esc kra30a kra30b kra lipa20a lipa30a lipa40a lipa50a nug nug nug nug rou rou rou scr scr scr tai25a tai30a tai40a tai50a tai60a tai80a Conclusions The island model of EA was implemented and tested, with migration strategy from [5]. This was rst implementation of this migration model for QAP. The OpenMP was used to parallelize code. The main tested element was migration. The experiments was carried out to check inuence of migration parameters for algorithm. For universes number, it was obtained simple conclusion: algorithm nds better solutions for greater value of U. For thresholds (θ L and θ G ) it is hard to determine one, universal good value, their should be adjust individualy to instances. Proposed strategy: set less value of local migration threshold to provide good information ow between subpopulations, and higher threshold for global migration to preserve diversity among universes. Also parallelism was succesfull tested. Obtained acceleration was equal to 1.67 on dualcore processor. In more parallel environment it will be possible to improve this results, because algorithm can be used with more universes. Algorithm found solutions, which are very close to best known solutions from QAPLIB. Acknowledgment Work nanced by state science funds for as a research project. Contract no. N N Bibliography [1] Chmiel Wojciech: Algorytmy ewolucyjne w optymalizacji przydziaªu zada«z kwadratow funkcj celu, Rozprawa doktorska, AGH Kraków, Wydziaª EAIiE. Promotor: K. Wala [2] Çela Eranda: The quadratic assignment problem: theory and algorithms,kluwer Academic Publishers, 1998 [3] QAPLIB: [4] Ji P., Wu Y., Liu H.: A Solution Method for the Quadratic Assignment Problem (QAP), ISO- RA'06, pp , 2006 [5] Gu J., Gu X., Gu M.: A novel parallel quantum genetic algorithm for stochastic job shop scheduling, Journal of Mathematical Analysis and Applications, vol. 355, pp , 2009 [6] OpenMP: [7] Obr czka Anna: Równolegªe realizacje algorytmów ewolucyjnych., Praca magisterska, AGH Kraków, Wydziaª EAIiE. Promotor: W. Chmiel Author: mgr in». Anna Obr czka Akademia Górniczo-Hutnicza Katedra Automatyki Al. Mickiewicza 30/B Kraków anna.obraczka@gmail.com 132
A New Heuristic for the Quadratic Assignment Problem
JOURNAL OF APPLIED MATHEMATICS AND DECISION SCIENCES, 6(3), 143 153 Copyright c 2002, Lawrence Erlbaum Associates, Inc. A New Heuristic for the Quadratic Assignment Problem ZVI DREZNER zdrezner@fullerton.edu
More informationAdvances in Metaheuristics on GPU
Advances in Metaheuristics on GPU 1 Thé Van Luong, El-Ghazali Talbi and Nouredine Melab DOLPHIN Project Team May 2011 Interests in optimization methods 2 Exact Algorithms Heuristics Branch and X Dynamic
More informationAn Evolutionary Algorithm for the Multi-objective Shortest Path Problem
An Evolutionary Algorithm for the Multi-objective Shortest Path Problem Fangguo He Huan Qi Qiong Fan Institute of Systems Engineering, Huazhong University of Science & Technology, Wuhan 430074, P. R. China
More informationOptimization of fuzzy multi-company workers assignment problem with penalty using genetic algorithm
Optimization of fuzzy multi-company workers assignment problem with penalty using genetic algorithm N. Shahsavari Pour Department of Industrial Engineering, Science and Research Branch, Islamic Azad University,
More informationACO and other (meta)heuristics for CO
ACO and other (meta)heuristics for CO 32 33 Outline Notes on combinatorial optimization and algorithmic complexity Construction and modification metaheuristics: two complementary ways of searching a solution
More informationA new inter-island genetic operator for optimization problems with block properties
A new inter-island genetic operator for optimization problems with block properties Wojciech Bożejko 1 and Mieczys law Wodecki 2 1 Institute of Engineering Cybernetics, Wroc law University of Technology
More informationEstimation of Distribution Algorithm with 2-opt Local Search for the Quadratic Assignment Problem
Estimation of Distribution Algorithm with 2-opt Local Search for the Quadratic Assignment Problem Qingfu Zhang, Jianyong Sun, Edward Tsang and John Ford Department of Computer Science, University of Essex
More informationDiscrete Cat Swarm Optimization for Solving the Quadratic Assignment Problem
Discrete Cat Swarm Optimization for Solving the Quadratic Assignment Problem *1 Mohammed ESSAID RIFFI, 2 Abdelhamid BOUZIDI Laboratory of MATIC, Computer Science Department. Faculty of Sciences, Chouaïb
More informationMetaheuristic Development Methodology. Fall 2009 Instructor: Dr. Masoud Yaghini
Metaheuristic Development Methodology Fall 2009 Instructor: Dr. Masoud Yaghini Phases and Steps Phases and Steps Phase 1: Understanding Problem Step 1: State the Problem Step 2: Review of Existing Solution
More informationImproved Discrete Differential Evolution Algorithm in Solving Quadratic Assignment Problem for best Solutions
Improved Discrete Differential Evolution Algorithm in Solving Quadratic Assignment Problem for best Solutions Asaad Shakir Hameed 1, Burhanuddin Mohd Aboobaider 2, Ngo Hea Choon 3, Modhi Lafta Mutar 4
More informationSolving quadratic assignment problem using water cycle optimization algorithm
International Journal of Intelligent Information Systems 2014; 3(6-1): 75-79 Published online November 3, 2014 (http://www.sciencepublishinggroup.com/j/ijiis) doi: 10.11648/j.ijiis.s.2014030601.24 ISSN:
More informationCHAPTER 4 GENETIC ALGORITHM
69 CHAPTER 4 GENETIC ALGORITHM 4.1 INTRODUCTION Genetic Algorithms (GAs) were first proposed by John Holland (Holland 1975) whose ideas were applied and expanded on by Goldberg (Goldberg 1989). GAs is
More informationSUITABLE CONFIGURATION OF EVOLUTIONARY ALGORITHM AS BASIS FOR EFFICIENT PROCESS PLANNING TOOL
DAAAM INTERNATIONAL SCIENTIFIC BOOK 2015 pp. 135-142 Chapter 12 SUITABLE CONFIGURATION OF EVOLUTIONARY ALGORITHM AS BASIS FOR EFFICIENT PROCESS PLANNING TOOL JANKOWSKI, T. Abstract: The paper presents
More informationARTIFICIAL INTELLIGENCE (CSCU9YE ) LECTURE 5: EVOLUTIONARY ALGORITHMS
ARTIFICIAL INTELLIGENCE (CSCU9YE ) LECTURE 5: EVOLUTIONARY ALGORITHMS Gabriela Ochoa http://www.cs.stir.ac.uk/~goc/ OUTLINE Optimisation problems Optimisation & search Two Examples The knapsack problem
More informationii
ACO Algorithms for the Quadratic Assignment Problem Thomas Stutzle 1 and Marco Dorigo IRIDIA Universite Libre de Bruxelles ftstutzle,mdorigog@ulb.ac.be 1 Currently on leave from FG Intellektik, TU Darmstadt.
More informationA LOWER BOUND FOR THE QAP BASED ON GRAPH THEORY AND LINEAR PROGRAMMING
A LOWER BOUND FOR THE QAP BASED ON GRAPH THEORY AND LINEAR PROGRAMMING André R. S. Amaral Universidade Federal do Espírito Santo, Departamento de Informática, 29060-900, Vitória, ES, Brasil Abstract Let
More informationGA is the most popular population based heuristic algorithm since it was developed by Holland in 1975 [1]. This algorithm runs faster and requires les
Chaotic Crossover Operator on Genetic Algorithm Hüseyin Demirci Computer Engineering, Sakarya University, Sakarya, 54187, Turkey Ahmet Turan Özcerit Computer Engineering, Sakarya University, Sakarya, 54187,
More informationParallel Ant Colonies for Combinatorial. Abstract. Ant Colonies (AC) optimization take inspiration from the behavior
Parallel Ant Colonies for Combinatorial Optimization Problems El-ghazali Talbi?, Olivier Roux, Cyril Fonlupt, Denis Robillard?? Abstract. Ant Colonies (AC) optimization take inspiration from the behavior
More informationA Pheromone Trails Model for MAX-MIN Ant System
A Pheromone Trails Model for MAX-MIN Ant System Nikola Ivkovic 1, Marin Golub 2, Mirko Malekovic 1 1 Faculty of Organization and Informatics, University of Zagreb {nikola.ivkovic, mirko.malekovic}@foi.hr
More informationA NEW GENETIC REPRESENTATION FOR QUADRATIC ASSIGNMENT PROBLEM 1
Yugoslav Journal of Operations Research 2 (20), Number 2, 225-238 DOI: 0.2298/YJOR02225K A NEW GENETIC REPRESENTATION FOR QUADRATIC ASSIGNMENT PROBLEM Jozef KRATICA Mathematical Institute, Serbian Academy
More informationA Genetic Algorithm for Graph Matching using Graph Node Characteristics 1 2
Chapter 5 A Genetic Algorithm for Graph Matching using Graph Node Characteristics 1 2 Graph Matching has attracted the exploration of applying new computing paradigms because of the large number of applications
More informationFrontier Pareto-optimum
Distributed Genetic Algorithms with a New Sharing Approach in Multiobjective Optimization Problems Tomoyuki HIROYASU Mitsunori MIKI Sinya WATANABE Doshisha University, Dept. of Knowledge Engineering and
More informationFuzzy Inspired Hybrid Genetic Approach to Optimize Travelling Salesman Problem
Fuzzy Inspired Hybrid Genetic Approach to Optimize Travelling Salesman Problem Bindu Student, JMIT Radaur binduaahuja@gmail.com Mrs. Pinki Tanwar Asstt. Prof, CSE, JMIT Radaur pinki.tanwar@gmail.com Abstract
More informationScheduling Mixed-Model Assembly Lines with Cost Objectives by a Hybrid Algorithm
Scheduling Mixed-Model Assembly Lines with Cost Objectives by a Hybrid Algorithm Binggang Wang, Yunqing Rao, Xinyu Shao, and Mengchang Wang The State Key Laboratory of Digital Manufacturing Equipment and
More informationTHE DEVELOPMENT OF THE POTENTIAL AND ACADMIC PROGRAMMES OF WROCLAW UNIVERISTY OF TECHNOLOGY METAHEURISTICS
METAHEURISTICS 1. Objectives The goals of the laboratory workshop are as follows: to learn basic properties of evolutionary computation techniques and other metaheuristics for solving various global optimization
More informationA tabu search based memetic algorithm for the max-mean dispersion problem
A tabu search based memetic algorithm for the max-mean dispersion problem Xiangjing Lai a and Jin-Kao Hao a,b, a LERIA, Université d'angers, 2 Bd Lavoisier, 49045 Angers, France b Institut Universitaire
More informationHardware/Software Codesign
Hardware/Software Codesign 3. Partitioning Marco Platzner Lothar Thiele by the authors 1 Overview A Model for System Synthesis The Partitioning Problem General Partitioning Methods HW/SW-Partitioning Methods
More informationBI-OBJECTIVE EVOLUTIONARY ALGORITHM FOR FLEXIBLE JOB-SHOP SCHEDULING PROBLEM. Minimizing Make Span and the Total Workload of Machines
International Journal of Mathematics and Computer Applications Research (IJMCAR) ISSN 2249-6955 Vol. 2 Issue 4 Dec - 2012 25-32 TJPRC Pvt. Ltd., BI-OBJECTIVE EVOLUTIONARY ALGORITHM FOR FLEXIBLE JOB-SHOP
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 informationParallel Genetic Algorithm to Solve Traveling Salesman Problem on MapReduce Framework using Hadoop Cluster
Parallel Genetic Algorithm to Solve Traveling Salesman Problem on MapReduce Framework using Hadoop Cluster Abstract- Traveling Salesman Problem (TSP) is one of the most common studied problems in combinatorial
More informationEvolutionary Linkage Creation between Information Sources in P2P Networks
Noname manuscript No. (will be inserted by the editor) Evolutionary Linkage Creation between Information Sources in P2P Networks Kei Ohnishi Mario Köppen Kaori Yoshida Received: date / Accepted: date Abstract
More informationCrew Scheduling Problem: A Column Generation Approach Improved by a Genetic Algorithm. Santos and Mateus (2007)
In the name of God Crew Scheduling Problem: A Column Generation Approach Improved by a Genetic Algorithm Spring 2009 Instructor: Dr. Masoud Yaghini Outlines Problem Definition Modeling As A Set Partitioning
More informationSparse Matrices Reordering using Evolutionary Algorithms: A Seeded Approach
1 Sparse Matrices Reordering using Evolutionary Algorithms: A Seeded Approach David Greiner, Gustavo Montero, Gabriel Winter Institute of Intelligent Systems and Numerical Applications in Engineering (IUSIANI)
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 informationGT HEURISTIC FOR SOLVING MULTI OBJECTIVE JOB SHOP SCHEDULING PROBLEMS
GT HEURISTIC FOR SOLVING MULTI OBJECTIVE JOB SHOP SCHEDULING PROBLEMS M. Chandrasekaran 1, D. Lakshmipathy 1 and P. Sriramya 2 1 Department of Mechanical Engineering, Vels University, Chennai, India 2
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 informationGENETIC ALGORITHM VERSUS PARTICLE SWARM OPTIMIZATION IN N-QUEEN PROBLEM
Journal of Al-Nahrain University Vol.10(2), December, 2007, pp.172-177 Science GENETIC ALGORITHM VERSUS PARTICLE SWARM OPTIMIZATION IN N-QUEEN PROBLEM * Azhar W. Hammad, ** Dr. Ban N. Thannoon Al-Nahrain
More informationData Mining Chapter 8: Search and Optimization Methods Fall 2011 Ming Li Department of Computer Science and Technology Nanjing University
Data Mining Chapter 8: Search and Optimization Methods Fall 2011 Ming Li Department of Computer Science and Technology Nanjing University Search & Optimization Search and Optimization method deals with
More informationA GA-ACO-Local Search Hybrid Algorithm for Solving Quadratic Assignment Problem
A GA-ACO-Local Search Hybrid Algorithm for Solving Quadratic Assignment Problem Yi-Liang Xu, Meng-Hiot Lim, Yew-Soon Ong, Jing Tang Intelligent System Center, Research Techno Plaza Nanyang Technological
More informationGenetic Algorithms for Solving. Open Shop Scheduling Problems. Sami Khuri and Sowmya Rao Miryala. San Jose State University.
Genetic Algorithms for Solving Open Shop Scheduling Problems Sami Khuri and Sowmya Rao Miryala Department of Mathematics and Computer Science San Jose State University San Jose, California 95192, USA khuri@cs.sjsu.edu
More information2 The Service Provision Problem The formulation given here can also be found in Tomasgard et al. [6]. That paper also details the background of the mo
Two-Stage Service Provision by Branch and Bound Shane Dye Department ofmanagement University of Canterbury Christchurch, New Zealand s.dye@mang.canterbury.ac.nz Asgeir Tomasgard SINTEF, Trondheim, Norway
More informationExtending MATLAB and GA to Solve Job Shop Manufacturing Scheduling Problems
Extending MATLAB and GA to Solve Job Shop Manufacturing Scheduling Problems Hamidullah Khan Niazi 1, Sun Hou-Fang 2, Zhang Fa-Ping 3, Riaz Ahmed 4 ( 1, 4 National University of Sciences and Technology
More informationA Particle Swarm Approach to Quadratic Assignment Problems
A Particle Swarm Approach to Quadratic Assignment Problems Hongbo Liu 1,3, Ajith Abraham 2,3, and Jianying Zhang 1 1 Department of Computer Science, Dalian University of Technology, Dalian, 116023, China
More informationParallel Ant Colonies for the quadratic assignment problem
Future Generation Computer Systems 17 (2001) 441 449 Parallel Ant Colonies for the quadratic assignment problem E.-G. Talbi a,, O. Roux b, C. Fonlupt b, D. Robillard b a LIFL URA-369 CNRS/Université de
More informationC 1 Modified Genetic Algorithm to Solve Time-varying Lot Sizes Economic Lot Scheduling Problem
C 1 Modified Genetic Algorithm to Solve Time-varying Lot Sizes Economic Lot Scheduling Problem Bethany Elvira 1, Yudi Satria 2, dan Rahmi Rusin 3 1 Student in Department of Mathematics, University of Indonesia,
More informationThe study of comparisons of three crossover operators in genetic algorithm for solving single machine scheduling problem. Quan OuYang, Hongyun XU a*
International Conference on Manufacturing Science and Engineering (ICMSE 2015) The study of comparisons of three crossover operators in genetic algorithm for solving single machine scheduling problem Quan
More informationMETAHEURISTIC. Jacques A. Ferland Department of Informatique and Recherche Opérationnelle Université de Montréal.
METAHEURISTIC Jacques A. Ferland Department of Informatique and Recherche Opérationnelle Université de Montréal ferland@iro.umontreal.ca March 2015 Overview Heuristic Constructive Techniques: Generate
More informationA Steady-State Genetic Algorithm for Traveling Salesman Problem with Pickup and Delivery
A Steady-State Genetic Algorithm for Traveling Salesman Problem with Pickup and Delivery Monika Sharma 1, Deepak Sharma 2 1 Research Scholar Department of Computer Science and Engineering, NNSS SGI Samalkha,
More informationAdaptive Spiral Optimization Algorithm for Benchmark Problems
Bilecik Şeyh Edebali Üniversitesi Fen Bilimleri Dergisi, Cilt:, Sayı:, 6 ISSN: -77 (http://edergi.bilecik.edu.tr/index.php/fbd) Araştırma Makalesi/Research Article Adaptive Spiral Optimization Algorithm
More informationOpen Access A Sequence List Algorithm For The Job Shop Scheduling Problem
Send Orders of Reprints at reprints@benthamscience.net The Open Electrical & Electronic Engineering Journal, 2013, 7, (Supple 1: M6) 55-61 55 Open Access A Sequence List Algorithm For The Job Shop Scheduling
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 informationOptimal Reactive Power Dispatch Using Hybrid Loop-Genetic Based Algorithm
Optimal Reactive Power Dispatch Using Hybrid Loop-Genetic Based Algorithm Md Sajjad Alam Student Department of Electrical Engineering National Institute of Technology, Patna Patna-800005, Bihar, India
More informationResearch Incubator: Combinatorial Optimization. Dr. Lixin Tao December 9, 2003
Research Incubator: Combinatorial Optimization Dr. Lixin Tao December 9, 23 Content General Nature of Research on Combinatorial Optimization Problem Identification and Abstraction Problem Properties and
More informationA Genetic Algorithm for Multiprocessor Task Scheduling
A Genetic Algorithm for Multiprocessor Task Scheduling Tashniba Kaiser, Olawale Jegede, Ken Ferens, Douglas Buchanan Dept. of Electrical and Computer Engineering, University of Manitoba, Winnipeg, MB,
More informationResearch on time optimal trajectory planning of 7-DOF manipulator based on genetic algorithm
Acta Technica 61, No. 4A/2016, 189 200 c 2017 Institute of Thermomechanics CAS, v.v.i. Research on time optimal trajectory planning of 7-DOF manipulator based on genetic algorithm Jianrong Bu 1, Junyan
More informationA Memetic Heuristic for the Co-clustering Problem
A Memetic Heuristic for the Co-clustering Problem Mohammad Khoshneshin 1, Mahtab Ghazizadeh 2, W. Nick Street 1, and Jeffrey W. Ohlmann 1 1 The University of Iowa, Iowa City IA 52242, USA {mohammad-khoshneshin,nick-street,jeffrey-ohlmann}@uiowa.edu
More informationModified Order Crossover (OX) Operator
Modified Order Crossover (OX) Operator Ms. Monica Sehrawat 1 N.C. College of Engineering, Israna Panipat, Haryana, INDIA. Mr. Sukhvir Singh 2 N.C. College of Engineering, Israna Panipat, Haryana, INDIA.
More informationHomework 2: Search and Optimization
Scott Chow ROB 537: Learning Based Control October 16, 2017 Homework 2: Search and Optimization 1 Introduction The Traveling Salesman Problem is a well-explored problem that has been shown to be NP-Complete.
More informationHeuristic Optimisation
Heuristic Optimisation Part 10: Genetic Algorithm Basics 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
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 informationA heuristic approach to find the global optimum of function
Journal of Computational and Applied Mathematics 209 (2007) 160 166 www.elsevier.com/locate/cam A heuristic approach to find the global optimum of function M. Duran Toksarı Engineering Faculty, Industrial
More informationA HYBRID APPROACH IN GENETIC ALGORITHM: COEVOLUTION OF THREE VECTOR SOLUTION ENCODING. A CASE-STUDY
A HYBRID APPROACH IN GENETIC ALGORITHM: COEVOLUTION OF THREE VECTOR SOLUTION ENCODING. A CASE-STUDY Dmitriy BORODIN, Victor GORELIK, Wim DE BRUYN and Bert VAN VRECKEM University College Ghent, Ghent, Belgium
More informationBranch-and-bound: an example
Branch-and-bound: an example Giovanni Righini Università degli Studi di Milano Operations Research Complements The Linear Ordering Problem The Linear Ordering Problem (LOP) is an N P-hard combinatorial
More informationCell-to-switch assignment in. cellular networks. barebones particle swarm optimization
Cell-to-switch assignment in cellular networks using barebones particle swarm optimization Sotirios K. Goudos a), Konstantinos B. Baltzis, Christos Bachtsevanidis, and John N. Sahalos RadioCommunications
More informationNew algorithm for analyzing performance of neighborhood strategies in solving job shop scheduling problems
Journal of Scientific & Industrial Research ESWARAMURTHY: NEW ALGORITHM FOR ANALYZING PERFORMANCE OF NEIGHBORHOOD STRATEGIES 579 Vol. 67, August 2008, pp. 579-588 New algorithm for analyzing performance
More informationParallel path-relinking method for the flow shop scheduling problem
Parallel path-relinking method for the flow shop scheduling problem Wojciech Bożejko 1 and Mieczys law Wodecki 2 1 Wroc law University of Technology Institute of Computer Engineering, Control and Robotics
More informationMultiprocessor Scheduling Using Parallel Genetic Algorithm
www.ijcsi.org 260 Multiprocessor Scheduling Using Parallel Genetic Algorithm Nourah Al-Angari 1, Abdullatif ALAbdullatif 2 1,2 Computer Science Department, College of Computer & Information Sciences, King
More informationSolving the Traveling Salesman Problem using Reinforced Ant Colony Optimization techniques
Solving the Traveling Salesman Problem using Reinforced Ant Colony Optimization techniques N.N.Poddar 1, D. Kaur 2 1 Electrical Engineering and Computer Science, University of Toledo, Toledo, OH, USA 2
More informationUsing Genetic Algorithms to Solve the Box Stacking Problem
Using Genetic Algorithms to Solve the Box Stacking Problem Jenniffer Estrada, Kris Lee, Ryan Edgar October 7th, 2010 Abstract The box stacking or strip stacking problem is exceedingly difficult to solve
More informationScheduling of Independent Tasks in Cloud Computing Using Modified Genetic Algorithm (FUZZY LOGIC)
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 4, Issue. 9, September 2015,
More informationDETERMINING MAXIMUM/MINIMUM VALUES FOR TWO- DIMENTIONAL MATHMATICLE FUNCTIONS USING RANDOM CREOSSOVER TECHNIQUES
DETERMINING MAXIMUM/MINIMUM VALUES FOR TWO- DIMENTIONAL MATHMATICLE FUNCTIONS USING RANDOM CREOSSOVER TECHNIQUES SHIHADEH ALQRAINY. Department of Software Engineering, Albalqa Applied University. E-mail:
More informationAN IMPROVED ITERATIVE METHOD FOR SOLVING GENERAL SYSTEM OF EQUATIONS VIA GENETIC ALGORITHMS
AN IMPROVED ITERATIVE METHOD FOR SOLVING GENERAL SYSTEM OF EQUATIONS VIA GENETIC ALGORITHMS Seyed Abolfazl Shahzadehfazeli 1, Zainab Haji Abootorabi,3 1 Parallel Processing Laboratory, Yazd University,
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 informationMeta-Heuristic Combining Prior, Online and Offline Information for the Quadratic Assignment Problem. Jianyong Sun, Qingfu Zhang and Xin Yao
1 Meta-Heuristic Combining Prior, Online and Offline Information for the Quadratic Assignment Problem Jianyong Sun, Qingfu Zhang and Xin Yao Abstract The construction of promising solutions for N P- hard
More informationA Parallel Architecture for the Generalized Traveling Salesman Problem
A Parallel Architecture for the Generalized Traveling Salesman Problem Max Scharrenbroich AMSC 663 Project Proposal Advisor: Dr. Bruce L. Golden R. H. Smith School of Business 1 Background and Introduction
More informationIn Proc of 4th Int'l Conf on Parallel Problem Solving from Nature New Crossover Methods for Sequencing Problems 1 Tolga Asveren and Paul Molito
0 NEW CROSSOVER METHODS FOR SEQUENCING PROBLEMS In Proc of 4th Int'l Conf on Parallel Problem Solving from Nature 1996 1 New Crossover Methods for Sequencing Problems 1 Tolga Asveren and Paul Molitor Abstract
More informationO(1) Delta Component Computation Technique for the Quadratic Assignment Problem
O(1) Delta Component Computation Technique for the Quadratic Assignment Problem Sergey Podolsky, Yuri Zorin National Technical University of Ukraine Kyiv Polytechnic Institute Faculty of Applied Mathematics
More informationGenetic Hybrids for the. Quadratic Assignment Problem CHARLES FLEURENT AND JACQUES A. FERLAND. May 16, 1993
DIMACS Series in Discrete Mathematics and Theoretical Computer Science Volume 00, 0000 Genetic Hybrids for the Quadratic Assignment Problem CHARLES FLEURENT AND JACQUES A. FERLAND May 16, 1993 Abstract.
More informationOptimization of Makespan and Mean Flow Time for Job Shop Scheduling Problem FT06 Using ACO
Optimization of Makespan and Mean Flow Time for Job Shop Scheduling Problem FT06 Using ACO Nasir Mehmood1, Muhammad Umer2, Dr. Riaz Ahmad3, Dr. Amer Farhan Rafique4 F. Author, Nasir Mehmood is with National
More informationAn Approach to Polygonal Approximation of Digital CurvesBasedonDiscreteParticleSwarmAlgorithm
Journal of Universal Computer Science, vol. 13, no. 10 (2007), 1449-1461 submitted: 12/6/06, accepted: 24/10/06, appeared: 28/10/07 J.UCS An Approach to Polygonal Approximation of Digital CurvesBasedonDiscreteParticleSwarmAlgorithm
More informationAIRFOIL SHAPE OPTIMIZATION USING EVOLUTIONARY ALGORITHMS
AIRFOIL SHAPE OPTIMIZATION USING EVOLUTIONARY ALGORITHMS Emre Alpman Graduate Research Assistant Aerospace Engineering Department Pennstate University University Park, PA, 6802 Abstract A new methodology
More informationA Binary Model on the Basis of Cuckoo Search Algorithm in Order to Solve the Problem of Knapsack 1-0
22 International Conference on System Engineering and Modeling (ICSEM 22) IPCSIT vol. 34 (22) (22) IACSIT Press, Singapore A Binary Model on the Basis of Cuckoo Search Algorithm in Order to Solve the Problem
More informationHEURISTICS FOR THE NETWORK DESIGN PROBLEM
HEURISTICS FOR THE NETWORK DESIGN PROBLEM G. E. Cantarella Dept. of Civil Engineering University of Salerno E-mail: g.cantarella@unisa.it G. Pavone, A. Vitetta Dept. of Computer Science, Mathematics, Electronics
More informationCombining Two Local Searches with Crossover: An Efficient Hybrid Algorithm for the Traveling Salesman Problem
Combining Two Local Searches with Crossover: An Efficient Hybrid Algorithm for the Traveling Salesman Problem Weichen Liu, Thomas Weise, Yuezhong Wu and Qi Qi University of Science and Technology of Chine
More informationA Population-Based Learning Algorithm Which Learns Both. Architectures and Weights of Neural Networks y. Yong Liu and Xin Yao
A Population-Based Learning Algorithm Which Learns Both Architectures and Weights of Neural Networks y Yong Liu and Xin Yao Computational Intelligence Group Department of Computer Science University College,
More informationSolving the Capacitated Single Allocation Hub Location Problem Using Genetic Algorithm
Solving the Capacitated Single Allocation Hub Location Problem Using Genetic Algorithm Faculty of Mathematics University of Belgrade Studentski trg 16/IV 11 000, Belgrade, Serbia (e-mail: zoricast@matf.bg.ac.yu)
More informationCombination of Guided Local Search and Estimation of Distribution Algorithm for Quadratic Assignment Problems
Combination of Guided Local Search and Estimation of Distribution Algorithm for Quadratic Assignment Problems Qingfu Zhang, Jianyong Sun, Edward Tsang and John Ford Department of Computer Science University
More informationA Solution for the Quadratic Assignment Problem (QAP) through a Parallel Genetic Algorithm Based Grid on GPU
Applied Mathematical Sciences, Vol. 11, 2017, no. 57, 2843-2854 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ams.2017.710319 A Solution for the Quadratic Assignment Problem (QAP) through a Parallel
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 informationParameter Optimization for Evolutionary Algorithm Quadratic Assignment Problem
Parameter Optimization for Evolutionary Algorithm Quadratic Assignment Problem S. Muenvanichakul 1, C. Chanpilom 2 1 Department of Industrial Engineering, Kasetsart University Sriracha Campus, Chonburi
More informationHybrid approach for solving TSP by using DPX Cross-over operator
Available online at www.pelagiaresearchlibrary.com Advances in Applied Science Research, 2011, 2 (1): 28-32 ISSN: 0976-8610 CODEN (USA): AASRFC Hybrid approach for solving TSP by using DPX Cross-over operator
More informationA Comparative Study for Efficient Synchronization of Parallel ACO on Multi-core Processors in Solving QAPs
2 IEEE Symposium Series on Computational Intelligence A Comparative Study for Efficient Synchronization of Parallel ACO on Multi-core Processors in Solving Qs Shigeyoshi Tsutsui Management Information
More informationStudy on GA-based matching method of railway vehicle wheels
Available online www.jocpr.com Journal of Chemical and Pharmaceutical Research, 2014, 6(4):536-542 Research Article ISSN : 0975-7384 CODEN(USA) : JCPRC5 Study on GA-based matching method of railway vehicle
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 informationRandomized rounding of semidefinite programs and primal-dual method for integer linear programming. Reza Moosavi Dr. Saeedeh Parsaeefard Dec.
Randomized rounding of semidefinite programs and primal-dual method for integer linear programming Dr. Saeedeh Parsaeefard 1 2 3 4 Semidefinite Programming () 1 Integer Programming integer programming
More informationA Hybrid Genetic Algorithm for the Distributed Permutation Flowshop Scheduling Problem Yan Li 1, a*, Zhigang Chen 2, b
International Conference on Information Technology and Management Innovation (ICITMI 2015) A Hybrid Genetic Algorithm for the Distributed Permutation Flowshop Scheduling Problem Yan Li 1, a*, Zhigang Chen
More informationA Two-Stage Stochastic Programming Approach for Location-Allocation Models in Uncertain Environments
A Two-Stage Stochastic Programming Approach for Location-Allocation in Uncertain Environments Markus Kaiser, Kathrin Klamroth Optimization & Approximation Department of Mathematics University of Wuppertal
More informationThe Memetic Algorithm for The Minimum Spanning Tree Problem with Degree and Delay Constraints
The Memetic Algorithm for The Minimum Spanning Tree Problem with Degree and Delay Constraints Minying Sun*,Hua Wang* *Department of Computer Science and Technology, Shandong University, China Abstract
More information1. Introduction. 2. Motivation and Problem Definition. Volume 8 Issue 2, February Susmita Mohapatra
Pattern Recall Analysis of the Hopfield Neural Network with a Genetic Algorithm Susmita Mohapatra Department of Computer Science, Utkal University, India Abstract: This paper is focused on the implementation
More informationParallel Computing in Combinatorial Optimization
Parallel Computing in Combinatorial Optimization Bernard Gendron Université de Montréal gendron@iro.umontreal.ca Course Outline Objective: provide an overview of the current research on the design of parallel
More information