Multi-Objective Algorithm Based on Tissue P System for Solving Tri-objective Grain Dispatching and Transportation

Author(s):  
Zhixin He ◽  
Kang Zhou ◽  
Hang Shu ◽  
Jian Zhou ◽  
Xinyu Lyu ◽  
...  
2018 ◽  
Vol 39 ◽  
pp. 310-322 ◽  
Author(s):  
Wenbo Dong ◽  
Kang Zhou ◽  
Huaqing Qi ◽  
Cheng He ◽  
Jun Zhang

2018 ◽  
Vol 13 (3) ◽  
pp. 323-336 ◽  
Author(s):  
Naeimeh Elkhani ◽  
Ravie Chandren Muniyandi ◽  
Gexiang Zhang

Computational cost is a big challenge for almost all intelligent algorithms which are run on CPU. In this regard, our proposed kernel P system multi-objective binary particle swarm optimization feature selection and classification method should perform with an efficient time that we aimed to settle via using potentials of membrane computing in parallel processing and nondeterminism. Moreover, GPUs perform better with latency-tolerant, highly parallel and independent tasks. In this study, to meet all the potentials of a membrane-inspired model particularly parallelism and to improve the time cost, feature selection method implemented on GPU. The time cost of the proposed method on CPU, GPU and Multicore indicates a significant improvement via implementing method on GPU.


2007 ◽  
Vol 15 (5) ◽  
pp. 683-690 ◽  
Author(s):  
Liang HUANG ◽  
Lei SUN ◽  
Ning WANG ◽  
Xiaoming JIN

2018 ◽  
Vol 232 ◽  
pp. 03039
Author(s):  
Taowei Chen ◽  
Yiming Yu ◽  
Kun Zhao

Particle swarm optimization(PSO) algorithm has been widely applied in solving multi-objective optimization problems(MOPs) since it was proposed. However, PSO algorithms updated the velocity of each particle using a single search strategy, which may be difficult to obtain approximate Pareto front for complex MOPs. In this paper, inspired by the theory of P system, a multi-objective particle swarm optimization (PSO) algorithm based on the framework of membrane system(PMOPSO) is proposed to solve MOPs. According to the hierarchical structure, objects and rules of P system, the PSO approach is used in elementary membranes to execute multiple search strategy. And non-dominated sorting and crowding distance is used in skin membrane for improving speed of convergence and maintaining population diversity by evolutionary rules. Compared with other multi-objective optimization algorithm including MOPSO, dMOPSO, SMPSO, MMOPSO, MOEA/D, SPEA2, PESA2, NSGAII on a benchmark series function, the experimental results indicate that the proposed algorithm is not only feasible and effective but also have a better convergence to true Pareto front.


2007 ◽  
Vol 171 (2) ◽  
pp. 81-93 ◽  
Author(s):  
Daniel Díaz-Pernil ◽  
Miguel A. Gutiérrez-Naranjo ◽  
Mario J. Pérez-Jiménez ◽  
Agustín Riscos-Núñez

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Xiangrong Liu ◽  
Ziming Li ◽  
Juan Suo ◽  
Ying Ju ◽  
Juan Liu ◽  
...  

Tissue P system is a class of parallel and distributed model; a feature of traditional tissue P system is that the execution time of certain biological processes is very sensitive to environmental factors that might be hard to control. In this work, we construct a family of tissue P systems that works independently from the values associated with the execution times of the rules. Furthermore, we present a time-free efficient solution to multidimensional 0-1 knapsack problem by timed recognizer tissue P systems.


Sign in / Sign up

Export Citation Format

Share Document