自适应多目标混合差分进化算法在联盟运输调度中的应用  

Adaptive multi-objective hybrid differential evolution algorithm in union transport scheduling

作　　者：蔡延光[1] 宋康[1] 张敏捷[1] 武鑫 

机构地区：[1]广东工业大学自动化学院,广州510006 [2]红河钢铁有限公司,云南红河661100

出　　处：《计算机应用》2010年第11期2887-2890,共4页journal of Computer Applications

基　　金：广东省自然科学基金资助项目(8351009001000002);广东省科学技术厅项目(2007B010200070)

摘　　要：传统的单目标算法运行一次只能得到一个解,而多目标算法运行一次可以得到一个解集。文中所提算法(DEASA)通过改进差分进化策略,设计重构,调整自适应参数,并采用擂台法则构建非支配集,将模拟退火策略融入到差分进化算法当中,进一步提高了算法的性能,降低了时间复杂度,增强避免陷入局部最优的能力。通过实验验证表明,该算法能有效地解决联盟运输调度问题。The traditional single-objective algorithm can only get one solution, but the multi-objective algorithm can get a solution set after every run. The algorithm （DEASA） improved the differential evolution strategy, designed reconstruction, adjusted parameter adaptively, adopted arena＇s principle to build non-dominating set rules, and added simulated annealing strategies into the differential evolution algorithm which enhanced the ability to further improve the performance of the algorithm and reduced the time complexity to avoid falling into local optimum. The experiments show that this algorithm can effectively solve the union transport problem.

关 键 词：联盟运输调度 差分算法 模拟退火 非支配集 多目标最优化 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]