Department of Computer Science and Information Systems

Permanent URI for this collectionhttp://localhost:4000/handle/123456789/1928

Browse

Filters

2019 - 201912020 - 20231

Settings

Author: search.filters.author.Viswanathan, SangeethaSubject: search.filters.subject.Algorithms

Search Results

Now showing 1 - 2 of 2
  • No Thumbnail Available
    Item
    A Normalized Rank Based A* Algorithm for Region Based Path Planning on an Image
    (Springer, 2019-04) Viswanathan, Sangeetha
    With the development of many autonomous systems, the need for efficient and robust path planners are increasing every day. Inspired by the intelligence of the heuristic, a normalized rank-based A* algorithm has been proposed in this paper to find the optimal path between a start and destination point on a classified image. The input image is classified and a normalized rank value based on the priority of traversal on each class is associated with each point on the image. Using the modified A* algorithm, the final optimal path is obtained. The obtained results are compared with the traditional method and results are found to be far better than existing method.
  • No Thumbnail Available
    Item
    Solving Vehicle Routing Problem Using a Hybridization of Gain-Based Ant Colony Optimization and Firefly Algorithms
    (Springer, 2023) Viswanathan, Sangeetha
    Vehicle Routing Problem is one of the classical NP hard and combinatorial optimization problems that has been a spark of interest in the operation research domain. Though many variations of classical VRP are being developed, there is still the need for developing algorithms to improve solutions for VRP. A hybrid gain-based ant colony optimization-firefly algorithm (GACO-FA) has been proposed to deal with VRP. A global search is initially performed using the gain-based ant colony optimization, and subsequently local search for promising solution is done in the fine-tuned search space using firefly algorithm. The strengths of GACO and weakness of FA are aptly managed with a finer trade-off between them. The proposed GACO-FA is compared with best-known solutions and existing algorithms for performance analysis using the benchmark dataset. Analysis has been performed using measures like route cost, standard deviation, and percentage variation in length. The results have also been statistically verified for their significance.