• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>BioTechnology: An Indian Journal >The application of tabu search algorithm on split delivery open vehicle routing problem
【24h】

The application of tabu search algorithm on split delivery open vehicle routing problem

机译：禁忌搜索算法在分批配送开放式车辆路径问题中的应用

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

摘要

The traditional Open Vehicle Routing Problem (OVRP) assumes that the client????s demand can not be split and the type of vehicles is the same, but in the practical logistics distribution, the type of vehicles is not exactly the same, sometimes the transportation cost can be reduced by splitting the demand of clients to make the best of the loading capacity of vehicles. This paper proposes the SplitDeliveryOpenVehicle Routing Problemwith Heterogeneous Vehicles (SDOVRPHV) presents mathematic model with the integer programming, solves the problem with Tabu search algorithm and improves the generation of initial solution and neighborhood structure in the algorithm, By experiments, the effectiveness of model is validated, and the results are compared with the traditional OVRP which indicates that the algorithm can reduce effectively the transportation cost.
机译：传统的开放式车辆路径问题（OVRP）假设客户的需求无法分割且车辆类型相同，但在实际物流配送中，车辆类型并不完全相同，有时通过分散客户的需求以充分利用车辆的装载能力，可以降低运输成本。提出了异构车辆的SplitDeliveryOpenVehicle路径问题（SDOVRPHV），提出了带有整数规划的数学模型，用Tabu搜索算法解决了该问题，并改进了初始解和邻域结构的生成，通过实验验证了模型的有效性。 ，并将结果与​​传统的OVRP进行比较，表明该算法可以有效降低运输成本。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号