A variable neighbourhood search algorithm for the hospital case mix planning problem
Résumé
The hospital case mix planning problem resides in the determination of a tactical plan of patients of several pathology groups so as to allocate at best available resources over the horizon. This problem can be formulated as a mixed integer program. As exact methods fail to provide the optimal solution in a reasonable time, we develop a VNS algorithm with neighbourhoods defined in terms of plan changes. Exploration is performed using two operators : period change (one patient is moved to another period) and swap (patients of two groups in two periods are exchanged).