Cargando…

Clustering-based iterative heuristic framework for a non-emergency patients transportation problem

INTRODUCTION: Non-emergency patient transportation (NEPT) services are particularly important nowadays due to the aging population and contagious disease outbreaks (e.g., Covid-19 and SARS). In this work, we study a NEPT problem with a case study of patient transportation services in Hong Kong. The...

Descripción completa

Detalles Bibliográficos
Autores principales: Nasir, Jamal Abdul, Kuo, Yong-Hong, Cheng, Reynold
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Elsevier Ltd. 2022
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9359798/
https://www.ncbi.nlm.nih.gov/pubmed/35966904
http://dx.doi.org/10.1016/j.jth.2022.101411
_version_ 1784764211336839168
author Nasir, Jamal Abdul
Kuo, Yong-Hong
Cheng, Reynold
author_facet Nasir, Jamal Abdul
Kuo, Yong-Hong
Cheng, Reynold
author_sort Nasir, Jamal Abdul
collection PubMed
description INTRODUCTION: Non-emergency patient transportation (NEPT) services are particularly important nowadays due to the aging population and contagious disease outbreaks (e.g., Covid-19 and SARS). In this work, we study a NEPT problem with a case study of patient transportation services in Hong Kong. The purpose of this work is to study the discomfort and inconvenience measures (e.g., waiting time and extra ride time) associated with the transportation of non-emergency patients while optimizing the operational costs and utilization of NEPT ambulances. METHODS: A mixed-integer linear programming (MILP) formulation is developed to model the NEPT problem. This MILP model contributes to the existing literature by not only including the patient inconvenience measures in the objective function but also illustrating a better trade-off among different performance measures through its specially customized formulation and real-life characteristics. CPLEX is used to find the optimal solutions for the test instances. To overcome the computational complexity of the problem, a clustering-based iterative heuristic framework is designed to solve problems of practical sizes. The proposed framework distinctively exploits the problem-specific structure of the considered NEPT problem in a novel way to enhance and improve the clustering mechanism by repeatedly updating cluster centers. RESULTS: The computational experiments on 19 realistic problem instances show the effective execution of the solution method and demonstrate the applicability of our approach. Our heuristic framework observes an optimality gap of less than 5% for all those instances where CPLEX delivered the result. The weighted objective function of the proposed model supports the analysis of different performance measures by setting different preferences for these measures. An extensive sensitivity analysis performed to observe the behavior of the MILP model shows that when operating costs are given a weightage of 0.05 in the objective function, the penalty value for user inconvenience measures is the lowest; when the weightage value for operating costs varies between 0.8 and 1.0, the penalty value for the same measures is the highest. CONCLUSIONS: This research can assist decision-makers in improving service quality by balancing operational costs and patient discomfort during transportation.
format Online
Article
Text
id pubmed-9359798
institution National Center for Biotechnology Information
language English
publishDate 2022
publisher Elsevier Ltd.
record_format MEDLINE/PubMed
spelling pubmed-93597982022-08-09 Clustering-based iterative heuristic framework for a non-emergency patients transportation problem Nasir, Jamal Abdul Kuo, Yong-Hong Cheng, Reynold J Transp Health Article INTRODUCTION: Non-emergency patient transportation (NEPT) services are particularly important nowadays due to the aging population and contagious disease outbreaks (e.g., Covid-19 and SARS). In this work, we study a NEPT problem with a case study of patient transportation services in Hong Kong. The purpose of this work is to study the discomfort and inconvenience measures (e.g., waiting time and extra ride time) associated with the transportation of non-emergency patients while optimizing the operational costs and utilization of NEPT ambulances. METHODS: A mixed-integer linear programming (MILP) formulation is developed to model the NEPT problem. This MILP model contributes to the existing literature by not only including the patient inconvenience measures in the objective function but also illustrating a better trade-off among different performance measures through its specially customized formulation and real-life characteristics. CPLEX is used to find the optimal solutions for the test instances. To overcome the computational complexity of the problem, a clustering-based iterative heuristic framework is designed to solve problems of practical sizes. The proposed framework distinctively exploits the problem-specific structure of the considered NEPT problem in a novel way to enhance and improve the clustering mechanism by repeatedly updating cluster centers. RESULTS: The computational experiments on 19 realistic problem instances show the effective execution of the solution method and demonstrate the applicability of our approach. Our heuristic framework observes an optimality gap of less than 5% for all those instances where CPLEX delivered the result. The weighted objective function of the proposed model supports the analysis of different performance measures by setting different preferences for these measures. An extensive sensitivity analysis performed to observe the behavior of the MILP model shows that when operating costs are given a weightage of 0.05 in the objective function, the penalty value for user inconvenience measures is the lowest; when the weightage value for operating costs varies between 0.8 and 1.0, the penalty value for the same measures is the highest. CONCLUSIONS: This research can assist decision-makers in improving service quality by balancing operational costs and patient discomfort during transportation. Elsevier Ltd. 2022-09 2022-07-05 /pmc/articles/PMC9359798/ /pubmed/35966904 http://dx.doi.org/10.1016/j.jth.2022.101411 Text en © 2022 Elsevier Ltd. All rights reserved. Since January 2020 Elsevier has created a COVID-19 resource centre with free information in English and Mandarin on the novel coronavirus COVID-19. The COVID-19 resource centre is hosted on Elsevier Connect, the company's public news and information website. Elsevier hereby grants permission to make all its COVID-19-related research that is available on the COVID-19 resource centre - including this research content - immediately available in PubMed Central and other publicly funded repositories, such as the WHO COVID database with rights for unrestricted research re-use and analyses in any form or by any means with acknowledgement of the original source. These permissions are granted for free by Elsevier for as long as the COVID-19 resource centre remains active.
spellingShingle Article
Nasir, Jamal Abdul
Kuo, Yong-Hong
Cheng, Reynold
Clustering-based iterative heuristic framework for a non-emergency patients transportation problem
title Clustering-based iterative heuristic framework for a non-emergency patients transportation problem
title_full Clustering-based iterative heuristic framework for a non-emergency patients transportation problem
title_fullStr Clustering-based iterative heuristic framework for a non-emergency patients transportation problem
title_full_unstemmed Clustering-based iterative heuristic framework for a non-emergency patients transportation problem
title_short Clustering-based iterative heuristic framework for a non-emergency patients transportation problem
title_sort clustering-based iterative heuristic framework for a non-emergency patients transportation problem
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9359798/
https://www.ncbi.nlm.nih.gov/pubmed/35966904
http://dx.doi.org/10.1016/j.jth.2022.101411
work_keys_str_mv AT nasirjamalabdul clusteringbasediterativeheuristicframeworkforanonemergencypatientstransportationproblem
AT kuoyonghong clusteringbasediterativeheuristicframeworkforanonemergencypatientstransportationproblem
AT chengreynold clusteringbasediterativeheuristicframeworkforanonemergencypatientstransportationproblem