• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>IEEE International Conference on Parallel and Distributed Systems >When Packages Ride a Bus: Towards Efficient City-Wide Package Distribution
【24h】

When Packages Ride a Bus: Towards Efficient City-Wide Package Distribution

机译：当包裹乘坐公共汽车时：走向高效的城市范围的包装分配

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The demand for package delivery services is extremely huge every day, because of the rapid development on online retailers. This leads to huge traffic congestion, resource consumption and environmental pollution (e.g. carbon emission). However, the urban public transport system offers a large amount of under-utilized capacity outside the peak hours. In this paper, we present the City-wide Package Distribution problem using Crowdsourced Public Transportation Systems (CPTS). That is, packages are delivered by carefully utilizing the considerable amount of idle capacity of the CPTS. Specifically, given a number of packages and the timetable of available CPTS trips, we optimize the package delivering scheme by determining the four identified states of any package at any time slot (waiting, riding, re-waiting and being unloaded). The delivering scheme can be modeled as an instance of the multi-commodity flow problem, and formulated by the Mixed Integer LinearProgramming techniques. We then propose an efficient heuristic solution for this NP-hard problem. Finally, our work is validated via comprehensive emulations with a real bus transportation network.
机译：由于在线零售商的快速发展，对包裹递送服务的需求非常庞大。这导致巨大的交通拥堵，资源消耗和环境污染（例如碳排放）。然而，城市公共交通系统在高峰时段内提供大量利用的能力。在本文中，我们使用众群公共交通系统（CPTS）展示了城市范围的包装分布问题。也就是说，通过仔细利用CPT的相当数量的空闲容量来提供包。具体地，给定许多包和可用CPTS旅行的时间表，我们通过在任何时隙（等待，骑行，重新等待和卸载）中确定任何包的四个识别状态来优化包传递方案。传送方案可以被建模为多商品流量问题的实例，并由混合整数线性编程技术配制。然后，我们为这个NP难题提出了一个有效的启发式解决方案。最后，我们的作品通过具有真正的总线运输网络的全面仿真进行了验证。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号