Recent developments and studies in brain-computer interface (BCI) technologies have facilitated emotion detection and classification. Many BCI studies have sought to investigate, detect, and recognize participants’ emotional affective states. The applied domains for these studies are varied, and include such fields as communication, education, entertainment, and medicine. To understand trends in electroencephalography (EEG)-based emotion recognition system research and to provide practitioners and researchers with insights into and future directions for emotion recognition systems, this study set out to review published articles on emotion detection, recognition, and classification. The study also reviews current and future trends and discusses how these trends may impact researchers and practitioners alike. We reviewed 285 articles, of which 160 were refereed journal articles that were published since the inception of affective computing research. The articles were classified based on a scheme consisting of two categories: research orientation and domains/applications. Our results show considerable growth of EEG-based emotion detection journal publications. This growth reflects an increased research interest in EEG-based emotion detection as a salient and legitimate research area. Such factors as the proliferation of wireless EEG devices, advances in computational intelligence techniques, and machine learning spurred this growth.

This paper introduces the Fleet Size and Mix Vehicle Routing Problem with Synchronized Visits (FSM-VRPS), an extension of the Vehicle Routing Problem with Synchronization (VRPS), where a mixed fleet composed of electric and conventional bikes, and passenger cars having different acquisition costs are considered. The problem consists of planning a set of different vehicle routes to serve a set of clients who may require more than one visit by different healthcare specialists, and some of these visits should be synchronized. Moreover, each client must be visited within a specified time window. In addition, the problem uses bikes to reduce Carbon Dioxide (CO₂) emission for environmentally cleaner routing operations. This problem has many real-life applications, such as the scheduling of visits for homecare givers in the healthcare sector. We present a mixed integer linear-programming formulation and develop a Multi-Start Adaptive Large Neighborhood Search with Threshold Accepting algorithm. The results showed that our algorithm is highly effective on the FSM-VRPS, as well as on the heterogeneous VRPS. We also demonstrate the advantage of adopting different types of vehicles in terms of reducing the number of vehicles and costs. The analysis of the results also indicated that the new components added to the standard Adaptive Large Neighborhood Search algorithm enhanced intensification and diversification mechanisms during the search process.

Recently, drones, have been utilized in many real-life applications including healthcare services. For example, providing medical supplies, blood samples, and vaccines to people in remote areas or during emergencies. In this study, the maximum coverage facility location problem with drones (MCFLPD) was studied. The problem is the application of drones in the context of the facility location and routing. It involves selecting the locations of drone launching centers, which maximizes patient service coverage within certain drone range constraints. In this study, a heuristic named the maximum coverage greedy randomized heuristic (MCGRH) is developed. The idea of the algorithm is to first choose some facilities to open at random from among those that can handle the most weight of the patient demands. After that, patients are assigned to the closest opened facility with the capacity to serve them. Finally, drones are assigned to patients based on the least amount of battery consumed between the patient and the facility. Extensive testing of MCGRH indicated that it ranks efficiently alongside other methods in the literature that tried to solve the MCFLPD. It was able to achieve a high coverage of patients (more than 80% on average) within a very fast processing time (less than 1 s on average).