Abstract
The rehabilitation of burn patients is essential and is intrinsically linked to conventional rehabilitation; the motivational challenges faced by burn patients in maintaining engagement with these rehabilitation programs are well known. It is understood that the use of other resources, particularly technological ones, associated with conventional rehabilitation could overcome these constraints and thereby optimize the rehabilitation program and health outcomes. The objective of this study is to synthesize the available evidence on the use of exergames in rehabilitation programs for burn patients. This systematic review was developed following the guidelines of the Joanna Briggs Institute (JBI). The search was conducted in the following databases: Medline®, CINAHL®, Sports Discus®, Cochrane®, and Scopus® during May 2025. The PRISMA Checklist Model was used to organize the information from the selected studies. Seven RCTs were included, involving a total of 236 participants. Outcomes related to the use of exergames in the rehabilitation of burn patients were identified, including increased range of motion, functionality, strength, speed of movement, improved balance, reduced fear and pain, and satisfaction with the technological resource used. It is believed that the results of this review, which confirmed the advantage of using exergames, such as Nintendo Wii, PlayStation, Xbox Kinect, or Wii Fit, to optimize the functionality of burn patients, can support clinical decision-making and encourage the integration of exergames to improve rehabilitation programs for burn patients.

Abstract
Balancing supply and demand in free-floating one-way carsharing systems is a critical operational challenge. This paper presents a novel approach that integrates a binary logit model into a mixed integer linear programming framework to optimize short-term pricing and fleet relocation. Demand modeling, based on a binary logit model, aggregates different trips under a unified utility model and improves estimation by incorporating information from similar trips. To speed up the estimation process, a categorizing approach is used, where variables such as location and time are classified into a few categories based on shared attributes. This is particularly beneficial for trips with limited observations as information gained from similar trips can be used for these trips effectively. The modeling framework adopts a dynamic structure where the binary logit model estimates demand using accumulated observations from past iterations at each decision point. This continuous learning environment allows for dynamic improvement in estimation and decision-making. At the core of the framework is a mathematical program that prescribes optimal levels of promotion and relocation. The framework then includes simulated market responses to the decisions, allowing for real-time adjustments to effectively balance supply and demand. Computational experiments demonstrate the effectiveness of the proposed approach and highlight its potential for real-world applications. The continuous learning environment, combining demand modeling and operational decisions, opens avenues for future research in transportation systems.

Abstract

Abstract
The Prisoner Transportation Problem is an NP-hard combinatorial problem and a complex variant of the Dial-a- Ride Problem. Given a set of requests for pick-up and delivery and a homogeneous fleet, it consists of assigning requests to vehicles to serve all requests, respecting the problem constraints such as route duration, capacity, ride time, time windows, multi-compartment assignment of conflicting prisoners and simultaneous services in order to optimize a given objective function. In this paper, we present anew solution framework to address this problem that leads to an efficient heuristic. A comparison with computational results from previous papers shows that the heuristic is very competitive for some classes of benchmark instances from the literature and clearly superior in the remaining cases. Finally, suggestions for future studies are presented.

Abstract
The Prisoner Transportation Problem is an NP-hard combinatorial problem and a complex variant of the Dial-a-Ride Problem. Given a set of requests for pick-up and delivery and a homogeneous fleet, it consists of assigning requests to vehicles to serve all requests, respecting the problem constraints such as route duration, capacity, ride time, time windows, multi-compartment assignment of conflicting prisoners and simultaneous services in order to optimize a given objective function. In this paper, we present a new solution framework to address this problem that leads to an efficient heuristic. A comparison with computational results from previous papers shows that the heuristic is very competitive for some classes of benchmark instances from the literature and clearly superior in the remaining cases. Finally, suggestions for future studies are presented.

Abstract
This study focuses on improving the picking processes within a Picking-by-Line (PBL) warehouse through the development of a simulation model to assess different layouts and new operational rules. Utilizing a combination of Discrete Event Simulation (DES) and Agent-Based Modeling (ABS) in AnyLogic, the simulation model was validated against real-world Key Performance Indicators (KPIs) to ensure accuracy. The study identified three primary improvement opportunities. To address these opportunities, four scenarios were tested. The results showed varying impacts on productivity, with three of the four scenarios yielding improvements in picking productivity. Pilot testing confirmed the simulation model's predictions. The findings indicate that balancing travel distance reduction with congestion management is key to increasing picking productivity. This study reaffirms the value of simulation modeling in warehouse management, providing a robust framework for free-risk testing. © 2025 Elsevier B.V., All rights reserved.