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

首頁> 外文學位 >Concierge service problem for location-based services: Combined-cost and multi objective approaches.
【24h】

Concierge service problem for location-based services: Combined-cost and multi objective approaches.

機譯：基于位置的服務的禮賓服務問題：組合成本和多目標方法。

獲取原文
獲取原文并翻譯 | 示例
  • 摘要
  • 著錄項
  • 相似文獻
  • 相關主題

摘要

The Concierge Service Problem (CSP) is to guide users with a route and locations of multiple Point-of-Interests (POIs) to visit with minimum (or optimum) cost including the purchasing, stopping, and travel costs as in Location-Based Services. The largest hurdle in deploying this service model on a commercial scale is the efficiency of the solution algorithm. Because the concierge service problem is an NP-hard problem, the success of this service depends on how efficiently and accurately the solution algorithm gives responses to a user's query.;There are two cost components in this problem: monetary cost (purchasing, parking, toll etc.) and time cost spent on the road. Combined-cost approach is to use a predefined time value represented by dollar-per-hour and to find the minimum total cost. Multi-objective approach provides multiple solutions having lower cost than other feasible solutions either in a monetary cost or in a time cost.;In this research, we defined and formulated CSP for both general and simple cases, and developed exact and heuristic solution algorithms for both combined-cost and multi-objective approaches. The exact algorithms include the adaptive dynamic programming with or without multiple alternative solutions. The heuristic solution algorithms vary from the Euclidean heuristic, the modified K-th shortest path method, the single minimum cost POI method, and Genetic Algorithms. The computational performance of suggested algorithms has been evaluated for its efficiency and validated by implementing them using large size metropolitan networks; Chicago, Illinois and Seoul, Korea for various service scenarios.
機譯：禮賓服務問題（CSP）指導用戶使用多個興趣點（POI）的路線和位置以最低（或最佳）成本（包括基于位置的服務中的購買，停車和差旅費用）進行訪問。在商業(yè)規(guī)模上部署此服務模型的最大障礙是解決算法的效率。由于禮賓服務問題是NP難題，因此該服務的成功取決于解決方案算法對用戶查詢做出響應的效率和準確性。該問題有兩個成本組成部分：貨幣成本（購買，停車，收費等）和花費在路上的時間成本。組合成本方法是使用以美元每小時表示的預定義時間值，并找到最低總成本。多目標方法提供了多種解決方案，無論是在貨幣成本還是時間成本上，其解決方案的成本均低于其他可行解決方案。在本研究中，我們定義和制定了適用于一般情況和簡單情況的CSP，并開發(fā)了精確且啟發(fā)式的解決方案算法組合成本和多目標方法。確切的算法包括帶有或不帶有多個替代解決方案的自適應動態(tài)編程。啟發(fā)式求解算法不同于歐幾里得啟發(fā)式算法，改進的第K條最短路徑方法，單個最小成本POI方法以及遺傳算法。已對所建議算法的計算性能進行了效率評估，并通過使用大型城域網(wǎng)將其實現(xiàn)進行了驗證。伊利諾伊州芝加哥和韓國首爾提供各種服務方案。

著錄項

  • 作者

    Kang, Seungmo.;

  • 作者單位

    University of Illinois at Urbana-Champaign.;

  • 授予單位 University of Illinois at Urbana-Champaign.;
  • 學科 Engineering Civil.;Transportation.
  • 學位 Ph.D.
  • 年度 2008
  • 頁碼 110 p.
  • 總頁數(shù) 110
  • 原文格式 PDF
  • 正文語種 eng
  • 中圖分類 建筑科學;綜合運輸;
  • 關鍵詞

相似文獻

  • 外文文獻
  • 中文文獻
  • 專利
獲取原文

客服郵箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服務號