相似文献/References:
[1]廖宁 刘建勋 王俊年.DPSO算法在服务网格资源调度中的应用[J].计算机技术与发展,2009,(08):104.
LIAO Ning,LIU Jian-xun,WANG Jun-nian.Application of Discrete Particle Swarm Optimization Algorithm to Service Grid Resource Optimization Scheduling[J].,2009,(08):104.
[2]王丽红 倪志伟 高雅卓.改进的蚁群算法求解多目标车间作业调度问题[J].计算机技术与发展,2008,(10):49.
WANG Li-hong,NI Zhi-wei,GAO Ya-zhuo.An Improved Ant Colony Algorithm for Multi - Objective Job - Shop Scheduling Problem[J].,2008,(08):49.
[3]饶玉佳 程家兴 夏军 李志俊.基于佳点集的多目标遗传算法[J].计算机技术与发展,2008,(12):67.
RAO Yu-jia,CHENG jia-xing,XIA Jun,et al.Multi- Objective Optimization Genetic Algorithm Based on Good Point Set[J].,2008,(08):67.
[4]吴昊,杨佳,王会颖,等.求解人力资源分配问题的多目标和声搜索算法[J].计算机技术与发展,2013,(02):65.
WU Hao,YANG Jia,WANG Hui-ying,et al.Multi-objective Harmony Search Algorithm for Solving Human Resource Allocation Problem[J].,2013,(08):65.
[5]王越,吕光宏.改进的粒子群求解多目标优化算法[J].计算机技术与发展,2014,24(02):42.
WANG Yue,Lü Guang-hong.Modified Particle Swarm Optimization Algorithm Solving Multi-objective[J].,2014,24(08):42.
[6]殷小龙,李君,万明祥. 云环境下基于改进NSGA II的虚拟机调度算法[J].计算机技术与发展,2014,24(08):71.
YIN Xiao-long,LI Jun,WAN Ming-xiang. Virtual Machines Scheduling Algorithm Based on Improved NSGA II in Cloud Environment[J].,2014,24(08):71.
[7]刘慧慧. 一种改进的粒子群多目标优化算法研究[J].计算机技术与发展,2015,25(01):87.
LIU Hui-hui. Research on an Improved Multi-objective Optimization Algorithm of Particle Swarm[J].,2015,25(08):87.
[8]黄志川,吴蒙. 多目标优化的相控阵三维方向调制方法[J].计算机技术与发展,2016,26(11):111.
HUANG Zhi-chuan,WU Meng. Three-dimensional Direction Modulation of Phased Array Based on Multi-objective Optimization[J].,2016,26(08):111.
[9]娄艳秋[],庄毅[],顾晶晶[],等. 协同干扰环境下基于IMOABC的任务调度方法[J].计算机技术与发展,2017,27(11):46.
LOU Yan-qiu[],ZHUANG Yi[],GU Jing-jing[],et al. A Task Scheduling Method Based on IMOABC in Collaboration Interference Environment[J].,2017,27(08):46.
[10]吴超,何利文,唐澄澄,等.基于多目标遗传算法的云数据安全存储方法[J].计算机技术与发展,2018,28(11):135.[doi:10.3969/ j. issn.1673-629X.2018.11.030]
WU Chao,HE Li-wen,TANG Cheng-cheng,et al.Cloud Data Safe Placement Method Based on Multi-objective Genetic Algorithm[J].,2018,28(08):135.[doi:10.3969/ j. issn.1673-629X.2018.11.030]