Files in this item
An integrated approach to a combinatorial optimisation problem
|Kuster Filipe Bowles, Juliana
|Caminati, Marco Bright
|Tapia Tarifa, Silvia Lizeth
|Kuster Filipe Bowles , J & Caminati , M B 2019 , An integrated approach to a combinatorial optimisation problem . in W Ahrendt & S L Tapia Tarifa (eds) , Integrated Formal Methods : 15th International Conference, IFM 2019, Bergen, Norway, December 2–6, 2019, Proceedings . LNCS edn , Lecture Notes in Computer Science (Programming and Software Engineering) , vol. 11918 , Springer , Cham , pp. 284-302 , 15th International Conference on integrated Formal Methods (iFM 2019) , Bergen , Norway , 2/12/19 . https://doi.org/10.1007/978-3-030-34968-4_16
|PURE UUID: 940bee9e-c321-40d4-8b29-896a70bd39ad
|Funding: MRC grant MR/S003819/1 and Health Data Research UK, an initiative funded by UK Research and Innovation, Department of Health and Social Care (England) and the devolved administrations, and leading medical research charities.
|We take inspiration from a problem from the healthcare domain, where patients with several chronic conditions follow different guidelines designed for the individual conditions, and where the aim is to find the best treatment plan for a patient that avoids adverse drug reactions, respects patient’s preferences and prioritises drug efficacy. Each chronic condition guideline can be abstractly described by a directed graph, where each node indicates a treatment step (e.g., a choice in medications or resources) and has a certain duration. The search for the best treatment path is seen as a combinatorial optimisation problem and we show how to select a path across the graphs constrained by a notion of resource compatibility. This notion takes into account interactions between any finite number of resources, and makes it possible to express non-monotonic interactions. Our formalisation also introduces a discrete temporal metric, so as to consider only simultaneous nodes in the optimisation process. We express the formal problem as an SMT problem and provide a correctness proof of the SMT code by exploiting the interplay between SMT solvers and the proof assistant Isabelle/HOL. The problem we consider combines aspects of optimal graph execution and resource allocation, showing how an SMT solver can be an alternative to other approaches which are well-researched in the corresponding domains.
|Integrated Formal Methods
|Lecture Notes in Computer Science (Programming and Software Engineering)
|Copyright © 2019 Springer Nature AG. This work has been made available online in accordance with publisher policies or with permission. Permission for further reuse of this content should be sought from the publisher or the rights holder. This is the author created accepted manuscript following peer review and may differ slightly from the final published version. The final published version of this work is available at https://doi.org/10.1007/978-3-030-34968-4_16
|QA75 Electronic computers. Computer science
|RM Therapeutics. Pharmacology
|An integrated approach to a combinatorial optimisation problem
|Medical Research Council
|University of St Andrews. School of Computer Science
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.