View in EDS

Search for an immobile entity on a network

Saved in:
Bibliographic Details
Title: Search for an immobile entity on a network
Authors: Jotshi, Arun1 arun.jotshi@att.com, Batta, Rajan2 batta@eng.buffalo.edu
Source: European Journal of Operational Research. Dec2008, Vol. 191 Issue 2, p347-359. 13p.
Subjects: Heuristic, Famous problems in probabilities, Algorithms, Probability theory, Operations research
Abstract: We consider the problem of searching for a single, uniformly distributed immobile entity on an undirected network. This problem differs from edge-covering problems, e.g., the Chinese Postman Problem (CPP), since the objective here is not to find the minimum length tour that covers all the edges at least once, but instead to minimize the expected time to find the entity. We introduce a heuristic algorithm to deal with the search process given that the entity is equally likely to be at any point on the network. Computational results are presented. [Copyright &y& Elsevier]
Copyright of European Journal of Operational Research is the property of Elsevier B.V. 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: 32171059
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Search for an immobile entity on a network
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Jotshi%2C+Arun%22">Jotshi, Arun</searchLink><relatesTo>1</relatesTo><i> arun.jotshi@att.com</i><br /><searchLink fieldCode="AR" term="%22Batta%2C+Rajan%22">Batta, Rajan</searchLink><relatesTo>2</relatesTo><i> batta@eng.buffalo.edu</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22European+Journal+of+Operational+Research%22">European Journal of Operational Research</searchLink>. Dec2008, Vol. 191 Issue 2, p347-359. 13p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Heuristic%22">Heuristic</searchLink><br /><searchLink fieldCode="DE" term="%22Famous+problems+in+probabilities%22">Famous problems in probabilities</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Probability+theory%22">Probability theory</searchLink><br /><searchLink fieldCode="DE" term="%22Operations+research%22">Operations research</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: We consider the problem of searching for a single, uniformly distributed immobile entity on an undirected network. This problem differs from edge-covering problems, e.g., the Chinese Postman Problem (CPP), since the objective here is not to find the minimum length tour that covers all the edges at least once, but instead to minimize the expected time to find the entity. We introduce a heuristic algorithm to deal with the search process given that the entity is equally likely to be at any point on the network. Computational results are presented. [Copyright &y& Elsevier]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of European Journal of Operational Research is the property of Elsevier B.V. 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=32171059
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/j.ejor.2007.08.032
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 13
        StartPage: 347
    Subjects:
      – SubjectFull: Heuristic
        Type: general
      – SubjectFull: Famous problems in probabilities
        Type: general
      – SubjectFull: Algorithms
        Type: general
      – SubjectFull: Probability theory
        Type: general
      – SubjectFull: Operations research
        Type: general
    Titles:
      – TitleFull: Search for an immobile entity on a network
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Jotshi, Arun
      – PersonEntity:
          Name:
            NameFull: Batta, Rajan
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 12
              Text: Dec2008
              Type: published
              Y: 2008
          Identifiers:
            – Type: issn-print
              Value: 03772217
          Numbering:
            – Type: volume
              Value: 191
            – Type: issue
              Value: 2
          Titles:
            – TitleFull: European Journal of Operational Research
              Type: main
ResultId 1