首页> 外文会议>International conference on transportation engineering;ICTE 2011 >ANT COLONY ALGORITHM BASED ON VEHICLE SCHEDULING PROBLEMWITH TIME WINDOWS UNDER EMERGENCY CONDITIONS
【24h】

ANT COLONY ALGORITHM BASED ON VEHICLE SCHEDULING PROBLEMWITH TIME WINDOWS UNDER EMERGENCY CONDITIONS

机译:紧急情况下基于时间窗的车辆调度问题的蚁群算法

获取原文

摘要

Under emergency conditions, the demand for emergency supplies have time constraints, It is with great significance under conditions of the time window to study vehicle scheduling problem to reduce the loss. With time windows constraints for the distribution center vehicle scheduling problem, ant colony algorithm using the time window into the form of penalty function, be incorporated into the objective function, the established time to meet customer delivery requirements of the minimum cost of transport under the conditions of the vehicle scheduling model, solution of the model be proposed, Simulation analysis is taking with an example.
机译:在紧急情况下,对应急物资的需求具有时间约束,在时间窗条件下研究车辆调度问题以减少损失具有重要意义。具有时间窗约束的配送中心车辆调度问题,蚁群算法利用时间窗的形式将罚函数转化为惩罚函数,并纳入目标函数,建立了满足客户交付时间条件下的最低运输成本的要求针对车辆调度模型,提出了模型的求解方法,并以仿真分析为例。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号