Multi-objective home health nurse routing with remote monitoring devices

Milburn, Ashlea Bennett; Spicer, Jessica

doi:10.1504/ijps.2013.059677

Cited by 14 publications

(3 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Braekers and Kovacs [2] computed the average cost of a solution where each passenger was served by one, two and three drivers, respectively, showing that a solution with two drivers can be near optimal whereas solutions with one driver are 10% costlier on average. Other approaches using soft constraints have yielded similar conclusions [22, 30]. In Feillet et al [9], drivers are assigned to routes a posteriori, so that service time consistency and driver consistency are considered as independent problems in a lexicographical way.…”

Section: Related Literaturementioning

confidence: 91%

See 1 more Smart Citation

The time‐consistent dial‐a‐ride problem

et al. 2021

View full text Add to dashboard Cite

In the context of door-to-door transportation of people with disabilities, service quality considerations such as maximum ride time and service time-consistency are critical requirements. To identify a good trade-off between these considerations and economic objectives, we define a new variant of the multi-period dial-a-ride problem called the time-consistent dial-a-ride problem. A transportation planning is supposed to be time-consistent if for each passenger, the same service time is used all along the planning horizon. However, considering the numerous variations in transportation demands over a week, designing consistent plan for all users can be too expensive. It is therefore necessary to find a compromise solution between costs and time-consistency objectives. The time-consistent dial-a-ride problem is solved using an epsilon-constraint approach to illustrate the trade-off between these two objectives. It computes an approximation of the Pareto front, using a matheuristic framework that combines a large neighbourhood search with the solution of set partitioning problems. This approach is benchmarked on time-consistent vehicle routing problem literature instances. Experiments are also conducted in the context of door-to-door transportation for people with disabilities, using real data. These experiments support managerial insights regarding the inter-relatedness of costs and quality of service.

show abstract

Section: Related Literaturementioning

confidence: 91%

“…Constraints (21) are set covering constraints for demand satisfaction. Constraints (22) enforce the number of vehicles to be less than or equal to 𝜈 at each period.…”

Section: Initializationmentioning

confidence: 99%