|
Bees Algorithm
In computer science and operations research, the bees algorithm is a population-based search algorithm which was developed by Pham, Ghanbarzadeh et al. in 2005.Pham DT, Ghanbarzadeh A, Koc E, Otri S, Rahim S and Zaidi M. The Bees Algorithm. Technical Note, Manufacturing Engineering Centre, Cardiff University, UK, 2005. It mimics the food foraging behaviour of honey bee colonies. In its basic version the algorithm performs a kind of neighbourhood search combined with global search, and can be used for both combinatorial optimization and continuous optimization. The only condition for the application of the bees algorithm is that some measure of distance between the solutions is defined. The effectiveness and specific abilities of the bees algorithm have been proven in a number of studies.Pham, D.T., Castellani, M. (2009)The Bees Algorithm – Modelling Foraging Behaviour to Solve Continuous Optimisation Problems Proc. ImechE, Part C, 223(12), 2919-2938.Nasrinpour, H. R., Massah Bava ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Honey Bee Takes Nectar
Honey is a sweet and viscous substance made by several species of bees, the best-known of which are honey bees. Honey is made and stored to nourish bee colonies. Bees produce honey by gathering and then refining the sugary secretions of plants (primarily floral nectar) or the secretions of other insects, like the honeydew of aphids. This refinement takes place both within individual bees, through regurgitation and enzymatic activity, and during storage in the hive, through water evaporation that concentrates the honey's sugars until it is thick and viscous. Honey bees stockpile honey in the hive. Within the hive is a structure made from wax called honeycomb. The honeycomb is made up of hundreds or thousands of hexagonal cells, into which the bees regurgitate honey for storage. Other honey-producing species of bee store the substance in different structures, such as the pots made of wax and resin used by the stingless bee. Honey for human consumption is collected from wil ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Artificial Bee Colony Algorithm
In computer science and operations research, the artificial bee colony algorithm (ABC) is an optimization algorithm based on the intelligent foraging behaviour of honey bee swarm, proposed by Derviş Karaboğa (Erciyes University) in 2005. Algorithm In the ABC model, the colony consists of three groups of bees: employed bees, onlookers and scouts. It is assumed that there is only one artificial employed bee for each food source. In other words, the number of employed bees in the colony is equal to the number of food sources around the hive. Employed bees go to their food source and come back to hive and dance on this area. The employed bee whose food source has been abandoned becomes a scout and starts to search for finding a new food source. Onlookers watch the dances of employed bees and choose food sources depending on dances. The main steps of the algorithm are given below: * Initial food sources are produced for all employed bees * REPEAT ** Each employed bee goes to a fo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Particle Swarm Optimization
In computational science, particle swarm optimization (PSO) is a computational method that Mathematical optimization, optimizes a problem by iterative method, iteratively trying to improve a candidate solution with regard to a given measure of quality. It solves a problem by having a population of candidate solutions, here dubbed Point particle, particles, and moving these particles around in the Optimization (mathematics)#Concepts and notation, search-space according to simple formula, mathematical formulae over the particle's Position (vector), position and velocity. Each particle's movement is influenced by its local best known position, but is also guided toward the best known positions in the search-space, which are updated as better positions are found by other particles. This is expected to move the swarm toward the best solutions. PSO is originally attributed to James Kennedy (social psychologist), Kennedy, Russell C. Eberhart, Eberhart and Yuhui Shi, Shi and was first int ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Metaheuristic
In computer science and mathematical optimization, a metaheuristic is a higher-level procedure or heuristic designed to find, generate, tune, or select a heuristic (partial search algorithm) that may provide a sufficiently good solution to an optimization problem or a machine learning problem, especially with incomplete or imperfect information or limited computation capacity. Metaheuristics sample a subset of solutions which is otherwise too large to be completely enumerated or otherwise explored. Metaheuristics may make relatively few assumptions about the optimization problem being solved and so may be usable for a variety of problems. Their use is always of interest when exact or other (approximate) methods are not available or are not expedient, either because the calculation time is too long or because, for example, the solution provided is too imprecise. Compared to optimization algorithms and iterative methods, metaheuristics do not guarantee that a globally optimal sol ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematical Optimization
Mathematical optimization (alternatively spelled ''optimisation'') or mathematical programming is the selection of a best element, with regard to some criteria, from some set of available alternatives. It is generally divided into two subfields: discrete optimization and continuous optimization. Optimization problems arise in all quantitative disciplines from computer science and engineering to operations research and economics, and the development of solution methods has been of interest in mathematics for centuries. In the more general approach, an optimization problem consists of maxima and minima, maximizing or minimizing a Function of a real variable, real function by systematically choosing Argument of a function, input values from within an allowed set and computing the Value (mathematics), value of the function. The generalization of optimization theory and techniques to other formulations constitutes a large area of applied mathematics. Optimization problems Opti ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Manufacturing Engineering Centre
The Manufacturing Engineering Centre (MEC) is an international R&D Centre of Excellence for Advanced Manufacturing and Information Technology. The MEC was founded in 1996 under the directorship of Professor Duc Truong Pham. The Centre forms part of Cardiff University, which dates back to 1883 and is one of Britain's major civic universities. The MEC's purpose is to conduct research and development in all major areas of Advanced Manufacturing and use the output to promote the introduction of new manufacturing technology and practice to industry. It was the first autonomous research centre created by Cardiff University. Research The MEC conducts basic, strategic and applied research as well as technology transfer with partners from 22 countries in Europe, Asia and the Americas. The research spans a broad spectrum of subjects, including robotics and microsystems, sensor systems, high-speed automation and intelligent control, rapid manufacturing, micromanufacturing, nanotechnolog ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lévy Flight Foraging Hypothesis
The Lévy flight foraging hypothesis is a hypothesis in the field of biology that may be stated as follows: ''Since Lévy flights and walks can optimize search efficiencies, therefore natural selection should have led to adaptations for Lévy flight foraging.'' Background The movement of animals closely resembles in many ways the random walks of dust particles in a fluid. This similarity led to interest in trying to understand how animals move via the analogy to Brownian motion. This conventional wisdom held until the early 1990s. However, starting in the late 1980s, evidence began to accumulate that did not fit the theoretical predictions. In 1999, a theoretical investigation of the properties of Lévy flights showed that an inverse square distribution of flight times or distances could optimize the search efficiency under certain circumstances. Specifically, a search based on an inverse-square Lévy walk, consisting of a constant velocity search following a path whose length i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Evolutionary Computation
Evolutionary computation from computer science is a family of algorithms for global optimization inspired by biological evolution, and the subfield of artificial intelligence and soft computing studying these algorithms. In technical terms, they are a family of population-based trial and error problem solvers with a metaheuristic or stochastic optimization character. In evolutionary computation, an initial set of candidate solutions is generated and iteratively updated. Each new generation is produced by stochastically removing less desired solutions, and introducing small random changes as well as, depending on the method, mixing parental information. In biological terminology, a population of solutions is subjected to natural selection (or artificial selection), mutation and possibly recombination. As a result, the population will gradually evolve to increase in fitness, in this case the chosen fitness function of the algorithm. Evolutionary computation techni ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ant Colony Optimization Algorithms
In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems that can be reduced to finding good paths through graphs. Artificial ants represent multi-agent methods inspired by the behavior of real ants. The pheromone-based communication of biological ants is often the predominant paradigm used. Combinations of artificial ants and local search algorithms have become a preferred method for numerous optimization tasks involving some sort of graph, e.g., vehicle routing and internet routing. As an example, ant colony optimization is a class of optimization algorithms modeled on the actions of an ant colony. Artificial 'ants' (e.g. simulation agents) locate optimal solutions by moving through a parameter space representing all possible solutions. Real ants lay down pheromones to direct each other to resources while exploring their environment. The simulated 'ants' similarly record th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computer Science
Computer science is the study of computation, information, and automation. Computer science spans Theoretical computer science, theoretical disciplines (such as algorithms, theory of computation, and information theory) to Applied science, applied disciplines (including the design and implementation of Computer architecture, hardware and Software engineering, software). Algorithms and data structures are central to computer science. The theory of computation concerns abstract models of computation and general classes of computational problem, problems that can be solved using them. The fields of cryptography and computer security involve studying the means for secure communication and preventing security vulnerabilities. Computer graphics (computer science), Computer graphics and computational geometry address the generation of images. Programming language theory considers different ways to describe computational processes, and database theory concerns the management of re ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Waggle Dance
Waggle dance is a term used in beekeeping and ethology for a particular figure-eight dance of the honey bee. By performing this dance, successful foragers can share information about the direction and distance to patches of flowers yielding nectar and pollen, to water sources, or to new nest-site locations with other members of the colony. The waggle dance and the round dance are two forms of dance behaviour that are part of a continuous transition. As the distance between the resource and the hive increases, the round dance transforms into variations of a transitional dance, which, when communicating resources at even greater distances, becomes the waggle dance. In the case of '' Apis mellifera ligustica'', the round dance is performed until the resource is about 10 metres away from the hive, transitional dances are performed when the resource is at a distance of 20 to 30 metres away from the hive, and finally, when it is located at distances greater than 40 metres from the h ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Honey Bees
A honey bee (also spelled honeybee) is a eusocial flying insect within the genus ''Apis'' of the bee clade, all native to mainland Afro-Eurasia. After bees spread naturally throughout Africa and Eurasia, humans became responsible for the current cosmopolitan distribution of honey bees, introducing multiple subspecies into South America (early 16th century), North America (early 17th century), and Australia (early 19th century). Honey bees are known for their construction of perennial colonial nests from wax, the large size of their colonies, and surplus production and storage of honey, distinguishing their hives as a prized foraging target of many animals, including honey badgers, bears and human hunter-gatherers. Only 8 surviving species of honey bees are recognized, with a total of 43 subspecies, though historically 7 to 11 species are recognized. Honey bees represent only a small fraction of the roughly 20,000 known species of bees. The best-known honey bee is the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
