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

有时间窗的非满载车辆调度问题的遗传算法
引用本文:谢秉磊,李军,郭耀煌.有时间窗的非满载车辆调度问题的遗传算法[J].系统工程学报,2000,15(3):290-294.
作者姓名:谢秉磊  李军  郭耀煌
作者单位:西南交通大学经济管理学院,成都,610031
基金项目:国家自然科学基金资助项目!( 7970 0 0 19)
摘    要:有时间窗的车辆调度问题是一个典型的NP-难题,传统求解方法往往不能令人满意,本文将货运量约束和时间窗约束转化为目标约束,设计了基于自然数编码的可同时处理软、硬时间窗约束的遗传算法,实验分析获得了较好的结果。

关 键 词:车辆调度  时间窗  遗传算法  汽车  行车组织

Genetic algorithm for vehicle scheduling problem of non-full loads with time windows
XIE Bing-lei,LI Jun,GUO Yao-huang.Genetic algorithm for vehicle scheduling problem of non-full loads with time windows[J].Journal of Systems Engineering,2000,15(3):290-294.
Authors:XIE Bing-lei  LI Jun  GUO Yao-huang
Abstract:Because the vehicle scheduling problem of non full loads with time windows is a typical NP hard problem, traditional algorithms are not satisfactory. In this paper, while the restraints of capacity and time windows are changed into objective restraints, a genetic algorithm on decimal coding is designed, which can deal with soft and hard time windows. The excellent solutions are obtained in the application.
Keywords:vehicle scheduling problem  non  full loads  time windows  genetic algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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