{"title":"用于重新安置应急服务车辆的辐辏网络设计","authors":"Banu Soylu , Betül Yıldırım","doi":"10.1016/j.cor.2024.106898","DOIUrl":null,"url":null,"abstract":"<div><div>Relocation involves the repositioning of idle Emergency Service (ES) vehicles among stations in order to reduce the response time. It is well-known in the literature that relocating idle vehicles provides better coverage in the network, which in turn reduces the response time to the next call. In classical emergency service networks, idle vehicles can be relocated between any two stations. This can cause long delays and increase the response times. In this study, we proposed for the first time a hub-and-spoke network to efficiently realize the relocation of idle vehicles. The proposed hub-and-spoke structure consolidates relocations among hubs, while hub-spoke relocations are implemented as needed. Such a structure helps to better organize the simultaneous movements of ES vehicles for relocation. We have developed a mathematical model to maximize the expected safely covered population. The model provides both the hub-spoke topology and the relocation plan (a compliance table), which shows the desired stations of idle vehicles depending on the system state. In the literature, the relocation plan does not show the relocation paths (movements) of the vehicles. We have presented an exact algorithm that computes the relocation paths for all possible call cases and system levels in advance. This helps the dispatcher to manage the system effectively. We performed a detailed simulation study for ES vehicles of a natural gas distributor to demonstrate the real-life suitability of the proposed system. Compared to the classical relocation network structure, the proposed system has improved the response time, relocation time, and travel time especially when the system is busy.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"174 ","pages":"Article 106898"},"PeriodicalIF":4.1000,"publicationDate":"2024-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A hub-and-spoke network design for relocating emergency service vehicles\",\"authors\":\"Banu Soylu , Betül Yıldırım\",\"doi\":\"10.1016/j.cor.2024.106898\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Relocation involves the repositioning of idle Emergency Service (ES) vehicles among stations in order to reduce the response time. It is well-known in the literature that relocating idle vehicles provides better coverage in the network, which in turn reduces the response time to the next call. In classical emergency service networks, idle vehicles can be relocated between any two stations. This can cause long delays and increase the response times. In this study, we proposed for the first time a hub-and-spoke network to efficiently realize the relocation of idle vehicles. The proposed hub-and-spoke structure consolidates relocations among hubs, while hub-spoke relocations are implemented as needed. Such a structure helps to better organize the simultaneous movements of ES vehicles for relocation. We have developed a mathematical model to maximize the expected safely covered population. The model provides both the hub-spoke topology and the relocation plan (a compliance table), which shows the desired stations of idle vehicles depending on the system state. In the literature, the relocation plan does not show the relocation paths (movements) of the vehicles. We have presented an exact algorithm that computes the relocation paths for all possible call cases and system levels in advance. This helps the dispatcher to manage the system effectively. We performed a detailed simulation study for ES vehicles of a natural gas distributor to demonstrate the real-life suitability of the proposed system. Compared to the classical relocation network structure, the proposed system has improved the response time, relocation time, and travel time especially when the system is busy.</div></div>\",\"PeriodicalId\":10542,\"journal\":{\"name\":\"Computers & Operations Research\",\"volume\":\"174 \",\"pages\":\"Article 106898\"},\"PeriodicalIF\":4.1000,\"publicationDate\":\"2024-11-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computers & Operations Research\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0305054824003708\",\"RegionNum\":2,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054824003708","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
摘要
重新定位涉及在站点之间重新定位闲置的紧急服务(ES)车辆,以缩短响应时间。众所周知,重新定位闲置车辆可提高网络的覆盖率,从而缩短对下一个呼叫的响应时间。在传统的紧急服务网络中,闲置车辆可以在任意两个站点之间重新定位。这会造成长时间的延迟,增加响应时间。在本研究中,我们首次提出了一种集线器-辐条网络,以有效实现闲置车辆的重新定位。所提出的 "枢纽-辐条 "结构在枢纽之间整合搬迁,而 "枢纽-辐条 "搬迁则根据需要实施。这种结构有助于更好地组织 ES 车辆同时移动,进行重新安置。我们建立了一个数学模型,以最大限度地提高预期安全覆盖人口。该模型提供了轮辐式拓扑结构和搬迁计划(合规表),根据系统状态显示了闲置车辆的理想站点。在文献中,搬迁计划并不显示车辆的搬迁路径(移动)。我们提出了一种精确算法,可以提前计算所有可能的呼叫情况和系统级别的重新安置路径。这有助于调度员有效地管理系统。我们对一家天然气分销商的 ES 车辆进行了详细的模拟研究,以证明所提系统在现实生活中的适用性。与传统的搬迁网络结构相比,建议的系统改善了响应时间、搬迁时间和旅行时间,尤其是在系统繁忙时。
A hub-and-spoke network design for relocating emergency service vehicles
Relocation involves the repositioning of idle Emergency Service (ES) vehicles among stations in order to reduce the response time. It is well-known in the literature that relocating idle vehicles provides better coverage in the network, which in turn reduces the response time to the next call. In classical emergency service networks, idle vehicles can be relocated between any two stations. This can cause long delays and increase the response times. In this study, we proposed for the first time a hub-and-spoke network to efficiently realize the relocation of idle vehicles. The proposed hub-and-spoke structure consolidates relocations among hubs, while hub-spoke relocations are implemented as needed. Such a structure helps to better organize the simultaneous movements of ES vehicles for relocation. We have developed a mathematical model to maximize the expected safely covered population. The model provides both the hub-spoke topology and the relocation plan (a compliance table), which shows the desired stations of idle vehicles depending on the system state. In the literature, the relocation plan does not show the relocation paths (movements) of the vehicles. We have presented an exact algorithm that computes the relocation paths for all possible call cases and system levels in advance. This helps the dispatcher to manage the system effectively. We performed a detailed simulation study for ES vehicles of a natural gas distributor to demonstrate the real-life suitability of the proposed system. Compared to the classical relocation network structure, the proposed system has improved the response time, relocation time, and travel time especially when the system is busy.
期刊介绍:
Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.