First-order logic (FOL) reasoning, which involves sequential deduction, is pivotal for intelligent systems and serves as a valuable task for evaluating reasoning capabilities, particularly in chain-of-thought (CoT) contexts. Existing benchmarks often rely on extensive human annotation or handcrafted templates, making it difficult to achieve the necessary complexity, scalability, and diversity for robust evaluation. To address these limitations, we propose a novel framework called ProverGen that synergizes the generative strengths of Large Language Models (LLMs) with the rigor and precision of symbolic provers, enabling the creation of a scalable, diverse, and high-quality FOL reasoning dataset, ProverQA. ProverQA is also distinguished by its inclusion of accessible and logically coherent intermediate reasoning steps for each problem. Our evaluation shows that state-of-the-art LLMs struggle to solve ProverQA problems, even with CoT prompting, highlighting the dataset's challenging nature. We also finetune Llama3.1-8B-Instruct on a separate training set generated by our framework. The finetuned model demonstrates consistent improvements on both in-distribution and out-of-distribution test sets, suggesting the value of our proposed data generation framework. Code available at: \url{https://github.com/opendatalab/ProverGen}

Cloud manufacturing (CMfg) converts the traditional manufacturing system into an Internet-of-things-enabled (IoT-enabled) manufacturing system, where both manufacturing and computational tasks must be scheduled among distributed and heterogeneous resources. Deep reinforcement learning (DRL) has recently become a promising idea for task scheduling in CMfg. However, existing DRL-based methods depend heavily on problem-specific reward engineering and struggle to represent hybrid decision variables. To this end, this paper proposed the sparse-reward deep reinforcement learning (SDRL) method to solve the hybrid task scheduling problem in CMfg. First, the hybrid task scheduling model in CMfg is constructed to minimize the makespan. We reformulate the studied problem as a partially observable Markov decision process (POMDP). Then, the objective hindsight experience replay (objective HER) mechanism is proposed to alleviate the sparse reward issue, through which the scheduling policy can be effectively trained without problem-specific reward engineering. The continuous action space is defined to represent hybrid decision variables, and the implicit action-selection mapping is utilized to alleviate the boundary effect. Numerical experiments validated the effectiveness and superiority of our method compared to eleven popular scheduling algorithms including evolutionary algorithms and DRL. Compared to mainstream DRL scheduling methods, the proposed SDRL outperforms the second-best one at most by$23.6\%$regarding generalization, and a scheduling solution can be generated in$0.5$seconds.Note to Practitioners—With the intelligentization of the CMfg platform, hybrid tasks, including manufacturing and computational tasks, need to be scheduled simultaneously. However, this hybrid task scheduling problem is rarely considered by existing works. DRL exhibits many benefits in addressing scheduling problems, but the strong dependency on problem-specific reward engineering limits its application. Additionally, most DRL-based scheduling algorithms are discrete-action DRL, restricting their capacity to effectively represent hybrid decision variables. The studied problem originates from the CMfg platform, but the proposed method holds potential for broader application. The scheduling framework and the POMDP modeling can be applied to similar problems, including hybrid, manufacturing, or computational task scheduling problems. The proposed objective HER serves as a general approach to addressing challenges associated with sparse rewards, which can be extended to diverse combinatorial optimization problems aimed at optimizing an objective. We will open-source our codes to help others to apply the method to other fields.

The Industrial Internet of Things provides an opportunity for flexible and collaborative manufacturing, but introduces more risk and more communication overhead from the Internet to the industrial field. To avoid attacks from unreliable service providers and requesters, Industrial Demilitarized Zone (IDMZ) is introduced in conjunction with firewalls to provide new communication modes between edge servers and industrial devices. As the number of tasks being offloaded to the edge side increases, optimal task offloading to balance the risk and the communication overhead with limited demilitarized buffer size becomes a challenge. Therefore, this paper establishes a mathematical model for secure task offloading in the Industrial Internet-of-Things considering dense communication with different communication modes. Then, a Parallel Gbest-centric differential evolution (P-G-DE) is designed to solve this task offloading problem with a heuristic-embedded initialization strategy, a modified Gbest-centric differential evolutionary operator and a circular-rotated parallelization scheme. The experimental results verify that the proposed method is capable of providing a high-quality solution with a lower risk and a shorter execution time in seconds, compared to six state-of-the-art evolutionary algorithms.

Recently, foundation models (such as ChatGPT) have emerged with powerful learning, understanding, and generalization abilities, showcasing tremendous potential to revolutionarily promote modern industry. Despite significant advancements in various fields, existing general foundation models face challenges in industry when dealing with the data of specialized modalities, the tasks of varying-scenario with multiple processes, and the requirements of trustworthy output, which makes industrial foundation model (IFM) a necessity. This article proposes a system architecture of termed IFMsys, including model training, model adaptation, and model application. Specifically, in model training, a base model is constructed by pretraining on multimodal industrial data and fine-tuning with fundamental industrial mechanisms. In model adaptation, the base model is developed into a series of task-oriented and domain-specific IFMs through fine-tuning with representative tasks and domain knowledge. In model application, an industrial agent-centric collaboration system and a comprehensive application framework of IFM are proposed to enhance the industrial product lifecycle applications. In addition, a prototype system of the IFM, namely, MetaIndux, is delivered, with application examples presented in typical industrial tasks. Finally, future research directions and open issues of IFM are prospected. We hope this article will inspire the advancements in the theories, technologies, and applications in this emerging research field of IFM.

Complex industrial equipment plays a critical role in specific tasks within industrial edge scenarios. Predicting their health status accurately is essential to ensuring safety and reliability in the production process. However, real-world industrial edge scenarios often have limited resources and stringent real-time requirements, making it difficult to deploy high-precision deep learning models directly at the edge. To address this issue, this article proposes an efficient adaptive-gating binary neural network (ABNN). First, a trend-aware encoder (TAE) is proposed to optimize the binarization process of the input layer. Next, a learnable precision indicator (LPI) is proposed to adjust the inference precision level. Finally, an adaptive-gating convolution is proposed to improve the representational capabilities while maintaining the fitting ability without significantly increasing the computational cost. Additionally, a field-programmable gate array (FPGA) hardware accelerator is designed for the proposed network. ABNN achieves approximately a 7% improvement in accuracy and a 45% gain in efficiency compared to the baseline model.

Industrial Internet-of-things (IIoT) is considered an emerging infrastructure for enhancing manufacturing efficiency by facilitating the sharing of resources across multiple factories. With increasing requirements on customized production in IIoT, the tasks and objectives of the flexible job shop scheduling problem for different orders vary greatly, leading to repetitive algorithm adjustment and time-consuming solver invocation. To accelerate the efficiency for the production orders in different scheduling scenarios, this paper proposed a transfer optimization method based on pointer networks improved by Transformer (Trans-Ptr-Nets). A historical solution selection strategy accompanied with a historical solution dataset to retrieve solutions similar to the current scenario are established. Then, the Trans-Ptr-Nets is designed to transfer the candidate solutions to new solutions that are feasible to the target scheduling scenario. Subsequently, the new solutions are introduced as the additional new population of evolutionary algorithm to accelerate the optimization process. Experimental results conducted on four transfer scenarios show that the proposed method can realize at most 50% reduction in running time while improving the solution quality by at least 10%, compared with six typical evolutionary algorithms and three typical transfer learning networks.

Smart manufacturing has been transforming toward industrial digitalization integrated with various advanced technologies. Metaverse has been evolving as a next-generation paradigm of a digital space extended and augmented by reality. In the metaverse, users are interconnected for various virtual activities. In consideration of advanced possibilities that may be brought by the metaverse, it is envisioned that industrial metaverse should be integrated into smart manufacturing to upgrade industry for more visible, intelligent and efficient production in the future. Therefore, a conceptual model, named IMverse Model, and novel characteristics of the industrial metaverse for smart manufacturing are proposed in this article. Besides, an industrial metaverse architecture, named IMverse Architecture, is proposed involving several key enabling technologies. Typical innovative applications of the industrial metaverse throughout the whole product life cycle for smart manufacturing are presented with insights. Nonetheless, in prospect of future, the industrial metaverse still faces limitations and is far from implementation. Thus, challenges and open issues of the industrial metaverse for smart manufacturing are discussed, then outlook is provided for further research and application.

Industrial multivariate time series (MTS) is a critical view of the industrial field for people to understand the state of machines. However, due to data collection difficulty and privacy concerns, available data for building industrial intelligence and industrial large models is far from sufficient. Therefore, industrial time series data generation is of great importance. Existing research usually applies generative adversarial networks (GANs) to generate MTS. However, GANs suffer from the unstable training process due to the joint training of the generator and discriminator. This article proposes a temporal-augmented conditional adaptive diffusion model, termed Diff-MTS, for MTS generation. It aims to better handle the complex temporal dependencies and dynamics of MTS data. Specifically, a conditional adaptive maximum-mean discrepancy (Ada-MMD) method has been proposed for the controlled generation of MTS, which does not require a classifier to control the generation. It improves the condition consistency of the diffusion model. Moreover, a temporal decomposition reconstruction UNet (TDR-UNet) is established to capture complex temporal patterns and further improve the quality of the synthetic time series. Comprehensive experiments on the C-MAPSS and FEMTO datasets demonstrate that the proposed Diff-MTS performs substantially better in terms of diversity, fidelity, and utility compared with the GAN-based methods. These results show that Diff-MTS facilitates the generation of industrial data, contributing to intelligent maintenance and the construction of industrial large models.

Industrial Internet of Things enables various manufacturing processes executed in distributed production lines and flexible workshops. With different cloud–edge–device collaboration ways, interconnected manufacturing tasks and computational tasks are cooperatively completed in manufacturing cells, cloud resources, and edge resources. Large-scale decision variables and complex precedence constraints make the scheduling problem intractable. To this end, this article proposed a discretized soft actor–critic configured differential evolution algorithm to find a stable solution for the cloud–edge–device collaborative task-scheduling problem. A mathematical model is established to describe the relationship between different tasks, the variables, the main constraints in collaboration, and the scheduling targets. A decentralized partially observable Markov decision process is modeled with five neural networks and three discretized loss functions to formulate the discretized soft actor–critic policy efficiently and enable it to find the best differential evolution configurations for different scheduling cases. Experimental analysis of four cloud–edge–device scheduling instances indicates that the proposed method trained in one case is adaptable to the other three cases. In the four cases, the proposed method reduces the total objective by 30.82% and 44.35% at most compared to five deep-reinforcement-learning-based differential evolution algorithms and seven typical evolutionary algorithms, respectively.

Prediction of industrial time-series is crucial for various Industrial Internet of Things applications. Despite the high accuracy of deep learning methods for time-series prediction, the significant memory requirements of deep learning models pose a challenge for the limited computational resources of industrial edge devices. To address this issue, this work proposes BTFormer, which achieves a high compression rate while maintaining competitive performance. First, a binary adaptive attention module is proposed to mitigate the loss of attention information caused by binarization. Second, a trend information soft-link is proposed to propagate trend information between layers and improve the representation ability of the model. Finally, a distribution-guided distillation strategy is proposed to optimize the training process. The experiments demonstrate that BTFormer effectively reduces model memory usage by 31.0 times and improves computational efficiency by 32.8 times while maintaining competitive performance.

Time-series prediction plays a crucial role in the Industrial Internet of Things (IIoT) to enable intelligent process control, analysis, and management, such as complex equipment maintenance, product quality management, and dynamic process monitoring. Traditional methods face challenges in obtaining latent insights due to the growing complexity of IIoT. Recently, the latest development of deep learning provides innovative solutions for IIoT time-series prediction. In this survey, we analyze the existing deep learning-based time-series prediction methods and present the main challenges of time-series prediction in IIoT. Furthermore, we propose a framework of state-of-the-art solutions to overcome the challenges of time-series prediction in IIoT and summarize its application in practical scenarios, such as predictive maintenance, product quality prediction, and supply chain management. Finally, we conclude with comments on possible future directions for the development of time-series prediction to enable extensible knowledge mining for complex tasks in IIoT.

Large Language Models (LLMs) have achieved remarkable success in many formal language oriented tasks, such as structural data-to-text and semantic parsing.However current benchmarks mostly follow the data distribution of the pre-training data of LLMs.Therefore, a natural question rises that do LLMs really understand the structured semantics of formal languages.In this paper, we investigate this problem on a special case, converse binary relation.We introduce a new benchmark ConvRe focusing on converse relations, which contains 17 relations and 1240 triples extracted from popular knowledge graph completion datasets.Our ConvRe features two tasks, Re2Text and Text2Re, which are formulated as multi-choice question answering to evaluate LLMs' ability to determine the matching between relations and associated text.For the evaluation protocol, apart from different prompting methods, we further introduce variants to the test text and few-shot example text.We conduct experiments on three popular LLM families and have observed various scaling trends.The results suggest that LLMs often resort to shortcut learning and still face challenges on our proposed benchmark.

Industrial Internet of Things is moving toward an intelligent level with large-scale collaborative cloud and edge resources, making it possible for online supervision, fast analysis, and precise control for many manufacturing job shops. However, online processing of large-scale industrial computation brings huge communication overhead and energy consumption among cloud, edge, and end devices. To improve the performance of the cloud–edge collaboration, this article establishes a practical model of task scheduling considering two kinds of cloud–edge collaborative modes. We propose a parallel group-merge evolutionary algorithm to assign thousands of tasks in seconds. The algorithm separates tasks into weakly correlated groups and applies modified evolutionary operators to find a subsolution for each group. Then, the subsolutions are merged to form a complete solution for fine-tuning based on the cross-use of heuristics. Experimental results show that the proposed method could assign thousands of tasks to cloud servers and edge servers in seconds, reduce the overall task computing time by 36.97%, and save the overall energy by 23.71% at most.

Industrial Cyber Physical Systems can use data and information gained from across a variety of different environments to enable robots that are reconfigurable. Custom grasping is a basic operation a robot must be able to carry out for a given task, i.e., finding the best grasping point for emergent behaviors. However, environmental disturbance and limited data degrade the precision and speed of many tailored machine learning models on robot grasping detection. This paper proposes a region-based method to enable fast custom grasping through fewer RGB-D data. The grasping detection problem is simplified as a two-stage prediction problem. At the first stage, a robust grasp candidate generation strategy is proposed based on the Sobel operator. At the second stage, a region-based predictor is designed to locate the best grasping point-pair for an emergent task. The predictor is trained by a modified consistency based self-training method to realize semi-supervised learning. Experimental results show that the success rate of custom grasping of new emergent object can be increased by 3.4% on average using the proposed method. By introducing data augmentation strategies in training, the success rate is further increased by 9.2% on average. A robot is able to grasp new object with 91.5% success rate using less than 100 training samples. The number of training samples required for the proposed method is less than to 1% of which for the previous works. Note to Practitioners—This research was motivated by the problem of robot reconfigurability for various industrial automation processes and focuses mainly on the recognition of grasping point-pair of emergent object for different task. Existing approaches on robotic grasping detection are tailored to a given object and require expensive training with large amount of labeled data. This paper presents a region-based few shot learning approach that enables the robot to detect the best grasping point-pair autonomously and quickly. We show how to generate candidate point-pairs with image distortion and background disturbance. We then demonstrate how the best grasping point-pair can be located with much less training cost. Experiments suggest that this approach is feasible in robot automation for handling a class of objects. In future research, we will construct behavior learning module to enable evolving cyber-physical robotic system for more purposes.

Service composition enables the flexible and agile collaboration of multiple services to complete personalized manufacturing tasks in cloud manufacturing. Compared with traditional manufacturing mode and cloud computing, trust problems become more serious and crucial in cloud manufacturing because of the nontransparency and short-term cooperation mode. A trust evaluation method for service composition in cloud manufacturing is proposed in this article. To quantitatively calculate the trust, a trust evaluation index system is established that comprehensively considers the influencing factors in the production, transaction, and collaboration processes of cloud manufacturing services. The trust value is synthesized based on all index values using the criteria importance through intercriteria correlation method. To extract the temporal information in historical trust data, a time-aware predictive trust evaluation method based on gated recurrent unit is proposed to learn the changing pattern of trust value over time. The trust data are trained together with their timestamps to predict the trust in the scheduled transaction time. The correlation between services in service composition is modeled to mine the correlation information by association analysis. The trust of service composition depends on the trust values of all component services and the correlations between them. The experiments demonstrate the effectiveness of the proposed method through case studies and performance comparisons with other state-of-art methods.

A key step in remanufacturing is disassembly of the “core” or the returned product to be remanufactured. Disassembly sequence planning is challenging due to uncertainties in the conditions of the cores. Rust, corrosion, deformation, and missing parts may require disassembly plans to be changed and adapted frequently. Conventional industrial automation that usually serves in repetitive and structured activities may fail when it is applied to disassembly. This research investigates the flexible sequencing of robotic disassembly in the presence of failed automation operations and develops online recovery by incorporating backup actions. It starts with modeling the time and success rate of a backup action. The expected disassembly time and completion rate of a disassembly plan are deduced according to the failure probability of both the operations and their backup actions. A biobjective optimization model for robotic disassembly sequence planning is established using a dual-selection multiobjective evolutionary algorithm. Two solution selection criteria are combined to produce potential offspring candidates in each evolutionary generation. Experimental results show that the backup actions allow efficient recovery from automation and can potentially improve the robustness of robotic disassembly.Note to Practitioners—This research was motivated by the development of automated disassembly techniques. Industrial automation techniques usually use predetermined operation motions. Robotic disassembly using such an approach may fail due to uncertainties in the condition of the products (e.g., positioning and geometry). This article introduces backup actions for disassembly sequence planning and describes the logic and reasoning of their implementation. Our proposed method can theoretically increase the completion rate of automated robotic disassembly. Experimental studies suggested that backup actions are efficient in providing a reliable disassembly sequence and, thus, can improve the robustness of robotic disassembly. In future research, we will implement typical backup actions and establish an automated disassembly process with a replanning module.

Soft sensor, as an important paradigm for industrial intelligence, is widely used in industrial production to achieve efficient monitoring and prediction of production status including product quality. Data-driven soft sensor methods have attracted attention, which still have challenges because of complex industrial data with diverse characteristics, nonlinear relationships, and massive unlabeled samples. In this article, a data-driven self-supervised long short-term memory–deep factorization machine (LSTM-DeepFM) model is proposed for industrial soft sensor, in which a framework mainly including pretraining and finetuning stages is proposed to explore diverse industrial data characteristics. In the pretraining stage, an LSTM-autoencoder is first unsupervised pretrained. Then, based on two self-supervised mask strategies, LSTM-deep can explore the interdependencies between features as well as the dynamic fluctuation in time series. In the finetuning stage, relying on pretrained representation, the temporal, high-dimensional, and low-dimensional features can be extracted from the LSTM, deep, and FM components, respectively. Finally, experiments on the real-world mining dataset demonstrate that the proposed method achieves state of the art comparing with stacked autoencoder-based models, variational autoencoder-based models, semisupervised parallel DeepFM, etc.

Virtualization is a crucial technology of cloud computing to enable the flexible use of a significant amount of distributed computing services on a pay-as-you-go basis. As the service demand continuingly increases to a global scale, efficient virtual machine consolidation becomes more and more imperative. Existing heuristic algorithms targeted mostly at minimizing either the rate of service level agreement violations or the energy consumption of the cloud. However, the communication overhead among different virtual machines and the decision time of virtual machine consolidation are rarely considered. To reduce both the over-utilized nodes and the under-utilized nodes with the consideration of migration cost, communication overhead, and energy consumption, this paper presents a new iterative budget algorithm in which a budget heuristic and a multi-stage selection strategy are designed to find suitable migration objects and targets simultaneously. Experiments show that the proposed algorithm provides a substantial improvement over other typical heuristics and metaheuristic algorithms in reducing the energy consumption, the number of migrated virtual machines, the overall communication overhead, as well as the decision time.

Cloud manufacturing (CMfg) is an emerging paradigm that aims to provide on-demand manufacturing services over the Internet. Service composition as an important means for generating value-added services plays an important role in achieving the aim of CMfg. Most of previous works focused on exploring techniques of service composition for a single composite task using meta-heuristic algorithms. However, the issue of service composition for multiple composite tasks has rarely been considered. Meta-heuristic algorithms suffer from cumbersome parameter tuning as well as the tendency of getting into local optima. In addition, the effectiveness of different algorithms has not yet been fully explored when different degrees of constraints are imposed. Different from approaches in most of the previous works, this paper proposes an extended Gale-Shapley (GS) algorithm-based approach for service composition that allows generation of multiple service composition solutions effectively. Requirements with different constraints are considered. Experimental results indicate that: 1) meta-heuristic algorithms can be used in various scenarios with different degrees of constraints. However, they are incapable of finding the optimal solutions in situations with relatively loose constraints, and moreover, the failure rate of finding solutions for a batch of multiple tasks is high; 2) the dynamic programming (DP) is a method that is the most sensitive to constraints. It performs better only under loose constraints and in the case of a single requirement; and 3) the application range of the GS method proposed is wider than that of the DP method. It can achieve better performance when constraints are relaxed irrespective of task status (i.e., a single task or multiple tasks), and moreover, it can make more tasks find solutions in the multitask scenario without service reuse.

With the conception and application of cloud manufacturing getting into manufacturing enterprises, more and more enterprises begin to establish the cloud system. How to collect the knowledge generated in these systems and pro-vide it to the enterprise manufacturing cloud for use is now an important issue. This paper presents an architecture of knowledge cloud based on manufacturing big data, according to the characteristics of manufacturing big data, building a knowledge database by ontology, encapsulation the knowledge service, and finally providing the provide the support for the enterprise manufacturing cloud.

The problem of task allocation and service selection in the complex dynamic cloud manufacturing (CMfg) environment is complex for different types of manufacturing resources. With the rapid development of 3D printing technology, the supply-demand matching problem of 3D printing tasks and services in CMfg needs to be modelled specifically. In this paper, the service attributes of 3D printing services are analyzed, including model size, printing material, printing preciseness, cost, time and logistics. The service transaction model of 3D printing services is built. To reduce delivery time of tasks from service suppliers to service demanders, a 3D printing service matching and selection method (MST) is proposed to generate the optimal solutions. Experimental results show that the average task completion time with MST is less than that of the typical method when the amounts of tasks change. Besides, MST can balance the task assignment among different service providers.

With the increase of dimensions and complexity of current engineering problems, parallel evolutionary algorithm which take advantage of population division and information exchange among processors has been introduced for years. However, low solution ability of each sub-group and high communication load between them are always seen as the biggest bottlenecks which hinder parallel evolutionary algorithm to be more efficient. To overcome this two problems, a multi operators-based partial connected parallel evolutionary algorithm, i.e. MO-PCPEA is proposed. By combining multiple evolutionary operators, an adaptive strategy for operator configuration inside each parallel group is designed to ensure the searching ability of the algorithm for wider range of problems. More importantly, a partial connection topology is proposed to guide the periodic communication between each group. Computational results in two typical permutation combinatorial optimization benchmarks and one practical case study demonstrate that MO-PCPEA is highly competitive compared with most tailored serial and parallel evolutionary algorithms in terms of not only searching time, but also solution quality.

Cloud computing is getting more prevalent and finding a way to reduce the cost of cloud computing platform through the migration of virtual machines (VM) is a concerned issue. In this paper, the problem of dynamic migration of VMs (DM-VM) in the cloud computing platform (or simply the cloud) is investigated. A triple-objective optimization model for DM-VM is established, which takes energy consumption, communication between VMs, and migration cost into account under the situation that the platform works normally. The DM-VM problem is divided into two parts: (i) forming VMs into groups, and (ii) determining the best way to place the groups into certain physical nodes. A binary graph matching-based bucket-code learning algorithm (BGM-BLA) is designed for solving the DM-VM problem. In BGM-BLA, bucket-coding and learning is employed for finding the optimal solutions, and binary graph matching is used for evaluating the candidate solutions. The computational results demonstrate that the proposed BGM-BLA algorithm performs relatively well in terms of the Pareto sets obtained and computational time in comparison with two optimization algorithms, i.e., Non-dominated Sorting Genetic Algorithm (NSGA-II) and binary graph matching-based common-coding algorithm.

In order to realize the full-scale sharing, free circulation and transaction, and on-demand-use of manufacturing resource and capabilities in modern enterprise systems (ES), Cloud manufacturing (CMfg) as a new service-oriented manufacturing paradigm has been proposed recently. Compared with cloud computing, the services that are managed in CMfg include not only computational and software resource and capability service, but also various manufacturing resources and capability service. These various dynamic services make ES more powerful and to be a higher-level extension of traditional services. Thus, as a key issue for the implementation of CMfg-based ES, service composition optimal-selection (SCOS) is becoming very important. SCOS is a typical NP-hard problem with the characteristics of dynamic and uncertainty. Solving large scale SCOS problem with numerous constraints in CMfg by using the traditional methods might be inefficient. To overcome this shortcoming, the formulation of SCOS in CMfg with multiple objectives and constraints is investigated first, and then a novel parallel intelligent algorithm, namely full connection based parallel adaptive chaos optimization with reflex migration (FC-PACO-RM) is developed. In the algorithm, roulette wheel selection and adaptive chaos optimization are introduced for search purpose, while full-connection parallelization in island model and new reflex migration way are also developed for efficient decision. To validate the performance of FC-PACO-RM, comparisons with 3 serial algorithms and 7 typical parallel methods are conducted in three typical cases. The results demonstrate the effectiveness of the proposed method for addressing complex SCOS in CMfg.