A Vehicle Routing Problem for Modeling Home Healthcare: a Case Study

Authors

  • Mir-Saman Pishvaee Assistant Professor, School of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran
  • Mojtaba Saghafi Nia Instructor, School of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran
  • Mona Issabakhsh MSc Student, School of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran
Abstract:

Compared to center-based hemodialysis (HD), peritoneal dialysis (PD) has many advantages among which cost effectiveness and comfort of patients are the most important ones. On the other hand the number of PD patients is so small and even decreasing worldwide due to difficulties of this mode of dialysis. Therefore to encourage dialysis patients to choose PD, health system must provide a proper set of care services proportional to special needs of these patients.Applying operations research (OR) as an efficient mathematical tool and considering the realistic assumptions such as travel time uncertainty, first a Vehicle Routing Problem model is presented to serve PD patients at home with special logistic services. Thereafter, based on the criticality of timeliness in providing healthcare service, a conservative method called robust optimization, is applied to handle time uncertainty. The corresponding results show that the proposed method at the maximum uncertainty level has less than 30% variations in results and in comparison with the deterministic model increases the costs only by 1.2%.With small variations in results,this model can handle the travel time uncertainty properly and is highly appropriate and practical to be used in a sensitive application like healthcare where timeliness is crucial.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

A HYBRID ALGORITHM FOR THE OPEN VEHICLE ROUTING PROBLEM

The open vehicle routing problem (OVRP) is a variance of the vehicle routing problem (VRP) that has a unique character which is its open path form. This means that the vehicles are not required to return to the depot after completing service. Because this problem belongs to the NP-hard problems, many metaheuristic approaches like the ant colony optimization (ACO) have been used to solve OVRP in...

full text

Proposing a Constrained-GSA for the Vehicle Routing Problem

In the past decades, vehicle routing problem (VRP) has gained considerable attention for its applications in industry, military, and transportation applications. Vehicle routing problem with simultaneous pickup and delivery is an extension of the VRP. This problem is an NP-hard problem; hence finding the best solution for this problem which is using exact method, take inappropriate time, and th...

full text

A novel heuristic algorithm for capacitated vehicle routing problem

The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...

full text

A multi-objective memetic algorithm for risk minimizing vehicle routing problem and scheduling problem

In this paper, a new approach to risk minimizing vehicle routing and scheduling problem is presented. Forwarding agents or companies have two main concerns for the collection of high-risk commodities like cash or valuable commodities between the central depot and the customers: one; because of the high value of the commodities transported, the risk of ambush and robbery are very high. Two; the ...

full text

The periodic vehicle routing problem: a case study

This paper deals with a case study which is a variant of the Periodic Vehicle Routing Problem (PVRP). As in the traditional Vehicle Routing Problem (VRP), customer locations each with a certain daily demand are given, as well as a set of capacitated vehicles. In addition, the PVRP has a horizon, say T days, and there is a frequency for each customer stating how often within this T -day period t...

full text

A green vehicle routing problem with customer satisfaction criteria

This paper develops an MILP model, named Satisfactory-Green Vehicle Routing Problem. It consists of routing a heterogeneous fleet of vehicles in order to serve a set of customers within predefined time windows. In this model in addition to the traditional objective of the VRP, both the pollution and customers’ satisfaction have been taken into account. Meanwhile, the introduced model prepares a...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 5  issue 3

pages  211- 228

publication date 2018-01-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023