ROUTING PROBLEM FOR PARALLEL ROUTE BASED MAXMIN ANT SYSTEM
Journal Title: International Journal of Computer Science and Information Technologies - Year 2010, Vol 1, Issue 2
Abstract
The proposed work presented a modified MAX-MIN Ant System (MMAS) algorithm to solve the routing problem, in which known demand are supplied from a store house with parallel routes for new local search. Routing Problem is an optimization problem and solved to nearly optimum by heuristics. The objective of routing issues is to use a fleet of vehicles with specified capacity to serve a number of users with dissimilar demands at minimum cost, without violating the capacity and route length constraints. Many meta-heuristic approaches like Simulated Annealing (SA), Tabu Search (TS) and An Improved Ant Colony System (IACS) algorithm are compared for the performance result analysis. The real life problems deal with imperfectly specified knowledge and some degree of imprecision, uncertainty or inconsistency is embedded in the problem specification. The well-founded theory of fuzzy sets is a special way to model the uncertainty. The rules in a fuzzy model contain a set of propositions, each of which restricts a fuzzy variable to a single fuzzy value by means of the predicate equivalency. That way, each rule covers a single fuzzy region of the fuzzy grid. The proposed system of this thesis extends this structure to provide more general fuzzy rules, covering the input space as much as possible. In order to do this, new predicates are considered and a MaxMin Ant System is proposed to learn such fuzzy rules
Authors and Affiliations
K. Sankar , K. Krishnamoorthy
Keywords
Related Articles
- EP ID EP139637
- DOI -
- Views 65
- Downloads 0
Operating System based Compliance Validation of Trusted Computing
The concept of trusted computing given was by Anderson [2]. Trust is an expectation that a device behaves in a particular manner. A trusted component, operation or process is one whose behavior is pr...
An Enhancing approach in MEDLINE & PubMed using Text Mining
Text mining is a new and exciting research area that attempts to solve the information overload problem. Information extraction using text mining has been applied to many different areas of bio-medici...
Caching Technique for Improving Data Retrieval Performance in Mobile Ad Hoc Networks
Mobile Ad Hoc Networks (MANETs) provide an attractive solution for networking in the situations where network infrastructure or service subscription is not available. Cooperative caching scheme can improve the acces...
Text database cleaning by filling the Missing values using Object Oriented Intelligent Multi-Agent System Data Cleaning Architecture
Agents are software programs that perform tasks on behalf of others and they are used to clean the text database with their characteristics. Agents are task oriented with the ability to learn by them...
Web Services Security Architectures using RoleBased Access Control
The Web Services Access controls are categorized according to access control granularity and have two approaches: The first approach supports a negotiation-based attribute-based access control to Web Servi...