3,619 research outputs found
Operating Room (Re)Scheduling with Bed Management via ASP
The Operating Room Scheduling (ORS) problem is the task of assigning patients to operating rooms (ORs), taking into account different specialties, lengths, and priority scores of each planned surgery, OR session durations, and the availability of beds for the entire length of stay (LOS) both in the Intensive Care Unit (ICU) and in the wards. A proper solution to the ORS problem is of primary importance for the healthcare service quality and the satisfaction of patients in hospital environments. In this paper we first present a solution to the problem based on Answer Set Programming (ASP). The solution is tested on benchmarks with realistic sizes and parameters, on three scenarios for the target length on 5-day scheduling, common in small-medium-sized hospitals, and results show that ASP is a suitable solving methodology for the ORS problem in such setting. Then, we also performed a scalability analysis on the schedule length up to 15 days, which still shows the suitability of our solution also on longer plan horizons. Moreover, we also present an ASP solution for the rescheduling problem, that is, when the offline schedule cannot be completed for some reason. Finally, we introduce a web framework for managing ORS problems via ASP that allows a user to insert the main parameters of the problem, solve a specific instance, and show results graphically in real time
Best matching processes in distributed systems
The growing complexity and dynamic behavior of modern manufacturing and service industries along with competitive and globalized markets have gradually transformed traditional centralized systems into distributed networks of e- (electronic) Systems. Emerging examples include e-Factories, virtual enterprises, smart farms, automated warehouses, and intelligent transportation systems. These (and similar) distributed systems, regardless of context and application, have a property in common: They all involve certain types of interactions (collaborative, competitive, or both) among their distributed individualsâfrom clusters of passive sensors and machines to complex networks of computers, intelligent robots, humans, and enterprises. Having this common property, such systems may encounter common challenges in terms of suboptimal interactions and thus poor performance, caused by potential mismatch between individuals. For example, mismatched subassembly parts, vehiclesâroutes, suppliersâretailers, employeesâdepartments, and productsâautomated guided vehiclesâstorage locations may lead to low-quality products, congested roads, unstable supply networks, conflicts, and low service level, respectively. This research refers to this problem as best matching, and investigates it as a major design principle of CCT, the Collaborative Control Theory.
The original contribution of this research is to elaborate on the fundamentals of best matching in distributed and collaborative systems, by providing general frameworks for (1) Systematic analysis, inclusive taxonomy, analogical and structural comparison between different matching processes; (2) Specification and formulation of problems, and development of algorithms and protocols for best matching; (3) Validation of the models, algorithms, and protocols through extensive numerical experiments and case studies. The first goal is addressed by investigating matching problems in distributed production, manufacturing, supply, and service systems based on a recently developed reference model, the PRISM Taxonomy of Best Matching. Following the second goal, the identified problems are then formulated as mixed-integer programs. Due to the computational complexity of matching problems, various optimization algorithms are developed for solving different problem instances, including modified genetic algorithms, tabu search, and neighbourhood search heuristics. The dynamic and collaborative/competitive behaviors of matching processes in distributed settings are also formulated and examined through various collaboration, best matching, and task administration protocols. In line with the third goal, four case studies are conducted on various manufacturing, supply, and service systems to highlight the impact of best matching on their operational performance, including service level, utilization, stability, and cost-effectiveness, and validate the computational merits of the developed solution methodologies
Application of Artificial Intelligence declarative methods for Solving Operating Room Scheduling problems in Hospital Environments
Digital health is a relatively new but already important field in which digitalization meets the need to automatically and efficiently solve problems in healthcare to improve the quality of life for patients. The need to efficiently solve some of these problems has become even more pressing due to the Covid-19 pandemic that significantly increased stress and demand on hospitals. Hospitals have long waiting lists, surgery cancellations, and even worse, resource overloadâissues that negatively impact the level of patient satisfaction and the quality of care provided. Within every hospital, operating rooms (ORs) are an important unit. The Operating Room Scheduling (ORS) problem is the task of assigning patients to operating rooms, taking into account different specialties, lengths and priority scores of each planned surgery, operating room session durations, and the availability of beds for the entire length of stay both in the Intensive Care Unit and in the wards. A proper solution to the ORS problem is of primary importance for the quality of healthcare service and the satisfaction of patients in hospital environments. In this thesis, we provide several contributions to the ORS problem. We first present a solution to the problem based on Knowledge Representation and Reasoning via modeling and solving approaches using Answer Set Programming (ASP). This first basic solution builds on a previous solution but takes into account explicitly beds and ICU units because in the pandemic we understood how important and limiting they were. Moreover, we also present an ASP solution for the rescheduling problem, i.e., when the off-line schedule cannot be completed for some reasons, and a further extension where surgical teams are also considered. Another technical contribution is a second solution for the basic ORS problem with beds and an ICU unit, whose modeling departs from the guidelines previously used and shows efficiency improvements. Finally, we introduce a web framework for managing ORS problems via ASP that allows a user to insert the main parameters of the problem, solve a specific instance, and show results graphically in real time
The State-of-the-Art Survey on Optimization Methods for Cyber-physical Networks
Cyber-Physical Systems (CPS) are increasingly complex and frequently
integrated into modern societies via critical infrastructure systems, products,
and services. Consequently, there is a need for reliable functionality of these
complex systems under various scenarios, from physical failures due to aging,
through to cyber attacks. Indeed, the development of effective strategies to
restore disrupted infrastructure systems continues to be a major challenge.
Hitherto, there have been an increasing number of papers evaluating
cyber-physical infrastructures, yet a comprehensive review focusing on
mathematical modeling and different optimization methods is still lacking.
Thus, this review paper appraises the literature on optimization techniques for
CPS facing disruption, to synthesize key findings on the current methods in
this domain. A total of 108 relevant research papers are reviewed following an
extensive assessment of all major scientific databases. The main mathematical
modeling practices and optimization methods are identified for both
deterministic and stochastic formulations, categorizing them based on the
solution approach (exact, heuristic, meta-heuristic), objective function, and
network size. We also perform keyword clustering and bibliographic coupling
analyses to summarize the current research trends. Future research needs in
terms of the scalability of optimization algorithms are discussed. Overall,
there is a need to shift towards more scalable optimization solution
algorithms, empowered by data-driven methods and machine learning, to provide
reliable decision-support systems for decision-makers and practitioners
Dialogue Act Modeling for Automatic Tagging and Recognition of Conversational Speech
We describe a statistical approach for modeling dialogue acts in
conversational speech, i.e., speech-act-like units such as Statement, Question,
Backchannel, Agreement, Disagreement, and Apology. Our model detects and
predicts dialogue acts based on lexical, collocational, and prosodic cues, as
well as on the discourse coherence of the dialogue act sequence. The dialogue
model is based on treating the discourse structure of a conversation as a
hidden Markov model and the individual dialogue acts as observations emanating
from the model states. Constraints on the likely sequence of dialogue acts are
modeled via a dialogue act n-gram. The statistical dialogue grammar is combined
with word n-grams, decision trees, and neural networks modeling the
idiosyncratic lexical and prosodic manifestations of each dialogue act. We
develop a probabilistic integration of speech recognition with dialogue
modeling, to improve both speech recognition and dialogue act classification
accuracy. Models are trained and evaluated using a large hand-labeled database
of 1,155 conversations from the Switchboard corpus of spontaneous
human-to-human telephone speech. We achieved good dialogue act labeling
accuracy (65% based on errorful, automatically recognized words and prosody,
and 71% based on word transcripts, compared to a chance baseline accuracy of
35% and human accuracy of 84%) and a small reduction in word recognition error.Comment: 35 pages, 5 figures. Changes in copy editing (note title spelling
changed
Toward an interdisciplinary theory of coordination
Includes bibliographical references (p. 37-45).Research supported by Digital Equipment Corporation. Research supported by the National Science Foundation. IRI-8805798 IRI-8903034 Research supported by the MIT International Financial Services Research Center. Research supported by General Motors/Electronic Data Systems.Thomas W. Malone, Kevin Crowston
Proceedings of Mathsport international 2017 conference
Proceedings of MathSport International 2017 Conference, held in the Botanical Garden of the University of Padua, June 26-28, 2017.
MathSport International organizes biennial conferences dedicated to all topics where mathematics and sport meet.
Topics include: performance measures, optimization of sports performance, statistics and probability models, mathematical and physical models in sports, competitive strategies, statistics and probability match outcome models, optimal tournament design and scheduling, decision support systems, analysis of rules and adjudication, econometrics in sport, analysis of sporting technologies, financial valuation in sport, e-sports (gaming), betting and sports
- âŠ