首页> 外文会议>IEEE Congress on Evolutionary Computation >Using multiobjective metaheuristics to solve VRP with uncertain demands
【24h】

Using multiobjective metaheuristics to solve VRP with uncertain demands

机译:使用多目标元启发法求解不确定需求的VRP

获取原文

摘要

In real life optimization problems, it is very important to have high quality solutions (optimal). But when uncertainty becomes part of the optimization problem, solutions should be optimal and robust to the uncertain environmental changes. This paper focuses on finding robust optimal solution for the vehicle routing problem with stochastic demands VRPSD. In this case when the uncertainty of the customers demands enters this problem, the classical methods of VRP can not be used to obtain optimal solutions. We need new methods with new strategies to have robust optimal solution. For that we propose two bi-objective models, depending on the multi-objective evolutionary algorithms MOEAs: IBEA, MOGA and NSGAII. We compare the robustness degree of the two models and also we compare the performance of the three MOEAs over these two models.
机译:在现实生活中的优化问题中,拥有高质量的解决方案(最优)非常重要。但是,当不确定性成为优化问题的一部分时,解决方案应该是最佳的,并且对不确定的环境变化具有鲁棒性。本文着重于为具有随机需求VRPSD的车辆路径问题寻找鲁棒的最优解决方案。在这种情况下,当客户的不确定性需求进入此问题时,经典的VRP方法将无法用于获得最佳解决方案。我们需要新的方法和新的策略来拥有可靠的最佳解决方案。为此,根据多目标进化算法MOEA,我们提出了两个双目标模型:IBEA,MOGA和NSGAII。我们比较了两个模型的鲁棒性程度,还比较了这两个模型上三个MOEA的性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号