Hierarchical structure modelling in uncertain emergency location-routing problem using combined genetic algorithm and simulated annealing
by Bijan Nahavandi; Mahdi Homayounfar; Amir Daneshvar; Mohammad Shokouhifar
International Journal of Computer Applications in Technology (IJCAT), Vol. 68, No. 2, 2022

Abstract: Emergency Location Routing Problem (ELRP) is a strategic issue in healthcare systems. In this paper, a two-objective mathematical model is presented for the ELRP. The first objective is to maximise the provided services to demand nodes, assuming proper emergency facilities' operation, while the second objective is to maximise the reliability of the facility system to respond the patient's demands even if some facilities fail to operate. To achieve this purpose, a backup system with hybrid ambulance-helicopter transportation system is developed for the situations where the primary system cannot properly serve the patients. The failure probability of the emergency facilities is analysed via robust optimisation. To solve the NP-hard ELRP problem, a balanced exploration-exploitation metaheuristic algorithm based on Genetic Algorithm (GA) and Simulated Annealing (SA), named GASA, is proposed. Research findings by comparison of the GASA simulation results with a commercial solver demonstrate the higher efficiency of the proposed method.

Online publication date: Wed, 22-Jun-2022

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com