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

首頁(yè)> 外文學(xué)位 >Advancing the Urban Parcel Delivery System Using Crowdshipping.
【24h】

Advancing the Urban Parcel Delivery System Using Crowdshipping.

機(jī)譯：推進(jìn)使用眾包的城市包裹遞送系統(tǒng)。

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

摘要

This research presents a methodological investigation on the design, modeling, and evaluation of two types of crowdsourcee-enabled urban parcel delivery systems. The first system couples the existing truck-delivery practice with the locally available crowdsourcees to minimize the cost of last mile delivery. The second system considers the delivery of parcels without the use of any intermediate relay point i.e. crowdsourcees are solely responsible for the pickup of parcels and delivering it to customers' doorsteps.;For the first system, we consider cyclists and pedestrians as crowdsourcees who are close to customers and interested in relaying parcels with a truck carrier and undertaking jobs for the last-leg parcel delivery and the first-leg parcel pickup. The crowdsourcees express their interests in doing so by submitting bids to the truck carrier. The truck carrier then selects bids and coordinates crowdsourcees' last-leg delivery (first-leg pickup) with its truck operations. The truck carrier's problem is formulated as a mixed integer non-linear program which simultaneously i) selects crowdsourcees to complete the last-leg delivery (first-leg pickup) between customers and selected points for crowdsourcee-truck relay; and ii) determines the relay points and truck routes and schedule. To solve the truck carrier problem, we first decompose the problem into a winner determination problem and a simultaneous pickup and delivery problem with soft time windows, and propose a Tabu Search based algorithm to iteratively solve the two subproblems. Numerical results show that this solution approach is able to yield close-to-optimum solutions with much less time than using off-the-shelf solvers. By adopting this new system, truck vehicle miles traveled (VMT) and total cost can be reduced compared to pure-truck delivery. The advantage of the system over pure-truck delivery is sensitive to factors such as penalty for servicing outside customers' desired time windows, truck unit operating cost, time value of crowdsourcees, and the crowdsourcee mode.;For the second system, a new mechanism design based model is proposed in which a Delivery Service Provider (DSP) solicits ordinary individuals, i.e., crowdsourcees, who walk, bike, or drive to do delivery in urban areas. As an essential part of the model, the DSP collects private information such as one's willingness-to-do-crowdshipping (WTDC) and available time window from crowdsourcees in order to assign shipments with the minimum cost. The mechanisms embedded in the crowdshipping model recognize that crowdsourcees may strategically misreport their private information to gain self-interest, and devises a joint shipment assignment-payment scheme that aligns the self-interest of the crowdsourcees with the objective of the DSP. Both static and dynamic cases are investigated. Numerical results demonstrate that the proposed mechanisms will lead to reduced shipping cost compared to the state-of-the-practice crowdshipping. A case study of North Chicago is also presented to further demonstrate the promise of the proposed mechanism to the on-demand delivery in urban areas.
機(jī)譯：這項(xiàng)研究提出了一種對(duì)兩種類型的啟用眾包的城市包裹遞送系統(tǒng)進(jìn)行設(shè)計(jì)，建模和評(píng)估的方法學(xué)調(diào)查。第一個(gè)系統(tǒng)將現(xiàn)有的卡車交付實(shí)踐與本地可用的眾包資源相結(jié)合，以最大程度地減少最后一英里的交付成本。第二個(gè)系統(tǒng)考慮了不使用任何中間中繼點(diǎn)的包裹交付，即，眾包僅負(fù)責(zé)包裹的提取并將其交付到客戶的家門口。在第一個(gè)系統(tǒng)中，我們將騎自行車的人和行人視為附近的眾包向有興趣與卡車承運(yùn)人運(yùn)送包裹并從事最后一站包裹交付和第一站包裹提取工作的客戶提供服務(wù)。眾包通過(guò)向卡車承運(yùn)人投標(biāo)來(lái)表達(dá)他們的興趣。然后，卡車承運(yùn)人選擇要價(jià)，并與卡車運(yùn)營(yíng)協(xié)調(diào)眾包的最后一站交付（第一站取貨）?？ㄜ嚦羞\(yùn)人的問(wèn)題被表述為混合整數(shù)非線性程序，該程序同時(shí)進(jìn)行：i）選擇眾包以完成客戶與眾包卡車接力點(diǎn)之間的最后一站交付（首站取貨）； ii）確定中轉(zhuǎn)站，卡車路線和時(shí)間表。為了解決卡車承運(yùn)人的問(wèn)題，我們首先將問(wèn)題分解為優(yōu)勝者確定問(wèn)題和帶有軟時(shí)間窗的同時(shí)取貨和交付問(wèn)題，然后提出一種基于禁忌搜索的算法來(lái)迭代解決這兩個(gè)子問(wèn)題。數(shù)值結(jié)果表明，這種解決方案方法能夠以比使用現(xiàn)成的求解器更少的時(shí)間生成接近最佳的解決方案。通過(guò)采用這種新系統(tǒng)，與純卡車交付相比，卡車的行駛里程（VMT）和總成本得以降低。該系統(tǒng)相對(duì)于純卡車交付的優(yōu)勢(shì)對(duì)以下因素敏感：服務(wù)于外部客戶期望的時(shí)間窗的罰款，卡車單位的運(yùn)營(yíng)成本，眾包時(shí)間價(jià)值和眾包模式等因素。第二種系統(tǒng)是一種新機(jī)制提出了一種基于設(shè)計(jì)的模型，其中，交付服務(wù)提供商（DSP）征集了普通個(gè)人，即步行，騎自行車或開(kāi)車在市區(qū)進(jìn)行交付的人群。作為該模型的重要組成部分，DSP會(huì)收集眾人的意愿（例如，WTDC的意愿）和眾包中可用的時(shí)間窗口等私人信息，以便以最低的成本分配貨件。眾包模型中嵌入的機(jī)制認(rèn)識(shí)到眾包可能會(huì)戰(zhàn)略性地誤報(bào)其私人信息以獲取自身利益，并設(shè)計(jì)了一種聯(lián)合裝運(yùn)分配付款方案，以使眾包的自身利益與DSP的目標(biāo)保持一致。靜態(tài)和動(dòng)態(tài)情況都進(jìn)行了調(diào)查。數(shù)值結(jié)果表明，與實(shí)踐中的眾包相比，擬議的機(jī)制將降低運(yùn)輸成本。還提供了北芝加哥的案例研究，以進(jìn)一步證明擬議機(jī)制對(duì)城市按需交付的承諾。

著錄項(xiàng)

  • 作者

    Kafle, Nabin.;

  • 作者單位

    University of Illinois at Chicago.;

  • 授予單位 University of Illinois at Chicago.;
  • 學(xué)科 Civil engineering.;Transportation.
  • 學(xué)位 Ph.D.
  • 年度 2017
  • 頁(yè)碼 127 p.
  • 總頁(yè)數(shù) 127
  • 原文格式 PDF
  • 正文語(yǔ)種 eng
  • 中圖分類 遙感技術(shù);
  • 關(guān)鍵詞

相似文獻(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)