Journal of Computer Applications ›› 2016, Vol. 36 ›› Issue (9): 2416-2421.DOI: 10.11772/j.issn.1001-9081.2016.09.2416
Previous Articles Next Articles
LI Weipeng, ZENG Jing, ZHANG Guoliang
Received:
2016-02-17
Revised:
2016-03-18
Online:
2016-09-10
Published:
2016-09-08
通讯作者:
李维鹏
作者简介:
李维鹏(1992-),男,湖北武汉人,硕士研究生,主要研究方向:最优估计、移动机器人基于视觉的同时定位与地图创建;曾静(1973-),女,四川金堂人,副教授,博士,主要研究方向:最优估计、运筹学;张国良(1970-),男,四川金堂人,教授,博士,主要研究方向:智能机器人、先进控制、组合导航。
CLC Number:
LI Weipeng, ZENG Jing, ZHANG Guoliang. Intelligent algorithm acceleration strategy for nonlinear 0-1 programming based on improved Markov neighborhood[J]. Journal of Computer Applications, 2016, 36(9): 2416-2421.
李维鹏, 曾静, 张国良. 基于改进Markov邻域的非线性0-1规划智能算法加速策略[J]. 计算机应用, 2016, 36(9): 2416-2421.
Add to citation manager EndNote|Ris|BibTeX
URL: http://www.joca.cn/EN/10.11772/j.issn.1001-9081.2016.09.2416
[1] MATSUI T, SAKAWA M, KATO K. Particle swarm optimization for nonlinear 0-1 programming problems [C]// Proceedings of the 2008 IEEE International Conference on Systems, Man and Cybernetics. Piscataway, NJ: IEEE, 2008: 168-173. [2] 梁艳春,吴春国,石小虎,等.群智能优化算法理论与应用[M].北京:科学出版社,2009:100-135.(LIANG Y C, WU C G,SHI X H, et al. Theory and Application of Swarm Intelligence Optimization Algorithms [M]. Beijing: Science Press, 2009:100-135.) [3] 李春梅,马良.非线性0-1规划问题的人工鱼群算法[J].计算机应用研究,2011,28(7):2449-2451.(LI C M, MA L. Artificial fish-swarm algorithm for nonlinear 0-1 programming problem [J]. Application Research of Computers, 2011, 28(7): 2449-2451.) [4] 刘勇,马良.非线性0-1规划的元胞蚁群算法[J].系统管理学报,2010,19(3):351-355.(LIU Y, MA L. Solving nonlinear 0-1 programming by cellular ant algorithm [J]. Journal of Systems and Management, 2010, 19(3): 351-355.) [5] 韩燕燕,马良,赵小强.非线性0-1规划问题的蜂群算法[J].数学的实践与认识,2011,41(23):147-152. (HAN Y Y, MA L, ZHAO X Q. Bees algorithm for nonlinear 0-1 programming problem [J]. Journal of Mathematics in Practice and Theory, 2011, 41(23): 147-152.) [6] 张盛意,蔡之华,占志刚.基于改进模拟退火的遗传算法求解0-1背包问题[J].微电子学与计算机,2011,28(2):61-64. (ZHANG S Y, CAI Z H, ZHAN Z G. Solving 0-1 Knapsack problem based on genetic algorithm with improved simulated annealing [J]. Microelectronics and Computer, 2011, 28(2): 61-64.) [7] 许智宏,宋勃,董建波.用蚂蚁算法和模拟退火算法解大规模TSP问题的研究[J].计算机工程与科学,2008,30(10):43-44.(XU Z, SONG B, DONG J. Research on using the ant algorithm and the simulated annealing algorithm to solve the large-scale traveling salesman problem [J]. Computer Engineering and Science, 2008, 30(10): 43-44.) [8] 管屏,朱刚,马良,等.求解0-1规划的生长竞争蚁群算法[J].计算机工程与科学,2012,34(3):128-131.(GUAN P, ZHU G, MA L, et al. A growing competitive ant algorithm for the 0-1 programming problem[J]. Computer Engineering and Science, 2012, 34(3): 128-131.) [9] 周康,覃磊,同小军,等.0-1规划问题的闭环DNA算法 [J].系统工程与电子技术,2009,31(4):947-951.(ZHOU K, QIN J, TONG X J, et al. Closed circle DNA algorithm of 0-1 planning problem [J]. Systems Engineering and Electronics, 2009, 31(4): 947-951.) [10] 李芳芳,王靖.一种基于模拟退火算法的无线传感器网络最优簇类求解方案[J].传感技术学报,2011,24(6):900-904.(LI F F, WANG J. A best clustering scheme based on simulated annealing algorithm in wireless sensor networks [J]. Chinese Journal of Sensors and Actuators, 2011, 24(6): 900-904.) |
[1] | Ying LEI, Wanbo ZHENG, Wei WEI, Yunni XIA, Xiaobo LI, Chengwu LIU, Hong XIE. Task offloading method based on probabilistic performance awareness and evolutionary game strategy in “cloud + edge” hybrid environment [J]. Journal of Computer Applications, 2021, 41(11): 3302-3308. |
[2] | Gangzhu QIAO, Rui WANG, Chaoli SUN. Improved high-dimensional many-objective evolutionary algorithm based on decomposition [J]. Journal of Computer Applications, 2021, 41(11): 3097-3103. |
[3] | Fan PING, Xiaochun TANG, Yanyu PAN, Zhanhuai LI. Scheduling strategy of irregular tasks on graphics processing unit cluster [J]. Journal of Computer Applications, 2021, 41(11): 3295-3301. |
[4] | Fumin ZOU, Sijie LUO, Zhihui CHEN, Lyuchao LIAO. Time-space distribution identification method of taxi shift based on trajectory data [J]. Journal of Computer Applications, 2021, 41(11): 3376-3384. |
[5] | . Hybrid adaptive large neighborhood search algorithm for solving time-dependent vehicle routing problem in cold chain logistics [J]. Journal of Computer Applications, 0, (): 0-0. |
[6] | . Alternately optimizing algorithm based on Brownian movement and gradient information [J]. Journal of Computer Applications, 0, (): 0-0. |
[7] | . Fault diagnosis method based on improved one-dimensional convolution and bidirectional long short-term memory neural network [J]. Journal of Computer Applications, 0, (): 0-0. |
[8] | . Yin-Yang-pair algorithm based on dynamic D-way splitting strategy and chaos perturbation [J]. Journal of Computer Applications, 0, (): 0-0. |
[9] | . Harris hawks optimization algorithm based on chemotaxis correction [J]. Journal of Computer Applications, 0, (): 0-0. |
[10] | . Influence maximization algorithm based on node coverage and structural holes [J]. Journal of Computer Applications, 0, (): 0-0. |
[11] | TANG Andi, HAN Tong, XU Dengwu, XIE lei. Chaotic elite Harris hawks optimization algorithm [J]. Journal of Computer Applications, 2021, 41(8): 2265-2272. |
[12] | LI Mengmeng, QIN Wei, LIU Yi, DIAO Xingchun. Hybrid ant colony optimization algorithm with brain storm optimization [J]. Journal of Computer Applications, 2021, 41(8): 2412-2417. |
[13] | ZHANG Wenqiang, XING Zheng, YANG Weidong. Hybrid particle swarm optimization with multi-region sampling strategy to solve multi-objective flexible job-shop scheduling problem [J]. Journal of Computer Applications, 2021, 41(8): 2249-2257. |
[14] | ZHANG Xiangfei, LU Yuming, ZHANG Pingsheng. Constrained multi-objective optimization algorithm based on coevolution [J]. Journal of Computer Applications, 2021, 41(7): 2012-2018. |
[15] | ZHANG Meng, LI Weihua. Influence maximization algorithm based on user interactive representation [J]. Journal of Computer Applications, 2021, 41(7): 1964-1969. |
Viewed | ||||||
Full text |
|
|||||
Abstract |
|
|||||