%0 Journal Article
%T Study on VSP with different constraints based on genetic algorithm<br>基于遗传算法的不同约束条件车辆调度问题研究*
%A WANG Zhen-feng
%A WANG Xu
%A GE Xian-longa
%A <br>王振锋
%A 王旭
%A 葛显龙a
%J 计算机应用研究
%D 2010
%I 
%X This paper studied the shortest run distances of vehicle scheduling problem (VSP) with different constraints.Established the vehicle scheduling models with different constraints include driving distance, time window, full loads and non-full loads. And then designed genetic algorithm of natural number coding for vehicle scheduling models and improved the cross algorithm of it.Retained the optimal gene transmissibility as much as possible and accelerated the convergence of the algorithm.Finally,verified the model and algorithm through numerical example.
%K genetic algorithm
%K vehicle scheduling problem(VSP)
%K time window<br>遗传算法
%K 车辆调度问题
%K 时间窗
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=7403E4CC1B3BF4B19090AA99B6BD77B6&yid=140ECF96957D60B2&vid=DB817633AA4F79B9&iid=F3090AE9B60B7ED1&sid=9674A825BE6EA1E7&eid=B79AD94FEDB43E41&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=11