In this paper, a multipopulation dynamic adaptive coevolutionary strategy is proposed for large-scale optimization problems, which can dynamically and adaptively adjust the connection between population particles according to the optimization problem characteristics. Based on analysis of the network evolution characteristics of collaborative search between particles, a dynamic adaptive evolutionary network (DAEN) model with multiple interconnection couplings is established in this algorithm. In the model, the swarm type is divided according to the judgment threshold of particle types, and the dynamic evolution of collaborative topology in the evolutionary process is adaptively completed according to the coupling connection strength between different particle types, which enhances the algorithm’s global and local searching capability and optimization accuracy. Based on that, the evolution rules of the particle swarm dynamic cooperative search network were established, the search algorithm was designed, and the adaptive coevolution between particles in different optimization environments was achieved. Simulation results revealed that the proposed algorithm exhibited a high optimization accuracy and converging rate for high-dimensional and large-scale complex optimization problems.

Many scientific and technological resources (STR) cannot meet the needs of real demand-based industrial services. To address this issue, the characteristics of scientific and technological resource services (STRS) are analyzed, and a method of the optimal combination of demand-based STR based on multi-community collaborative search is then put forward. An optimal combined evaluative system that includes various indexes, namely response time, innovation, composability, and correlation, is developed for multi-services of STR, and a hybrid optimal combined model for STR is constructed. An evaluative algorithm of multi-community collaborative search is used to study the interactions between general communities and model communities, thereby improving the adaptive ability of the algorithm to random dynamic resource services. The average convergence value C MCCS A = 0.00274 is obtained by the convergence measurement function, which exceeds other comparison algorithms. The findings of this study indicate that the proposed methods can preferably reach the maximum efficiency of demand-based STR, and new ideas and methods for implementing demand-based real industrial services for STR are provided.

Aiming at the problem of low response speed and unbalanced distribution of data resources of production process (DRPP) for the distributed workshop production environment, an optimization scheduling method of DRPP based on a multicommunity cooperative search algorithm is proposed. A heuristic data resource service scheduling framework including a load manager and dynamic scheduling engine is first built to deal with the uncertainty of data resource service response and the imbalance of resource allocation; a core scheduling optimization mathematical model with the objectives: resource service efficiency, reduced response time, and load balancing, is established. Then, a multicommunity cooperative search algorithm for the scheduling model is presented, and the mapping relationship between the particle position vector and resource allocation is established via binary coding. Thus, the optimization algorithm is mapped to discrete data space, and the multicommunity bidirectional driving evolutionary mechanism is used to realize the cooperative and interactive search between common and model community, which enhances the adaptability of the algorithm to dynamic random scheduling tasks. Finally, the effectiveness of the proposed method is verified by an example of multiprocess quality prediction service scheduling in silk production process, which provides an effective means for solving the complex scheduling problem of production process data.