文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > Ant algorithms Review and future applications
侵权投诉

Ant algorithms Review and future applications

A search for a robust optimization methodology for addressing dynamic problems in business and engineering has been in research for the past decade. One such tool in the array of algorithms is the Ant algorithms, inspired by the behavior of the real ants.

Ant Algorithms: Review and Future Applications

Krishnan Krishnaiyer, S. Hossein Cheraghi

Department of Industrial and Manufacturing Engineering

Wichita State University

Wichita, KS 67260-0035

Extended Abstract

A search for a robust optimization methodology for addressing dynamic problems in business and engineering has been in research for the past decade. One such tool in the array of algorithms is the Ant algorithms, inspired by the behavior of the real ants. These algorithms fall in the category of search meta-heuristics, which are used to arrive at the best possible solution from an initial one. The natural ant colonies exhibit the application of adhoc and dynamic decision-making process in their day-to-day living activities such as foraging and brooding that can definitely be used as a tool to tackle the mercurial scenarios present in the current industrial and manufacturing environment. This paper presents an overview of the concept of Ant algorithms and provides a review of its applications to solve real world problems.

Keywords

Ant algorithms, meta-heuristics, search algorithm

1. Introduction

The ever-increasing customer satisfaction and variety of products are making the business environment very dynamic. This changing market scene is making many industries to shuffle their manufacturing and distribution strategies and be focused on retaining the customers. A production schedule based on the last forecast is becoming impractical; allocation of resources and changing capacities are becoming more probabilistic. In these dynamic situations application of conventional operation research techniques is time consuming and there is a need for a heuristics that can provide an optimal or near optimal solution. To solve such practical combinatorial optimization problem, in the year 1986 Fred-Glover coined the term Meta-heuristics, which is basically oriented towards generating a global optimal solution for a given problem. Meta-heuristics are a general class of heuristics for solving hard problems. They are sometimes considered as intelligent heuristic search, which can avoid the local optimality. Ever since the usage of Meta-heuristics they have dramatically undergone change. Laguna [1] classified meta-heuristics based on the design methods into one that uses adaptive memory, another that uses the neighborhood solution space exploration and another as the one that takes into account the number of solutions that is passed along successive iterations. According to Digalakis and Margaritis [2], “ Meta heuristics for optimization problem may be described summarily as a walk through neighborhoods search trajectory through the solution domain of the problem”. Meta-heuristics incorporate various strategies inspired from natural behaviors of species, mathematical reasoning, physical science, nervous systems, and statistical mechanics. Studies indicate that the meta-heuristic based search procedures help to arrive at solutions of higher quality to practically hard problems in business and industry. Hao [3] identifies four main approaches in the meta-heuristic algorithms adopted to solve combinatorial optimization problems. They are construction approach, loach search approach, evolution approach, and hybrid approach. Current reach work is focused on the hybrid approach because of its wide adaptability and applicability to real world problem.

Meta-heuristics find many applications in a variety of practical and difficult combinatorial optimization problems in wide fields ranging from management science to computer science. Under the umbrella of meta-heuristics there are variety of heuristic procedures such as genetic algorithms, greedy random adaptive search procedures, simulated annealing, tabu search and ant algorithms. The applicability of meta-heuristics is problem specific but the primary goal is to find an optimal or a near optimal solution for a given problem. They can be applied to solve difficult network and graph problem, scheduling and control problem, Traveling Salesman Problem (TSP), and vehicle routing problems.

The insect societies exhibit stable and adaptive behaviors required in the industry without a central planning or management [4]. Bios group [5] reports that ant algorithms have been proved to be a quick global optimal solution finder when compared to other heuristic methods such as simulated annealing and genetic algorithms. It also states that the ant algorithms have the quality to find new optimal solution without reinitiating the computations from

第1页

你可能喜欢

热门文档

相关文档

站点地图 | 文档上传 | 侵权投诉 | 手机版
本站所有资源均来自互联网,本站只负责收集和整理,均不承担任何法律责任,如有侵权等其它行为请联系我们.
文档下载 Copyright 2013 doc.guandang.net All Rights Reserved.  -  email