Optimising Flexibility for Simple Temporal Networks

Conference Paper (2016)
Authors

C Witteveen (TU Delft - Algorithmics)

Research Group
Algorithmics
To reference this document use:
https://doi.org/10.5220/0005824205240531
More Info
expand_more
Publication Year
2016
Language
English
Research Group
Algorithmics
Volume number
2
Pages (from-to)
524-531
ISBN (print)
978-989-758-172-4
DOI:
https://doi.org/10.5220/0005824205240531

Abstract

We generalise a recently proposed concurrent flexibility metric to overcome some of its shortcomings. We show that these shortcomings can be removed if one selects an optimal subset of variables for which the concurrent flexibility is determined. The flexibility of the remaining variables does not play a role in the determination of the flexibility of the system. We present a preliminary experimental evaluation of the improvement in concurrent flexibility that can be obtained by comparing some (approximation) algorithms. Their performance on several benchmark sets is evaluated. As a result, in some cases the concurrent flexibility of an STN can be enhanced by 20-50%.

No files available

Metadata only record. There are no files for this record.