Search Results (2)

The economic friction and political conflicts between some countries and regions have made multinational corporations increasingly focus on the reliability and credibility of manufacturing supply chains. In view of the impact of poor manufacturing entity reliability and service reputation on the new-era manufacturing industry, the time-varying reliability and time-varying credibility of cloud manufacturing (CMfg) services were studied from the perspective of combining nature and society. Taking time-varying reliability, time-varying credibility, composition complexity, composition synergy, execution time, and execution cost as objective functions, a new six-dimension comprehensive evaluation model of service quality was constructed. To solve the optimization problem, this study proposes an improved chaos sparrow search algorithm (ICSSA), where the Bernoulli chaotic mapping formula was introduced to improve the basic sparrow search algorithm (BSSA), and the position calculation formulas of the explorer sparrow and the scouter sparrow were enhanced. The Bernoulli chaotic operator changed the symmetry of the BSSA, increased the uncertainty and randomness of the explorer sparrow position in the new algorithm, and affected the position update and movement strategies of the follower and scouter sparrows. The asymmetric chaotic characteristic brought better global search ability and optimization performance to the ICSSA. The comprehensive performance of the service composition (SvcComp) scheme was evaluated by calculating weighted relative deviation based on six evaluation elements. The WFG and DTLZ series test functions were selected, and the inverse generation distance (IGD) index and hyper volume (HV) index were used to compare and evaluate the convergence and diversity of the ICSSA, BSSA, PSO, SGA, and NSGA-III algorithms through simulation analysis experiments. The test results indicated that the ICSSA outperforms the BSSA, PSO, SGA, and NSGA-III in the vast majority of testing issues. Finally, taking disinfection robot manufacturing tasks as an example, the effectiveness of the proposed CMfg SvcComp optimization model and the ICSSA were verified. The case study results showed that the proposed ICSSA had faster convergence speed and better comprehensive performance for the CMfg SvcComp optimization problem compared with the BSSA, PSO, SGA, and NSGA-III. Full article

This paper investigates the Discrete Targets Search Problem, (DTSP), which aims to quickly search for discrete objects scattered in a vast symmetry region. Different from continuous function extremal value search, the discrete points search cannot make use of the properties of regular functions, such as function analytic, single/multiple extreme, and monotonicity. Thus, in this paper a new search scheme based on Lévy random distribution is investigated. In comparison with the $Traditional$$Carpet$ search or $Random$ search based on other distributions, DTSP can provide much faster search speed which is demonstrated by simulation with different scales problems for the selected scenarios. The simulations experiment proves that DTSP is faster for searching for a discrete single target or multiple targets in a wide area. It provides a new method for solving the discrete target search problem. Full article