摘要
有时间窗的车辆调度问题是一个典型的 NP-难题 ,传统求解方法往往不能令人满意 .本文将货运量约束和时间窗约束转化为目标约束 ,设计了基于自然数编码的可同时处理软、硬时间窗约束的遗传算法 ,实验分析获得了较好的结果 .
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.
出处
《系统工程学报》
CSCD
2000年第3期290-294,共5页
Journal of Systems Engineering
基金
国家自然科学基金资助项目!( 7970 0 0 19)
关键词
车辆调度
时间窗
遗传算法
汽车
行车组织
vehicle scheduling problem
non full loads
time windows
genetic algorithm
