scholarly journals Estimation of Exponential Smoothing Parameter on Pesticide Characteristic Forecast using Ant Colony Optimization (ACO)

2018 ◽  
Vol 18 (1) ◽  
pp. 56-63 ◽  
Author(s):  
Dinita Rahmalia

Pest in agriculture can raise plant disease and fail to harvest. The pest problem in agriculture can be solved by using pesticide. Pesticide usage must be done proportionally. So, the manufacturer should fix standard pesticide active ingredient in pesticide production. Forecast is a prediction of some future evens. In forecast problem, there are any parameters which should be determined. Parameters can be estimated by exact method or heuristic method. Ant Colony Optimization (ACO) is inspired from the cooperative behavior of ant colonies, which can find the shortest path from their nest to a food source. In this research, we use heuristic method like ACO to estimate exponential smoothing parameter on pesticide active ingredient forecast and pesticide sample weight forecast. From the simulation, on the first iteration, all ants choose parameter randomly. At the optimization process, we update pheromone until all ants choose the similar parameter so that process converges and variance approaches to zero. The optimal exponential smoothing parameter can be applied in forecasting with minimum sum of squared error (SSE).

2018 ◽  
Vol 24 (2) ◽  
pp. 223-228
Author(s):  
Felix U. Ogban ◽  
Roy Nentui

Packets routing and bandwidth sensing in a network platform remains an integral part of the study of signal flow.The algorithm to route packets in a network link called the AntNet algorithm was inspired by the behavior of real ant colonies. At each node in the network, a forward ant deposits some amount of pheromones at different links that responds to the node’s queue length. In this paper, we propose the inclusion of the computation of paths to adapt with the Depth Search Ant Explorer Network (DS-ANTENet) algorithm for discrete problems as an IP based mechanism. This method is tested and the efficiency is compared to the original AntNet algorithm and the Link-State algorithm to check the transmission of computing traffic flows between the nodes. We then made comparison with the algorithms proposed in the literature. The protocols were sorted out in terms of average number of lost packets ranging from the higher priority queue to the lower priority queue which then resulted to the fact that; First, AntNetBW (loss ratios reduction of 9.6% when compared to the AntNet and the Link-State algorithm respectively. Secondly,  SANTENetBW (loss ratios reduction of 8.3% and 36.7% when compared to the AntNet and the Link-State algorithm respectively. Finally, DS-ANTENet (loss ratios reduction 0.7% and 33.2% when compared to the AntNet and the Link- State algorithm respectively.Keywords: Packets Routing, Bandwidth Sensing, Network Traffic, Ant Colony Optimization Algorithm, AntNet


2014 ◽  
Vol 548-549 ◽  
pp. 1206-1212
Author(s):  
Sevda Dayıoğlu Gülcü ◽  
Şaban Gülcü ◽  
Humar Kahramanli

Recently some studies have been revealed by inspiring from animals which live as colonies in the nature. Ant Colony System is one of these studies. This system is a meta-heuristic method which has been developed based upon food searching characteristics of the ant colonies. Ant Colony System is applied in a lot of discrete optimization problems such as travelling salesman problem. In this study solving the travelling salesman problem using ant colony system is aimed.


2012 ◽  
Vol 182-183 ◽  
pp. 2055-2058
Author(s):  
Zhi Qiang Fu ◽  
Lei An Liu

Ant Colony Optimization is an intelligent optimization algorithm from the observations of ant colonies foraging behavior. However, ACO usually cost more searching time and get into early stagnation during convergence Process. We design the improved ant colony algorithm using perturbation method to avoid early stagnation, adjusting volatilization coefficient to increase the exploration of tours at first phase and searching speed at second phase, using hortation method to improved searching efficiency. We apply the improved algorithm on traveling salesman problem showing that the improved algorithm finds the best values more quickly and more stability than Max-Min Ant System algorithm.


2018 ◽  
Vol 8 (1) ◽  
Author(s):  
Benjamın Baran ◽  
Osvaldo Gomez

Ant Colony Optimization (ACO) is a metaheuristic inspired by the foraging behavior of ant colonies that has been successful in the resolution of hard combinatorial optimization problems like the Traveling Salesman Problem (TSP). This paper proposes the Omicron ACO (OA), a novel population-based ACO alternative originally designed as an analytical tool. To experimentally prove OA advantages, this work compares the behavior between the OA and the MMAS as a function of time in two well-known TSP problems. A simple study of the behavior of OA as a function of its parameters shows its robustness.


2011 ◽  
Vol 204-210 ◽  
pp. 1135-1138
Author(s):  
Cheng Ming Qi

Ant algorithms are a recently developed, population-based approach which was inspired by the observation of the behavior of ant colonies. Based on the ant colony optimization idea, we present a hybrid ant colony system (ACS) coupled with a pareto local search (PLS) algorithm, named PACS, and apply to the continuous functions optimization. The ACS makes firstly variable range into grid. In local search, we use the PLS to escape local optimum. Computational results for some benchmark problems demonstrate that the proposed approach has the high search superior solution ability.


Author(s):  
Nabila Dwi Indria ◽  
Junaidi Junaidi ◽  
Iut Tri Utami

The distribution system of goods is one of the most important parts for every company. The company certainly has many route options to visit, and this is expected to be conducted efficiently in terms of time. In the distribution of goods by Alfamidi company in Palu City which has 51 outlets include into the category of Traveling Salesman Problem (TSP) because of many route options that can be visited. The problem can be solved by employing the Ant Colony Optimization (ACO) method which is one of the algorithms Ant Colony System (ACS). The ACS acquires principles based on the behavior of ant colonies and applies three characteristics to determine the shortest route namely status transition rules, local pheromone renewal and global pheromones. The result showed that the shortest route of the distribution of goods based on the calculation of selected iterations was ant 1 with the shortest total distance obtained 86.98 km.


Author(s):  
Hicham Grari ◽  
Siham Lamzabi ◽  
Ahmed Azouaoui ◽  
Khalid Zine-Dine

<p class="Abstract"><span id="docs-internal-guid-d3fe8e21-7fff-17fc-df0e-00893428243c"><span>The Merkle-Hellman (MH) cryptosystem is one of the earliest public key cryptosystems, which is introduced by Ralph Merkle and Martin Hellman in 1978 based on an NP-hard problem, known as the subset-sum problem. Furthermore, ant colony optimization (ACO) is one of the most nature-inspired meta-heuristic optimization, which simulates the social behaviour of ant colonies. ACO has demonstrated excellent performance in solving a wide variety of complex problems. In this paper, we present a novel ant colony optimization (ACO) based attack for cryptanalysis of MH cipher algorithm, where two different search techniques are used. Moreover, experimental study is included, showing the effectiveness of the proposed attacking scheme. The results show that ACO based attack is more suitable than many other algorithms like genetic algorithm (GA) and particle swarm optimization (PSO).</span></span></p>


2019 ◽  
Vol 8 (2) ◽  
pp. 272-284
Author(s):  
Via Risqiyanti ◽  
Hasbi Yasin ◽  
Rukun Santoso

For company, shortest distribution route is an important thing to be developed in order to obtain effectiveness in the distribution of products to consumers. One way of development is to find the shortest route with Ant Colony Optimization algorithm. This algorithm is inspired by the behavior of ant colonies that can find the shortest path from the nest to the food source. One example of a distribution company is PT Distriversa Buana Mas, also known as DBM. DBM is a physical distribution company covering the entire Indonesian archipelago specialized in the distribution of pharmaceuticals and consumer goods such as personal care, cosmetic and food products. DBM uses land transportation in 18 brances spread across Indonesia. One branch of DBM is in the Purwokerto region that distributes products to 29 stores in the Purbalingga region. This research is done with the help of GUI as a computation tool. Based on test results, the GUI system that has been built able to simplify and speed up the selection process of finding the shortest route for distribute product of DBM in the Purbalingga region. Keywords: Travelling Salesman Problem, Distriversa Buana Mas, Algorithm, Ant Colony Optimization, GUI


1999 ◽  
Vol 5 (2) ◽  
pp. 137-172 ◽  
Author(s):  
Marco Dorigo ◽  
Gianni Di Caro ◽  
Luca M. Gambardella

This article presents an overview of recent work on ant algorithms, that is, algorithms for discrete optimization that took inspiration from the observation of ant colonies' foraging behavior, and introduces the ant colony optimization (ACO) metaheuristic. In the first part of the article the basic biological findings on real ants are reviewed and their artificial counterparts as well as the ACO metaheuristic are defined. In the second part of the article a number of applications of ACO algorithms to combinatorial optimization and routing in communications networks are described. We conclude with a discussion of related work and of some of the most important aspects of the ACO metaheuristic.


Sign in / Sign up

Export Citation Format

Share Document