ROUTING PROBLEM FOR PARALLEL ROUTE BASED MAXMIN ANT SYSTEM

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

Performance Analysis Of Guaranteed Packet Transfer In Coverage Area And Less Coverage Area For MANET

The main challenge in mobile adhoc network is guaranteed transfer of packet within coverage area and less coverage area. The hierarchical clustering is used to increase coverage area to reduce the packet loss in MANET.Th...

 Fuzzy K-mean Clustering Via J48 For Intrusiion Detection System

Due to fast growth of the internet technology there is need to establish security mechanism. So for achieving this objective NIDS is used. Datamining is one of the most effective techniques used for intrusion detection....

Syntactic Sentence Fusion Techniques for Bengali

The present paper describes various syntactic sentence fusion techniques for Bengali language that belongs to the Indo-Aryan language family. Firstly a clause identification and classification system marks clause boundar...

AN INSTINCTIVE APPROACH FOR SECURE COMMUNICATION - ENHANCED DATA ENCRYPTION STANDARD (EHDES)

In this article, we establish a new architecture of information security for secure or more secure communication in network. Data encryption process is the main precious and important for secure transaction of informatio...

Effect of User-Unknown Email addresses in spammers' lists

Spam emails are an extra burden over the network and also another Issue for the security of the internet. Today lot of spam mail are coming from the different resources. Many approaches and method are there to filter th...

Download PDF file
  • EP ID EP139637
  • DOI -
  • Views 84
  • Downloads 0

How To Cite

K. Sankar, K. Krishnamoorthy (2010). ROUTING PROBLEM FOR PARALLEL ROUTE BASED MAXMIN ANT SYSTEM. International Journal of Computer Science and Information Technologies, 1(2), 114-120. https://europub.co.uk./articles/-A-139637