首页 | 本学科首页   官方微博 | 高级检索  
     检索      

有行驶里程限制的满载车辆调度问题
引用本文:魏航,李军,魏洁.有行驶里程限制的满载车辆调度问题[J].西南交通大学学报,2005,40(6):798-802.
作者姓名:魏航  李军  魏洁
作者单位:西南交通大学经济管理学院,四川,成都,610031
基金项目:国家自然科学基金资助项目(79700019,70271022)
摘    要:应用网络模型,对有行驶里程限制的多车场满载车辆的调度问题进行了探讨.将行驶里程限制约束转化为目标约束,建立了该约束条件下的路径选择模型;设计了基于自然数编码求解该问题的遗传算法,并用实例进行了验证.结果表明,该方法能有效地解决有行驶里程限制的满载车辆调度问题.

关 键 词:满载车辆调度问题  遗传算法  网络模型  行驶里程
文章编号:0258-2724(2005)05-0798-05
收稿时间:2004-09-15
修稿时间:2004-09-15

Vehicle Routing Problem with Full Load and Driving Distance Restriction
WEI Hang,LI Jun,WEI Jie.Vehicle Routing Problem with Full Load and Driving Distance Restriction[J].Journal of Southwest Jiaotong University,2005,40(6):798-802.
Authors:WEI Hang  LI Jun  WEI Jie
Institution:School of Economics and Management, Southwest Jiaotong University, Chengdu 610031, China
Abstract:The graph model was applied to solve the vehicle routing problem with full load (VRPFL) and a driving distance restriction.A route choice model with a driving distance restriction was set up through transforming the driving distance restriction into the objective restriction.The genetic algorithm based on decimal coding was given to solve the VRPFL with a driving distance restriction and verified through an example.The result of the example shows the validity of this method to solve the VRPFL with a driving distance restriction.
Keywords:vehicle routing problem with full load  genetic algorithm  graph model  driving distance
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号