Traveling Salesman Problem: A Case Study
Journal Title: INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY - Year 2012, Vol 3, Issue 1
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.
Authors and Affiliations
Dr. Leena jain, Mr. Amit Bhanot
Optimal Electric-Power Distribution and Load-Sharing on Smart-Grids: Analysis by Artificial Neural Network
This study refers to developing an electric-power distribution system with optimal/suboptimal load-sharing in the complex and expanding metro power-grid infrastructure. That is, the relevant exercise is to in...
A Comparative Evaluation of approaches for Model Testability
Design for testability is a very importantissue in software engineering. It becomes crucial in the case of Model Based Testing where models are generally not tested before using as input of Model Based Testing. The quali...
A TABU SEARCH APPROACH FOR THE BI-OBJECTIVE HOSPITAL SITE DETERMINATION PROBLEM UNDER FUZZY ENVIRONMENT
The present paper attempts to study the bi-objective hospital site determination problem under fuzzy environment. In this paper, the concept of Tabu search is used for solving bi-objective facility location problem i.e....
Visualizing text similarities from a graph-based SOM
Text in articles is based on expert opinion of a large number of people including the views of authors. These views are based on cultural or community aspects, which make extracting information from text very difficult....
A Novel SLM based PAPR reduction Technique in OFDM-MIMO System
Orthogonal Frequency Division Multiplexing (OFDM) is annew method for fourth generation wireless communication.MIMO-OFDM has become a promising candidate for highperformance 4G broadband wireless communications.However,...