Instruction-set architecture exploration of VLIW ASIPs using a genetic algorithm

Genetic algorithms are commonly used for automatically solving complex design problem because exploration using genetic algorithms can consistently deliver good results when the algorithm is given a long enough run-time. However, the exploration time for problems with huge design spaces can be very long, often making exploration using a genetic algorithm practically infeasible. In this work, we present a genetic algorithm for exploring the instruction-set architecture of VLIW ASIPs and demonstrate its effectiveness by comparing it to two heuristic algorithms. We present several optimizations to the genetic algorithm configuration, and demonstrate how caching of intermediate compilation and simulation results can reduce the exploration time by an order of magnitude

A Multilevel Genetic Algorithm for the Maximum Satisfaction Problem

Genetic algorithms (GA) which belongs to the class of evolutionary algorithms are regarded as highly successful algorithms when applied to a broad range of discrete as well continuous optimization problems. This chapter introduces a hybrid approach combining genetic algorithm with the multilevel paradigm for solving the maximum constraint satisfaction problem (Max-CSP). The multilevel paradigm refers to the process of dividing large and complex problems into smaller ones, which are hopefully much easier to solve, and then work backward toward the solution of the original problem, using the solution reached from a child level as a starting solution for the parent level. The promising performances achieved by the proposed approach are demonstrated by comparisons made to solve conventional random benchmark problems

Finding Optimal Cayley Map Embeddings Using Genetic Algorithms

Genetic algorithms are a commonly used metaheuristic search method aimed at solving complex optimization problems in a variety of fields. These types of algorithms lend themselves to problems that can incorporate stochastic elements, which allows for a wider search across a search space. However, the nature of the genetic algorithm can often cause challenges regarding time-consumption. Although the genetic algorithm may be widely applicable to various domains, it is not guaranteed that the algorithm will outperform other traditional search methods in solving problems specific to particular domains. In this paper, we test the feasibility of genetic algorithms in solving a common optimization problem in topological graph theory. In the study of Cayley maps, one problem that arises is how one can optimally embed a Cayley map of a complete graph onto an orientable surface with the least amount of holes on the surface as possible. One useful application of this optimization problem is in the design of circuit boards since such a process involves minimizing the number of layers that are required to build the circuit while still ensuring that none of the wires will cross. In this paper, we study complete graphs of the form K_12m + 7 for positive integers m and we work on mappings with the finite cyclic group Z_n. We develop several baseline search algorithms to first gain an understanding of the search space and its complexity. Then, we employ two different approaches to building the genetic algorithm and compare their performances in finding optimal Cayley map embeddings

Analysis of Routing Algorithms based on the Natural Inspiration

Nature is a great and immense source of inspiration for solving hard and complex problems in computer science since it exhibits extremely diverse, dynamic, robust, complex and fascinating phenomenon. Nature inspired algorithms are metaheuristics that mimics the nature for solving optimisation problems opening a new era in computation. A new agent-based routing algorithm using optimisation techniques is implemented in this paper. The different optimisation techniques are warty frog fish, artificial ant, ant, ant lion, grey wolf, genetic algorithm (GA) are the combinations used in the packet delivery between the networks. The routing is a process of carrying the data from source to destination in the network. The output of these algorithms is determined by the simulation time. The experiments are implemented with the NS2 software platform, which is based on the basics of C, C++ and TCL scripting language. The results of the algorithm showed that the grey wolf optimiser (GWO) is much better than the other algorithms in the packet delivery between the networks

An Artificial Human Optimization Algorithm titled Human Thinking Particle Swarm Optimization

Artificial Human Optimization is a latest field proposed in December 2016. Just like artificial Chromosomes are agents for Genetic Algorithms, similarly artificial Humans are agents for Artificial Human Optimization Algorithms. Particle Swarm Optimization is very popular algorithm for solving complex optimization problems in various domains. In this paper, Human Thinking Particle Swarm Optimization (HTPSO) is proposed by applying the concept of thinking of Humans into Particle Swarm Optimization. The proposed HTPSO algorithm is tested by applying it on various benchmark functions. Results obtained by HTPSO algorithm are compared with Particle Swarm Optimization algorithm.  &nbsp

Optimization of Nursing Scheduling in Emergency by Using Genetic Algorithm

Scheduling nurse duty is one of the problems in health organizations that is quite complicated to solve. Starting from the uncertain number of patients, serious patient illnesses, characteristics of organizational groups, requests for nurses to take time off, and the qualifications and specialization of the nurses themselves are why scheduling in the ER is difficult to optimize. The same thing is being experienced by one of the health institutions, RSUD Dr. Pirngadi. Preparing schedules or determining the number of nurses on duty is still done manually, resulting in a lack of optimization in scheduling and the number of nurses who must be on duty, especially in the emergency department. In solving this problem, an appropriate method is needed so that the process of scheduling and optimizing the number of nurses can be formed properly. This research applies the Genetic Algorithm in optimal emergency department (IGD) nurse duty scheduling. Genetic algorithms, also called search algorithms, are based on the mechanisms of natural selection and genetics. Genetic algorithms are one of the appropriate methods for solving complex optimization problems. This method is good enough to optimize shift scheduling for the Emergency Room Nursing Service in a Hospital. This Genetic Algorithm can be a solution to multi-criteria and multi-objective problems modeled using biological and evolutionary processes. So, the concept of this method can be applied in optimizing the Nursing Service schedule. The results of calculations using the Genetic Algorithm show quite significant comparisons, including several nurses losing their positions and being eliminated by mutation because they could not compete with several other strong individuals

Antibody Remainder Method Based Artificial Immune System for Mathematical Function Optimization

Artificial immune system (AIS) is one of the natureinspired algorithm for solving optimization problem. In AIS, clonal selection algorithm (CSA) is able to improve global searching ability. However, the CSA convergence and accuracy can be improved further because the hypermutation in CSA itself cannot always guarantee a better solution. Alternatively,Genetic Algorithms (GAs) and Particle Swarm Optimization(PSO) have been used efficiently in solving complex optimization problems, but they have a tendency to converge prematurely. In this study, the CSA is modified using the best solution for each exposure (iteration) namely Single Best Remainder (SBR) CSA. In this study, the results show that the performance of the proposed algorithm (SBR-CSA) compares favourably with other algorithms while Half Best Insertion (HBI) CSA produced moderate results in most of the simulations