Complexity

Complexity / 2019 / Article
Special Issue

Control Design for Systems Operating in Complex Environments

View this Special Issue

Research Article | Open Access

Volume 2019 |Article ID 7438710 | 21 pages | https://doi.org/10.1155/2019/7438710

IHDETBO: A Novel Optimization Method of Multi-Batch Subtasks Parallel-Hybrid Execution Cloud Service Composition for Cloud Manufacturing

Academic Editor: Andy Annamalai
Received02 Aug 2018
Revised16 Nov 2018
Accepted11 Dec 2018
Published04 Feb 2019

Abstract

Cloud manufacturing (CMfg) is a new service-oriented smart manufacturing paradigm, and it provides a new product development model in which users are enabled to configure, select, and utilize customized manufacturing service on-demand. Because of the massive manufacturing resources, various users with individualized demands, heterogeneous manufacturing system or platform, and different data type or file type, CMfg is fully recognized as a kind of complex manufacturing system in complex environment and has received considerable attention in recent years. In practical scenarios of CMfg, the amount of manufacturing task may be very large, and there are always quite a lot of candidate manufacturing services in cloud pool for corresponding subtasks. These candidate services will be selected and composed together to complete a complex manufacturing task. Obviously, manufacturing service composition plays a very important role in CMfg lifecycle and thus enables complex manufacturing system to be stable, safe, reliable, and efficient and effective. In this paper, a new manufacturing service composition scheme named as Multi-Batch Subtasks Parallel-Hybrid Execution Cloud Service Composition for Cloud Manufacturing (MBSPHE-CSCCM) is proposed, and such composition is one of the most difficult combination optimization problems with NP-hard complexity. To address the problem, a novel optimization method named as Improved Hybrid Differential Evolution and Teaching Based Optimization (IHDETBO) is proposed and introduced in detail. The results obtained by simulation experiments and case study validate the effectiveness and feasibility of the proposed algorithm.

1. Introduction

The continuing rise in customer expectation, demand of environmental-friendly production, rapid responsiveness to market changes, and other market competitions poses a critical challenge to manufacturing industry. Under these market pressures, it is very important that manufacturing partners in the industry chain should work together to provide offerings, which contain material products and immaterial services or functionalities, so as to achieve a win-win situation among users, enterprises, environment, and society. So, cloud manufacturing (CMfg) emerges as the time require. The term “cloud manufacturing” was firstly coined by Li et al. ‎[1]. CMfg is a special networked manufacturing mode which is different from traditional networked manufacturing mode such as ASP and MGrid. Traditional networked manufacturing is an independent and static system and lacks dynamics, intelligent client, and effective business model. Its shared resources are mostly software and other soft resource, less involving hardware resources, and the overall manufacturing capacity of enterprises. The concept of traditional networked manufacturing emphasizes the centralized use of decentralized resources. As a new manufacturing paradigm, CMfg is a kind of large-scale networked distributed manufacturing mode that simultaneously provides multiple users with customized manufacturing services on a CMfg system or platform by organizing online manufacturing resources which are always virtualized and encapsulated as manufacturing services. Both the concepts of “integration of distributed resources” and “distribution of integrated resources” are reflected in CMfg. So, the advantage of CMfg is that the philosophy of “software as a service” is expanded to “manufacturing as a service”, which enables the cloud system to virtualize and servitize the manufacturing resources and capabilities including not only soft resource but also hard resource. In CMfg, there are massive manufacturing resources, various users with individualized demands, heterogeneous manufacturing system or platform, and different data type or file type, so the CMfg is obviously a complex system running in a complex environment. It is a strong demand that the system reaches stability, safety, reliability, and efficiency and effectiveness, and there are many theoretical and technological challenges for the CMfg in practical application.

In the past decades, through the integration of some advanced technology such as Cyber-Physical System (CPS) ‎[2], Artificial Intelligence (AI) ‎[3], Internet of Things (IoT) ‎[4], Big Data (BD) ‎[5], supply chain management ‎[6], cloud computing ‎[7], and so on, CMfg has been improved rapidly and gradually in focus. Now, many research institutions are focusing on CMfg, and many theoretical researches on the definition, architecture, resource modeling, QoS evaluation, and resource scheduling of CMfg have been reported. More importantly, thanks to these aforementioned technologies, more and more national governments are also focusing on CMfg and promoting its greater development. Taking “Industrie 4.0” of the German government as an example, any production system can seamlessly access to the cloud platform to provide remote maintenance or to find personalized custom solutions.

Since the manufacturing services in CMfg are massive, users can acquire a lot of production capability to fulfill their customized demand. Especially for a complex manufacturing task, it is always divided into several subtasks, and for every subtask there are also many manufacturing services that can be selected. Although these candidate services have different performance or QoS, they all satisfy or are within the range of user’s requirements. So, such collaboration is essentially enabled by the composition of manufacturing services, i.e., cloud service composition for cloud manufacturing (CSCCM). CSCCM involves selecting appropriate and optimal manufacturing services from candidate services and assembling them together with logistic. In other words, CSCCM is essentially an interconnected set of multiple specialized manufacturing services to offer the products or functionalities to solve a complex manufacturing task according to user’s requirement. Obviously, such composition is one of the most difficult combination optimization problems with NP-hard complexity. Tao et al. ‎[8] divide existing service composition method into five categories: business flow-based service composition, AI-based service composition, graph-based service composition, agent-based service composition, and QoS-aware service composition. Now, many researches focus on the QoS-aware service composition, because the QoS such as time, cost, reliability, and reputation influent user satisfaction deeply. Besides, many classical swarm intelligent and heuristic algorithms which have been widely studied in traditional manufacturing system are also introduced into CMfg, such as genetic algorithm (GA) ‎[9], simulated annealing (SA) ‎[10], swarm optimization (PSO) ‎[11], ant colony optimization (ACO) ‎[12], artificial bee colony (ABC) ‎[13], chaos optimization (CO) ‎[8], differential evolution algorithm (DE) ‎[14], and teaching-learning based optimization (TLBO) ‎[15, 16].

Although the aforementioned algorithms and related improved versions can solve NP-hard problem to a certain degree, they cannot address well the mass task in CMfg. In order to achieve a better optimization, adopted are several candidate manufacturing services, when the task amount is very large and there are quite a lot of candidate manufacturing services for corresponding subtasks. Moreover, when the interface is highly standardized, it is possible that multi-services execute parallel and hybrid. The encoding methods and operations of the aforementioned algorithms are just on single gene location, which is not suitable for the scenario of the multi-services selected for one subtask, because to the multi-services, the transportation scheme between subtasks is diversity and should be under consideration when establish the objective function. In addition, the global search ability of the aforementioned algorithms is not ideal for high dimensional and complex objective function in CMfg. So, in this paper, we propose a manufacturing service composition scheme named as Multi-Batch Subtasks Parallel-Hybrid Execution Cloud Service Composition for Cloud Manufacturing (MBSPHE-CSCCM). Meanwhile, a novel optimization method named as Improved Hybrid Differential Evolution and Teaching Based Optimization (IHDETBO) is proposed by adopting and improving the classical DE and TLBO algorithms.

The remainder of the paper is organized as follows. In Section 2, our previously proposed CMfg architecture is presented, and the problem statement is discussed. In Section 3, the basic concepts and operations of DE and TLBO algorithms are both summarized. In Section 4, the proposed algorithm IHDETBO is introduced in detail. In Section 5, the simulation experiments and case study are given, and the experimental results are discussed. In Section 6, the paper is summarized with concluding remarks and future work.

2. Problem Statement

In our previous work, we have discussed the CMfg architecture ‎[1719]. As shown in Figure 1, there are three kinds of roles in CMfg: the resource demander (RD), who is the demander of products, manufacturing resource, or service, for example, the users or some public institutions; the resource provider (RP), who is the provider of products, manufacturing resource, or service, for example, the enterprise or service cooperator; the manager, who designs, develops, and maintains the CMfg equipments and related software like some professional middleware. From the perspective of CMfg system, it is composed of a cloud manufacturing platform (CMP) and cloud end (CE). The latter contains a cloud demander (CD) and a cloud provider (CP) both of which are corresponding to RD and RP, respectively. The CPs publish, update, cancel, and provide manufacturing resource and service through CMP; the CDs, in turn, submit the requirement to and obtain the corresponding products or services from CMP, the functionality of which is like a great resource pool consisting of several sub-CMPs that can interact with each other. In addition, through cutting-edge technologies such as Internet of Things (IoT), Big Data (BD), Cyber-Physical System (CPS), and so on, manufacturing resources in CP are encapsulated as cloud service (CS), which then can be accessed and obtained by CD from CMP. Thus, CMfg can provide users with manufacturing resources highly virtualized as services in the manufacturing life cycle ‎[20].

Generally speaking, the lifecycle of CMfg has several phases just like cloud computing: the definition and publication of CS, the proposal of manufacturing task requirement, the matching of CS, the composition and provision of CS, the determination of manufacturing contract, manufacturing and distribution, and the disposal of manufacturing task ‎[22]. The work proposed in this paper will address the phase of the composition and provision of CS. As shown in Figure 2, after users have submitted manufacturing task to CMP, the CMP first decomposes the task to several subtasks according to the knowledge of domain experts and searches proper CSs to the corresponding subtasks from cloud service pool (CSP) and then selects and composes these CSs with optimization algorithms to satisfy users’ QoS requirements such as time, cost, availability, reputation, and so on. Because the total amount of tasks may be very large, as well as there are many candidate CSs according to the performance requirement of corresponding subtasks, several CSs would like to be chosen to complete the same subtask parallel, and each of them would deliver its production results to one or more CSs for next subtask. Taking the first and second subtasks as an example (shown as SubT1 and SubT2 in Figure 2), they have two corresponding candidate CS sets CSS1= and CSS2=, and total amounts of these two subtasks are both T. Some of these CSs will be allocated production task and the amount is Ti,j, where . So, some CSs in CSS1 will be allocated production task and will deliver their production results to one or more CSs in CSS2 after completing their own tasks. For example, in composition scenario shown in Figure 2, for the first subtask, three candidate CSs are chosen, i.e., CS1,1, CS1,2, and . After completing their own tasks, the production results of CS1,1 will be delivered to CS2,1 and , similarly, CS1,2 to CS2,1 and CS2,2, and to and . Thus, a mass task can be transformed into multi-batch subtasks which will be parallel-hybrid executed. Obviously, the key issue is CS composition with respect to users’ QoS requirement, which is a combinatorial optimization problem with strong NP-hard problem in essence.

3. Basic Concepts and Operations of DE Algorithm and TLBO Algorithm

MBSPHE-CSCCM is a combinatorial optimization problem with strong NP-hard problem. Furthermore, with the rapid increasing number of candidate CSs and the amount of cloud manufacturing tasks and subtasks, the search space is quite large. It is hard to solve MBSPHE-CSCCM problem with a large search scale by traditional methods. In this paper, the DE algorithm and TLBO algorithm are adopted to design a new method termed as IHDETBO. DE and TLBO are both recently developed meta-heuristic algorithms to enhance and balance the exploration and exploitation capacities. The basic concepts and operations of these two algorithms are detailed in the following sections.

3.1. DE Algorithm

DE was firstly coined by Storn and Price ‎[14]. It is a powerful evolutionary algorithm based on stochastic search technique, which is an efficient and effective global optimizer in the continuous search domain ‎[23]. Similar to other evolutionary algorithms such as ABC, DE firstly generates a population consisting of NP n-dimensional initial vector randomly, which is so-called individuals, i.e., , generated by (1). Here, NP is one of the parameters of DE and indicates population size: where ; is the boundary of the jth variable; and is a random number uniformly distributed over the interval .

Then the population evolves over generations through three types of operations such as mutation, crossover, and selection till one of the termination criterions is satisfied.

3.1.1. Mutation Operation

In the mutation operation of the kth generation, DE produces a mutant vector . Seven most frequently referred mutation operations are listed as follows:(1)rand/1/bin ‎[14]:(2)rand/2/bin ‎[23]:(3)best-to-rand/1/bin ‎[14]:(4)best-to-rand/2/bin ‎[24]:(5)rand-to-best/2/bin ‎[25]:(6)current-to-rand/1/bin ‎[26]:(7)current-to-pbest/1/bin ‎[24]:where d1, d2, d3, d4, and d5 are distinct random integers uniformly generated from the set ; represents the best individuals in the kth generation; represents the individuals randomly selected from the top 100p best individuals in the kth generation, and ; is a control parameter randomly chosen with the range ; is a real fixed number () named as scale parameter (step size) to control the amplification of the difference.

3.1.2. Crossover Operation

In the crossover operation after mutation operation of the kth generation, the trial/offspring vector is generated by mixing with each pair of the target vector and its corresponding mutant vector . In the basic version, the binomial crossover operation is defined as follows:where is a uniform random number on the interval ; CR is crossover constant determined by users within the interval ; is a randomly chosen index which ensures that the trial vector gets at least one element different from .

3.1.3. Selection Operation

A greedy selection operation is used to select individual from each pair of the target vector and the corresponding trial/offspring vector into the next in the next (k+1)th generation by comparing their fitness. For minimization problems, whose fitness is smaller, they will be chosen, and, for maximization problems, the opposite is true.

3.2. TLBO Algorithm

TLBO algorithm was firstly proposed by Rao ‎[15, 16]. Based on the effect of the influence of a teacher on the output of learners in a class, teaching-learning is an important motivated progress where any individual tries to learn something from the other and simulates the traditional teaching-learning phenomenon of class room ‎[27]. So, teaching-learning algorithm has two fundamental modes of learning: (i) learning from the teacher (known as teacher phase) and (ii) interacting with the other learners (known as learner phase). The initialization is as the same as DE by using (1).

3.2.1. Teacher Phase

In the teacher phase, the algorithm simulates the learning of students from teacher. The teacher (always the best individual of the entire population) will put maximum effort to increase the mean grade of the class from any value to his value, and the learners will gain knowledge according to the quality of teaching delivered by a teacher and the quality of learners present in the class ‎[27]. At any teaching-learning cycle k, let be the teacher and be the mean whose every element is the mean value of the corresponding dimension, i.e., , , where j and n have the same meaning with DE. Teacher will try to improve other individuals by shifting their positions towards the position of his own level, where . The difference between the result of the teacher and the mean result of the learner for the learner d is calculated as follows:where rd is a random number in the range ; TF is the teaching factor which decides the value of the mean to be changed and can be either 1 or 2 and decided randomly as follows:

Based on the , individual in the current population is updated according to the following:where is the updated value and will be accepted if it gives a better fitness value.

3.2.2. Learner Phase

In the learner phase after teacher phase, the algorithm will simulate the learning of the students (individuals) through interacting with each other by discussions, presentations, formal communications, and so on. A learner will develop his knowledge if the other learners are better. So in this phase of the kth generation, a learner randomly selects another learner , if the fitness value of is better than that of , then will be updated by (13), otherwise by (14).where is a random number within the range , and will be accepted if it gives a better fitness value.

4. IHDETBO for Cloud Manufacturing

To solve the MBSPHE-CSCCM problem, a so-called IHDETBO algorithm is proposed by integrating improved DE (named as IDE phase) and the improved teacher phase of TLBO (named as IT phase) to enhance and balance the exploration and exploitation capacities. At first, block encoding and initialization are operated in population initialization. In the IDE phase, block mutation, block crossover and block selection are operated. Besides, factors F and CR will be both improved and calculated with adaptive strategy to enhance the population diversity and generate better individuals into the next phase ‎[28]. In the learner phase of canonical TLBO, due to the fact that the learner may select an inappropriate learner (a poor student) to learn, the convergence speed will slow down and the effect of local search will be reduced. On the contrary, every learner will be improved to the teacher’s level in the teacher phase of canonical TLBO, and the algorithm puts up a better convergence performance. So, operations in teacher phase will be adopted and improved as IT phase, and factor TF will be also improved to make the simulation more in line with the actual. The algorithm is discussed as follows in detail.

4.1. Parameter Settings

To facilitate the discussion of MBSPHE-CSCCM problem, the parameter setting is unified as follows.

Task: cloud manufacturing task.

K: the total amount of cloud manufacturing task.

: the set of subtasks decomposed by CMP, where i is a natural number in the range ; n is the total amount of subtasks. So, let the amount of every subtask be Ki. Generally, and must both hold, where is a positive integer.

: the set of candidate CSs for corresponding subtask , where , is the amount of the candidate CSs.

4.2. Block Encoding and Initialization

To address the MBSPHE-CSCCM problem, a new encoding method named as block encoding is proposed. A MBSPHE-CSCCM scheme can be encoded as a chromosome by the integer array with the length equal to the number of CSs ‎[21], and the integers are all in the range . By adopting calculation method of subtask height, a genebit partition method based on subtask rank is proposed; thus every genebit in the integer array is one-to-one correspondence with the CS ‎[29]. Shown as Figure 3, the rank of the corresponding subtask is the location in the cloud manufacturing chain, and the amount of genebit in every rank is the amount of candidate CS for the corresponding subtask. So, the genebits in the same rank can be seen as a block of the chromosome. The genebit index of is calculated as follows:

The initialization is generated randomly and the sum of every rank equals to the amount of the corresponding subtask, so the initialization of every genebit is calculated as follows:

4.3. IDE Phase

In the IDE phase, there are still three operations: mutation, crossover, and selection mentioned above. Based on the block encoding and initialization, mutation and crossover are both executed rank by rank, which are named as block mutation and block crossover, respectively. Additionally, parameters F and CR will be both improved in the block mutation operation and the block crossover operation, respectively.

4.3.1. Improved Block Mutation Operation

Let be rank i of the hth generation, where is the integer array in the genebit of rank i of individual d. After this operation, a block mutant vector is . To enhance the exploration capacity and population diversity, we employ “rand/1/bin” mutation operation like (17), which demonstrates slow convergence speed but has strong exploration capability ‎[14]. Obviously, the sum of every element of equals that of .

In the IHDETBO algorithm, the mutation factor Fd is improved and calculated adaptively with the aim of generating diversified individuals. At each generation h, Fd of each individual is independently generated like (18), according to a Cauchy distribution with location parameter and scale parameter 0.1, and then truncated to be 1 if or regenerated if .

Let SF be the set of all successful mutation factors in this generation. The location parameter of the Cauchy distribution is initialized to be 0.5 and then updated at the end of this iteration as follows:where c is a positive constant between 0 and 1, and is the Lehmer mean and calculated as equation (20).

According to the existing research results ‎[24], a truncated Cauchy distribution is introduced to generate adaptive Fd, because it is more helpful to diversify Fd and thus avoid premature convergence which often occurs in greedy mutation strategies if Fd is highly concentrated around a certain value, so as to enhance the population diversity. Additionally, the Lehmer mean of SF makes the adaptation of place more weight on larger successful mutation factors and is also helpful to propagate larger so as to avoid premature convergence at the end.

4.3.2. Improved Block Crossover Operation

Let be the block trial/offspring vector, and the block crossover operation is executed rank by rank. According to (9), the block crossover operation is calculated as follows. To make the sum of every element of remain unchanged, fine-turning operation will be needed; i.e., every element of will increase or decrease proportionally.

In the IHDETBO algorithm, the crossover probability CRd is also improved and calculated adaptively with the aim of generating better individuals into the next IT phase. At each generation h, CRd of each individual is independently generated as (22), according to a normal distribution of mean and standard deviation 0.1, and then truncated to .

Let SCR be the set of all successful crossover probabilities in this generation. The mean of the normal distribution is initialized to 0.5 and then updated at the end of this iteration as follows:where c is a positive constant between 0 and 1, and is the arithmetic mean of SCR.

According to the existing research results ‎[24], better control parameter values tend to generate better individuals that are more likely to survive and thus these values should be propagated to the following generations. So, the set SCR records recent successful crossover probabilities, and with a small standard deviation in (22) leads to generate a new CRd that has a great probability close to the successful crossover probability values.

4.3.3. Selection Operation

After block mutation and block crossover, we can obtain a trial/offspring individual , and abovementioned greedy selection operation is also adopted to choose or into next phase.

4.4. IT Phase

In IHDETBO algorithm, the teacher phase of TLBO is improved and adopted as IT phase following the IDE phase. Based on the block operations illustrated in Section 4.3, the operation in this phase is also executed block by block. Additionally, factor TF will be improved to make the simulation more in line with the actual.

4.4.1. Block Teaching Operation

Just as introduced in Section 3.2.1, the teacher (the best individual of this population) tries to disseminate knowledge among learners (other individuals of this population), which will in turn increase the knowledge level of the whole class (population). So, after IDE phase of the hth generation, let the individual which has the best fitness value be the teacher and be the mean individual, where i and n have the same meaning with that in Section 4.2; and . The difference of block i between the result of the teacher and the mean result of the learner for the learner d is calculated as follows:where rd is a random number in the range ; TF is the teaching factor which can be calculated by (11). Then, block i of individual d will be updated, and the updated individual will be accepted if it gives a better fitness value.

4.4.2. Improvement of TF

In the canonical TLBO algorithm, the teaching factor TF,d is either 1 or 2. It means that the learners learn nothing from the teacher or learn all the things from the teacher, respectively. Obviously, it is not in line with the actual. In actually teaching-learning phenomenon, the learners may learn in any proportion from the teacher because of the learners’ learning ability, the teacher’s teaching ability, or other reasons, so the teaching factor TF,d is not always at its end state for learners but varies in-between also ‎[27, 30]. Therefore, TF,d is calculated as follows:where and are the fitness values of and , respectively.

5. Experiments and Discussions

In this section, the effectiveness of the proposed IHDETBO algorithm is examined by several benchmark functions, and the process of IHDETBO applied to MBSPHE-CSCCM is demonstrated by a case study. These experiments are implemented in a PC with an Intel® Core™ i5-3337U CPU operating at 1.80GHz and 8.00GB of RAM, and operating system is Windows 7 (64 bit). The programming software for the experiments with benchmark functions and that for the case study are Matlab R2016a and Microsoft Visual C++ 6.0, respectively.

5.1. Experiments with Benchmark Functions

To investigate the performance of the proposed IHDETBO algorithm, six different benchmark functions with different characteristics of objective functions and different dimensions and search space are adopted. The results obtained by using the IHDETBO algorithm are also compared with other optimization algorithms such as PSO, DE, and TLBO algorithms with different dimensions and population sizes.

5.1.1. Benchmark Functions

To analyze and compare the performance and accuracy of the IHDETBO algorithm, we adopt six different benchmark functions shown as in Table 1. These functions have different characteristics such as unimodality (U), multimodality (M), separable (S), and non-separable (N), which have been shown in column C of Table 1, and the optimum is all 0 which is the minimum. For a unimodal function, the local minimum is also the global minimum, conversely, there are several global minimums for multimodal functions. So, it is more difficult to find the global minimum for multimodal function than that for unimodal function, because the former requires better global search ability. Additionally, the variables are affected by other variables in non-separable functions, but not for separable functions, so it is more difficult to find an optimum for the non-separable function than that for separable function. Therefore, the abilities of exploration, exploitation, and finding an optimum can be assessed by these functions, which can be seen as the abstraction for some engineering problem in practice.


NameFunctionCSearch spaceInitial spaceMin

SphereUS0
RosenbrockUN0
AckleyMN0
Schwefel 2.26MS0
GriewankMN0
RastriginMN0

5.1.2. Parameters Settings

We test proposed IHDETBO algorithm with the same parameters setting and compare the test results with PSO and DE algorithms. For PSO algorithm, parameter v is half of the search space. As for the DE algorithm, scale factor F and crossover probability CR are 0.5 and 0.9, respectively ‎[31]. The maximum iteration is 500 shown in column M of Table 2. The population size is an important parameter for heuristic algorithms, and it is set to 10, 20, and 50 shown in column N of Table 2. In addition, the dimensionality of the search space is another important issue for the methods, and it is set to 2, 5, and 10 for each population size shown in column D of Table 2. All experiments are operated 50 times independently.


Benchmark functionalgorithmN102050
D251025102510

f1IHDETBObest7.58E-1543.56E-681.11E-362.52E-1356.14E-541.27E-279.72E-1206.39E-478.65E-23
worst2.63E-1383.63E-558.63E-291.38E-1222.95E-483.64E-225.31E-1134.35E-434.44E-20
mean6.36E-1407.66E-575.76E-302.84E-1242.54E-491.46E-232.43E-1145.53E-445.47E-21
std3.68E-1395.07E-561.53E-291.93E-1236.60E-495.19E-238.54E-1149.57E-448.16E-21
FE1.00E+041.00E+041.00E+042.00E+042.00E+042.00E+045.01E+045.01E+045.01E+04
PSObest0.00E+000.00E+002.78E+010.00E+000.00E+008.41E-010.00E+000.00E+002.76E-15
worst1.65E-435.00E+005.34E+032.03E-486.62E-301.62E+027.32E-556.56E-531.60E-03
mean4.17E-452.42E-019.88E+024.67E-503.42E-313.98E+015.41E-562.18E-544.60E-05
std2.34E-447.58E-019.09E+022.85E-491.23E-304.76E+011.47E-551.01E-532.27E-04
FE1.14E+041.23E+041.24E+042.22E+042.31E+042.42E+045.45E+045.45E+045.91E+04
DEbest4.55E-1111.73E-023.64E+011.83E-1135.16E-471.78E-155.66E-1129.89E-449.08E-20
worst2.68E-016.28E+022.42E+033.01E-1044.33E-064.66E+012.65E-1042.60E-401.11E-17
mean5.40E-035.57E+014.51E+027.63E-1069.90E-081.51E+001.07E-1052.41E-411.56E-18
std3.75E-021.03E+025.24E+024.24E-1056.11E-076.64E+004.31E-1054.91E-411.84E-18
FE1.00E+041.00E+041.00E+042.00E+042.00E+042.00E+045.01E+045.01E+045.01E+04
TLBObest1.39E-2061.71E-1402.09E-1411.97E-1952.50E-1232.96E-1173.53E-1822.07E-1145.37E-87
worst1.68E-1893.79E-1313.74E-1301.10E-1775.87E-1168.28E-1104.21E-1745.35E-1092.22E-84
mean4.12E-1911.08E-1329.72E-1322.20E-1791.05E-1176.04E-1111.57E-1751.35E-1103.58E-85
std0.00E+005.65E-1325.27E-1310.00E+008.25E-1171.67E-1100.00E+007.51E-1105.36E-85
FE1.00E+041.00E+041.00E+042.00E+042.00E+042.00E+045.01E+045.01E+045.01E+04

f2IHDETBObest0.00E+001.44E-021.02E+000.00E+006.04E-042.27E+000.00E+001.39E-165.70E-03
worst3.18E-174.00E+007.30E+000.00E+005.72E-014.55E+000.00E+002.51E-014.01E+00
mean6.37E-195.27E-014.22E+000.00E+002.85E-013.72E+000.00E+003.40E-022.82E-02
std4.45E-186.57E-017.70E-010.00E+001.20E-013.11E-010.00E+005.54E-028.68E-01
FE1.00E+041.00E+041.00E+042.00E+042.00E+042.00E+045.01E+045.01E+045.01E+04
PSObest0.00E+007.80E-051.00E+010.00E+000.00E+005.88E+000.00E+000.00E+007.65E-01
worst0.00E+004.63E+001.96E+020.00E+003.93E+005.76E+010.00E+003.93E+009.57E+00
mean0.00E+002.30E+004.18E+010.00E+003.15E-011.11E+010.00E+002.36E-015.57E+00
std0.00E+001.58E+003.48E+010.00E+001.07E+008.77E+000.00E+009.34E-012.22E+00
FE1.11E+041.24E+041.24E+042.16E+042.31E+042.42E+045.32E+045.49E+045.98E+04
DEbest0.00E+002.16E-026.77E+000.00E+001.27E-042.89E-010.00E+007.77E-301.63E+00
worst4.95E+008.75E+011.81E+022.97E-013.93E+002.59E+010.00E+001.06E+006.05E+05
mean2.48E-016.10E+004.40E+012.17E-021.32E+007.80E+000.00E+002.77E-014.19E+00
std7.36E-011.34E+013.47E+016.03E-021.10E+003.39E+000.00E+003.21E-011.24E+00
FE1.00E+041.00E+041.00E+042.00E+042.00E+042.00E+045.01E+045.01E+045.01E+04
TLBObest5.03E-291.40E-045.18E+005.70E-292.73E-055.89E-019.67E-281.78E-051.03E-02
worst7.91E-212.06E+007.16E+003.08E-222.77E-015.11E+006.81E-243.60E-037.24E-01
mean3.27E-225.45E-016.49E+008.28E-247.20E-033.74E+002.66E-257.77E-048.77E-02
std1.31E-215.11E-014.53E-014.32E-233.86E-028.08E-019.64E-256.35E-041.23E-01
FE1.00E+041.00E+041.00E+042.00E+042.00E+042.00E+045.01E+045.01E+045.01E+04

f3IHDETBObest0.00E+000.00E+000.00E+000.00E+000.00E+008.30E-140.00E+000.00E+002.76E-11
worst0.00E+004.89E-152.82E-130.00E+004.89E-153.68E-110.00E+004.89E-154.25E-10
mean0.00E+003.82E-152.42E-140.00E+003.18E-154.71E-120.00E+002.26E-151.21E-10
std0.00E+001.63E-154.86E-140.00E+001.77E-157.58E-120.00E+001.56E-158.58E-11
FE1.00E+041.00E+041.00E+042.00E+042.00E+042.00E+045.01E+045.01E+045.01E+04
PSObest0.00E+001.48E-065.34E+000.00E+000.00E+001.76E+000.00E+000.00E+001.16E+00
worst4.89E-157.50E+001.74E+010.00E+004.17E+001.25E+010.00E+002.32E+005.09E+00
mean1.47E-153.17E+001.06E+010.00E+001.02E+005.38E+000.00E+003.10E-012.88E+00
std6.96E-162.01E+002.71E+000.00E+002.00E+002.10E+000.00E+006.67E-019.53E-01
FE1.11E+041.22E+041.23E+042.16E+042.23E+042.41E+045.33E+045.40E+045.88E+04
DEbest0.00E+005.20E-032.72E+000.00E+000.00E+001.59E-100.00E+000.00E+001.56E-10
worst2.58E+001.41E+011.49E+010.00E+001.65E+002.58E+000.00E+004.89E-153.60E-09
mean5.87E-022.66E+008.67E+000.00E+006.58E-023.30E-010.00E+001.47E-159.13E-10
std3.62E-013.07E+002.59E+000.00E+003.23E-016.53E-010.00E+006.96E-166.01E-10
FE1.00E+041.00E+041.00E+042.00E+042.00E+042.00E+045.01E+045.01E+045.01E+04
TLBObest0.00E+000.00E+000.00E+000.00E+000.00E+000.00E+000.00E+000.00E+001.33E-15
worst4.89E-154.89E-158.44E-150.00E+004.89E-158.44E-150.00E+004.89E-154.89E-15
mean1.47E-154.03E-155.10E-150.00E+003.25E-155.03E-150.00E+003.32E-154.81E-15
std6.96E-161.52E-158.44E-120.00E+001.77E-159.95E-160.00E+001.76E-154.97E-16
FE1.00E+041.00E+041.00E+042.00E+042.00E+042.00E+045.01E+045.01E+045.01E+04

f4IHDETBObest0.00E+000.00E+002.27E-130.00E+000.00E+002.73E-110.00E+000.00E+001.39E-09
worst2.38E+024.75E+027.14E+021.18E+021.18E+023.57E+020.00E+000.00E+008.78E-08
mean2.37E+011.09E+023.02E+024.74E+001.42E+016.88E+010.00E+000.00E+001.71E-08
std5.31E+011.13E+021.84E+022.32E+013.85E+018.25E+010.00E+000.00E+001.65E-08
FE1.00E+041.00E+041.00E+042.00E+042.00E+042.00E+045.01E+045.01E+045.01E+04
PSObest0.00E+001.23E-027.38E+020.00E+000.00E+004.85E+020.00E+001.18E+022.38E+02
worst3.57E+021.08E+032.54E+032.38E+028.69E+022.26E+031.18E+029.52E+021.92E+03
mean9.68E+015.72E+021.69E+038.29E+014.43E+021.39E+034.50E+013.88E+021.19E+03
std9.35E+012.41E+024.11E+027.21E+012.26E+023.85E+025.75E+011.89E+023.69E+02
FE1.08E+041.17E+041.23E+042.12E+042.18E+042.38E+045.21E+045.26E+045.59E+04
DEbest0.00E+003.86E-015.20E+020.00E+000.00E+001.18E+020.00E+000.00E+001.23E-02
worst2.74E+027.90E+021.82E+031.40E+026.25E+021.03E+030.00E+001.25E+021.26E+03
mean6.52E+013.94E+021.15E+031.80E+011.94E+025.98E+020.00E+001.32E+014.76E+02
std6.93E+011.93E+022.83E+024.23E+011.83E+022.34E+020.00E+003.62E+013.10E+02
FE1.00E+041.00E+041.00E+042.00E+042.00E+042.00E+045.01E+045.01E+045.01E+04
TLBObest0.00E+001.18E+027.13E+020.00E+000.00E+003.55E+020.00E+000.00E+001.25E+02
worst2.39E+027.15E+021.58E+031.18E+026.51E+021.28E+030.00E+003.55E+021.04E+03
mean3.08E+013.22E+021.28E+031.18E+011.93E+027.33E+020.00E+007.88E+015.35E+02
std5.20E+011.52E+022.23E+023.55E+011.29E+022.16E+020.00E+009.06E+011.86E+02
FE1.00E+041.00E+041.00E+042.00E+042.00E+042.00E+045.01E+045.01E+045.01E+04

f5IHDETBObest0.00E+000.00E+003.92E-070.00E+000.00E+001.30E-050.00E+009.58E-136.32E-04
worst7.40E-031.72E-023.20E-020.00E+001.12E-052.84E-020.00E+001.75E-052.18E-02
mean1.48E-042.70E-037.90E-030.00E+006.10E-077.20E-030.00E+008.31E-078.80E-03
std1.00E-034.70E-037.80E-030.00E+002.23E-066.20E-030.00E+002.69E-065.50E-03
FE1.00E+041.00E+041.00E+042.00E+042.00E+042.00E+045.01E+045.01E+045.01E+04
PSObest0.00E+007.88E-022.67E+000.00E+003.45E-021.95E-010.00E+007.40E-038.42E-02
worst7.89E-023.16E+007.86E+016.66E-028.06E-011.16E+013.95E-024.43E-011.37E+00
mean1.40E-024.95E-011.36E+019.20E-032.46E-011.70E+002.50E-031.60E-013.62E-01
std1.69E-025.05E-011.22E+011.37E-021.50E-011.81E+006.20E-039.92E-023.47E-01
FE1.09E+041.22E+041.23E+042.12E+042.20E+002.40E+045.22E+045.30E+045.89E+04
DEbest0.00E+003.41E-027.99E-010.00E+007.40E-039.90E-030.00E+002.80E-031.21E-09
worst5.75E-016.62E+003.85E+011.33E-021.58E-016.43E-010.00E+008.85E-024.96E-01
mean3.19E-026.20E-019.95E+001.20E-034.47E-028.61E-020.00E+004.52E-021.94E-01
std8.11E-021.17E+007.67E+003.00E-033.19E-021.00E-010.00E+001.98E-021.50E-01
FE1.00E+041.00E+041.00E+042.00E+042.00E+042.00E+045.01E+045.01E+045.01E+04
TLBObest0.00E+002.28E-080.00E+000.00E+002.90E-030.00E+000.00E+007.66E-080.00E+00
worst7.40E-031.11E-011.69E-012.80E-037.15E-026.89E-028.72E-085.15E-024.92E-02
mean9.32E-043.86E-021.28E-021.17E-043.08E-029.90E-031.74E-091.76E-029.60E-03
std2.20E-032.87E-022.81E-025.42E-041.50E-021.74E-021.22E-081.08E-021.37E-02
FE1.00E+041.00E+041.00E+042.00E+042.00E+042.00E+045.01E+045.01E+045.01E+04

f6IHDETBObest0.00E+000.00E+000.00E+000.00E+000.00E+000.00E+000.00E+000.00E+001.88E-13
worst0.00E+002.98E+003.98E+000.00E+009.95E-019.95E-010.00E+000.00E+005.38E-11
mean0.00E+002.79E-011.21E+000.00E+005.97E-021.99E-020.00E+000.00E+005.02E-12
std0.00E+005.98E-011.22E+000.00E+002.36E-011.39E-010.00E+000.00E+008.67E-12
FE1.00E+041.00E+041.00E+042.00E+042.00E+042.00E+045.01E+045.01E+045.01E+04
PSObest0.00E+000.00E+001.27E+010.00E+000.00E+004.44E+000.00E+000.00E+002.00E+00
worst1.99E+003.08E+015.97E+019.95E-012.69E+014.12E+019.95E-011.09E+013.68E+01
mean4.18E-017.14E+003.59E+012.39E-015.63E+002.21E+013.98E-023.78E+001.44E+01
std5.30E-015.89E+001.16E+014.25E-014.20E+008.63E+001.95E-012.43E+007.14E+00
FE1.09E+041.22E+041.23E+042.12E+042.19E+042.40E+045.21E+045.30E+045.83E+04
DEbest0.00E+007.53E-023.25E+000.00E+000.00E+001.17E+000.00E+000.00E+001.22E+01
worst1.25E+001.77E+014.27E+010.00E+002.98E+002.12E+010.00E+001.13E-023.27E+01
mean3.19E-013.80E+001.64E+010.00E+005.40E-015.58E+000.00E+002.27E-042.34E+01
std4.60E-012.81E+008.16E+000.00E+007.31E-013.63E+000.00E+001.60E-035.54E+00
FE1.00E+041.00E+041.00E+042.00E+042.00E+042.00E+045.01E+045.01E+045.01E+04
TLBObest0.00E+000.00E+000.00E+000.00E+000.00E+000.00E+000.00E+000.00E+002.47E-12
worst0.00E+003.98E+001.19E+010.00E+001.99E+001.39E+010.00E+009.95E-015.97E+00
mean0.00E+008.65E-014.91E+000.00E+003.24E-014.32E+000.00E+002.04E-022.05E+00
std0.00E+001.27E+003.02E+000.00E+005.10E-012.81E+000.00E+001.39E-011.53E+00
FE1.00E+041.00E+041.00E+042.00E+042.00E+042.00E+045.01E+045.01E+045.01E+04

5.1.3. Discussion on the Experimental Results

Every experiment is operated 50 times independently. The results of comparison test on 6 different benchmark functions are shown as Table 2. The column best, worst, mean, std, and FE are the best value, worst value, mean value, standard deviation, and mean value of function evaluations for the 50 times operations, respectively. The mean value is the most important index that will validate the algorithm performance well. Additionally, for better analysis through the benchmark function, the objective function landscapes of them for D=2 are shown as Figure 4, through which we can view the shape and obtain the corresponding characteristics.

According to the landscape shown in Figure 4, their characteristics will be analyzed theoretically. The first benchmark function f1 is a unimodal separable function. It is a very simple benchmark function, which is the easiest to find the global minimum among the six functions. It requires nearly no global search capability and pays special attention on local convergence speed of an algorithm. As shown in Table 2, the performance rank is TLBO>IHDETBO>DE>PSO. The second one f2 is a unimodal non-separable function. Although it is unimodality, its shape is spiral, so it is prone to oscillation that makes it difficult to identify the search direction. Due to the feature, it is difficult to find global minimum, and this benchmark function is always used to evaluate the global search capability of an algorithm. As shown in Table 2, the performance rank is IHDETBO>TLBO>DE>PSO. The third one f3 is a multimodal non-separable function. Although it is multimodality and there are many local minimums, most of them exist in a long and narrow place around the global minimum. Thanks to this feature, these local minimums have no deceptive. So, it is also very easy to find the global minimum, and the global search capability of an algorithm has little effect on the optimization result. As shown in Table 2, the performance rank is TLBO>IHDETBO>PSO>DE. The fourth one f4 is a multimodal separable function and has a very strong deception. Around the global minimum, there are many local minimums, whose gradients are very similar to that of global minimum, and the optimization algorithm may be mistaken for finding the global minimum. So, it can well evaluate the diversity of population and the global search capability of an algorithm. As shown in Table 2, the performance rank is IHDETBO>DE>TLBO>PSO, and IHDETBO performs better much more. The fifth one f5 is a typical non-linear multimodal non-separable function and has a wide search space. The variables in every dimension are closely related to and interact with each other, and there are a lot of local minimums. So, it is usually considered as a complex multimodal problem which is difficult to deal with by optimization algorithm. As shown in Table 2, the performance rank is IHDETBO>TLBO>PSO>DE. Similar to f5, the sixth one f6 is a typical non-linear multimodal non-separable function, too. In the D-dimensional search space, there are about 10D local minimums, and the shapes of these irregular peaks are uneven and jump up and down. So, the effect of traditional gradient-based algorithm is often not ideal, and it is also difficult to find global minimum. As shown in Table 2, the performance rank is IHDETBO>TLBO>PSO>DE, and IHDETBO performs better much more.

In summary, the classical DE algorithm has very strong global search capability, but its convergence speed is slow. As to classical TLBO algorithm, every individual tries its best to approach the teacher individual in teacher phase, and then in learner phase positive learning and reverse learning are carried out when excellent partner and poor partner are selected, respectively. So, the local search capability is very strong and the convergence speed is very high, which we can obtain through f1 and f3, but the performance is mediocre for complex deceptive benchmark functions such as f2, f4, f5, and f6. The algorithm proposed in this paper is divided into two phases, i.e., IDE and IT. In the IDE phase, the mutation factor Fd and crossover probability CRd are both improved. Especially, the mutation factor Fd that generated with a Cauchy distribution is very important to keep the diversity of population and improve the global search capability. The teacher phase of classical TLBO algorithm has very strong local search capability and leads to a very high local convergence speed; the improvement in the IT phase not only enhances the local search capability, but also avoids losing the possibility of finding better solutions due to overreliance on the teacher individual, so as to better balance the exploration and exploitation capacities. According to the experimental results, the algorithm proposed in this paper performs better to the high-dimensional non-linear multimodal benchmark function, which is always considered as mathematical model of complex engineering problems such as cloud service composition for CMfg.

5.2. Case Study

CMfg is a complex manufacturing system. Taking the car manufacturing as an example, automobile industry is a large and complex manufacturing system involving more than 200 industry fields such as design, material, electronic equipment, and so on. For every automaker, nearly 70% spare parts are outsourced. In this paper, we take the tire manufacturing as a case study, and it refers to raw material production, tire production, hub production, wheel assembly, vehicle assembly, and auto dealer. So, we can decompose the task into 5 subtasks: raw material production is subtask 1, tire production and hub production is subtasks 2.1 and 2.2 which can be executed parallel and regarded as subtask 2, wheel assembly is subtask 3, vehicle assembly is subtask 4, and auto dealer is subtask 5.

5.2.1. Case Data

The case data is from ‎[21]. Assume that a user needs 1000 cars and submits the requirements to CMP, then the CMP searches several candidate CSs for each subtask shown as Table 3. The amount of each subtask is 4000, 4000, 4000, 1000, and 1000, respectively, and the time consumption for each spare part (hour) is shown in column t of Table 3.


Subtask 1Subtask 2Subtask 3Subtask 4Subtask 5
CStCStCStCStCSt

10.8010.087310.007810.304010.3333
20.7020.077520.007120.2670
30.6330.068530.005830.2812
40.6140.090140.0065
50.5750.082350.0069
60.6460.073460.0069
70.7170.0060
80.7680.0063
90.55

5.2.2. Objective Function

Objective function is the goal of MBSPHE-CSCCM. Normally, it is significant to optimize the QoS according to customer’s preferences. For the sake of discussion, we take the production time as the optimization objective. So, the objective function is defined as follows:where , and Ti is the production time of the ith batch subtask. Aiming at minimizing time consumption, the production results of each CS for subtask i will be delivered to the CS whose production plan is started the earliest and related production time is the largest among the candidate CSs for the following subtask (i+1). So, we firstly establish the time matrix as follows: where every element of contains three variables: the first one is the start time which is initialized to 0; the second one is subtask amount of obtained from individual of IHDETBO; and the third one is the end time of subtasks for each CS which is initialized to the calculation by , where , , and is the corresponding time consumption for each spare part obtained from Table 3. Then, the transportation scheme between subtasks is designed as Algorithm 1.

for  n=2:N
while  
  Examine row (n-1), choose in case of and is the smallest;
  Examine row n, choose in case of , is the smallest and is the largest;
  if  
   if  
    ;
    ;
    ;
   else
    ;
    ;
    ;
     ;
   end
  else
   if  
    ;
    ;
    ;
   else
    ;
    ;
    ;
    ;
   end
  end
end
end
Examine column N, return which is the largest;
5.2.3. Experimental Results

In this experiment, the parameters are set as follows: the population size N is 50, the positive constant c is 0.1, and the max iteration is 1000. Based on the proposed IHDETBO algorithm, case data, and objective function, the experimental result are shown in Tables 4 and 5. Table 4 shows the production time of the 50 schemes which are the corresponding individuals or integer arrays in the last generation. We can conclude that the individual No. 20 is the best one, and the production time is 444.208. The subtask amount of every CS in the best scheme which is indicated as integer in the corresponding genebit of individual No. 20 is shown in Table 5.


No.123456789
T457.318452.676448.705444.982452.278453.831486.805453.236476.361

No.101112131415161718
T483.416450.803445.757449.945487.402450.2486.736449.795451.612

No.192021222324252627
T453.816444.208453.446449.327488.205447.775484.68486.12484.042

No.282930313233343536
T485.717471.496484.962450.663453.67447.113449.442448.972452.468

No.373839404142434445
T453.126446.577470.006454.908447.644451.225449.972457.097450.997

No.4647484950
T482.804478.697458.643454.673453.376


Subtask 1123456789
Amount326464435504546420368462475

Subtask 2123456
Amount2819556061026810322

Subtask 312345678
Amount634382755495716250494274

Subtask 4123
Amount553307140

Subtask 51
Amount1000

Figure 5 shows the batch division and transportation scheme in detail. The circle indicates the candidate CS for every subtask, and the number inside indicates the corresponding subtask amount. The arrow direction indicates the delivery destination for the next subtask and the number on which indicates the delivery amount. The circles marked in yellow color indicate the CS whose time to complete its own task is the latest in one subtask, and the related solid line indicated the production line which takes the longest time. So, we can conclude that the cloud manufacturing task has been divided into several small batches executed parallel and hybrid. Obviously, thanks to the MBSPHE-CSCCM, the production time is reduced a lot.

6. Conclusions and Future Work

With the intense competition in the global market and increasingly serious energy and environmental issues, the integration and sharing of manufacturing resources have been becoming more and more important in manufacturing industry. As one of the new manufacturing paradigms, CMfg has been proposed to address to these problems and has gradually been in focus. In practice, CMfg is a large-scale networked distributed manufacturing. The manufacturing resources which always scatter all over the world have the characteristics of massive, heterogeneous, complexity, and coarse granularity. Besides, the transportation among them is very complex because of today advanced logistic. Generally speaking, CMfg is a typical complex system in complex environment, and the manufacturing resources are encapsulated as CS. In complex system, because the total amount of task may be very large, the problem of service composition also becomes very complex. In this paper, we begin with a discussion of the state-of-the-art CMfg and then introduce the manufacturing scheme named as MBSPHE-CSCCM, in which a mass task can be transformed into multi-batch subtasks which will be parallel-hybrid executed. To address the service composition problem for MBSPHE-CSCCM, a novel optimization method IHDETBO for MBSPHE-CSCCM is proposed. This method can be divided into two phases: the first phase is IDE phase, based on basic concept and operation of DE, factors F and CR are both improved and calculated with adaptive strategy to enhance the population diversity and generate better individuals; the second phase is IT phase, the teacher phase of classical TLBO is adopted, and factor TF will be also improved to make the simulation more in line with the actual. In addition, to adapt the special condition of CMfg, block operation including block encoding and initialization, block mutation, block crossover, block selection, and block teaching operation are also proposed. Finally, with the simulation experiments and a case study, we demonstrate the advantage of the proposed method. MBSPHE-CSCCM plays a very important role in CMfg. Besides, there are also many other problems of CMfg that need to be studied, such as task decomposition, the evaluation of CS QoS, CS selection based on performance matching, and so on, which deserves our further consideration.

Data Availability

The experimental data and case study data used to support the findings of this study are included within the article.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

Acknowledgments

This work was partly supported by the National Natural Science Foundation of China (Grants nos. 61701443, 61876168, and 61403342) and Zhejiang Provincial Natural Science Foundation of China (LY18F030020).

References

  1. B. H. Li, L. Zhang, S. L. Wang et al., “Cloud manufacturing: a new service-oriented networked manufacturing model,” Computer Integrated Manufacturing Systems, vol. 16, no. 1, pp. 1–16, 2010. View at: Google Scholar
  2. R. Lovas, A. Farkas, A. C. Marosi et al., “Orchestrated platform for cyber-physical systems,” Complexity, vol. 2018, Article ID 8281079, 16 pages, 2018. View at: Google Scholar
  3. A. Azizi, “Introducing a novel hybrid artificial intelligence algorithm to optimize network of industrial applications in modern manufacturing,” Complexity, vol. 2017, Article ID 8728209, 18 pages, 2017. View at: Google Scholar | MathSciNet
  4. L. Ribeiro and M. Hochwallner, “On the design complexity of cyberphysical production systems,” Complexity, vol. 2018, Article ID 4632195, 13 pages, 2018. View at: Google Scholar
  5. D. Wang, J. Fan, H. Fu, and B. Zhang, “Research on optimization of big data construction engineering quality management based on RNN-LSTM,” Complexity, vol. 2018, Article ID 9691868, 16 pages, 2018. View at: Google Scholar
  6. S. Cannella, R. Dominguez, J. M. Framinan, and B. Ponte, “Evolving trends in supply chain management: complexity, new technologies, and innovative methodological approaches,” Complexity, vol. 2018, Article ID 7916849, 3 pages, 2018. View at: Google Scholar
  7. A. Bala and I. Chana, “Autonomic fault tolerant scheduling approach for scientific workflows in Cloud computing,” Concurrent Engineering Research and Applications, vol. 23, no. 1, pp. 27–39, 2015. View at: Publisher Site | Google Scholar
  8. F. Tao, Y. Laili, L. Xu, and L. Zhang, “FC-PACO-RM: a parallel method for service composition optimal-selection in cloud manufacturing system,” IEEE Transactions on Industrial Informatics, vol. 9, no. 4, pp. 2023–2033, 2013. View at: Publisher Site | Google Scholar
  9. J. Wu, D. Bin, X. Feng, Z. Wen, and Y. Zhang, “GA based adaptive singularity-robust path planning of apace robot for on-orbit detection,” Complexity, vol. 2018, Article ID 3702916, 11 pages, 2018. View at: Google Scholar
  10. S. Chen and D. Tan, “A SA-ANN-Based modeling method for human cognition mechanism and the PSACO cognition algorithm,” Complexity, vol. 2018, Article ID 6264124, 21 pages, 2018. View at: Google Scholar | MathSciNet
  11. S. M. Abd-Elazim and E. S. Ali, “A hybrid particle swarm optimization and bacterial foraging for power system stability enhancement,” Complexity, vol. 21, no. 2, pp. 245–255, 2015. View at: Publisher Site | Google Scholar
  12. Z.-J. Wang, Z.-Z. Liu, X.-F. Zhou, and Y.-S. Lou, “An approach for composite web service selection based on DGQoS,” The International Journal of Advanced Manufacturing Technology, vol. 56, no. 9–12, pp. 1167–1179, 2011. View at: Publisher Site | Google Scholar
  13. A. S. Oshaba, E. S. Ali, and S. M. Abd Elazim, “PI controller design using artificial bee colony algorithm for MPPT of photovoltaic system supplied DC motor-pump load,” Complexity, vol. 21, no. 6, pp. 99–111, 2016. View at: Publisher Site | Google Scholar
  14. R. Storn and K. Price, “Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces,” Journal of Global Optimization, vol. 11, no. 4, pp. 341–359, 1997. View at: Publisher Site | Google Scholar
  15. R. V. Rao, V. J. Savsani, and D. P. Vakharia, “Teaching-learning-based optimization: an optimization method for continuous non-linear large scale problems,” Information Sciences, vol. 183, no. 1, pp. 1–15, 2012. View at: Publisher Site | Google Scholar | MathSciNet
  16. R. V. Rao and V. D. Kalyankar, “Parameter optimization of modern machining processes using teaching-learning-based optimization algorithm,” Engineering Applications of Artificial Intelligence, vol. 26, no. 1, pp. 524–531, 2013. View at: Google Scholar
  17. Y.-W. Zhao and L.-N. Zhu, “Service-evaluation-based resource selection for cloud manufacturing,” Concurrent Engineering Research and Applications, vol. 24, no. 4, pp. 307–317, 2016. View at: Publisher Site | Google Scholar
  18. L. N. Zhu, Y. W. Zhao, C. Zhao, and G. J. Shen, “A multidimensional extension-based method for resource performance matching in cloud manufacturing,” Concurrent Engineering: Research and Applications, vol. 26, no. 3, pp. 276–286, 2018. View at: Publisher Site | Google Scholar
  19. L. Zhu, P. Li, X. Yang, G. Shen, and Y. Zhao, “EE-RJMTFN: A novel manufacturing risk evaluation method for alternative resource selection in cloud manufacturing,” Concurrent Engineering: Research and Applications, 2018. View at: Publisher Site | Google Scholar
  20. F. Tao, L. Zhang, H. Guo, Y.-L. Luo, and L. Ren, “Typical characteristics of cloud manufacturing and several key issues of cloud service composition,” Computer Integrated Manufacturing Systems, vol. 17, no. 3, pp. 447–486, 2011. View at: Google Scholar
  21. L. Zhu, W. Wang, and G. Shen, “Resource optimization combination method based on improved differential evolution algorithm for cloud manufacturing,” Computer Integrated Manufacturing Systems, vol. 23, no. 1, pp. 203–214, 2017. View at: Google Scholar
  22. G. Breiter and M. Behrendt, “Life cycle and characteristics of services in the world of cloud computing,” IBM Journal of Research and Development, vol. 53, no. 4, pp. 1–8, 2009. View at: Google Scholar
  23. A. K. Qin, V. L. Huang, and P. N. Suganthan, “Differential evolution algorithm with strategy adaptation for global numerical optimization,” IEEE Transactions on Evolutionary Computation, vol. 13, no. 2, pp. 398–417, 2009. View at: Publisher Site | Google Scholar
  24. J. Q. Zhang and A. C. Sanderson, “JADE: adaptive differential evolution with optional external archive,” IEEE Transactions on Evolutionary Computation, vol. 13, no. 5, pp. 945–958, 2009. View at: Publisher Site | Google Scholar
  25. J. Zhou and X. Yao, “Multi-population parallel self-adaptive differential artificial bee colony algorithm with application in large-scale service composition for cloud manufacturing,” Applied Soft Computing, vol. 56, pp. 379–397, 2017. View at: Publisher Site | Google Scholar
  26. Y. Wang, Z. X. Cai, and Q. F. Zhang, “Differential evolution with composite trial vector generation strategies and control parameters,” IEEE Transactions on Evolutionary Computation, vol. 15, no. 1, pp. 55–66, 2011. View at: Publisher Site | Google Scholar
  27. D. P. Rai, “Comments on “A note on multi-objective improved teaching-learning based optimization algorithm (MO-ITLBO)”,” International Journal of Industrial Engineering Computations, vol. 8, no. 2, pp. 179–190, 2017. View at: Google Scholar
  28. J. Brest, S. Greiner, B. Bošković, M. Mernik, and V. Zumer, “Self-adapting control parameters in differential evolution: a comparative study on numerical benchmark problems,” IEEE Transactions on Evolutionary Computation, vol. 10, no. 6, pp. 646–657, 2006. View at: Publisher Site | Google Scholar
  29. E. S. H. Hou, N. Ansari, and H. Ren, “A genetic algorithm for multiprocessor scheduling,” IEEE Transactions on Parallel and Distributed Systems, vol. 5, no. 2, pp. 113–120, 1994. View at: Publisher Site | Google Scholar
  30. R. V. Rao and V. Patel, “An improved teaching-learning-based optimization algorithm for solving unconstrained optimization problems,” Scientia Iranica, Transactions D: Computer Science & Engineering and Electrical Engineering, vol. 20, no. 3, pp. 710–720, 2013. View at: Publisher Site | Google Scholar
  31. J. Zhou and X. Yao, “Hybrid teaching–learning-based optimization of correlation-aware service composition in cloud manufacturing,” The International Journal of Advanced Manufacturing Technology, vol. 91, no. 9-12, pp. 3515–3533, 2017. View at: Publisher Site | Google Scholar

Copyright © 2019 Li-Nan Zhu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


More related articles

501 Views | 254 Downloads | 2 Citations
 PDF  Download Citation  Citation
 Download other formatsMore
 Order printed copiesOrder

Related articles

We are committed to sharing findings related to COVID-19 as quickly and safely as possible. Any author submitting a COVID-19 paper should notify us at help@hindawi.com to ensure their research is fast-tracked and made available on a preprint server as soon as possible. We will be providing unlimited waivers of publication charges for accepted articles related to COVID-19. Sign up here as a reviewer to help fast-track new submissions.