首页> 外文会议>International conference of logistics engineering and management;ICLEM 2010 >Application of Dijkstra-based N-Shortest-Paths Algorithm to CateringLogistics Transportation
【24h】

Application of Dijkstra-based N-Shortest-Paths Algorithm to CateringLogistics Transportation

机译:基于Dijkstra的N-最短路径算法在餐饮中的应用。物流运输

获取原文

摘要

To analyze current situation and issue of the catering logistic transportation, in order to reduce the transportation cost, these elements were considered: delivery location, destination, modes of transport, cost of petrol, toll and time. A catering transportation path model was built to acquire the optimal path by using N shortest paths algorithm.
机译:为了分析餐饮物流运输的现状和问题,为了降低运输成本,考虑了以下要素:交货地点,目的地,运输方式,汽油成本,通行费和时间。建立了餐饮运输路径模型,利用N条最短路径算法获取最优路径。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号