View in EDS

Solving the traveling-salesman problem with time windows using tabu search.

Saved in:
Bibliographic Details
Title: Solving the traveling-salesman problem with time windows using tabu search.
Authors: Carlton, William B.1, Barnes, J. Wesley1
Source: IIE Transactions. Aug96, Vol. 28 Issue 8, p617-629. 13p.
Subjects: Traveling salesman problem, Problem solving, Algorithms, Feasibility studies, Decision making
Abstract: This paper presents a robust tabu search approach to the traveling-salesman problem with time windows. The approach uses a two-level tour hashing scheme within a reactive tabu search procedure to detect unique repeated solutions and to promote a more diverse search. Strong feasibility conditions restrict the neighborhood of candidate solutions. The search returns optimal, or near-optimal, solutions within a fraction of the time required by optimal methods. The algorithm's search neighborhood is not restricted to feasible solutions, and superior marginally infeasible solutions are reported to enhance the decision making process. The paper presents computational results for 145 problems from the literature. [ABSTRACT FROM AUTHOR]
Copyright of IIE Transactions is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 11873650
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Solving the traveling-salesman problem with time windows using tabu search.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Carlton%2C+William+B%2E%22">Carlton, William B.</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Barnes%2C+J%2E+Wesley%22">Barnes, J. Wesley</searchLink><relatesTo>1</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22IIE+Transactions%22">IIE Transactions</searchLink>. Aug96, Vol. 28 Issue 8, p617-629. 13p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Traveling+salesman+problem%22">Traveling salesman problem</searchLink><br /><searchLink fieldCode="DE" term="%22Problem+solving%22">Problem solving</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Feasibility+studies%22">Feasibility studies</searchLink><br /><searchLink fieldCode="DE" term="%22Decision+making%22">Decision making</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: This paper presents a robust tabu search approach to the traveling-salesman problem with time windows. The approach uses a two-level tour hashing scheme within a reactive tabu search procedure to detect unique repeated solutions and to promote a more diverse search. Strong feasibility conditions restrict the neighborhood of candidate solutions. The search returns optimal, or near-optimal, solutions within a fraction of the time required by optimal methods. The algorithm's search neighborhood is not restricted to feasible solutions, and superior marginally infeasible solutions are reported to enhance the decision making process. The paper presents computational results for 145 problems from the literature. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of IIE Transactions is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=11873650
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1080/15458830.1996.11770707
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 13
        StartPage: 617
    Subjects:
      – SubjectFull: Traveling salesman problem
        Type: general
      – SubjectFull: Problem solving
        Type: general
      – SubjectFull: Algorithms
        Type: general
      – SubjectFull: Feasibility studies
        Type: general
      – SubjectFull: Decision making
        Type: general
    Titles:
      – TitleFull: Solving the traveling-salesman problem with time windows using tabu search.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Carlton, William B.
      – PersonEntity:
          Name:
            NameFull: Barnes, J. Wesley
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 08
              Text: Aug96
              Type: published
              Y: 1996
          Identifiers:
            – Type: issn-print
              Value: 0740817X
          Numbering:
            – Type: volume
              Value: 28
            – Type: issue
              Value: 8
          Titles:
            – TitleFull: IIE Transactions
              Type: main
ResultId 1