A multi-objective search strategy to select optimal network hardening measures

2015 ◽  
Vol 1 (1) ◽  
pp. 130 ◽  
Author(s):  
Arkadeep Kundu ◽  
Soumya K. Ghosh
Author(s):  
STEFAN WIEGAND ◽  
CHRISTIAN IGEL ◽  
UWE HANDMANN

For face recognition from video streams speed and accuracy are vital aspects. The first decision whether a preprocessed image region represents a human face or not is often made by a feed-forward neural network (NN), e.g. in the Viisage-FaceFINDER® video surveillance system. We describe the optimisation of such a NN by a hybrid algorithm combining evolutionary multi-objective optimisation (EMO) and gradient-based learning. The evolved solutions perform considerably faster than an expert-designed architecture without loss of accuracy. We compare an EMO and a single objective approach, both with online search strategy adaptation. It turns out that EMO is preferable to the single objective approach in several respects.


2014 ◽  
Vol 8 (2) ◽  
pp. 203-216 ◽  
Author(s):  
Wenzhong Guo ◽  
Genggeng Liu ◽  
Guolong Chen ◽  
Shaojun Peng

2008 ◽  
Vol 2008.8 (0) ◽  
pp. 219-224
Author(s):  
Masashi NISHIOKA ◽  
Tomoyuki HIROYASU ◽  
Mitsunori MIKI ◽  
Hisatake YOKOUCHI

2012 ◽  
Vol 544 ◽  
pp. 245-250 ◽  
Author(s):  
Guo Hui Zhang

The multi objective job shop scheduling problem is well known as one of the most complex optimization problems due to its very large search space and many constraint between machines and jobs. In this paper, an evolutionary approach of the memetic algorithm is used to solve the multi objective job shop scheduling problems. Memetic algorithm is a hybrid evolutionary algorithm that combines the global search strategy and local search strategy. The objectives of minimizing makespan and mean flow time are considered while satisfying a number of hard constraints. The computational results demonstrate the proposed MA is significantly superior to the other reported approaches in the literature.


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.


Sign in / Sign up

Export Citation Format

Share Document