View in EDS PDF Full Text

A Closer Look at the Travelling Salesman Problem

Saved in:
Bibliographic Details
Title: A Closer Look at the Travelling Salesman Problem
Description: A Closer Look at the Travelling Salesman Problem first defines the travelling salesman problem and then discusses important methods for solving it. The authors describe a novel search system, the attractor-based search system; this system uses a local search process to construct the solution attractor, and then completely searches the constructed solution attractor to find the optimal tour, solving the travelling salesman problem efficiently. Additionally, the hybrid of improvement and construction heuristics is presented, which produces a better cost-quality solution in lesser time. In the worst case, it creates a 1.91, 2.86 times better cost-quality compared to improvement and construction heuristics, respectively. The closing study reports on the solution of four 6-city, asymmetric traveling salesman problems on the D-Wave quantum processor. About 35% of the optimal tours were found by quantum means for a problem with 24 optimal tours and for another problem with 6 optimal tours.
Authors: Christina V. Østergaard
Resource Type: eBook.
Subjects: Mathematical models, Traveling salesman problem
Categories: MATHEMATICS / Optimization
Database: eBook Collection (EBSCOhost)
FullText Links:
  – Type: ebook-pdf
Text:
  Availability: 0
Header DbId: nlebk
DbLabel: eBook Collection (EBSCOhost)
An: 2365989
RelevancyScore: 1097
AccessLevel: 6
PubType: eBook
PubTypeId: ebook
PreciseRelevancyScore: 1096.64697265625
IllustrationInfo
ImageInfo – Size: thumb
  Target: https://rps2images.ebscohost.com/rpsweb/othumb?id=NL$2365989$PDF&s=r
– Size: medium
  Target: https://rps2images.ebscohost.com/rpsweb/othumb?id=NL$2365989$PDF&s=d
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A Closer Look at the Travelling Salesman Problem
– Name: Abstract
  Label: Description
  Group: Ab
  Data: A Closer Look at the Travelling Salesman Problem first defines the travelling salesman problem and then discusses important methods for solving it. The authors describe a novel search system, the attractor-based search system; this system uses a local search process to construct the solution attractor, and then completely searches the constructed solution attractor to find the optimal tour, solving the travelling salesman problem efficiently. Additionally, the hybrid of improvement and construction heuristics is presented, which produces a better cost-quality solution in lesser time. In the worst case, it creates a 1.91, 2.86 times better cost-quality compared to improvement and construction heuristics, respectively. The closing study reports on the solution of four 6-city, asymmetric traveling salesman problems on the D-Wave quantum processor. About 35% of the optimal tours were found by quantum means for a problem with 24 optimal tours and for another problem with 6 optimal tours.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Christina+V%2E+Østergaard%22">Christina V. Østergaard</searchLink>
– Name: TypePub
  Label: Resource Type
  Group: TypPub
  Data: eBook.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Mathematical+models%22">Mathematical models</searchLink><br /><searchLink fieldCode="DE" term="%22Traveling+salesman+problem%22">Traveling salesman problem</searchLink>
– Name: SubjectBISAC
  Label: Categories
  Group: Su
  Data: <searchLink fieldCode="ZK" term="%22MATHEMATICS+%2F+Optimization%22">MATHEMATICS / Optimization</searchLink>
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=nlebk&AN=2365989
RecordInfo BibRecord:
  BibEntity:
    Classifications:
      – Code: 519.6
        Scheme: ddc
        Type: prePub
    Languages:
      – Code: eng
        Text: English
    Subjects:
      – SubjectFull: Mathematical models
        Type: general
      – SubjectFull: Traveling salesman problem
        Type: general
    Titles:
      – TitleFull: A Closer Look at the Travelling Salesman Problem
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Christina V. Østergaard
      – PersonEntity:
          Name:
            NameFull: Christina V. Østergaard
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 2020
            – D: 08
              M: 12
              Type: profile
              Y: 2022
          Identifiers:
            – Type: isbn-electronic
              Value: 9781536175899
          Titles:
            – TitleFull: A Closer Look at the Travelling Salesman Problem
              Type: main
ResultId 1