首页> 外文会议>2010 International Conference of Information Science and Management Engineering >Vehicle Scheduling Problem for the Single-Depot Based on Genetic Algorithms
【24h】

Vehicle Scheduling Problem for the Single-Depot Based on Genetic Algorithms

机译:基于遗传算法的单基地车辆调度问题

获取原文

摘要

Vehicle scheduling problem is a common problem in trucking industry. Because of the existence of a large number of constraints, it is difficult to obtain the optimal solution. This issue has been an NP difficult problem. In this paper, we will both establish bi-objective vehicle scheduling model with the goal that shortest vehicle Run and least number of vehicles and solve this problem using of genetic algorithm. Practical application justify that the model and algorithm can quickly obtain the optimal solution of the problem.
机译:车辆调度问题是卡车运输行业的常见问题。由于存在大量约束,难以获得最佳解决方案。这个问题一直是一个难题问题。在本文中,我们都将建立双目标车辆调度模型,目标是最短的车辆运行和最少的车辆以及使用遗传算法来解决这个问题的目标。实际应用程序证明了模型和算法可以快速获得问题的最佳解决方案。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号