Evaluating modified pairing insertion heuristics for efficient dial-a-ride problem solutions in healthcare logistics

Main Article Content

DOI

Rodolfo Eleazar Pérez Loaiza

rodolfo.pl@apizaco.tecnm.mx

https://orcid.org/0000-0002-6500-258X
Aaron Guerrero-Campanur

aaron.gc@uruapan.tecnm.mx

https://orcid.org/0000-0002-9034-045X
Edmundo Bonilla Huerta

edmundo.bh@apizaco.tecnm.mx

https://orcid.org/0009-0009-4457-1482

Abstract

A subset of the Vehicle Routing Problem (VRP), the Dial-a-Ride Problem (DARP) is concerned with the effective route planning of cars employed to pick up and deliver passengers to designated destinations. For the transportation of elderly or incapacitated patients in Apizaco, Tlaxcala, Mexico, this research suggests using DARP. We propose to tackle this problem, a mathematical programming model and an insertion heuristic as a solution method. The objective is to optimize the trip time while adhering to the problem constraints. We ran a number of trials in different settings, accounting for different model parameter values. The outcomes demonstrate notable progress, with each of the generated routes having the least trip times. For instance, in a scenario with 20 patients, increasing vehicle speed from 30 km/h to 60 km/h reduced the total travel time from 30.66 minutes to 15.11 minutes. This significant improvement underscores the computational efficiency and practical applicability of the proposed heuristic approach in patient transportation systems.

Keywords:

dial-a-ride problem, healthcare logistics, insertion heuristic, patient transportation

References

Article Details

Pérez Loaiza, R. E., Guerrero-Campanur, A., & Bonilla Huerta, E. (2025). Evaluating modified pairing insertion heuristics for efficient dial-a-ride problem solutions in healthcare logistics. Informatyka, Automatyka, Pomiary W Gospodarce I Ochronie Środowiska, 15(4), 117–123. https://doi.org/10.35784/iapgos.7277