CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

A Proposed Solution to Travelling Salesman Problem using Branch and Bound

by Archit Rastogi, Ankur Kumar Shrivastava, Nitisha Payal, Ramander Singh
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 65 - Number 5
Year of Publication: 2013
Authors: Archit Rastogi, Ankur Kumar Shrivastava, Nitisha Payal, Ramander Singh
10.5120/10924-5866

Archit Rastogi, Ankur Kumar Shrivastava, Nitisha Payal, Ramander Singh . A Proposed Solution to Travelling Salesman Problem using Branch and Bound. International Journal of Computer Applications. 65, 5 ( March 2013), 44-49. DOI=10.5120/10924-5866

@article{ 10.5120/10924-5866,
author = { Archit Rastogi, Ankur Kumar Shrivastava, Nitisha Payal, Ramander Singh },
title = { A Proposed Solution to Travelling Salesman Problem using Branch and Bound },
journal = { International Journal of Computer Applications },
issue_date = { March 2013 },
volume = { 65 },
number = { 5 },
month = { March },
year = { 2013 },
issn = { 0975-8887 },
pages = { 44-49 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume65/number5/10924-5866/ },
doi = { 10.5120/10924-5866 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:17:56.469927+05:30
%A Archit Rastogi
%A Ankur Kumar Shrivastava
%A Nitisha Payal
%A Ramander Singh
%T A Proposed Solution to Travelling Salesman Problem using Branch and Bound
%J International Journal of Computer Applications
%@ 0975-8887
%V 65
%N 5
%P 44-49
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Travelling salesperson problem is a well-known problem. In this problem the minimum cost tour of few cities is needed, which are connected. The cost of different paths is given. The tour should be started from a given node and after completing the tour the travelling salesman has to return to the starting node. The earlier method is given by Greedy programming. In this paper Branch & Bound method is used to solve this problem.

References
  1. http://paralleltsp. googlecode. com/files/teamDharmaPresentation. pdf.
  2. http://lcm. csa. iisc. ernet. in/dsa/node187. html
  3. www. dtic. mil/dtic/tr/fulltext/u2/a126957. pdf
  4. http://retis. sssup. it/~bini/teaching/optimDisc2 010/bbtsp. pdf
  5. http://www. nd. edu/~dgalvin1/30210/30210_F0 7/presentations/TSP_branchandbound. pdf
  6. http://www. csd. uoc. gr/~hy583/papers/ch11. pdf
  7. http://www. math. ucdavis. edu/~mkoeppe/tsp. ps
  8. http://ab. inf. uni-tuebingen. de/teaching/ ws04/phylo/script/30_11. pdf
  9. https://www. waset. org/journals/waset/v6/v6-113. pdf
  10. https://www. waset. org/journals/waset/v6/v6-113. pdf
Index Terms

Computer Science
Information Sciences

Keywords

Backtracking Branch & Bound technique Cost Matrix Greedy Approach

Powered by PhDFocusTM