具有反向学习能力的串车调度算法研究

为了避免串车问题，研究了多条线路不同站点间隔的车辆实时串车调度算法.基于车辆自动定位(AVL)数据的分析预测，给出了具备反向学习能力的克隆选择优化算法 (Opposition-learning Clonal Selection Algorithm, OCSA )求解避免串车的调度序列，指导车辆调度.算法中设计了反向抗体库，反向抗体库存储了种群迭代过程中多个较差抗体的信息，利用较差基因位置信息，指导部分基因链以较快速度进行反向学习，将其迅速牵引出局部最优区域.反向学习过程可迅速改善抗体的多样性，使得算法在短时间内具有较强的全局寻优能力；且局部学习的缩放因子可随迭代过程动态调整，提高了算法的求解精度.实验结果表明，基于 OCSA算法获取的调度序列与经典的调度算法相比有较好的适应性，求得的调度序列能够实时有效地降低站点串车问题.

Tandem Scheduling Algorithm on Opposition-learning

In order to avoid the tandem traffic problem, a real-time vehicle tandem scheduling algorithm with different station intervals on multiple routes is studied. Based on the data analysis and prediction of AVL data, an Opposition-learning Clonal Selection Algorithm (OCSA) with opposition-learning ability is proposed，the scheduling sequence is used to avoiding tandem traffic and guide vehicle scheduling. In the algorithm, a reverse antibody library is designed, which stores the information of several inferior antibodies during the population iteration. The location information of the inferior genes is used to guide the reverse learning, in order to pull them out of the local optimal region quickly. The opposition- learning process can rapidly improve the diversity of antibodies, so that the algorithm has a strong global optimization ability in a short time, and the scaling factor of local learning can be dynamically adjusted with the iterative process to improve the accuracy of the algorithm. The experimental results show that the scheduling sequence obtained by OCSA algorithm has better adaptability than the classical scheduling algorithm, and the scheduling sequence obtained by OCSA algorithm can effectively reduce the tandem traffic problem in real-time.