Cover Image

Solving standard traveling salesman problem and multiple traveling salesman problem by using branch-and-bound

Link to publisher's homepage at http://scitation.aip.org

Saved in:
Bibliographic Details
Main Authors: Shakila, Saad, Wan Nurhadani, Wan Jaafar, Siti Jasmida, Jamil
Other Authors: shakila@unimap.edu.my
Format: Article
Language:English
Published: AIP Publishing LLC 2014
Subjects:
Branch-and-Bound; Breadthfirst-Search
Multiple Traveling Salesman Problem (MTSP)
Standard Traveling Salesman Problem
Online Access:http://dspace.unimap.edu.my:80/dspace/handle/123456789/35164
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.unimap-35164
record_format dspace
spelling my.unimap-351642014-06-07T02:34:22Z Solving standard traveling salesman problem and multiple traveling salesman problem by using branch-and-bound Shakila, Saad Wan Nurhadani, Wan Jaafar Siti Jasmida, Jamil shakila@unimap.edu.my hadani@unimap.edu.my jasmida@unimap.edu.my Branch-and-Bound; Breadthfirst-Search Multiple Traveling Salesman Problem (MTSP) Standard Traveling Salesman Problem Link to publisher's homepage at http://scitation.aip.org The standard Traveling Salesman Problem (TSP) is the classical Traveling Salesman Problem (TSP) while Multiple Traveling Salesman Problem (MTSP) is an extension of TSP when more than one salesman is involved. The objective of MTSP is to find the least costly route that the traveling salesman problem can take if he wishes to visit exactly once each of a list of n cities and then return back to the home city. There are a few methods that can be used to solve MTSP. The objective of this research is to implement an exact method called Branch-and-Bound (B&B) algorithm. Briefly, the idea of B&B algorithm is to start with the associated Assignment Problem (AP). A branching strategy will be applied to the TSP and MTSP which is Breadth-first-Search (BFS). 11 nodes of cities are implemented for both problem and the solutions to the problem are presented. 2014-06-07T02:34:22Z 2014-06-07T02:34:22Z 2013 Article AIP Conference Proceedings, vol. 1522, 2013, pages 1406-1411 978-073541150-0 0094-243X http://scitation.aip.org/content/aip/proceeding/aipcp/10.1063/1.4801294 http://dspace.unimap.edu.my:80/dspace/handle/123456789/35164 en AIP Publishing LLC
institution Universiti Malaysia Perlis
building UniMAP Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Malaysia Perlis
content_source UniMAP Library Digital Repository
url_provider http://dspace.unimap.edu.my/
language English
topic Branch-and-Bound; Breadthfirst-Search
Multiple Traveling Salesman Problem (MTSP)
Standard Traveling Salesman Problem
spellingShingle Branch-and-Bound; Breadthfirst-Search
Multiple Traveling Salesman Problem (MTSP)
Standard Traveling Salesman Problem
Shakila, Saad
Wan Nurhadani, Wan Jaafar
Siti Jasmida, Jamil
Solving standard traveling salesman problem and multiple traveling salesman problem by using branch-and-bound
description Link to publisher's homepage at http://scitation.aip.org
author2 shakila@unimap.edu.my
author_facet shakila@unimap.edu.my
Shakila, Saad
Wan Nurhadani, Wan Jaafar
Siti Jasmida, Jamil
format Article
author Shakila, Saad
Wan Nurhadani, Wan Jaafar
Siti Jasmida, Jamil
author_sort Shakila, Saad
title Solving standard traveling salesman problem and multiple traveling salesman problem by using branch-and-bound
title_short Solving standard traveling salesman problem and multiple traveling salesman problem by using branch-and-bound
title_full Solving standard traveling salesman problem and multiple traveling salesman problem by using branch-and-bound
title_fullStr Solving standard traveling salesman problem and multiple traveling salesman problem by using branch-and-bound
title_full_unstemmed Solving standard traveling salesman problem and multiple traveling salesman problem by using branch-and-bound
title_sort solving standard traveling salesman problem and multiple traveling salesman problem by using branch-and-bound
publisher AIP Publishing LLC
publishDate 2014
url http://dspace.unimap.edu.my:80/dspace/handle/123456789/35164
_version_ 1643797740592824320
score 13.214268

Similar Items