Search
12 articles for “Traveling Salesman Problem”
-
Parallelization of Metaheuristics for the Optimization of Travelling Salesman Problem
Abstract: Travelling salesman problem is a combinatorial NP-Hard Problem. It has vast number of applications in many other fields like engineering, transportation and logistics. In the area of combinatorial Optimization Problems, it is one of the most studied problem. This Problem is acting as benchmark for many other NP-Hard Problems. Even for 20 cities CPU’s takes 100’s of years to get the optimal solution. So, for computing NP-Hard problems we require …
Published in Recent Trends in Parallel Computing · Vol. 8, Issue 2, 2021 · pp. 20–26 Read article
-
Exhaustive Search Meets DNA Sequencing: A Comprehensive Review of TSP-Based Approaches
Abstract: Exhaustive search is a highly computational complex algorithm that checks every possibility to obtain the best solution. We illustrate an exhaustive search by applying it to three important problems: the traveling salesman problem, the knapsack problem, and the assignment problem. In this paper, we took a traveling salesman problem to explain DNA Sequencing. Since traveling salesman problem is an algorithmic problem that finds the shortest route between a set of …
Published in International Journal of Bioinformatics and Computational Biology · Vol. 2, Issue 2, 2024 · pp. 11–21 Read article
-
A Survey on Ant Colony Optimization Algorithm for Travelling Salesman Problem
Abstract: The ant colony optimization algorithm, abbreviated as ACO, is a meta-heuristic optimization algorithm which is based on the probability for solving different computational problems such as travelling salesman problem (TSP), job scheduling problem, vehicle routing problem etc. This algorithm is a member of ant colony algorithms family in swarm intelligence methods, which is based on the foraging behaviour of real ants. This paper presents a review on a variety of …
Published in Journal of Image Processing & Pattern Recognition Progress · Vol. 5, Issue 1, 2018 · pp. 33–38 Read article
-
Resolving Travelling Salesman Problem Using Modified Clustering Technique
Abstract: AbstractTravelling Salesman Problem (TSP) is a quotidian stumbling block in the field of Computer Science and operation research designed to seek out the shortest pathway amid the given targets viz. cities where each target is considered only once. Many solutions to this setback like Ant Colony Optimization. Brute-Force approach, Genetic Algorithm, Fruit Fly Optimization etc. are available in literature. The main objective of these solutions is to minimize the time …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 6, Issue 1, 2019 · pp. 22–31 Read article
-
Heuristic Based Transportation Routing and Sizing
Abstract: Employee transportation is one of the most concerned issues and a part of HR policy in today’s work culture. Optimization of these routes and analysis of scenario needs to be done to leverage cost benefits for the organizations of today. Traditional studies focus on goods delivery and pickup, but employees are a totally different entity, which change the type of problem to be solved. As the entity to be considered …
Published in Journal of Production Research & Management · Vol. 5, Issue 3, 2015 · pp. 20–27 Read article
-
Applications of Graph Theory in Computer Science
Abstract: Graph theory, a branch of mathematics, has found broad applications in different areas, especially in computer science. This study inspects the basic concepts of graph theory and its different applications in computer science. It talks about the role of graphs in modelling real-world networks, algorithmic problem-solving, optimization, data structures, network analysis, and other significant areas within the domain of computer science. Through different illustrations and case studies, this study aims …
Published in Journal of Open Source Developments · Vol. 10, Issue 3, 2023 · pp. 30–35 Read article
-
Improved Genetic Algorithmic Rule Mistreatment Hybrid Initial Population to Resolve Travelling Salesman Drawback
Abstract: Abstract: The algorithmic genetic rule is beneficial to resolve the optimization issues. It performs genetic operators to solve optimization issues. Travelling salesman problem (TSP) may be a well-known optimization downside, but TSP is beneficial to resolve the several difficulties of science and engineering. In this paper, to determine TSP, algorithmic genetic rule is applied. An initial hybrid population is generated in an algorithmic hereditary rule. The coupling of the initial …
Published in Current Trends in Information Technology · Vol. 9, Issue 3, 2019 · pp. 46–50 Read article
-
Genetic Algorithms for DTSP: A Study of Different Mutation Rates
Abstract: ABSTRACTThis paper deals with performance evaluation of genetic algorithms (GAs) for the dynamic traveling salesman problem (DTSP) using different values of mutation rates. DTSP is known to be NP-hard, and consists of the solution containing N! permutations. The objective of the study is to evaluate the ability of GA to solve the optimization problems using some variations in its parameters. All performance evaluation has been performed using a software program …
Published in Journal of Computer Technology & Applications · Vol. 3, Issue 3, 2012 · pp. 21–27 Read article
-
Fuzzy Minimum Spanning Tree Problem: A Greedy Algorithm using Quasi-Gaussian Fuzzy Weights
Abstract: The classical Minimum Spanning Tree Problem (MST) deals with determining the spanning tree in a given undirected graph G(V, E) for which the sum of the weights assigned to the edges is minimum. The weights assigned to the edges are real numbers representing parameters like demand, cost, link capacity and distance which are not naturally precise and the uncertainty involved can be modelled using fuzzy numbers. There are several types …
Published in Journal of Software Engineering Tools & Technology Trends · Vol. 1, Issue 3, 2014 · pp. 15–22 Read article
-
The Big Traveling Salesman and Mathematics At The Limits of Computation
Abstract: The travelling salesman problem (TSP) is a well-known problem in the field of operations research and has applications in many areas including manufacturing and production. This article is a small review of the book titled “In pursuit of the traveling salesman: mathematics at the limits of computation” written by William J. Cook published in 2012 by PRINCETON UNIVERSITY PRESS.
Published in Journal of Production Research & Management · Vol. 4, Issue 3, 2014 · pp. 23–25 Read article
-
Modified Search Solutions Based ABC with Mutation Algorithm for TSP
Abstract: Swarm intelligence systems are basically made up of simple agents’ population, which are interacting locally with each other and with their surroundings. The artificial bee colony algorithm (ABC) is for aging behavior based optimization algorithm. In this paper, modified version of ABC algorithm, called as ABCM, is used. In this algorithm, two equations of original ABC algorithm are modified: First is the search equation of employed bee and second is …
Published in Journal of Artificial Intelligence Research & Advances · Vol. 3, Issue 2, 2016 · pp. 39–43 Read article
-
Multiple Fragment Information Gathering Using Accumulating Framework
Abstract: The approach of use mobile sink, has been adopted in wireless sensor networks ( WSN) and wireless sensor and actor network( WSAN) to achieve advanced efficiency in terms of gathering data from sensors. Mobility-assisted data collection brings in new opportunity to improve the energy efficiency sensor nodes. However, mobile sink also introduces new challenges such as large data collection tansy. A lot of research efforts have been devoted to reduce …
Published in Journal of Web Engineering & Technology · Vol. 2, Issue 3, 2015 · pp. 14–18 Read article