Optimization of Timed Petri Nets using CP-SAT
Saved in:
| 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 |
Full Text Finder 
Nájsť tento článok vo Web of Science | Abstract: | 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. |
|---|---|
| ISSN: | 24058963 |
| DOI: | 10.1016/j.ifacol.2024.07.016 |