Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Handelsresandeproblemet: Metoder för asymmetriska grafer
KTH, School of Computer Science and Communication (CSC).
KTH, School of Computer Science and Communication (CSC).
2013 (Swedish)Independent thesis Advanced level (professional degree), 10 credits / 15 HE creditsStudent thesis
Abstract [sv]

I denna uppsats beskriver vi tre metoder för att lösa eller approximera en lösning till det asymmetriska handelsresandeproblemet. Vi försöker ta reda på huruvida det är en god ide att transformera en asymmetrisk instans till en symmetrisk instans av handelsresande problemet i relation till att lösa problemet med andra metoder. Innehållet uppsatsen är i huvudsak baserat pa tidigare forskning. Som slutsats konstaterar vi att det är svårt att veriera huruvida det finns några fördelar i medelfallet med att transformera en asymmetrisk instans till en symmetrisk instans. Dock uppmanar vi forskningsvärlden att fortsätta forska i denna riktning inom datalogin.

Abstract [en]

In this paper we describe three dierent methods for solving or approx-imating a solution to the asymmetric travelling salesman problem. We try togive an answer to whether it is a good idea to transform an asymmetric instanceof the travelling salesman problem into a symmetric instance, in the relation ofsolving the problem with other methods. The content of our paper is mostlybased on previous research. Our conclusion is that it is dicult at this time togive a straight answer to if there exists any benets to transform from asym-metric to symmetric instance of the traveling salesman problem. Although weencourage the science community to continue research into this field of computer science.

Place, publisher, year, edition, pages
2013. , 29 p.
Series
Kandidatexjobb CSC, K13001
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-134800OAI: oai:DiVA.org:kth-134800DiVA: diva2:668100
Educational program
Master of Science in Engineering - Computer Science and Technology
Supervisors
Examiners
Available from: 2013-12-13 Created: 2013-11-28 Last updated: 2013-12-13Bibliographically approved

Open Access in DiVA

Rapport_Hagsten_Oberg.pdf(22552 kB)122 downloads
File information
File name FULLTEXT01.pdfFile size 22552 kBChecksum SHA-512
dd946e96fcf9436945d398bb750c35e304d293d5d12b6f0c2f4128886ae37089e2cba1f11f8413f193a1b7ee31bcde9c3a3b3d84caa396aba06af360590c2769
Type fulltextMimetype application/pdf

Other links

http://www.csc.kth.se/utbildning/kth/kurser/DD143X/dkand13/Group1Vahid/report/Rapport_Hagsten_Oberg.pdf
By organisation
School of Computer Science and Communication (CSC)
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 122 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 92 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf