Papers by purusotham singamsetty
A new approach for solving the network problems
OPSEARCH, 2012
Page 1. APPLICATION ARTICLE A new approach for solving the network problems Purusotham Singamsett... more Page 1. APPLICATION ARTICLE A new approach for solving the network problems Purusotham Singamsetty & M. Sundara Murthy Accepted: 12 January 2012 © Operational Research Society of India 2012 Abstract This study ...
Maximum Flow with Minimum Cost in A Capacitated and Directed Network Problem
Let the directed network consist of nodes which for convenience are denoted in any order of seque... more Let the directed network consist of nodes which for convenience are denoted in any order of sequence S=1, 2…,n=D. It is assumed that certain capacity restriction and unit-shipping cost is associated with each arc of the network. The problem is to schedule maximum flow in minimum cost from some specified node, say source denoted by S, to another specified node, say destination denoted by D. We proposed Pandit's Maxi-Min algorithmic approach to solve the Maximum-Flow with Minimum Cost Problem with an illustrative example. For this problem a computer program is developed for the algorithm and is tested. It is observed that it takes less time for solving fairly higher dimension problem also. I. INTRODUCTION The Max-Flow problem is one of the most fundamental problems in network flow theory and has been investigated widely. In the traditional maximum flow problem, there is a capacitated network and the goal is to send as much of a single commodity as possible between two distinguishe...
An Articulation Point-Based Approximation Algorithm for Minimum Vertex Cover Problem
The minimum vertex cover problem (MVCP) is a well-known NP complete combinatorial optimization pr... more The minimum vertex cover problem (MVCP) is a well-known NP complete combinatorial optimization problem. The aim of this paper is to present an approximation algorithm for minimum vertex cover problem (MVCP). The algorithm construction is based on articulation points/cut vertices and leaf vertices/pendant vertices. The proposed algorithm assures the near optimal or optimal solution for a given graph and can be solved in polynomial time. A numerical example is illustrated to describe the proposed algorithm. Comparative results show that the proposed algorithm is very competitive compared with other existing algorithms.
Decision Science Letters, 2021
The multiple travelling salesman problem (MTSP) is one of the widely studied combinatorial optimi... more The multiple travelling salesman problem (MTSP) is one of the widely studied combinatorial optimization problems with various theoretical and practical applications. However, most of the studies intended to deal with classical MTSP, very limited attention has been given to an open multiple travelling salesman problem and its variants. In this paper, an open multiple travelling salesman problem with load balancing constraint (OMTSPLB) is addressed. The OMTSPLB differs from the conventional MTSP, in which all the salesmen start from the central depot and need not come back to it after visiting the given number of cities by accomplishing the load balance constraint, which helps in fairly distributing the task among all salesmen. The problem aims to minimize the overall traversal distance/cost for operating open tours subject to the load balancing constraint. A zero-one integer linear programming (0-1 ILP) model and an efficient metaheuristic genetic algorithm (GA), is established for the OMTSPLB. Since no existing study on OMTSPLB, the proposed GA is tested on the relaxed version of the present model, comparative results are reported. The comparative results show that the proposed GA is competent over the existing algorithms. Furthermore, extensive experiments are carried out on OMTSPLB and the results show that proposed GA can find the global solution effectively. .
Solving open travelling salesman subset-tour problem through a hybrid genetic algorithm
In open travelling salesman subset-tour problem (OTSSP), the salesman needs to traverse a set of ... more In open travelling salesman subset-tour problem (OTSSP), the salesman needs to traverse a set of k (≤n) out of n cities and after visiting the last city, the salesman does not necessarily return to the central depot. The goal is to minimize the overall traversal distance of covering k cities. The OTSSP model comprises two types of problems such as subset selection and permutation of the cities. Firstly, the problem of selection takes place as the salesman’s tours do not contain all the cities. On the other hand, the next problem is about to determine the optimal sequence of the cities from the selected subset of cities. To deal with this problem efficiently, a hybrid nearest neighbor technique based crossover-free Genetic algorithm (GA) with complex mutation strategies is proposed. To the best of the author’s knowledge, this is the first hybrid GA for the OTSSP. As there are no existing studies on OTSSP yet, benchmark instances are not available for OTSSP. For computational experime...
Designing optimal route for the distribution chain of a rural LPG delivery system
International Journal of Industrial Engineering Computations
A practical distribution system that arises in the context of delivering liquefied petroleum gas ... more A practical distribution system that arises in the context of delivering liquefied petroleum gas (LPG) through cylinders is considered in this study. To meet all the challenging constraints, the model is explicitly considered as a simultaneous pickup and delivery single commodity truncated vehicle routing problem with the homogeneous fleet of vehicles. The aim of this problem is to find the optimal routes for the set of vehicles locating at the distributing agency (DA), which offers simultaneous pickup and delivery operations over single commodity (i.e. LPG cylinders) to a fixed subset (need not serve all delivery centers) of delivery centers at rural level. The model is designed using zero-one integer linear programming. For proper treatment of the present model, an exact Lexi-search algorithm (LSA) has been developed. A comparative study is performed between the LSA and existing results for the relaxed version of the present model. Further, the efficiency of the LSA is tested thro...
Decision Science Letters
This paper introduces a novel practical variant, namely an open close multiple travelling salesme... more This paper introduces a novel practical variant, namely an open close multiple travelling salesmen problem with single depot (OCMTSP) that concerns the generalization of classical travelling salesman problem (TSP). In OCMTSP, the overall salesmen can be categorized into internal/permanent and external/outsourcing ones, where all the salesmen are positioned at the depot city. The primary objective of this problem is to design the optimal route such that all salesmen start from the depot/base city, and then visit a given set of cities. Each city is to be visited precisely once by exactly one salesman, and only the internal salesmen have to return to the depot city whereas the external ones need not return. To find optimal solutions, an exact pattern recognition technique based Lexi-search algorithm (LSA) is developed which has been subjected in Matlab. Comparative computational results of the LSA have been made with the existing methods for general multiple travelling salesman problem (MTSP). Further, to test the performance of LSA, computational experiments have been carried out on some benchmark as well as randomly generated test instances for OCMTSP, and results are reported. The overall computational results demonstrate that the proposed LSA is efficient in providing optimal and sub-optimal solutions within the considerable CPU times. .
An exact algorithm for multi-constrained minimum spanning tree problem
International Journal of Mathematics in Operational Research
Lexi-search algorithm for one to many multidimensional bi-criteria unbalanced assignment problem
International Journal of Bio-Inspired Computation
Bi-criteria travelling salesman subtour problem with time threshold
The European Physical Journal Plus
Uploads
Papers by purusotham singamsetty