• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Computer Technology and Media Convergence Design >Study on optimization of vehicle distribution path with time window constraint based on column generation algorithm
【24h】

Study on optimization of vehicle distribution path with time window constraint based on column generation algorithm

机译：基于列生成算法的时间窗约束的车辆分布路径优化研究

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

摘要

Vehicle path problem (VRP) is a famous research direction in optimization research. Its variants Rich-VRP combine multiple constraints to solve practical problems, which is of great significance to the logistics industry. In this paper, 50 and 100 orders are randomly set. A selection column generation algorithm is used to solve the large-scale VRP problem with a hard time window constraint. Meanwhile, 100 customers’ satisfaction with distribution service was summarized by statistical method, and the normal distribution of customer satisfaction was found. Finally, according to the results, the advantages and disadvantages of the column generation algorithm and its application value are analyzed.
机译：车辆路径问题（VRP）是优化研究中着名的研究方向。 它的变体富有-VRP结合了多种约束来解决实际问题，这对物流业具有重要意义。 在本文中，50和100订单随机设置。 选择列生成算法用于解决困难时间窗口约束的大规模VRP问题。 同时，通过统计方法总结了100名客户的满意度，并发现了客户满意度的正常分布。 最后，根据结果，分析了列生成算法及其应用值的优点和缺点。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号