View in EDS PDF Full Text

Complexity of the AGV shortest path and single-loop guide path layout problems.

Saved in:
Bibliographic Details
Title: Complexity of the AGV shortest path and single-loop guide path layout problems.
Authors: De Guzman, M. C.1, Prabhu, N.1, Tanchoco, J. M. A.1
Source: International Journal of Production Research. Aug1997, Vol. 35 Issue 8, p2083-2092. 10p.
Subjects: Automated guided vehicle systems, Materials handling, Industrial robots, Production engineering, Graph theory
Abstract: The guide path layout is one of the most important variables in the design of automated guided vehicle systems (AGVS). Many alternative guide path configurations have been proposed in previous research. Two of the simplest are the shortest path and shortest single-loop configurations. However, the optimal solutions to these two problems have not been easy to obtain. In this paper, we show why by proving the NP-completeness of these problems using graph theoretic methods. [ABSTRACT FROM AUTHOR]
Copyright of International Journal of Production Research 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 Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 6483950
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Complexity of the AGV shortest path and single-loop guide path layout problems.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22De+Guzman%2C+M%2E+C%2E%22">De Guzman, M. C.</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Prabhu%2C+N%2E%22">Prabhu, N.</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Tanchoco%2C+J%2E+M%2E+A%2E%22">Tanchoco, J. M. A.</searchLink><relatesTo>1</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22International+Journal+of+Production+Research%22">International Journal of Production Research</searchLink>. Aug1997, Vol. 35 Issue 8, p2083-2092. 10p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Automated+guided+vehicle+systems%22">Automated guided vehicle systems</searchLink><br /><searchLink fieldCode="DE" term="%22Materials+handling%22">Materials handling</searchLink><br /><searchLink fieldCode="DE" term="%22Industrial+robots%22">Industrial robots</searchLink><br /><searchLink fieldCode="DE" term="%22Production+engineering%22">Production engineering</searchLink><br /><searchLink fieldCode="DE" term="%22Graph+theory%22">Graph theory</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: The guide path layout is one of the most important variables in the design of automated guided vehicle systems (AGVS). Many alternative guide path configurations have been proposed in previous research. Two of the simplest are the shortest path and shortest single-loop configurations. However, the optimal solutions to these two problems have not been easy to obtain. In this paper, we show why by proving the NP-completeness of these problems using graph theoretic methods. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of International Journal of Production Research 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=6483950
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1080/002075497194741
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 10
        StartPage: 2083
    Subjects:
      – SubjectFull: Automated guided vehicle systems
        Type: general
      – SubjectFull: Materials handling
        Type: general
      – SubjectFull: Industrial robots
        Type: general
      – SubjectFull: Production engineering
        Type: general
      – SubjectFull: Graph theory
        Type: general
    Titles:
      – TitleFull: Complexity of the AGV shortest path and single-loop guide path layout problems.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: De Guzman, M. C.
      – PersonEntity:
          Name:
            NameFull: Prabhu, N.
      – PersonEntity:
          Name:
            NameFull: Tanchoco, J. M. A.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 08
              Text: Aug1997
              Type: published
              Y: 1997
          Identifiers:
            – Type: issn-print
              Value: 00207543
          Numbering:
            – Type: volume
              Value: 35
            – Type: issue
              Value: 8
          Titles:
            – TitleFull: International Journal of Production Research
              Type: main
ResultId 1