EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
774. Multi-hospitals collaborative operating room scheduling with downstream capacity constraints
Invited abstract in session TA-29: Applications of combinatorial optimisation in industry and services I, stream Combinatorial Optimization.
Tuesday, 8:30-10:00Room: 157 (building: 208)
Authors (first author is the speaker)
1. | Yang Wang
|
School of Management, Northwestern Polytechnical University | |
2. | Daiqiang Yin
|
School of Management, Northwestern Polytechnical University | |
3. | Juanru Wang
|
Northwestern Polytechnical University | |
4. | Abraham Punnen
|
Simon Fraser University | |
5. | zhipeng Lyu
|
School of Computer Science and Technology, Huazhong University of Science and Technology |
Abstract
We investigate a new multi-hospitals collaborative operating room scheduling problem with consideration of the downstream recovery beds to make integrated decisions from tactical and operational levels. For solving this challenging problem, we propose an effective multi-operator driven iterated tabu search (MOITS) algorithm to achieve a good search balance between intensification and diversification. The greedy initial solution construction procedure employs a priority scoring rule to sequence patients to obtain a high-quality initial schedule. The multi-operator driven tabu search procedure employs four move operators to manipulate surgeries in different OR time blocks, two move operators to change recovery hospitals of the scheduled surgeries, and one move operator to change specialties of the OR time blocks. New evaluation functions are designed for the recovery beds related move operators to allow capacity violations during the search. The elite set guided adaptive perturbation procedure uses historical information from a pool of best found solutions to adjust the OR time blocks assigned to each specialty. Experimental results indicate that our proposed MOITS algorithm is capable of finding much better solutions with an order-of-magnitude time reduction than Gurobi across problems of different sizes.
Keywords
- Health Care
- Combinatorial Optimization
- Metaheuristics
Status: accepted
Back to the list of papers