多配送中心车辆调度问题的DNA计算模型

Study on the Hierarchical Model for Multi-depot Logistic Vehicle Scheduling Problem

提出了采用聚类分析最短距离分配法将多配送中心车辆调度问题动态地分解为多个单配送中心车辆调度问题进行求解的策略,并设计了求解单配送中心车辆调度问题的DNA计算模型,实现了使用常规的生物分离方法进行最优路径的选择.

Via shortest distance attribute based cluster analysis, the multi-depot vehicle scheduling problem is broken down into multiple single-depot vehicle scheduling problems. Single-depot vehicle scheduling problems of DNA computing model is designed. DNA sequence is used to represent weight effectively ,in order to use the conventional biological separation methods to choose the optimal path.