Influence of Programming Language on the Execution Time of Ant Colony Optimization Algorithm

Supply chains can be accelerated by route optimization, a computationally intensive process for a large number of instances. Traveling Salesmen Problem, as the representative example of routing problems, is NP-hard combinatorial problem. It means that the time needed for solving the problem with exact methods increases exponentially with the increased dataset. Using metaheuristic methods, like Ant Colony Optimization, reduces the time needed for solving the problem drastically but finding a solution still takes a considerable amount of time for large datasets. In today’s dynamic environment finding the solution as fast as possible is important as finding a quality solution. The programming language used for finding the solution also influences execution time. In this paper, the execution time of Ant Colony Optimization to solve Traveling Salesman Problems of different sizes was measured. The algorithm was programmed in several programming languages, execution time was measured to rank programming languages

Well-solvable special cases of the TSP : a survey

The Traveling Salesman Problem belongs to the most important and most investigated problems in combinatorial optimization. Although it is an NP-hard problem, many of its special cases can be solved efficiently. We survey these special cases with emphasis on results obtained during the decade 1985-1995. This survey complements an earlier survey from 1985 compiled by Gilmore, Lawler and Shmoys. Keywords: Traveling Salesman Problem, Combinatorial optimization, Polynomial time algorithm, Computational complexity

Getting Things in Order: An Introduction to the R Package seriation

Seriation, i.e., finding a suitable linear order for a set of objects given data and a loss or merit function, is a basic problem in data analysis. Caused by the problem's combinatorial nature, it is hard to solve for all but very small sets. Nevertheless, both exact solution methods and heuristics are available. In this paper we present the package seriation which provides an infrastructure for seriation with R. The infrastructure comprises data structures to represent linear orders as permutation vectors, a wide array of seriation methods using a consistent interface, a method to calculate the value of various loss and merit functions, and several visualization techniques which build on seriation. To illustrate how easily the package can be applied for a variety of applications, a comprehensive collection of examples is presented.

PQ TREES, CONSECUTIVE ONES PROBLEM AND APPLICATIONS

A PQ tree is an advanced tree–based data structure, which represents a family of permutations on a set of elements. In this research article, we considered the significance of PQ trees and the Consecutive ones Problem to Computer Science and bioinformatics and their various applications. We also went further to demonstrate the operations of the characteristics of the Consecutive ones property by simulation, using high level programming languages. Attempt was also made at developing a PQ tree–Consecutive Ones analyzer, which could be instrumental not only as an educative tool to inquisitive students, but also serve as an important tool in developing clustering software in the field of bioinformatics and other application domains, with respect to solving real life problems

An extensive English language bibliography on graph theory and its applications

Bibliography on graph theory and its application