Analysis of MCLP, Q-MALP, and MQ-MALP with Travel Time Uncertainty Using Monte Carlo Simulation

Abdul Ghani, Noraida and Ahmad, Norazura (2017) Analysis of MCLP, Q-MALP, and MQ-MALP with Travel Time Uncertainty Using Monte Carlo Simulation. Journal of Computational Engineering, 2017 (236425). pp. 1-15. ISSN 2356-7260

[img] PDF
Download (3230Kb)

    Abstract

    This paper compares the application of theMonte Carlo simulation in incorporating travel time uncertainties in ambulance location problem using three models: Maximum Covering Location Problem (MCLP), Queuing Maximum Availability Location Problem (Q-MALP), andMultiserver QueuingMaximum Availability Location Problem (MQ-MALP). A heuristic method is developed to site the ambulances.The models are applied to the 33-node problem representing Austin, Texas, and the 55-node problem. For the 33-node problem, the results showthat the servers are less spatially distributed in Q-MALP andMQ-MALPwhen the uncertainty of server availability is considered using either the independent or dependent travel time. On the other hand, for the 55-node problem, the spatial distribution of the servers obtained by locating a server to the highest hit node location is more dispersed inMCLP and Q-MALP.The implications of the new model for the ambulance services system design are discussed as well as the limitations of the modeling approach.

    Item Type: Article
    Additional Information: Article ID 2364254
    Subjects: L Education > LC Special aspects of education > LC5800-5808 Distance education.
    Divisions: Pusat Pengajian Pendidikan Jarak Jauh (School of Distance Education) > Article
    Depositing User: Mr Noorazilan Noordin
    Date Deposited: 27 Sep 2017 08:42
    Last Modified: 27 Sep 2017 08:42
    URI: http://eprints.usm.my/id/eprint/36793

    Actions (login required)

    View Item
    Share