Vehicle Routing and Scheduling for Regular Mobile Healthcare Services

We propose our solution to a particular practical problem in the domain of vehicle routing and scheduling. The generic task is finding the best allocation of minimum number of mobile resources that can provide periodical services in remote locations. These mobile resources are based at a single central location. Specifications have been defined initially for a real-life application that is the starting point of an ongoing project. Particularly, the goal is to mitigate health problems in rural areas around a city in Romania. Medically equipped vans are programmed to start daily routes from county capital, provide a given number of examinations in townships within the county and return to the capital city in the same day. From healthcare perspective, each van is equipped with an ultrasound scanner and they are scheduled to investigate pregnant woman each trimester aiming to diagnose potential problems. The project is motivated by reports currently ranking Romania as the country with the highest infant mortality rate in European Union. Our solution was developed in two phases: first modeling of the most relevant parameters and data available for our goal and second, design and implement an algorithm that provides an optimized solution. The most important metric of a scheduling is the number of vans that are necessary to provide a given amount of examination time per township, followed by total travel time or fuel consumption, number of different routes, etc. Our solution implements two probabilistic algorithms out of which the best was chosen.