期刊：
Applied Mechanics and Materials,2016年721:51-56 ISSN：1662-7482
作者机构：
[Lei Qin; Yaqin Li; Kang Zhou] School of mathematics and computer,Wuhan Polytechnic University;[Lei Qin; Yaqin Li; Kang Zhou] School of automation,Huazhong University of Science and Technology
会议名称：
International Conference on Vehicle, Mechanical and Electrical Engineering
会议时间：
20141129-3
会议地点：
Wuhan
会议论文集名称：
Vehicle, mechanical and electrical engineering: Selected, peer reviewed papers from the 2014 International Conference on Sustainable Energy and Advanced Materials (ICVMEE 2014), November 29-30, 2014, Wuhan, China
关键词：
Vehicle Routing Problem;Artificial Fish School Algorithm;Coding
摘要：
Vehicle Routing Problem (VRP) is one of the core issue of logistics distribution, for traditional precision algorithms and heuristic algorithms had low accuracies or easily fell into local optimal solutions, it was difficult to obtain the optimal solution. This paper proposes a heuristic artificial fish school algorithm (HAFSA) for VRP, firstly, three-dimensional particle coding method is applied to vehicle routing code, and infeasible and inadequate artificial fish coding for heuristic repair, secondly HAFSA steps are given, finally the algorithm is tested through a simulative example. The experimental results show that compared with traditional genetic algorithm (GA) and particle swarm optimization (PSO), AFSA and their extension algorithms, HAFSA has a better performance in time and space cost and convergence.
期刊：
Communications in Computer and Information Science,2016年682:204-218 ISSN：1865-0929
通讯作者：
Zhou, Kang(zhoukang_wh@163.com)
作者机构：
[Fu, Qinhong] School of Math and Computer, Wuhan Polytechnic University, Wuhan, Hubei, 430023, China;[Wu, Tingfang] Key Laboratory of Image Information Processing and Intelligent Control, School of Automation, Huazhong University of Science and Technology, Wuhan, Hubei, 430074, China;[Qi, Huaqing; Zhou, Kang] Department of Economics and Management, Wuhan Polytechnic University, Wuhan, Hubei, 430023, China
通讯机构：
[Zhou, K.] D;Department of Economics and Management, China
会议名称：
11th International Conference on Bio-inspired Computing – Theories and Applications, BIC-TA 2016
会议时间：
28 October 2016 through 30 October 2016
关键词：
Discrete ant colony optimization;Time windows;Vehicle routing problem
会议名称：
International Symposium on Computers and Informatics (ISCI)
会议时间：
JAN 17-18, 2015
会议地点：
Beijing, PEOPLES R CHINA
会议主办单位：
[Shao, Kai;Zhou, Kang;Duan, Yingying;Dong, Wenbo] Wuhan Polytech Univ, Sch Math & Comp, Wuhan 430023, Peoples R China.
会议论文集名称：
ACSR-Advances in Comptuer Science Research
关键词：
PSO;TNDBDCP;Spanning tree
摘要：
Traffic network distribution based on distribution center problem (TNDBDCP) is put forward, which can not be solved by traditional algorithms. In order to solve TNDBDCP, Particle Swarm Optimization (PSO) is put forward based on the idea of global and feasible searching. In the PSO, introducing check function ensures the feasibility of particle swarm, which is designed based on the neighborhood search method which only uses one loop program to meet the requirement of time constraint and radialized network structure; more reasonable fitness function is designed based on the relationship between spanning tree and its cotree; improvements for updating the position of particle make the current position of particle be beneficial to being close to the best position of particle in its neighborhood.
作者机构：
[Gui, Bingxiang; Zhou, Kang; Zhou, Wanlei] Wuhan Polytech Univ, Coll Math & Comp Sci, Wuhan 430040, Peoples R China.
会议名称：
4th International Conference on Materials Engineering for Advanced Technologies (ICMEAT)
会议时间：
JUN 27-28, 2015
会议地点：
London, ENGLAND
会议主办单位：
[Gui, Bingxiang;Zhou, Wanlei;Zhou, Kang] Wuhan Polytech Univ, Coll Math & Comp Sci, Wuhan 430040, Peoples R China.
会议论文集名称：
Proceedings of 4th International Conference on Materials Engineering for Advanced Technologies（ICMEAT 2015）
关键词：
Low-rate distributed denial of service attack (DDoS);Information divergence metrics;Collaborative detection algorithm;IP traceback algorithm
摘要：
A low-rate distributed denial of service（DDo S） attack has significant ability to conceal its traffic because it can be able to elude the current anomaly-based detection methods. In this paper, we present a collaborative detection algorithm using the generalised entropy metric and the information divergence metric to detect low-rate DDo S attacks by measuring the difference between legitimate traffic and attack traffic. The experimental results show that the presented algorithm can effectively detect low-rate DDo S attacks and clearly reduce the false positive rate. Furthermore, we present an IP traceback algorithm that can find all attacks as well as attackers from their own local area networks（LANs）.
通讯机构：
[Zhou, Kang] W;Wuhan Polytech Univ, Sch Math & Comp, Wuhan 430023, Peoples R China.
关键词：
Batch separation operator;Deriving element;Satisfiability problem;Selecting separation set problem;Simulation DNA algorithm;Sticker model
摘要：
This paper puts forward simulation DNA algorithm of satisfiability problem (SAT) based on sticker model. And the key operation of simulation DNA algorithm is batch separation operator. This paper rapidly reduces the calculation scale of simulation DNA algorithm by using two methods. One method is to improve batch separation operator and to simplify batch separation operator set directly by introducing Ø element and deriving element. Research on complexity of simulation DNA algorithm of SAT shows that the calculation scale of simulation DNA algorithm of SAT is determined by the calculation order of separation sets. Therefore, the other method is to put forward selecting separation set problem for the first time and to solve it. Based on less-than relation between separation sets, this paper gives heuristic algorithm for selecting separation set problem, which can minimize the scale of batch separation operator set. It is the above two methods that make simulation DNA algorithm of SAT a more rapid, practical, effective and exact algorithm of SAT. Two examples also explain the practicality and effectiveness of simulation DNA algorithm of SAT.
作者机构：
[Zhou, Kang; Ge, Shuangqi; Hu, Di; Dai, Peng] Wuhan Polytech Univ, Sch Math & Comp, Wuhan, Peoples R China.
会议名称：
8th International Conference on Intelligent Computation Technology and Automation (ICICTA)
会议时间：
JUN 14-15, 2015
会议地点：
Nanchang, PEOPLES R CHINA
会议主办单位：
[Hu, Di;Dai, Peng;Zhou, Kang;Ge, Shuangqi] Wuhan Polytech Univ, Sch Math & Comp, Wuhan, Peoples R China.
会议论文集名称：
International Conference on Intelligent Computation Technology and Automation
关键词：
Particle Swarm Optimization;Minimum spanning tree of length constraint problem;Spanning tree
摘要：
Minimum spanning tree of length constraint problem (MSTLCP) can not be solved by traditional algorithms, so improved Particle Swarm Optimization (PSO) is put forward to solve MSTLCP, based on the idea of global and feasible searching. In the improved PSO, introducing check function ensures the feasibility of particle swarm; more reasonable fitness function is designed based on the relationship between spanning tree and its cotree; improvements for updating the position of particle make the current position of particle be beneficial to being close to the best position of particle in its neighborhood. Therefore improved PSO on MSTLCP is more reasonable than traditional PSO on MSTLCP. And then by doing simulation experiment, the analysis of the change of the parameters and the analysis of the change of particle swarm scale and iteration number, we draw a conclusion that improved PSO is a practical algorithm.
作者机构：
[Zhou, Kang; Qin, Lei] Wuhan Polytech Univ, Sch Math & Comp, Wuhan 430023, Peoples R China.;[Qin, Lei] Huazhong Univ Sci & Technol, Sch Automat, Wuhan 430074, Peoples R China.
会议名称：
International Conference on Information Sciences, Machinery, Materials and Energy
会议时间：
2015-04-11
会议地点：
Chongqing
会议主办单位：
[Qin, Lei;Zhou, Kang] Wuhan Polytech Univ, Sch Math & Comp, Wuhan 430023, Peoples R China.^[Qin, Lei] Huazhong Univ Sci & Technol, Sch Automat, Wuhan 430074, Peoples R China.
会议论文集名称：
First international conference on information sciences, machinery, materials and energy: ICISMME 2015, April 11-13, 2015, Chongqing, China
关键词：
Multi-knapsack problem;Artificial Fish School Algorithm;coding
摘要：
Multi-knapsack problem (MKP) is one of the typical NP problem in optimization field, because the computing complexities of the traditional algorithms are high or they have slow convergence speeds, this paper proposes an improved artificial fish school algorithm (IAFSA) for MKP. Firstly, the integer coding was used in the input ways of knapsacks, secondly, IAFSA adopted the strategy of "random repair" to repair infeasible artificial fish coding and inadequate artificial fish coding, and the coding after taking behaviors were improved and repaired, finally, IAFSA was verified by an example. Experimental results show that the advantage of IAFSA over other AFSA algorithms mainly lies in its faster convergence speed, stronger robustness, and its convergence to the optimal solution with greater probability.
