• 主题
高级搜索  >
历史搜索 清空历史
首页> 美国政府科技报告 >New Approach for Routing Carrier Delivery Services with Urgent Demand.
【24h】

New Approach for Routing Carrier Delivery Services with Urgent Demand.

机译：紧急需求路由载波传递服务的新方法。

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

摘要

Courier delivery services deal with the problem of routing a fleet of vehicles from a depot to service a set of customers that are geographically dispersed. In many cases, in addition to a regular uncertain demand, the industry is faced with sporadic, tightly constrained, urgent requests. An example of such application is the transportation of medical specimens, where timely, efficient, and accurate delivery is crucial in providing high quality and affordable patient services. In this work we propose to develop better vehicle routing solutions that can efficiently satisfy random demand over time and rapidly adjust to satisfy these sporadic, tightly constrained, urgent requests. We formulate a multi-trip vehicle routing problem using mixed integer programming. We devise an insertion based heuristic in the first phase, and use stochastic programming with recourse for daily plans to address the uncertainty in customer occurrence. The resource action for daily plans, considers a multi-objective function that maximizes demand coverage, maximizes the quality of delivery service, and minimizes travel cost. Because of the computational difficulty for large size problems, Tabu Search has been used to find an efficient solution to the problem. Simulations have been done on randomly generated data and on a real data set provided by a leading healthcare provider in Southern California. Our approach has shown significant improvement in travel costs as well as in quality of service as measured by route similarity than existing methods.

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号