| مشخصات مقاله | |
| ترجمه عنوان مقاله | رویکرد مبتنی بر سناریو برای مساله مکانیابی آمبولانس با تماس‌های ورودی تصادفی تحت خط‌مشی اعزام |
| عنوان انگلیسی مقاله | Scenario-based approach for the ambulance location problem with stochastic call arrivals under a dispatching policy |
| انتشار | مقاله سال 2018 |
| تعداد صفحات مقاله انگلیسی | 18 صفحه |
| هزینه | دانلود مقاله انگلیسی رایگان میباشد. |
| پایگاه داده | نشریه اسپرینگر |
| نوع نگارش مقاله |
مقاله پژوهشی (Research article) |
| مقاله بیس | این مقاله بیس میباشد |
| نمایه (index) | scopus – master journals – JCR |
| نوع مقاله | ISI |
| فرمت مقاله انگلیسی | |
| ایمپکت فاکتور(IF) |
2.346 در سال 2017 |
| شاخص H_index | 38 در سال 2018 |
| شاخص SJR | 1.633 در سال 2018 |
| رشته های مرتبط | مهندسی صنایع و مهندسی کامپیوتر |
| گرایش های مرتبط | مهندسی الگوریتم و محاسبات |
| نوع ارائه مقاله |
ژورنال |
| مجله / کنفرانس | مجله تولید و خدمات انعطاف پذیر – Flexible Services and Manufacturing Journal |
| دانشگاه | Department of Industrial and Systems EngineeringKAISTDaejeonRepublic of Korea |
| کلمات کلیدی | مساله مکانیابی آمبولانس، تماس‌های ورودی تصادفی، خط‌مشی (سیاست) اعزام، تجزیه بندرز منطق-محور |
| کلمات کلیدی انگلیسی | Ambulance location problem, Stochastic programming, Stochastic call arrivals, Dispatching policy, Logic-based Benders decomposition |
| شناسه دیجیتال – doi |
https://doi.org/10.1007/s10696-017-9282-x |
| کد محصول | E11603 |
| وضعیت ترجمه مقاله | ترجمه آماده این مقاله موجود نمیباشد. میتوانید از طریق دکمه پایین سفارش دهید. |
| دانلود رایگان مقاله | دانلود رایگان مقاله انگلیسی |
| سفارش ترجمه این مقاله | سفارش ترجمه این مقاله |
| بخشی از متن مقاله: |
| Abstract This paper proposes a scenario-based ambulance location model which explicitly computes the availability of ambulances with stochastic call arrivals under a dispatching policy. The model utilizes two-stage stochastic programming to represent the temporal variations in call arrivals as a set of call arrival sequences. Constraints are embedded in the model to ensure that available ambulances are assigned to incoming calls following a dispatching policy. A logic-based Benders decomposition algorithm is presented to solve the model. The advantage of using our algorithm is demonstrated by comparing its performance with those of other location models.Introduction The ambulance location problem arises because of the need to determine the best locations to base ambulances so as to minimize the time required to respond to emergency medical service (EMS) requests. The location of available ambulances is a major factor determining the response times to call arrivals. Extensive research has been performed in this regard since as early as the 1970s (Church and Velle 1974; Toregas et al. 1971). Ambulance location problems are often formulated as covering problems. A demand site is considered covered if it can be reached from an ambulance station within a specified time standard. The problem involves finding the optimal number of and locations for ambulances such that the sum of the covered demand sites is maximized. The covering problem consists of two major parts: the location set covering problem (LSCP) and the maximal covering location problem (MCLP). LSCP minimizes the number of facilities that are required to cover all demands, whereas MCLP maximizes the number of covered demands with a given number of facilities. |