Optimization of Timed Petri Nets using CP-SAT

Saved in:
Bibliographic Details
Title: Optimization of Timed Petri Nets using CP-SAT
Authors: Lennartson, Bengt, 1956
Source: 17th IFAC Workshop on Discrete Event Systems, WODES 2024, Rio de Janeiro, Brazil IFAC Proceedings Volumes (IFAC-PapersOnline). 58(1):90-95
Subject Terms: Time-optimal control, satisfiability solver, constraint programming, timed Petri net
Description: An optimization formulation is presented for timed Petri nets, based on a recently developed optimization solver where a satisfiability solver is integrated with constraint programming. The solver, called CP-SAT, is a part of Google's OR-Tools. The first optimization formulation includes an arbitrary number of concurrent sequences of operations, with shared, alternative, and local resources. A benchmark shows how much faster CP-SAT is compared to both an alternative SAT optimization solver and an A∗implementation. The optimization formulation is then generalized to mixed alternative and concurrent sequences. A comparison with a recent MILP formulation for timed Petri nets is presented, showing the strength of the proposed optimization formulation. Finally, an evaluation of an industrial-sized flexible manufacturing system, including uncontrollable events, demonstrates how efficient and easy to implement the proposed strategy is compared to existing results.
File Description: electronic
Access URL: https://research.chalmers.se/publication/542053
https://research.chalmers.se/publication/542053/file/542053_Fulltext.pdf
Database: SwePub
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://research.chalmers.se/publication/542053#
    Name: EDS - SwePub (s4221598)
    Category: fullText
    Text: View record in SwePub
  – Url: https://resolver.ebscohost.com/openurl?sid=EBSCO:edsswe&genre=article&issn=24058963&ISBN=&volume=58&issue=1&date=20240101&spage=90&pages=90-95&title=17th IFAC Workshop on Discrete Event Systems, WODES 2024, Rio de Janeiro, Brazil IFAC Proceedings Volumes (IFAC-PapersOnline)&atitle=Optimization%20of%20Timed%20Petri%20Nets%20using%20CP-SAT&aulast=Lennartson%2C%20Bengt&id=DOI:10.1016/j.ifacol.2024.07.016
    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=Lennartson%20B
    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.a66c7034.a1a4.4b73.8dc3.d38a9164a9aa
RelevancyScore: 986
AccessLevel: 6
PubType: Conference
PubTypeId: conference
PreciseRelevancyScore: 986.415405273438
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Optimization of Timed Petri Nets using CP-SAT
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Lennartson%2C+Bengt%22">Lennartson, Bengt</searchLink>, 1956
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <i>17th IFAC Workshop on Discrete Event Systems, WODES 2024, Rio de Janeiro, Brazil IFAC Proceedings Volumes (IFAC-PapersOnline)</i>. 58(1):90-95
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Time-optimal+control%22">Time-optimal control</searchLink><br /><searchLink fieldCode="DE" term="%22satisfiability+solver%22">satisfiability solver</searchLink><br /><searchLink fieldCode="DE" term="%22constraint+programming%22">constraint programming</searchLink><br /><searchLink fieldCode="DE" term="%22timed+Petri+net%22">timed Petri net</searchLink>
– Name: Abstract
  Label: Description
  Group: Ab
  Data: An optimization formulation is presented for timed Petri nets, based on a recently developed optimization solver where a satisfiability solver is integrated with constraint programming. The solver, called CP-SAT, is a part of Google's OR-Tools. The first optimization formulation includes an arbitrary number of concurrent sequences of operations, with shared, alternative, and local resources. A benchmark shows how much faster CP-SAT is compared to both an alternative SAT optimization solver and an A∗implementation. The optimization formulation is then generalized to mixed alternative and concurrent sequences. A comparison with a recent MILP formulation for timed Petri nets is presented, showing the strength of the proposed optimization formulation. Finally, an evaluation of an industrial-sized flexible manufacturing system, including uncontrollable events, demonstrates how efficient and easy to implement the proposed strategy is compared to existing results.
– 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/542053" linkWindow="_blank">https://research.chalmers.se/publication/542053</link><br /><link linkTarget="URL" linkTerm="https://research.chalmers.se/publication/542053/file/542053_Fulltext.pdf" linkWindow="_blank">https://research.chalmers.se/publication/542053/file/542053_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.a66c7034.a1a4.4b73.8dc3.d38a9164a9aa
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/j.ifacol.2024.07.016
    Languages:
      – Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 6
        StartPage: 90
    Subjects:
      – SubjectFull: Time-optimal control
        Type: general
      – SubjectFull: satisfiability solver
        Type: general
      – SubjectFull: constraint programming
        Type: general
      – SubjectFull: timed Petri net
        Type: general
    Titles:
      – TitleFull: Optimization of Timed Petri Nets using CP-SAT
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Lennartson, Bengt
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 2024
          Identifiers:
            – Type: issn-print
              Value: 24058963
            – Type: issn-locals
              Value: SWEPUB_FREE
            – Type: issn-locals
              Value: CTH_SWEPUB
          Numbering:
            – Type: volume
              Value: 58
            – Type: issue
              Value: 1
          Titles:
            – TitleFull: 17th IFAC Workshop on Discrete Event Systems, WODES 2024, Rio de Janeiro, Brazil IFAC Proceedings Volumes (IFAC-PapersOnline)
              Type: main
ResultId 1