首页> 外文期刊>Mathematical Theory and Modeling >Optimization of Vehicle Routine Problem of Using Saving Matrix Approach
【24h】

Optimization of Vehicle Routine Problem of Using Saving Matrix Approach

机译:运用保存矩阵法优化车辆常规问题

获取原文
           

摘要

D ominos is a company that engages in the delivering of pizza. Recently it also had to meet the high demand of domestic consumption. Transportation is the movement of pizza from one location to another so, that the good reach up into the hands of consumers. There are 12 distribution centres including one production centre in a city. Dominos want to determine the best transportation route in a city in Jaipur, It is used to determine delivery routes or paths pass by any vehicle that will distribute these items by considering consumer demand from the sub-centres. This paper discussed the vehicle routine problem using Saving matrix.
机译:D ominos是一家从事披萨交付的公司。最近,它还必须满足国内消费的高需求。运输是比萨饼从一个位置到另一个位置的移动,从而使比萨到达消费者手中。一个城市有12个配送中心,包括一个生产中心。多米诺骨牌公司希望确定斋浦尔城市最佳的运输路线,它被用来确定将通过考虑子中心的消费者需求来分发这些物品的任何车辆所经过的送货路线或路径。本文使用Saving矩阵讨论了车辆的日常问题。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号