Search results

To improve the position tracking efficiency of the upper-limb rehabilitation robot for stroke hemiplegia patients, the optimization Learning rate of the membership function based on the fuzzy impedance controller of the rehabilitation robot is propose.

First, the impaired limb’s damping and stiffness parameters for evaluating its physical recovery condition are online estimated by using weighted least squares method based on recursive algorithm. Second, the fuzzy impedance control with the rule has been designed with the optimal impedance parameters. Finally, the membership function learning rate online optimization strategy based on Takagi-Sugeno (TS) fuzzy impedance model was proposed to improve the position tracking speed of fuzzy impedance control.

This method provides a solution for improving the membership function learning rate of the fuzzy impedance controller of the upper limb rehabilitation robot. Compared with traditional TS fuzzy impedance controller in position control, the improved TS fuzzy impedance controller has reduced the overshoot stability time by 0.025 s, and the position error caused by simulating the thrust interference of the impaired limb has been reduced by 8.4%. This fact is verified by simulation and test.

The TS fuzzy impedance controller based on membership function online optimization learning strategy can effectively optimize control parameters and improve the position tracking speed of upper limb rehabilitation robots. This controller improves the auxiliary rehabilitation efficiency of the upper limb rehabilitation robot and ensures the stability of auxiliary rehabilitation training.

In recent decades, the student population in dormitories has increased notably, primarily attributed to the growing number of international students. Dormitories serve as pivotal environments for student development. The coordination and compatibility among students can significantly influence their overall success. This study aims to introduce an innovative method for roommate selection and room allocation within dormitory settings.

In this study, initially, using multi-attribute decision-making methods including the Bayesian best-worst method and weighted aggregated sum product assessment, the incompatibility rate among pairs of students is calculated. Subsequently, using a linear mathematical model, roommates are selected and allocated to dormitory rooms pursuing the twin objectives of minimizing the total incompatibility rate and costs. Finally, the grasshopper optimization algorithm is applied to solve large-sized instances.

The results demonstrate the effectiveness of the proposed method in comparison to two common alternatives, i.e. random allocation and preference-based allocation. Moreover, the proposed method’s applicability extends beyond its current context, making it suitable for addressing various matching problems, including crew pairing and classmate pairing.

This novel method for roommate selection and room allocation enhances decision-making for optimal dormitory arrangements. Inspired by a real-world problem faced by the authors, this study strives to offer a robust solution to this problem.

The proposed model aims to consider the flying hours as a criterion to initiate maintenance operation. Based on this condition, aircraft must be checked before flying hours threshold is met. After receiving maintenance service, the model ignores previous flying hours and the aircraft can keep on flying until the threshold value is reached again. Moreover, the model considers aircraft age and efficiency to assign them to flights.

The aircraft maintenance routing problem (AMRP), as one of the most important problems in the aviation industry, determines the optimal route for each aircraft along with meeting maintenance requirements. This paper presents a bi-objective mixed-integer programming model for AMRP in which several criteria such as aircraft efficiency and ferrying flights are considered.

As the solution approaches, epsilon-constraint method and a non-dominated sorting genetic algorithm (NSGA-II), including a new initializing algorithm, are used. To verify the efficiency of NSGA-II, 31 test problems in different scales are solved using NSGA-II and GAMS. The results show that the optimality gap in NSGA-II is less than 0.06%. Finally, the model was solved based on real data of American Eagle Airlines extracted from Kaggle datasets.

The authors confirm that it is an original paper, has not been published elsewhere and is not currently under consideration of any other journal.

This study aims to minimize the cost and time of blood delivery in the whole blood supply chain network (BSCN) in disaster conditions. In other words, integrating all strategic, tactical and operational decisions of three levels of blood collection, processing and distribution leads to satisfying the demand at the right time.

This paper proposes an integrated BSCN in disaster conditions to consider four categories of facilities, including temporary blood collection centers, field hospitals, main blood processing centers and medical centers, to optimize demand response time appropriately. The proposed model applies the location of all permanent and emergency facilities in three levels: blood collection, processing and distribution. Other essential decisions, including multipurpose facilities, emergency transportation, inventory and allocation, were also used in the model. The LP metric method is applied to solve the proposed bi-objective mathematical model for the BSCN.

The findings show that this model clarifies its efficiency in the total cost and blood delivery time reduction, which results in a low carbon transmission of the blood supply chain.

The researchers proposed an integrated BSCN in disaster conditions to minimize the cost and time of blood delivery. They considered multipurpose capabilities for facilities (e.g. field hospitals are responsible for the three purposes of blood collection, processing and distribution), and so locating permanent and emergency facilities at three levels of blood collection, processing and distribution, support facilities, emergency transportation and traffic on the route with pollution were used to present a new model.

This paper aims to develop a multi-objective problem for scheduling the operations of trucks entering and exiting cross-docks where the number of unloaded or loaded products by trucks is fuzzy logistic. The first objective function minimizes the maximum time to receive the products. The second objective function minimizes the emission cost of trucks. Finally, the third objective function minimizes the number of trucks assigned to the entrance and exit doors.

Two steps are implemented to validate and modify the proposed model. In the first step, two random numerical examples in small dimensions were solved by GAMS software with min-max objective function as well as genetic algorithms (GA) and particle swarm optimization. In the second step, due to the increasing dimensions of the problem and computational complexity, the problem in question is part of the NP-Hard problem, and therefore multi-objective meta-heuristic algorithms are used along with validation and parameter adjustment.

Therefore, non-dominated sorting genetic algorithm (NSGA-II) and non-dominated ranking genetic algorithm (NRGA) are used to solve 30 random problems in high dimensions. Then, the algorithms were ranked using the TOPSIS method for each problem according to the results obtained from the evaluation criteria. The analysis of the results confirms the applicability of the proposed model and solution methods.

This paper proposes mathematical model of truck scheduling for a real problem, including cross-docks that play an essential role in supply chains, as they could reduce order delivery time, inventory holding costs and shipping costs. To solve the proposed multi-objective mathematical model, as the problem is NP-hard, multi-objective meta-heuristic algorithms are used along with validation and parameter adjustment. Therefore, NSGA-II and NRGA are used to solve 30 random problems in high dimensions.