Share Your Research, Maximize Your Social Impacts
Traveling Salesman Problem: A Case Study
Journal: INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY (Vol.3, No. 1)Publication Date: 2013-01-01
Authors : Leena Jain; Amit Bhanot;
Page : 167-169
Keywords : Optimization technique; Linear Programming; Assignment problem. TSP; combinatorial optimization problem;
Source : Download Find it from : Google Scholar
- Traveling Salesman Problem: A Case Study
- Variants of 2-opt Approach for the Generalized Traveling Salesman Problem
- EVALUATION OF THE OPERATORS OF THE GENETIC ALGORITHM IN APPLICATION ON THE TRAVELING SALESMAN PROBLEM
- Efficiency of the Simulated Annealing Algorithm in Solving the Traveling Salesman Problem
- Software for solving the precedence constrained generalized traveling salesman problem
Abstract
In this paper assignment based integer linear formulation presented for solving traveling salesman problem. Unfortunately, the assignment model can lead to infeasible solutions. Infeasibility removes by introducing additional constraints. Then this linear problem solved by open source software.
Other Latest Articles
- Green computing ? The New Era of Energy Efficient Computing
- Performance Evaluation of Image Enhancement Techniques in Spatial and Wavelet Domains
- Detecting the Sybil Attack in Wireless Sensor Network :Survey
- LSB Embedding in Spatial Domain - A Review of Improved Techniques
- Content Based Image Retrieval using Texture, Color and Shape for Image Analysis
Last modified: 2016-06-30 14:19:40