Zobrazit v EDS

The stochastic opportunistic replacement problem, part III: improved bounding procedures

Uloženo v:
Podrobná bibliografie
Název: The stochastic opportunistic replacement problem, part III: improved bounding procedures
Autoři: Laksman, Efraim, 1983, Strömberg, Ann-Brith, 1961, Patriksson, Michael, 1964
Zdroj: Future Industrial Services Management Annals of Operations Research. 292(2):711-733
Témata: maintenace optimization, Stochastic programming, mixed binary linear optimization, stochastic opportunistic replacement problem
Popis: We consider the problem to find a schedule for component replacement in a multi-component system, whose components possess stochastic lives and economic dependencies, such that the expected costs for maintenance during a pre-defined time period are minimized. The problem was considered in Patriksson et al. (Ann Oper Res 224:51–75, 2015), in which a two-stage approximation of the problem was optimized through decomposition (denoted the optimization policy). The current paper improves the effectiveness of the decomposition approach by establishing a tighter bound on the value of the recourse function (i.e., the second stage in the approximation). A general lower bound on the expected maintenance cost is also established. Numerical experiments with 100 simulation scenarios for each of four test instances show that the tighter bound yields a decomposition generating fewer optimality cuts. They also illustrate the quality of the lower bound. Contrary to results presented earlier, an age-based policy performs on par with the optimization policy, although most simple policies perform worse than the optimization policy.
Popis souboru: electronic
Přístupová URL adresa: https://research.chalmers.se/publication/511286
https://research.chalmers.se/publication/510653
https://research.chalmers.se/publication/511286/file/511286_Fulltext.pdf
Databáze: SwePub
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://research.chalmers.se/publication/511286#
    Name: EDS - SwePub (s4221598)
    Category: fullText
    Text: View record in SwePub
  – Url: https://resolver.ebscohost.com/openurl?sid=EBSCO:edsswe&genre=article&issn=15729338&ISBN=&volume=292&issue=2&date=20200101&spage=711&pages=711-733&title=Future Industrial Services Management Annals of Operations Research&atitle=The%20stochastic%20opportunistic%20replacement%20problem%2C%20part%20III%3A%20improved%20bounding%20procedures&aulast=Laksman%2C%20Efraim&id=DOI:10.1007/s10479-019-03278-z
    Name: Full Text Finder
    Category: fullText
    Text: Full Text Finder
    Icon: https://imageserver.ebscohost.com/branding/images/FTF.gif
    MouseOverText: Full Text Finder
  – Url: https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=EBSCO&SrcAuth=EBSCO&DestApp=WOS&ServiceName=TransferToWoS&DestLinkType=GeneralSearchSummary&Func=Links&author=Laksman%20E
    Name: ISI
    Category: fullText
    Text: Nájsť tento článok vo Web of Science
    Icon: https://imagesrvr.epnet.com/ls/20docs.gif
    MouseOverText: Nájsť tento článok vo Web of Science
Header DbId: edsswe
DbLabel: SwePub
An: edsswe.oai.research.chalmers.se.53b3159d.793b.40bb.937c.56e8f19945ae
RelevancyScore: 987
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 987.1474609375
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: The stochastic opportunistic replacement problem, part III: improved bounding procedures
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Laksman%2C+Efraim%22">Laksman, Efraim</searchLink>, 1983<br /><searchLink fieldCode="AR" term="%22Strömberg%2C+Ann-Brith%22">Strömberg, Ann-Brith</searchLink>, 1961<br /><searchLink fieldCode="AR" term="%22Patriksson%2C+Michael%22">Patriksson, Michael</searchLink>, 1964
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <i>Future Industrial Services Management Annals of Operations Research</i>. 292(2):711-733
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22maintenace+optimization%22">maintenace optimization</searchLink><br /><searchLink fieldCode="DE" term="%22Stochastic+programming%22">Stochastic programming</searchLink><br /><searchLink fieldCode="DE" term="%22mixed+binary+linear+optimization%22">mixed binary linear optimization</searchLink><br /><searchLink fieldCode="DE" term="%22stochastic+opportunistic+replacement+problem%22">stochastic opportunistic replacement problem</searchLink>
– Name: Abstract
  Label: Description
  Group: Ab
  Data: We consider the problem to find a schedule for component replacement in a multi-component system, whose components possess stochastic lives and economic dependencies, such that the expected costs for maintenance during a pre-defined time period are minimized. The problem was considered in Patriksson et al. (Ann Oper Res 224:51–75, 2015), in which a two-stage approximation of the problem was optimized through decomposition (denoted the optimization policy). The current paper improves the effectiveness of the decomposition approach by establishing a tighter bound on the value of the recourse function (i.e., the second stage in the approximation). A general lower bound on the expected maintenance cost is also established. Numerical experiments with 100 simulation scenarios for each of four test instances show that the tighter bound yields a decomposition generating fewer optimality cuts. They also illustrate the quality of the lower bound. Contrary to results presented earlier, an age-based policy performs on par with the optimization policy, although most simple policies perform worse than the optimization policy.
– Name: Format
  Label: File Description
  Group: SrcInfo
  Data: electronic
– Name: URL
  Label: Access URL
  Group: URL
  Data: <link linkTarget="URL" linkTerm="https://research.chalmers.se/publication/511286" linkWindow="_blank">https://research.chalmers.se/publication/511286</link><br /><link linkTarget="URL" linkTerm="https://research.chalmers.se/publication/510653" linkWindow="_blank">https://research.chalmers.se/publication/510653</link><br /><link linkTarget="URL" linkTerm="https://research.chalmers.se/publication/511286/file/511286_Fulltext.pdf" linkWindow="_blank">https://research.chalmers.se/publication/511286/file/511286_Fulltext.pdf</link>
PLink https://erproxy.cvtisr.sk/sfx/access?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsswe&AN=edsswe.oai.research.chalmers.se.53b3159d.793b.40bb.937c.56e8f19945ae
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s10479-019-03278-z
    Languages:
      – Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 23
        StartPage: 711
    Subjects:
      – SubjectFull: maintenace optimization
        Type: general
      – SubjectFull: Stochastic programming
        Type: general
      – SubjectFull: mixed binary linear optimization
        Type: general
      – SubjectFull: stochastic opportunistic replacement problem
        Type: general
    Titles:
      – TitleFull: The stochastic opportunistic replacement problem, part III: improved bounding procedures
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Laksman, Efraim
      – PersonEntity:
          Name:
            NameFull: Strömberg, Ann-Brith
      – PersonEntity:
          Name:
            NameFull: Patriksson, Michael
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 2020
          Identifiers:
            – Type: issn-print
              Value: 15729338
            – Type: issn-print
              Value: 02545330
            – Type: issn-locals
              Value: SWEPUB_FREE
            – Type: issn-locals
              Value: CTH_SWEPUB
          Numbering:
            – Type: volume
              Value: 292
            – Type: issue
              Value: 2
          Titles:
            – TitleFull: Future Industrial Services Management Annals of Operations Research
              Type: main
ResultId 1