LGJan 24, 2018
Anticipating epileptic seizures through the analysis of EEG synchronization as a data classification problemPaolo Detti, Garazi Zabalo Manrique de Lara, Renato Bruni et al.
Epilepsy is a neurological disorder arising from anomalies of the electrical activity in the brain, affecting about 0.5--0.8\% of the world population. Several studies investigated the relationship between seizures and brainwave synchronization patterns, pursuing the possibility of identifying interictal, preictal, ictal and postictal states. In this work, we introduce a graph-based model of the brain interactions developed to study synchronization patterns in the electroencephalogram (EEG) signals. The aim is to develop a patient-specific approach, also for a real-time use, for the prediction of epileptic seizures' occurrences. Different synchronization measures of the EEG signals and easily computable functions able to capture in real-time the variations of EEG synchronization have been considered. Both standard and ad-hoc classification algorithms have been developed and used. Results on scalp EEG signals show that this simple and computationally viable processing is able to highlight the changes in the synchronization corresponding to the preictal state.
DMNov 16, 2016
Variable Neighborhood Search Algorithms for the multi-depot dial-a-ride problem with heterogeneous vehicles and usersPaolo Detti, Garazi Zabalo Manrique de Lara
In this work, a study on Variable Neighborhood Search algorithms for multi-depot dial-a-ride problems is presented. In dial-a-ride problems patients need to be transported from pre-specified pickup locations to pre-specified delivery locations, under different considerations. The addressed problem presents several constraints and features, such as heterogeneous vehicles, distributed in different depots, and heterogeneous patients. The aim is of minimizing the total routing cost, while respecting time-window, ride-time, capacity and route duration constraints. The objective of the study is of determining the best algorithm configuration in terms of initial solution, neighborhood and local search procedures. At this aim, two different procedures for the computation of an initial solution, six different type of neighborhoods and five local search procedures, where only intra-route changes are made, have been considered and compared. We have also evaluated an "adjusting procedure" that aims to produce feasible solutions from infeasible solutions with small constraints violations. The different VNS algorithms have been tested on instances from literature as well as on random instances arising from a real-world healthcare application.