Search results for: pheromone.

Authors: M. Keshlaf, R. Mensah, O. Nicetic, R. Spooner-Hart

Abstract:

The effectiveness of a commercial bee attractant, synthetic honey bee queen mandibular pheromone (Fruit Boost^®) for enhancing pollination of Gossypium hirsutum was evaluated in a transgenic (Bt) cotton crop. The study assessed the number of bee visitations to blossoms of plants treated with Fruit Boost^® as well, as effects on fruit set, yield, and lint quality. Bee activity on plots sprayed with pheromone concentrations of 50 and 500 queen equivalents (QEQ) /ha did not differ significantly from water-only control, on the day of application or the subsequent day. Application of the pheromone did not increase fruit set, yield, or lint quality. Two consecutive pheromone applications, applied two days apart, were not significantly different from a single application for any parameter.

Keywords: Apis mellifera, cotton, pollination, QMP pheromone

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2205

Authors: Lada-On Lertsuwanakul, Herwig Unger

Abstract:

This paper objects to extend Jon Kleinberg-s research. He introduced the structure of small-world in a grid and shows with a greedy algorithm using only local information able to find route between source and target in delivery time O(log2n). His fundamental model for distributed system uses a two-dimensional grid with longrange random links added between any two node u and v with a probability proportional to distance d(u,v)-2. We propose with an additional information of the long link nearby, we can find the shorter path. We apply the ant colony system as a messenger distributed their pheromone, the long-link details, in surrounding area. The subsequence forwarding decision has more option to move to, select among local neighbors or send to node has long link closer to its target. Our experiment results sustain our approach, the average routing time by Color Pheromone faster than greedy method.

Keywords: Routing algorithm, Small-World network, Ant Colony Optimization, and Peer-to-peer System.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1810

Authors: Musbah M. Aqel, P. K. Mahanti, Soumya Banerjee

Abstract:

This paper describes a simulation model for analyzing artificial emotion injected to design the game characters. Most of the game storyboard is interactive in nature and the virtual characters of the game are equipped with an individual personality and dynamic emotion value which is similar to real life emotion and behavior. The uncertainty in real expression, mood and behavior is also exhibited in game paradigm and this is focused in the present paper through a fuzzy logic based agent and storyboard. Subsequently, a pheromone distribution or labeling is presented mimicking the behavior of social insects.

Keywords: Artificial Emotion, Fuzzy logic, Game character, Pheromone label

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1263

Authors: Ali Lemouari, Mohamed Benmohamed

Abstract:

Biological evolution has generated a rich variety of successful solutions; from nature, optimized strategies can be inspired. One interesting example is the ant colonies, which are able to exhibit a collective intelligence, still that their dynamic is simple. The emergence of different patterns depends on the pheromone trail, leaved by the foragers. It serves as positive feedback mechanism for sharing information. In this paper, we use the dynamic of TASEP as a model of interaction at a low level of the collective environment in the ant-s traffic flow. This work consists of modifying the movement rules of particles “ants" belonging to the TASEP model, so that it adopts with the natural movement of ants. Therefore, as to respect the constraints of having no more than one particle per a given site, and in order to avoid collision within a bidirectional circulation, we suggested two strategies: decease strategy and waiting strategy. As a third work stage, this is devoted to the study of these two proposed strategies- stability. As a final work stage, we applied the first strategy to the whole environment, in order to get to the emergence of traffic flow, which is a way of learning.

Keywords: Ants system, emergence, exclusion process, pheromone.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1278

Authors: S. Bougrine, S. Ouchraa, B. Ahiod, A. A. El Imrani

Abstract:

Ant colony optimization is an ant algorithm framework that took inspiration from foraging behavior of ant colonies. Indeed, ACO algorithms use a chemical communication, represented by pheromone trails, to build good solutions. However, ants involve different communication channels to interact. Thus, this paper introduces the acoustic communication between ants while they are foraging. This process allows fine and local exploration of search space and permits optimal solution to be improved.

Keywords: Acoustic Communication, Ant Colony Optimization, Local Search, Traveling Salesman Problem.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2332

Authors: Yeong-Hwa Chang, Chia-Wen Chang, Hung-Wei Lin, C.W. Tao

Abstract:

In this paper, an improved ant colony optimization (ACO) algorithm is proposed to enhance the performance of global optimum search. The strategy of the proposed algorithm has the capability of fuzzy pheromone updating, adaptive parameter tuning, and mechanism resetting. The proposed method is utilized to tune the parameters of the fuzzy controller for a real beam and ball system. Simulation and experimental results indicate that better performance can be achieved compared to the conventional ACO algorithms in the aspect of convergence speed and accuracy.

Keywords: Ant colony algorithm, Fuzzy control, ball and beamsystem

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2151

Authors: Teerapun Saeheaw, Nivit Charoenchai, Wichai Chattinnawat

Abstract:

This paper proposes a meta-heuristic called Ant Colony Optimization to solve multi-objective production problems. The multi-objective function is to minimize lead time and work in process. The problem is related to the decision variables, i.e.; distance and process time. According to decision criteria, the mathematical model is formulated. In order to solve the model an ant colony optimization approach has been developed. The proposed algorithm is parameterized by the number of ant colonies and the number of pheromone trails. One example is given to illustrate the effectiveness of the proposed model. The proposed formulations; Max-Min Ant system are then used to solve the problem and the results evaluate the performance and efficiency of the proposed algorithm using simulation.

Keywords: Ant colony optimization, multi-objective problems.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1855