国产bbaaaaa片,成年美女黄网站色视频免费,成年黄大片,а天堂中文最新一区二区三区,成人精品视频一区二区三区尤物

首頁> 外文學(xué)位 >Location-covering models: Nodal and path demand, multiple-type facilities, unavailability of servers.
【24h】

Location-covering models: Nodal and path demand, multiple-type facilities, unavailability of servers.

機(jī)譯：位置覆蓋模型：節(jié)點(diǎn)和路徑需求，多種類型的設(shè)施，服務(wù)器不可用。

獲取原文
獲取原文并翻譯 | 示例
  • 摘要
  • 著錄項(xiàng)
  • 相似文獻(xiàn)
  • 相關(guān)主題

摘要

The dissertation develops location-covering models considering nodal and path demand, multiple-type facilities, and unavailability of servers. The first part concentrates on the systems with demand originating from nodes and paths. Two models are proposed. The explicit model is a Quadratic Maximal Covering Location Problem and a greedy heuristic supported by simulated annealing is suggested for its solution. The implicit model is for the systems with network structure and a heuristic algorithm based on geometrical concepts is developed for its solution. A case study is presented to locate cellular base stations in Erie County, NY. The second part implements the explicit model to optimize aeromedical base locations in the state of New Mexico by considering crash nodes and crash paths. In addition, performance measures are provided for the existing aeromedical system of New Mexico. The third part addresses the problem of simultaneously locating ground ambulances, air ambulances and transfer points. Three types of coverage are considered; ground coverage, air coverage, or joint ground-air coverage through a transfer point. To analyze this complex coverage situation, two sets of models are developed, which are variations of Location Set Covering Problem (LSCP) and the Maximal Covering Location Problem (MCLP). A case study, which uses crash data of New Mexico, is presented to illustrate the results. The fourth part considers the unavailability of aeromedical servers due to weather and visibility conditions. Objective is to maximize total accident coverage during the planning horizon without exceeding the specified relocation cost limit. Four different solution methods are developed based on greedy heuristic, simulated annealing and dynamic programming.
機(jī)譯：本文針對(duì)節(jié)點(diǎn)和路徑需求，多種類型的設(shè)施以及服務(wù)器的不可用情況，開發(fā)了位置覆蓋模型。第一部分著重于需求源自節(jié)點(diǎn)和路徑的系統(tǒng)。提出了兩種模型。該顯式模型是一個(gè)二次最大覆蓋位置問題，并建議使用模擬退火支持的貪婪啟發(fā)式求解。隱式模型適用于具有網(wǎng)絡(luò)結(jié)構(gòu)的系統(tǒng)，并為其解決方案開發(fā)了一種基于幾何概念的啟發(fā)式算法。提出了一個(gè)案例研究來定位紐約伊利縣的蜂窩基站。第二部分實(shí)現(xiàn)了顯式模型，通過考慮碰撞節(jié)點(diǎn)和碰撞路徑來優(yōu)化新墨西哥州的航空醫(yī)學(xué)基地位置。此外，還為新墨西哥州的現(xiàn)有航空醫(yī)學(xué)系統(tǒng)提供了性能指標(biāo)。第三部分解決了同時(shí)定位地面救護(hù)車，空中救護(hù)車和中轉(zhuǎn)站的問題?？紤]了三種類型的覆蓋范圍；通過轉(zhuǎn)接點(diǎn)的地面覆蓋，空氣覆蓋或聯(lián)合地面空氣覆蓋。為了分析這種復(fù)雜的覆蓋情況，開發(fā)了兩組模型，分別是位置集覆蓋問題（LSCP）和最大覆蓋位置問題（MCLP）的變體。提出了一個(gè)案例研究，該案例使用新墨西哥州的崩潰數(shù)據(jù)來說明結(jié)果。第四部分考慮了由于天氣和能見度條件而導(dǎo)致的航空醫(yī)療服務(wù)器不可用。目標(biāo)是在不超過規(guī)定的搬遷費(fèi)用限額的情況下，最大限度地?cái)U(kuò)大規(guī)劃范圍內(nèi)的事故總數(shù)。基于貪婪啟發(fā)式，模擬退火和動(dòng)態(tài)規(guī)劃，開發(fā)了四種不同的求解方法。

著錄項(xiàng)

相似文獻(xiàn)

  • 外文文獻(xiàn)
  • 中文文獻(xiàn)
  • 專利
獲取原文

客服郵箱：kefu@zhangqiaokeyan.com

京公網(wǎng)安備：11010802029741號(hào) ICP備案號(hào)：京ICP備15016152號(hào)-6 六維聯(lián)合信息科技 (北京) 有限公司?版權(quán)所有

  • 客服微信

  • 服務(wù)號(hào)