A Two-Phase ASP Encoding for Solving Rehabilitation Scheduling

Cardellini, Matteo; Nardi, Paolo De; Dodaro, Carmine; Galatà, Giuseppe; Giardini, Anna; Maratea, Marco; Porro, Ivan

doi:10.1007/978-3-030-91167-6_8

Cited by 8 publications

(8 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is possible due to the preliminary work performed by the preprocessor which leaves to the optimizer to explore a pruned search space containing only viable solutions, of which the best must be found. To further improve performance, CLINGO is executed with the option --parallel-mode=2 in order to parallelize two optimization algorithms: Branch and Bound with Restart on Model [16] and the Unsatisfiable Shrinking Core [2] which has already proven to be effective in [7]. Experiments were run on a MacBook Pro with a 2.5 GHz Intel Core i7 quad-core, with 16 GB of RAM.…”

Section: Preliminary Resultsmentioning

confidence: 99%

“…For this reason, the approach presented in this paper relies mainly on an Answer Set Programming (ASP) [17,21,3] encoding of the problem. ASP has already proved to be an effective tool for solving several practical scheduling problems [11,10,7]. In particular, in [13], an ASP based solution was presented for modelling an abstract mesoscopic flow model (a middle-ground approach between macroscopic and microscopic) and a strategy for generating traffic lights SPPs.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An ASP Framework for Efficient Urban Traffic Optimization

Cardellini

2022

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

Avoiding congestion and controlling traffic in urban scenarios is becoming nowadays of paramount importance due to the rapid growth of our cities' population and vehicles. The effective control of urban traffic as a means to mitigate congestion can be beneficial in an economic, environmental and health way. In this paper, a framework which allows to efficiently simulate and optimize traffic flow in a large roads' network with hundreds of vehicles is presented. The framework leverages on an Answer Set Programming (ASP) encoding to formally describe the movements of vehicles inside a network. Taking advantage of the ability to specify optimization constraints in ASP and the offthe-shelf solver CLINGO, it is then possible to optimize the routes of vehicles inside the network to reduce a range of relevant metrics (e.g., travel times or emissions). Finally, an analysis on real-world traffic data is performed, utilizing the state-of-the-art Urban Mobility Simulator (SUMO) to keep track of the state of the network, test the correctness of the solution and to prove the efficiency and capabilities of the presented solution.

show abstract

Section: Preliminary Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

An ASP Framework for Efficient Urban Traffic Optimization

Cardellini

2022

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

show abstract

“…This paper is an extended and revised version of Cardellini et al (2021), having the following main consistent additions: (i) a comparison to alternative logic-based formalisms on real instances (Subsection 4.2), and (ii) the definition and related experimental evaluation of two domain-specific optimizations (Section 5).…”

Section: Related Workmentioning

confidence: 99%

Solving Rehabilitation Scheduling Problems via a Two-Phase ASP Approach

Cardellini¹,

Nardi²,

Dodaro³

et al. 2023

Theory and Practice of Logic Programming

Self Cite

View full text Add to dashboard Cite

A core part of the rehabilitation scheduling process consists of planning rehabilitation physiotherapy sessions for patients, by assigning proper operators to them in a certain time slot of a given day, taking into account several legal, medical, and ethical requirements and optimizations, for example, patient’s preferences and operator’s work balancing. Being able to efficiently solve such problem is of upmost importance, in particular after the COVID-19 pandemic that significantly increased rehabilitation’s needs. In this paper, we present a two-phase solution to rehabilitation scheduling based on Answer Set Programming, which proved to be an effective tool for solving practical scheduling problems. We first present a general encoding and then add domain-specific optimizations. Results of experiments performed on both synthetic and real benchmarks, the latter provided by ICS Maugeri, show the effectiveness of our solution as well as the impact of our domain-specific optimizations.

show abstract

“…Then, the problem of assigning operating rooms to patients, denoted as Operating Room Scheduling [16,17], has been treated, and further extended to include bed management [15]. More recent problems include the Chemotherepy Treatment Scheduling problem [14], in which patients are assigned a chair or a bed for their treatments, and the Rehabilitation Scheduling Problem [12], which assigns patients to operators in rehabilitation sessions. The current paper is the only one which deals with the pre-operative phase, and presents a two phases approach.…”

Section: Related Workmentioning

confidence: 99%

An ASP-Based Approach to Scheduling Pre-operative Assessment Clinic

Caruso

Galatà²,

Maratea³

et al. 2022

AIxIA 2021 – Advances in Artificial Intelligence

Self Cite

View full text Add to dashboard Cite

The problem of scheduling Pre-Operative Assessment Clinic (PAC) consists of assigning patients to a day for the exams needed before a surgical procedure, taking into account patients with different priority levels, due dates, and operators availability. Realizing a satisfying schedule is of upmost importance for a clinic, since delay in PAC can cause delay in the subsequent phases, causing a decrease in patients' satisfaction. In this paper, we divide the problem in two sub-problems: In the first sub-problem patients are assigned to a day taking into account a default list of exams; then, in the second sub-problem, having the actual list of exams needed by each patient, we use the results of the first sub-problem to assign a starting time to each exam. We first present a mathematical formulation for both problems. Then, we present solutions based on Answer Set Programming (ASP): The first solution is a genuine ASP encoding of the sub-problems, while the second introduces domain-specific optimizations. Experiments show that both solutions provide satisfying results in short time, while the second is able to prove optimality faster.

show abstract

A Two-Phase ASP Encoding for Solving Rehabilitation Scheduling

Cited by 8 publications

References 22 publications

An ASP Framework for Efficient Urban Traffic Optimization

An ASP Framework for Efficient Urban Traffic Optimization

Solving Rehabilitation Scheduling Problems via a Two-Phase ASP Approach

An ASP-Based Approach to Scheduling Pre-operative Assessment Clinic

Contact Info

Product

Resources

About