China
Africa
Explore chapters and articles related to this topic
Modified Extremal Optimization
Published in Yong-Zai Lu, Yu-Wang Chen, Min-Rong Chen, Peng Chen, Guo-Qiang Zeng, Extremal Optimization, 2018
Yong-Zai Lu, Yu-Wang Chen, Min-Rong Chen, Peng Chen, Guo-Qiang Chen
This section presents another method called backbone-guided extremal optimization (BGEO) (Zeng et al., 2012) for the hard MAX-SAT problem. Menaï and Batouche (2006) developed a modified EO algorithm called Bose–Einstein-EO (BE-EO) to solve the MAX-SAT problem. The basic idea behind BE-EO is to sample initial configurations set based on Bose–Einstein distribution to the original τ-EO search process. The experimental results on both random and structured MAX-SAT instances demonstrate BE-EO’s superiority to more elaborate stochastic optimization methods such as SA (Hansen and Jaumard, 1990), GSAT (Selman and Kautz, 1993), WALKSAT (Selman et al., 1994), and Tabu search (Szedmak, 2001). In Zeng et al. (2011), a more generalized EO framework termed as EOSAT was proposed to solve the MAX-SAT problem. The modified algorithms, such as BE-EEO and BE-HEO, provide better performance than BE-EO. Therefore, by incorporating the backbone information into the EOSAT framework, the BGEO method proposed in the work of Zeng et al. (2012) is possible to guide the search approach to the optimal solutions, and to further improve the performance of the original EO algorithms.
Application of internet of things-based efficient security solution for industrial
Published in Production Planning & Control, 2023
Mohammed Hasan Ali, Mustafa Musa Jaber, Sura Khalil Abd, Ahmed Alkhayyat, Malik R. Q, Mohammad Hussain Ali
As calculated in Equation (4) bind variable has been discussed. At least one is deployed in this node while the Substratum is in use. The endpoint VNF routeing table is drawn up as a soft clause with the negative shape of the delay in the connection being weighted. The aim of Max-SAT, an improvement of SAT, is to complete as many conditions as possible. It is regarded as a key basic sequential management issue, as well as Max-SAT is a pure outgrowth for so many significant issues. This reduces the total latency of the chosen infrastructure path in the MaxSAT solver to a minimum As the position of is set to 0, the following soft constraint is generated for every potential substratum node which may be allocated to (near VNF neighbour in SG).