Treffer: Reactive tabu search and mixed-integer linear programming for multi-day assignment, scheduling, and routing problems of specialised education and home-care services.

Title:
Reactive tabu search and mixed-integer linear programming for multi-day assignment, scheduling, and routing problems of specialised education and home-care services.
Authors:
Bou Saleh, Mira1,2 (AUTHOR) mirabousaleh@hotmail.com, Chariete, Abderrahim2 (AUTHOR), Schwartz, Leo2 (AUTHOR), Grunder, Olivier2 (AUTHOR), El Hassani, Amir Hajjam2 (AUTHOR)
Source:
International Journal of Production Research. Mar2025, Vol. 63 Issue 5, p1779-1802. 24p.
Database:
Business Source Premier

Weitere Informationen

In this paper, we address the Multi-Day Assignment, Scheduling, and Routing Problem for Specialized Education and Home Care Services (SEHCS-MASRP), which involves heterogeneous employees and missions, posing a complex optimisation challenge. To tackle this, we propose a novel Mixed-Integer Linear Programming (MILP) model that considers employee qualifications, service requirements, scheduling constraints, routing decisions, and multiple objectives across the planning horizon. Additionally, we develop two metaheuristic approaches: a Reactive Tabu Search (RTS) algorithm incorporating either a Probabilistic Greedy Heuristic (PGH) or a Greedy Randomized Adaptive Search Procedure (GRASP) for initial solutions and a tailored genetic algorithm (GA). The three approaches aim to minimise wasted and overtime hours, total travel distances, and the number of assignments with an unsatisfied specialty while balancing wasted hours, overtime hours, and travel distances among the employees. Gurobi uses the proposed MILP model to find the optimal solutions, which are then compared with RTS and GA results across various instance sizes based on real-life SEHCS scenarios. Experimental results demonstrate the efficiency of MILP, RTS, and GA. MILP achieves proven optimal solutions for smaller to large instances. For huge instances, RTS generates high-quality solutions within reasonable computing times, outperforming GA performance. Notably, RTS consistently finds solutions within 5% of optimality for most instances. [ABSTRACT FROM AUTHOR]

Copyright of International Journal of Production Research is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Volltext ist im Gastzugang nicht verfügbar.