Abstract
AbstractOver the last few years, the efficient design of processes in hospitals and medical facilities has received more and more attention, particularly when the improvement of the processes is aimed at relieving the workload of medical staff. To this end, we have developed a method to determine optimal allocations of intra-hospital transports to hospital transport employees. When optimizing transport plans in hospitals, there are various optimization goals to strive for. Therefore, we used a lexicographic approach to solve this multi-criteria optimization problem. To calculate optimal transport plans in a sufficiently short computation time, we have decomposed the problem at hand with the Dantzig–Wolfe reformulation and solved the resulting pricing subproblem with an enumerative column generation approach. To improve the efficiency of the column generation process, we have investigated and implemented different pruning methods, dominance rules and a column reuse mechanism for the online setting of the application at hand. In an extensive computational study, we first evaluated the efficiency of the different pruning methods before we compared our solution approach with the standard branch-and-bound column search approach, classical column generation methods and the solution of an integrated MIP model solved by a commercial solver. Finally, we present performance indicators of the transport optimization tool, which was developed from our method and is now productively used in a German hospital.
Funder
Bayerische Staatsministerium für Wirtschaft, Landesentwicklung und Energie
Friedrich-Alexander-Universität Erlangen-Nürnberg
Publisher
Springer Science and Business Media LLC
Reference30 articles.
1. Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows. Prentice Hall, Hoboken
2. Allahverdi A (2015) The third comprehensive survey on scheduling problems with setup times/costs. Eur J Oper Res 246(2):345–378
3. Baker KR, Trietsch D (2013) Principles of sequencing and scheduling. Wiley, Hoboken
4. Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MW, Vance PH (1998) Branch-and-price: column generation for solving huge integer programs. Oper Res 46(3):316–329
5. Beaudry A, Laporte G, Melo T, Nickel S (2010) Dynamic transportation of patients in hospitals. OR Spectr 32(1):77–107