|
Bee Colony Optimization
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 Bavani ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computer Science
Computer science is the study of computation, automation, and information. Computer science spans theoretical disciplines (such as algorithms, theory of computation, information theory, and automation) to Applied science, practical disciplines (including the design and implementation of Computer architecture, hardware and Computer programming, software). Computer science is generally considered an area of research, academic research and distinct from computer programming. 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 for preventing Vulnerability (computing), security vulnerabilities. Computer graphics (computer science), Computer graphics and computational geometry address the generation of images. Progr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Operations Research
Operations research ( en-GB, operational research) (U.S. Air Force Specialty Code: Operations Analysis), often shortened to the initialism OR, is a discipline that deals with the development and application of analytical methods to improve decision-making. It is considered to be a subfield of mathematical sciences. The term management science is occasionally used as a synonym. Employing techniques from other mathematical sciences, such as modeling, statistics, and optimization, operations research arrives at optimal or near-optimal solutions to decision-making problems. Because of its emphasis on practical applications, operations research has overlap with many other disciplines, notably industrial engineering. Operations research is often concerned with determining the extreme values of some real-world objective: the maximum (of profit, performance, or yield) or minimum (of loss, risk, or cost). Originating in military efforts before World War II, its techniques have grown to ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Search Algorithm
In computer science, a search algorithm is an algorithm designed to solve a search problem. Search algorithms work to retrieve information stored within particular data structure, or calculated in the search space of a problem domain, with either discrete or continuous values. algorithms are Although search engines use search algorithms, they belong to the study of information retrieval, not algorithmics. The appropriate search algorithm often depends on the data structure being searched, and may also include prior knowledge about the data. Search algorithms can be made faster or more efficient by specially constructed database structures, such as search trees, hash maps, and database indexes. Search algorithms can be classified based on their mechanism of searching into three types of algorithms: linear, binary, and hashing. Linear search algorithms check every record for the one associated with a target key in a linear fashion. Binary, or half-interval, searches repeatedly ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Combinatorial Optimization
Combinatorial optimization is a subfield of mathematical optimization that consists of finding an optimal object from a finite set of objects, where the set of feasible solutions is discrete or can be reduced to a discrete set. Typical combinatorial optimization problems are the travelling salesman problem ("TSP"), the minimum spanning tree problem ("MST"), and the knapsack problem. In many such problems, such as the ones previously mentioned, exhaustive search is not tractable, and so specialized algorithms that quickly rule out large parts of the search space or approximation algorithms must be resorted to instead. Combinatorial optimization is related to operations research, algorithm theory, and computational complexity theory. It has important applications in several fields, including artificial intelligence, machine learning, auction theory, software engineering, VLSI, applied mathematics and theoretical computer science. Some research literature considers discrete o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Continuous Optimization
Continuous optimization is a branch of optimization in applied mathematics. As opposed to discrete optimization, the variables used in the objective function are required to be continuous variables—that is, to be chosen from a set of real values between which there are no gaps (values from intervals of the real line). Because of this continuity assumption, continuous optimization allows the use of calculus Calculus, originally called infinitesimal calculus or "the calculus of infinitesimals", is the mathematical study of continuous change, in the same way that geometry is the study of shape, and algebra is the study of generalizations of arithm ... techniques. References Mathematical optimization {{Mathapplied-stub ... [...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 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 eight surviving species of honey bee 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 western honey ... [...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 hive ... [...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 which can be reduced to finding good paths through Graph (discrete mathematics), graphs. Artificial ants stand for 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 (optimization), local search algorithms have become a method of choice for numerous optimization tasks involving some sort of Graph (discrete mathematics), graph, e.g., vehicle routing problem, vehicle routing and internet routing. As an example, ant colony optimization is a class of optimization (computer science), optimization algorithm In mathematics and computer science, an algorithm () is a finite sequence of rigorous instructions, typically used to solve a class of specific Computational problem, p ... [...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] |
Evolutionary Computation
In computer science, evolutionary computation 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. In biological terminology, a population of solutions is subjected to natural selection (or artificial selection) and mutation. As a result, the population will gradually evolve to increase in fitness, in this case the chosen fitness function of the algorithm. Evolutionary computation techniques can produce highly optimized solutions in a wide range of problem settings, making them popular i ... [...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 is ... [...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] |
