An Evolutionary Algorithm Based on Compressed Representation for Computing Weak Structural Balance in Large-Scale Signed Networks

Author(s):  
Xingong Chang ◽  
Fei Zhang
2020 ◽  
Vol 3 (1) ◽  
Author(s):  
Omid Askarisichani ◽  
Ambuj K. Singh ◽  
Francesco Bullo ◽  
Noah E. Friedkin

AbstractThere has been longstanding interest in the evolution of positive and negative relationships among countries. An interdisciplinary field of study, Structural Balance Theory, has developed on the dynamics of such appraisal systems. However, the advancement of research in the field has been impeded by the lack of longitudinal empirical data on large-scale networks. We construct the networks of international amicable and hostile relations occurring in specific time-periods in order to study the global evolution of the network of such international appraisals. Here we present an empirical evidence on the alignment of Structural Balance Theory with the evolution of the structure of this network, and a model of the probabilistic micro-dynamics of the alterations of international appraisals during the period 1995-2018. Also remarkably, we find that the trajectory of the Frobenius norm of sequential transition probabilities, which govern the evolution of international appraisals among nations, dramatically stabilizes.


2020 ◽  
Vol 94 ◽  
pp. 106323
Author(s):  
Mingzhou Yang ◽  
Lianbo Ma ◽  
Xingwei Wang ◽  
Min Huang ◽  
Qiang He

Author(s):  
Fei Tao ◽  
Luning Bi ◽  
Ying Zuo ◽  
A. Y. C. Nee

Process planning can be an effective way to improve the energy efficiency of production processes. Aimed at reducing both energy consumption and processing time (PT), a comprehensive approach that considers feature sequencing, process selection, and physical resources allocation simultaneously is established in this paper. As the number of decision variables increase, process planning becomes a large-scale problem, and it is difficult to be addressed by simply employing a regular meta-heuristic algorithm. A cooperative co-evolutionary algorithm, which hybridizes the artificial bee colony algorithm (ABCA) and Tabu search (TS), is therefore proposed. In addition, in the proposed algorithm, a novel representation method is designed to generate feasible process plans under complex precedence. Compared with some widely used algorithms, the proposed algorithm is proven to have a good performance for handling large-scale process planning in terms of maximizing energy efficiency and production times.


2018 ◽  
Vol 503 ◽  
pp. 780-792 ◽  
Author(s):  
Haifeng Du ◽  
Xiaochen He ◽  
Jingjing Wang ◽  
Marcus W. Feldman

Sign in / Sign up

Export Citation Format

Share Document