Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Optimization in Health Care Restricted Dynamic Programming: A Flexible Framework for Solving Realistic VRPs
 

Summary: Optimization in Health Care
Restricted Dynamic Programming: A Flexible Framework for Solving Realistic VRPs
Maartje Zonderland
Leendert Kok
PhD-TW-ColloquiumPhD-TW-Colloquium
Thursday, December 11, 3:45PM, Citadel T300
Driven by public opinion, increased health expenditures, an ageing population, and long waiting lists,
a flood of changes in the healthcare system has been set in motion to make the Dutch hospitals more efficient.
In this project we apply techniques from Operations Research and Operations Management to improve operational processes in health care.
Transportation costs can be as much as 10% of a product selling price. Clearly, efficient vehicle routing methods are highly valuable in practice.
To cope with many real life restrictions, the traditional vehicle routing model is extended to several generalizations of the Vehicle Routing Problem (VRP).
Local search methods are very successful in solving these variants of the VRP.
A major drawback of local search methods is that they require careful tailoring for each specific variant of the VRP.
We present a flexible framework for solving VRPs based on restricted dynamic programming.
We demonstrate the flexibility of this framework by showing how it can handle a wide range of different variants of the VRP.
Using a problem-driven approach, our aim is to provide solutions for current problems at Leiden University Medical Center, which are also of interest to other hospitals.

  

Source: Al Hanbali, Ahmad - Department of Applied Mathematics, Universiteit Twente

 

Collections: Engineering