摘要：
This paper presents a two-stage multi-objective evolutionary algorithm based on classified population (TSCEA) to solve vehicle routing problem with time windows (VRPTW). It is a well-known NP-hard discrete optimization problem with three objectives: to minimize the total distance cost, to minimize the number of vehicles, and to optimize the balance of routes within a limited time. For TSCEA, there are two stages: In the first stage, a population is explored using the proposed algorithm and then classified according to the number of vehicles, we call this process population classification; In the second stage, Pareto solution set of tri-objective VRPTW is obtained by optimizing the classified population again. The advantages of classified population structure are that for the first stage, this population that the number of vehicles of each individual is in this range composed of the upper and lower bounds of vehicles can be classified as different small populations with the same number of vehicles. Due to the evolution of small population, Pareto solution set with better extensibility can be searched. For the second one, it can reduce the dimension of tri-objective function, that is, three objective functions can be reduced to two objective functions because one of them has been identified in the first stage. Moreover, to resolve the nonlinear discrete problems, the computational approach of crowding degree is modified. The paper chooses Solomon benchmark instances as testing sets and the simulated results show that TSCEA outperforms the compared algorithms in terms of quality or extension, which verified the feasibility of the algorithm in solving tri-objective VRPTW.
作者机构：
[Zou, YiLin; Zhou, Kang; Zhen, YiTing] School of Math and Computer, Wuhan Polytechnic University, Wuhan;Hubei;430023, China;[Ji, BinGe] School of Economics and Management, Wuhan Polytechnic University, Wuhan;[Wu, XiaoDong] School of Electrical and Electronic Engineering, Wuhan Polytechnic University, Wuhan
通讯机构：
[Kang Zhou] S;School of Math and Computer, Wuhan Polytechnic University, Wuhan, China
关键词：
Dichotomy method;Finite difference method;One-dimensional unsteady heat conduction;Thickness optimization of high temperature protective clothing
摘要：
Traffic network transportation optimization problem (TNTOP) has important applications in logistics distribution fields. In various disciplines, methods about the solutions-termed TNTOP can have shown promising performance from different types of detection, at different conditions. Due to the limitatioins of the calculation speed of traditonal algorithms, it is rare that a simple unmodified method provides complete techniques of tackling large-scale TNTOP. We use the term P systems to solve the above limitatioins. Specifically, it is a tissue-like P system with four cells based on particle swarm algorithm, referred to as MPSO. In this system, the modified prim algorithm and the position-updated mechanism are adopted to generate and update all particle individuals, velocity-updated mechanism and an exchange-tree strategy are adopted to balance exploration and exploitation processes. Besides, some special strategies are also added to this systems. Numerous experiments are presented to verify the performance of the MPSO. The results show that it can generate the individuals of higher quality in shorter computation time when comparing to other benchmark algorithms. These empirical results validate the effectiveness and competitiveness of our proposed algorithm in solving TNTOP in terms of both quality and speed.
期刊：
Systems Science and Control Engineering,2019年7(2):96-107 ISSN：2164-2583
通讯作者：
Kang Zhou
作者机构：
[Haocheng Fang; Kang Zhou; Yilin Zou; Weilin Deng; Xin He; Jiapeng Zhou] School of Math and Computer, Wuhan Polytechnic University, Wuhan, People’s Republic of China
通讯机构：
[Kang Zhou] S;School of Math and Computer, Wuhan Polytechnic University, Wuhan, People’s Republic of China
关键词：
Grain processing;data analysis;database;information management;system;decision support system
期刊：
Communications in Computer and Information Science,2018年 952:1-12 ISSN：1865-0929
通讯作者：
Zhou, K.
作者机构：
[Zhen Y.; Zhang Z.; Zhang H.; Jia S.; Hu L.; Yang Y.; Zhou K.] School of Math and Computer, Wuhan Polytechnic University, Wuhan, Hubei 430023, China;[Qi H.] Department of Economics and Management, Wuhan Polytechnic University, Wuhan, Hubei 430023, China
通讯机构：
[Zhou, K.] S;School of Math and Computer, China
会议名称：
13th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2018
会议时间：
2 November 2018 through 4 November 2018
会议论文集名称：
Bio-inspired Computing: Theories and Applications
关键词：
Artificial fish swarm algorithm (AFSA);Improved AFSA;VRP
通讯机构：
[Li, Junyong] W;Wuhan Polytech Univ, Sch Math & Comp Sci, Wuhan 430023, Hubei, Peoples R China.
关键词：
working while receiving a full pension;economic effects;welfare implications;OLG model
摘要：
This paper investigates the economic consequences of working while receiving a full pension (WRFP). We find that WRFP has crowding out effect on savings of working period and crowding in effect on savings of WRFP period. We show that a unique non-trivial steady-state per capita capital stock of the dynamic system exists and increasing the length of WRFP period and social security contribution rate would increase the speed of capital accumulation reaching its optimal state. The effect of WRFP on welfare gains in the long run is ambiguous and is determined by the elasticity of capital in the two-period overlapping generations (OLG) model, whereas it depends not only on the elasticity of capital but also on the length of WRFP in the three-period OLG model. On the whole, although WRFP has an incentive effect on household agents, welfare losses arisen from its negative externalities exceed welfare gains.
通讯机构：
[Zhou, Kang] W;Wuhan Polytech Univ, Dept Math & Comp Sci, Wuhan 430023, Hubei, Peoples R China.
会议名称：
10th International Symposium on Multispectral Image Processing and Pattern Recognition (MIPPR) - Remote Sensing Image Processing, Geographic Information Systems, and Other Applications
期刊：
Journal of Computers (Taiwan),2018年29(3):197-209 ISSN：1991-1599
通讯作者：
Zhou, Kang(zhoukang65@whpu.edu.cn)
作者机构：
[Jiang, Falin; Zhou, Kang; Fu, Qinhong] School of Math and Computer, Wuhan Polytechnic University, Wuhan, 430023, China;[Qi, Huaqing] Department of Economics and Management, Wuhan Polytechnic University, Wuhan, 430023, China
通讯机构：
School of Math and Computer, Wuhan Polytechnic University, Wuhan, China
期刊：
INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL,2018年13(4):574-589 ISSN：1841-9836
通讯作者：
Zhou, K.
作者机构：
[Zhou, K.; Wang, H. F.] Wuhan Polytech Univ, Dept Math & Comp, Wuhan 430023, Hubei, Peoples R China.;[Zhang, G. X.] Southwest Jiaotong Univ, Sch Elect Engn, Chengdu, Sichuan, Peoples R China.;[Zhang, G. X.] Xihua Univ, Robot Res Ctr, Chengdu, Sichuan, Peoples R China.
通讯机构：
[Zhou, K.] W;Wuhan Polytech Univ, Dept Math & Comp, Wuhan 430023, Hubei, Peoples R China.
关键词：
SN P systems;rules and weights on synapses;addition;multiplication;the greatest common divisor
摘要：
The application of spiking neural P systems with rules and weights on synapses to arithmetic operations is discussed in this paper. We design specific spiking neural P systems with rules and weights on synapses for successfully performing addition, multiplication and the greatest common divisor. This is the first attempt to discuss the application of the new variant of spiking neural P systems, spiking neural P systems with rules and weights on synapses, and especially the use of spiking neural P systems to perform the greatest common divisor. Comparing with the results reported in the literature, smaller number of neurons are required to fulfill the arithmetic operations.
期刊：
Journal of Computers (Taiwan),2018年29(1):112-131 ISSN：1991-1599
通讯作者：
Zhou, Kang(zhoukang65@whpu.edu.cn)
作者机构：
[Duan, Yingying; Tong, Xin; Zhou, Kang] School of Math and Computer, Wuhan Polytechnic University, Wuhan, 430023, China;[Zhang, Hui] School of Information and Intelligence Engineering, Ningbo City College of Vocational Technology, Ningbo, 315000, China;[Qi, Huaqing] Department of Economics and Management, Wuhan Polytechnic University, Wuhan, 430023, China
通讯机构：
School of Math and Computer, Wuhan Polytechnic University, Wuhan, China
关键词：
Improved crossover operator;Membrane computing;Time classifier;Vehicle routing problem with time window
期刊：
Communications in Computer and Information Science,2017年682:285-301 ISSN：1865-0929
通讯作者：
Zhou, Kang(zhoukang_wh@163.com)
作者机构：
[Zhang, Jun; Zhou, Kang; Dong, Wenbo] School of Math and Computer, Wuhan Polytechnic University, Wuhan, Hubei, 430023, China;[Song, Bosheng] School of Automation, Huazhong University of Science and Technology, Wuhan, Hubei, 430074, China;[He, Cheng] Key Laboratory of Image Information Processing and Intelligent Control, Huazhong University of Science and Technology, Wuhan, Hubei, 430074, China;[Qi, Huaqing] Department of Economics and Management, Wuhan Polytechnic University, Wuhan, Hubei, 430023, China
通讯机构：
[Zhou, K.] S;School of Math and Computer, China
会议名称：
11th International Conference on Bio-inspired Computing – Theories and Applications, BIC-TA 2016
会议时间：
28 October 2016 through 30 October 2016
会议论文集名称：
Bio-inspired Computing – Theories and Applications
关键词：
Cell communication rules;Discrete glowworm evolution mechanism;Multi-objective VRPTW;Pareto;Tissue P system;Variable neighborhood evolution mechanism
摘要：
Vehicle routing problem with time windows has an important practical significance, but it is NP-Hard problem. In order to solve the problem, an optimization algorithm based on P system is proposed. The encoding of glowworm’s location is considered as evolutionary object and discrete glowworm evolution mechanism and variable neighborhood evolution mechanism are used as sub-algorithms. In this paper, the motion equations and related motion rules of glowworm algorithm are improved to optimize the performance of the algorithm. Meanwhile, in order to enlarge the search area of solution space and improve the precision, the variable neighborhood evolution mechanism is redesigned. Cell communication rules are used to exchange information between cells. Moreover, this paper introduced the concept of Pareto dominance to evaluate the advantages and disadvantages of the object, as a result, this method returns not a single non-dominated solution but a set of no-dominated solutions. At last, by solving the different Solomon numerical examples and simulation results show that the algorithm is easier to jump out of local optimal both achieves very good results in the number of vehicles and distance cost, besides, generates a lot of new solutions which are different from the database. This algorithm has the features of faster convergence rate and accurate precision, and it is competitive with other heuristic or metaheuristic algorithms in the literature.
期刊：
Communications in Computer and Information Science,2017年791:194-206 ISSN：1865-0929
通讯作者：
Zhou, Kang(zhoukang65@whpu.edu.cn)
作者机构：
[Wang, Fangxiu; Zhou, Kang] School of Math and Computer, Wuhan Polytechnic University, Wuhan, China;[Qi, Huaqing] Department of Economics and Management, Wuhan Polytechnic University, Wuhan, China
通讯机构：
[Zhou, K.] S;School of Math and Computer, China
会议名称：
12th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2017
会议时间：
1 December 2017 through 3 December 2017
会议论文集名称：
Bio-inspired Computing: Theories and Applications
关键词：
Coding SN P system;Decimal system;Decoding SN P system;SN P system
摘要：
In this paper, a new SN P system is investigated in order to compute the product of any two decimal natural numbers. Firstly, an SN P system with two input neurons is constructed, which can be used to compute the product of any two binary natural numbers which have specified lengths. Secondly, the correctness of the SN P system is proved theoretically. However, the system can only be used to compute the product of any two binary natural numbers, but the product of any two decimal natural numbers often need to be computed in practical application. Therefore, it is necessary to construct a coding SN P system which converts a decimal number into a binary number and to construct a decoding SN P system which converts a binary number to a decimal number. In the end, an new SN P system is constructed to compute the product of any two decimal natural numbers. An example test shows that the SN P system can be used to compute the product of any two decimal natural numbers. Therefore, this paper provides a new method for constructing the SN P system which can compute the product of any two natural numbers.
期刊：
Communications in Computer and Information Science,2017年681:118-132 ISSN：1865-0929
通讯作者：
Zhou, Kang(Zhoukang_wh@163.com)
作者机构：
[Duan, Yingying; Qi, Huaqing; Zhou, Kang] School of Math and Computer, Wuhan Polytechnic University, Wuhan, 430023, China;[Duan, Yingying; Qi, Huaqing; Zhou, Kang; Zhang, Zhiqiang] Key Laboratory of Image Information Processing and Intelligent Control, School of Automation, Huazhong University of Science and Technology, Wuhan, 430074, China;[Zhou, Kang; Zhang, Zhiqiang] Department of Economics and Management, Wuhan Polytechnic University, Wuhan, 430023, China
通讯机构：
[Zhou, K.] S;School of Math and Computer, China
会议名称：
11th International Conference on Bio-inspired Computing – Theories and Applications, BIC-TA 2016
会议时间：
28 October 2016 through 30 October 2016
会议论文集名称：
Bio-inspired Computing – Theories and Applications
通讯机构：
[Zhou, Kang] W;Wuhan Polytech Univ, Sch Math & Comp, Wuhan, Hubei, Peoples R China.
会议名称：
International Conference on Computer Systems, Electronics and Control (ICCSEC)
会议时间：
DEC 25-27, 2017
会议地点：
Dalian, PEOPLES R CHINA
会议主办单位：
[Liu, Zhiwei;Zhou, Kang;Jiang, Falin;Zhen, Yiting] Wuhan Polytech Univ, Sch Math & Comp, Wuhan, Hubei, Peoples R China.
关键词：
Membrane computing;Tabu algorithm;VRPTW
摘要：
Membrane evolutionary algorithm is a new computational optimization algorithm based on membrane computation derivation. Its distributed and parallel characteristics have great potential to solve the bottleneck problem in optimization field, especially when solving the traditional algorithm in solving VRPTW problems of poor accuracy. In this paper, taboo search algorithm and membrane computing are combined to solve these problems.
期刊：
Communications in Computer and Information Science,2016年682:475-488 ISSN：1865-0929
通讯作者：
Zhou, Kang(zhoukangwh@163.com)
作者机构：
[Wang, Fangxiu; Zhou, Kang] School of Math and Computer, Wuhan Polytechnic University, Wuhan, 430023, China;[Song, Bosheng] School of Automation, Huazhong University of Science and Technology, Wuhan, Hubei, 430074, China;[Qi, Huaqing] Department of Economics and Management, Wuhan Polytechnic University, Wuhan, 430023, China
通讯机构：
[Zhou, K.] S;School of Math and Computer, China
会议名称：
11th International Conference on Bio-inspired Computing – Theories and Applications, BIC-TA 2016
会议时间：
28 October 2016 through 30 October 2016
关键词：
Flag sequence;Inorder traversal;Postorder traversal;Preorder traversal;Recursive algorithm
