Optimizacija rasporeda odeljenja u zdravstvenim ustanovama

Abstract

Planiranje rasporeda odeljenja u zdravstvenim ustanovama ili rekonstrukcije postojećih je kompleksan zadatak na strateškom nivou odlučivanja. Konfuzni rasporedi odeljenja mogu doprineti anksioznosti pacijenata, povećati utrošeno vreme i pređeni put pacijenata. Razvijanje kvantitativnih pristupa u rešavanju ovog problema datira od kraja sedamdesetih godina dvadesetog veka. U ovom radu predstavljen je pristup planiranju rasporeda odeljenja u okviru zdravstvene ustanove zasnovan na metodi promenljivih okolina (Variable Neighborhood Search - VNS). Predloženi pristup je testiran na skupu poznatih instanci među kojima su i dve realne instance: Univerzitetska klinika Regensburg, Nemačka i Ahmed Maher bolnica u Kairu, Egipat. Predložena heuristika pronalazi optimalna rešenja na svim instancama manjih dimenzija, dok na instancama većih dimenzija pronalazi rešenja koja su relativno bliska najboljim poznatim rešenjima iz literature.

Planning the layout of departments in hospitals or reconstructing existing ones is a complex task at the strategic decision-making level. Confusing layouts can contribute to patients' anxiety, increase the time spent in clinical procedures and total distance travelled by patients. The development of quantitative approaches in solving this problem dates back to the late seventies of the twentieth century. In this paper, we present an approach to the hospital layout based on a Variable Neighborhood Search (VNS). The proposed approach was tested on artificial and two real-world instances: University Clinic Regensburg, Germany and Ahmed Maher Hospital in Cairo, Egypt. Presented computational results show that the proposed VNS quickly reaches all optimal solutions for small-scale instances obtained by exact solver and provides quality solutions on large-scale instances that are relatively close to the best known solutions in literature.