# Virtual Enterprise Risk Management Using Artificial Intelligence

Authors: Hanning Chen; Yunlong Zhu; Kunyuan Hu; Xuhui Li
Journal: Mathematical Problems in Engineering
 (2010)

---

## Abstract

Virtual enterprise (VE) has to manage its risk effectively in order to guarantee the profit. However, restricting the risk in a VE to the acceptable level is considered difficult due to the agility and diversity of its distributed characteristics. First, in this paper, an optimization model for VE risk management based on distributed decision making model is introduced. This optimization model has two levels, namely, the top model and the base model, which describe the decision processes of the owner and the partners of the VE, respectively. In order to solve the proposed model effectively, this work then applies two powerful artificial intelligence optimization techniques known as evolutionary algorithms (EA) and swarm intelligence (SI). Experiments present comparative studies on the VE risk management problem for one EA and three state-of-the-art SI algorithms. All of the algorithms are evaluated against a test scenario, in which the VE is constructed by one owner and different partners. The simulation results show that thePS2O algorithm, which is a recently developed SI paradigm simulating symbiotic coevolution behavior in nature, obtains the superior solution for VE risk management problem than the other algorithms in terms of optimization accuracy and computation robustness.


---

## Body

## 1. Introduction

A virtual enterprise (VE) [1] is a dynamic alliance of autonomous, diverse, and possibly geographically dispersed member companies composed of one owner and several partners that pool their resource to take advantage of a market opportunity. Each member company will provide its own core competencies in areas such as marketing, engineering, and manufacturing to the VE. When the market opportunity has passed, the VE is dissolved. With the rapidly increasing competitiveness in global manufacturing area, VE is becoming essential approach to meet the market’s requirements for quality, responsiveness, and customer satisfaction. As the VE environment continues to grow in size and complexity, the importance of managing such complexity increases. In the VE environment, there are various sources of risks that may threaten the success of the projects, such as market risk, credit risk, operational risk, and others [2]. Therefore, an effective approach that can actually deal with the risk measurement and management problem is a major concern in VE.Up to date, risk management of VE has received considerable research attentions. Various models and algorithms are developed to provide a more scientific and effective way for managing the risk of a VE. Ma and Zhang [3] analyzed all kinds of risks during the organization of a VE. They then proposed the defensive measures on the established risk of a VE in order to offer a reference to risk management for the new form of the VE organization. Huang et al. [4] introduced a fuzzy synthetic evaluation model for evaluating the risk of the VE, which focuses on the project mode and the uncertain characteristics of the VE. Ip et al. [1] proposed a risk-based partner selection model, which considers minimizing the risk in selecting partners and ensuring the due date of a project in a VE. By exploring the characteristics of the problem considered and the knowledge of project scheduling, a Rule-based Genetic Algorithm with embedded project scheduling is developed to solve the problem. Sun et al. [5] employed a constructional distributed decision making (DDM) model for risk management of VE that focuses on the situation of team or enforced team relationship between partners. A taboo search algorithm was designed to solve the model. Lu et al. [6] introduced a DDM model for VE risk management that has two levels, namely, the top-model and the base-model, which describe the decision processes of the owner and the partners, respectively. A particle swarm optimization approach was then designed to solve the resulting optimization problem.Nature serves as a fertile source of concepts, principles, and mechanisms for designing artificial computation systems to tackle complex computational problems. In the past few decades, many nature-inspired computational techniques were designed to deal with practical problems. Among them, the most successful are evolutionary algorithms (EA) and swarm intelligence (SI). Evolutionary algorithms are search methods that take their inspiration from natural selection and survival of the fittest in the biological world. Several different types of EA methods were developed independently. These include genetic programming (GP) [7], evolutionary programming (EP) [8], evolution strategies (ES) [9], and genetic algorithm (GA) [10]. Swarm intelligence (SI), which is inspired by the collective behavior of social systems (such as fish schools, bird flocks, and ant colonies), is an innovative computational way to solve hard optimization problems. Currently, SI includes several different algorithms, namely, ant colony optimization (ACO) [11], particle swarm optimization (PSO) [12, 13], bacterial foraging algorithm (BFA) [14–16], and artificial bee colony algorithm (ABC) [17]. In our previous works [18, 19], we also proposed a novel hierarchical swarm optimization algorithm called PS2O, which extends the single population PSO to interacting multi-swarm model by constructing hierarchical interaction topologies and enhanced dynamical update equations. By incorporating the new degree of complexity, PS2O can avoid premature convergence drawback of traditional SI algorithms and accommodate a considerable potential for solving more complex problems.In this paper, we develop an optimization model for distributed decision making of risk management in VE based on the evolutionary and swarm-based methods. Here the VE risk management problem is described and formulated as a two-level DDM model, which is in order to minimize the aggregate risk level of the VE to a reasonable lower level. Then, in order to solve this complex problem effectively and efficiently, the optimization procedure based on EA and SI systems is developed. Experiments are performed on three VE risk management cases with different scales. In the experiments, a comprehensive comparative study on the performances of four well-known evolutionary and swarm-based algorithms, namely, GA, PSO, ABC, and the recently proposed PS2O, is presented. Results show that the performance of the PS2O is better than or similar to those of other EA and SI algorithms with the advantage of maintaining suitable diversity of the whole population in optimization process.The paper is organized as follows. Section2 describes the two-level DDM model of VE risk management. In Section 3, the GA, PSO, ABC, and PS2O algorithms are summarized. Section 4 describes a detailed design optimization procedure of risk management in VE by evolutionary and swarm-based algorithms. In Section 5, the simulation results obtained are presented and discussed. Finally, Section 6 outlines the conclusions.


## 2. Problem Formulation of Risk Management in a VE

In this paper, the two-level risk management model suggested by Lu et al. [6] is employed to evaluate the performance of the proposed methods. This model can be described as a two-level distributed decision making (DDM) system that is depicted in Figure 1.Figure 1
DDM model for risk management in a VE.In the top-level, the decision maker is the owner who allocates the budget (i.e., the risk cost investment) to each member of VE. The decision variables are therefore given byI=(I0,I1,…,In). Here I0 denotes the budget to owner and Ii(i=1,2,…,n) represents the budget to Partner i. That is, there are n+1 members in a VE. Then the top-level objective of risk management in a VE is to allocate the optimal budget to each member in order to minimize the total risk level of the VE. The top-level model can be formulated as a continuous optimization problem that is given in what follows:(2.1)minIFT(I)=∑i=0nwiRi(Ii),(2.2)s.t.∑i=0nIi≤Imax,(2.3)Ri(Ii)≤Rmax,
where Ri(Ii) is the risk level of ith member under risk cost investment Ii, wi represents the weight of member i, Imax is the maximum total investment budget, and Rmax stands for the maximum risk level for each member in the VE.In the base-level, the partners of VE are making their decisions according to the top-level’s instruction (i.e., the budget to partners). The base-level risk management is that the decision maker selects the optimal series of risk control actionsAi=(a1i,a2i,…,ami) for each partner i(i=1,2,…,n) to minimize the risk level with respect to the allocated budget Ii. Here m is the number of risk factors that affect each partner’s security. Then the base-level model can be formulated as a discrete optimization problem that is given in what follows:(2.4)minAFB(A)=∑i=1nwiRi(Ai∣Ii),s.t.∑j=1mCji(aji)≤Ii,aji∈{0,1,2,…,W},
where Ri(Ai∣Ii) is the risk level of ith partner under risk control action Ai with respect to the top-level investment budget Ii, Cji(aji) represents the cost of partner i under the risk control action aji for the risk factor j, and W stands for the number of available actions for each risk factor of each partner.


## 3. Description of the Involved Evolutionary and Swarm Intelligence Algorithms

### 3.1. The Genetic Algorithm

Genetic algorithm is a particular class of evolutionary algorithms that use techniques inspired by evolutionary biology such as inheritance, mutation, selection, and crossover. A basic GA consists of five components. These are a random number generator, a fitness evaluation unit, genetic operators for reproduction, crossover, and mutation operations. The basic algorithm is summarized in Algorithm1.Algorithm 1
(1)Begin(2) Initialize population(3)Repeat(4)  Evaluation(5)  Reproduction(6)  Crossover(7)  Mutation(8)Untilrequirements are met(9)EndAt the start of the algorithm, the population initialization step randomly generates a set of number strings. Each string is a representation of a solution to the optimization problem being addressed. Continuous and discrete strings are both commonly employed. Associated with each string is a fitness value computed by the evaluation unit. The reproduction operator performs a natural selection function known as seeded selection. Individual strings are copied from one set (representing a generation of solutions) to the next according to their fitness values; the better the fitness value, the greater the probability of a string being selected for the next generation. The crossover operator chooses pairs of strings at random and produces new pairs. The simplest crossover operation is to cut the original parent strings at a randomly selected point and to exchange their tails. The number of crossover operations is governed by a crossover rate. The mutation operator, which is determined by a mutation rate, randomly mutates or reverses the values of bits in a string. A phase of the algorithm consists of applying the evaluation, reproduction, crossover, and mutation operations. A new generation of solutions is produced with each phase of the algorithm [20].


### 3.2. The Artificial Bee Colony Algorithm

Artificial bee colony (ABC) algorithm is one of the most recently introduced SI algorithms. ABC simulates the intelligent foraging behavior of a honeybee swarm. In ABC model, the foraging bees are classified into three categories: employed bees, onlookers, and scout bees. The main steps of the algorithm are as shown in Algorithm2.Algorithm 2
(1) Begin(2) Initialize population(3) Repeat(4)  Place the employed bees on their food sources(5)  Place the onlooker bees on the food sources depending on their nectar amounts(6)  Send the scouts to the search area for discovering new food sources(7)  Memorize the best food source found so far(8) Until requirements are met(9) EndABC starts by associating all employed bees with randomly generated food sources (solution). In mathematical terms,S is total number of food sources; the ith food source position can be represented as Xi=(xi1,xi2,…,xiD) in the D-dimensional space. F(Xi) refers to the nectar amount of the food source located at Xi. In each iteration t, every employed bee determines a food source in the neighborhood of its current food source and evaluates its nectar amount (fitness). This comparison of two food source position by each employed bee is manipulated according to the following equations:
(3.1)xij(t)=xij(t-1)+rand[-1,1](xij(t-1)-xkj(t-1)),
where k∈[1,2,…,S] and j∈[1,2,…,D] are randomly chosen indexes, and k≠j. Equation (3.1) controls the production of neighbor food sources around Xi. If its new fitness value is better than the best fitness value achieved so far, then the bee moves to this new food source abandoning the old one; otherwise it remains in its old food source. When all employed bees have finished this process, they share the fitness information with the onlookers; each of which selects a food source according to probability pi defined as(3.2)pi=F(Xi)∑n=1SF(Xn).
For each onlooker that selects the food source Xi, it will find a new neighborhood food source in the vicinity of Xi by using (3.1). Also, the greedy selection mechanism is employed by this onlooker as the selection operation between the old and the new food sources. With this scheme, good food sources will get more onlookers than the bad ones. In ABC, if a food source position cannot be improved further through a predetermined number of cycles, then that food source is assumed to be abandoned and the scout bee will randomly choose a new food source position in the search space.


### 3.3. The Particle Swarm Optimization

The canonical PSO is a successful SI-based technique. In PSO model, the rules that govern particles’ movements are inspired by models of fish schooling and bird flocking [21]. Each particle has a position and a velocity, and experiences linear spring-like attractions towards two attractors:(i)
its previous best position,(ii)
best position of its neighbors.In mathematical terms, theith particle is represented as xi=(xi1,xi2,…,xiD) in the D-dimensional space, where xid∈[ld,ud], d∈[1,D], and ld, ud are the lower and upper bounds for the dth dimension, respectively. The rate of velocity for particle i is represented as vi=(vi1,vi2,…,viD) clamped to a maximum velocity Vmax which is specified by the user. In each time step t, the particles are manipulated according to the following equations:
(3.3)vid(t)=χ(vid(t-1)+R1c1(pid-xid(t-1))+R2c2(pgd-xid(t-1))),xid(t)=xid(t-1)+vid(t),
where R1 and R2 are random values between 0 and 1, c1 and c2 are learning rates, which control how far a particle will move in a single iteration, pid is the best position found so far of the ith particle, pgd is the best position of any particles in its neighborhood, and χ is called constriction factor, given by:
(3.4)χ=2|2-φ-φ2-4φ|,
where φ=c1+c2, φ>4. Main steps of the PSO procedure are as shown in Algorithm 3.Algorithm 3
(1)   Begin(2)   Initialize Population(3)   Repeat(4)   Calculate fitness values of particles(5)   Modify the best particles in the swarm(6)   Choose the best particle(7)   Calculate the velocities of particles(8)   Update the particle positions(9)   Until requirements are met(10) EndKennedy and Eberhart [13] proposed a binary PSO in which a particle moves in a state space restricted to zero and one on each dimension, in terms of the changes in probabilities that a bit will be in one state or the other. The velocity formula (2.1) remains unchanged except that xid, pid, and pgd are integers in {0,1} and vid must be constrained to the interval [0.0,1.0]. This can be accomplished by introducing a sigmoid function S(v), and the new particle position is calculated using the following rule:
(3.5)ifrand<S(vid),thenxid=1,elsexid=0,
where rand is a random number selected from a uniform distribution in [0.0,1.0] and the function S(v) is a sigmoid-limiting transformation as follows:(3.6)S(v)=11+e-v.


### 3.4. The Multi-Swarm Optimizer: PS2O

Straight PSO uses the analogy of a single-species population and the suitable definition of the particle dynamics and the particle information network (interaction topology) to reflect the social evolution in the population. However, the situation in nature is much more complex than what this simple metaphor seems to suggest. Indeed, in biological populations there is a continuous interplay between individuals of the same species, and also encounters and interactions of various kinds with other species [22]. The points at issue can be clearly seen when one observes such ecological systems as symbiosis, host-parasite systems, and prey-predator systems, in which two organisms mutually support each other; one exploits the other, or they fight against each other. For instance, mutualistic relations between plants and fungi are very common. The fungus invades and lives among the cortex cells of the secondary roots and, in turn, helps the host plant absorb minerals from the soil. Another well-known example is the “association” between the Nile crocodile and the Egyptian plover, a bird that feeds on any leeches attached to the crocodile’s gums, thus keeping them clean. This kind of “cleaning symbiosis” is also common in fish.Inspired by mutualism phenomenon, in the previous works [18, 19] we extend the single population PSO to the interacting multi-swarm model by constructing hierarchical information networks and enhanced particle dynamics. In our multi-swarms approach, the interaction occurs not only between the particles within each swarm but also between different swarms. That is, the information exchanges on a hierarchical topology of two levels (i.e., the individual level and the swarm level). Many patterns of connection can be used in different levels of our model. The most common ones are rings, two-dimensional and three-dimensional lattices, stars, and hypercubes. Two example hierarchical topologies are illustrated in Figure 2. In Figure 2(a), four swarms at the upper level are connected by a ring, while each swarm (possesses four individual particles at the lower level) is structured as a star. While in Figure 2(b), both levels are structured as rings. Then, we suggest in the proposed model that each individual moving through the solution space should be influenced by three attractors:(i)
its own previous best position,(ii)
best position of its neighbors from its own swarm,(iii)
best position of its neighbor swarms.Hierarchical topology of the multi-swarm.
(a)(b)In mathematical terms, our multi-swarm model is defined as a triplet〈P,T,C〉, where P={S1,S2,…,SM} is a collection of M swarms, and each swarm possesses a members set Sk={X1k,X2k,…,XNk}of N individuals. T is the hierarchical topology of the multi-swarm. C is the enhanced control low of the particle dynamics, which can be formulated as
(3.7)vidk(t)=χ(vidk(t-1)+R1c1(pidk-xidk(t-1))+R2c2(pgdk-xidk(t-1))+R3c3(pgdθ-xidk(t-1))),(3.8)xidk(t)=xidk(t-1)+vidk(t),
where xidk represents the position of the ith particle of the kth swarm, pidk is the personal best position found so far by xidk, pgdk is the best position found so far by this particle’s neighbors within swarm k, pgdθ is the best position found so far by the other swarms in the neighborhood of swarm k (here θ is the index of the swarm which the best position belongs to), c1 is the individual learning rates, c2 is the social learning rate between particles within each swarm, c3 is the social learning rate between different swarms, and R1,R2,R3∈ℜd are random vectors uniformly distributed in [0,1]. Constriction factor χ is calculated by
(3.9)χ=2|2-φ-φ2-4φ|,
where φ=c1+c2+c3, φ>4. Here, the term R1c1(pidk-xidk) is associated with cognition since it takes into account the individual’s own experiences; the term R2c2(pgdk-xidk) represents the social interaction within swarm k; the term R3c3(pgdθ-xidk) takes into account the symbiotic coevolution between dissimilar swarms. The pseudocode for the PS2O algorithm is listed in Algorithm 4.Algorithm 4
(1) Begin(2) Randomizen swarms each possesses m particles;(3)    While (the termination conditions are not met)(4)     For (each swarm k)(5)      Find in the kth swarm neighborhood, the point with the best fitness;(6)      Set this point as pgdθ;(7)          For (each particle i of swarm k)(8)        Find in the particle neighborhood, the point with the best fitness;(9)        Set this point as pgdk;(10)      Update particle velocity using equations (3.7);(11)      Update particle position using equations (3.8);(13)       End For(14)     End For(15)    End While(16)  EndWe should note that, for solving discrete problems, we still use (3.5) and (3.6) to discretize the position vectors in PS2O algorithm.


## 3.1. The Genetic Algorithm

Genetic algorithm is a particular class of evolutionary algorithms that use techniques inspired by evolutionary biology such as inheritance, mutation, selection, and crossover. A basic GA consists of five components. These are a random number generator, a fitness evaluation unit, genetic operators for reproduction, crossover, and mutation operations. The basic algorithm is summarized in Algorithm1.Algorithm 1
(1)Begin(2) Initialize population(3)Repeat(4)  Evaluation(5)  Reproduction(6)  Crossover(7)  Mutation(8)Untilrequirements are met(9)EndAt the start of the algorithm, the population initialization step randomly generates a set of number strings. Each string is a representation of a solution to the optimization problem being addressed. Continuous and discrete strings are both commonly employed. Associated with each string is a fitness value computed by the evaluation unit. The reproduction operator performs a natural selection function known as seeded selection. Individual strings are copied from one set (representing a generation of solutions) to the next according to their fitness values; the better the fitness value, the greater the probability of a string being selected for the next generation. The crossover operator chooses pairs of strings at random and produces new pairs. The simplest crossover operation is to cut the original parent strings at a randomly selected point and to exchange their tails. The number of crossover operations is governed by a crossover rate. The mutation operator, which is determined by a mutation rate, randomly mutates or reverses the values of bits in a string. A phase of the algorithm consists of applying the evaluation, reproduction, crossover, and mutation operations. A new generation of solutions is produced with each phase of the algorithm [20].


## 3.2. The Artificial Bee Colony Algorithm

Artificial bee colony (ABC) algorithm is one of the most recently introduced SI algorithms. ABC simulates the intelligent foraging behavior of a honeybee swarm. In ABC model, the foraging bees are classified into three categories: employed bees, onlookers, and scout bees. The main steps of the algorithm are as shown in Algorithm2.Algorithm 2
(1) Begin(2) Initialize population(3) Repeat(4)  Place the employed bees on their food sources(5)  Place the onlooker bees on the food sources depending on their nectar amounts(6)  Send the scouts to the search area for discovering new food sources(7)  Memorize the best food source found so far(8) Until requirements are met(9) EndABC starts by associating all employed bees with randomly generated food sources (solution). In mathematical terms,S is total number of food sources; the ith food source position can be represented as Xi=(xi1,xi2,…,xiD) in the D-dimensional space. F(Xi) refers to the nectar amount of the food source located at Xi. In each iteration t, every employed bee determines a food source in the neighborhood of its current food source and evaluates its nectar amount (fitness). This comparison of two food source position by each employed bee is manipulated according to the following equations:
(3.1)xij(t)=xij(t-1)+rand[-1,1](xij(t-1)-xkj(t-1)),
where k∈[1,2,…,S] and j∈[1,2,…,D] are randomly chosen indexes, and k≠j. Equation (3.1) controls the production of neighbor food sources around Xi. If its new fitness value is better than the best fitness value achieved so far, then the bee moves to this new food source abandoning the old one; otherwise it remains in its old food source. When all employed bees have finished this process, they share the fitness information with the onlookers; each of which selects a food source according to probability pi defined as(3.2)pi=F(Xi)∑n=1SF(Xn).
For each onlooker that selects the food source Xi, it will find a new neighborhood food source in the vicinity of Xi by using (3.1). Also, the greedy selection mechanism is employed by this onlooker as the selection operation between the old and the new food sources. With this scheme, good food sources will get more onlookers than the bad ones. In ABC, if a food source position cannot be improved further through a predetermined number of cycles, then that food source is assumed to be abandoned and the scout bee will randomly choose a new food source position in the search space.


## 3.3. The Particle Swarm Optimization

The canonical PSO is a successful SI-based technique. In PSO model, the rules that govern particles’ movements are inspired by models of fish schooling and bird flocking [21]. Each particle has a position and a velocity, and experiences linear spring-like attractions towards two attractors:(i)
its previous best position,(ii)
best position of its neighbors.In mathematical terms, theith particle is represented as xi=(xi1,xi2,…,xiD) in the D-dimensional space, where xid∈[ld,ud], d∈[1,D], and ld, ud are the lower and upper bounds for the dth dimension, respectively. The rate of velocity for particle i is represented as vi=(vi1,vi2,…,viD) clamped to a maximum velocity Vmax which is specified by the user. In each time step t, the particles are manipulated according to the following equations:
(3.3)vid(t)=χ(vid(t-1)+R1c1(pid-xid(t-1))+R2c2(pgd-xid(t-1))),xid(t)=xid(t-1)+vid(t),
where R1 and R2 are random values between 0 and 1, c1 and c2 are learning rates, which control how far a particle will move in a single iteration, pid is the best position found so far of the ith particle, pgd is the best position of any particles in its neighborhood, and χ is called constriction factor, given by:
(3.4)χ=2|2-φ-φ2-4φ|,
where φ=c1+c2, φ>4. Main steps of the PSO procedure are as shown in Algorithm 3.Algorithm 3
(1)   Begin(2)   Initialize Population(3)   Repeat(4)   Calculate fitness values of particles(5)   Modify the best particles in the swarm(6)   Choose the best particle(7)   Calculate the velocities of particles(8)   Update the particle positions(9)   Until requirements are met(10) EndKennedy and Eberhart [13] proposed a binary PSO in which a particle moves in a state space restricted to zero and one on each dimension, in terms of the changes in probabilities that a bit will be in one state or the other. The velocity formula (2.1) remains unchanged except that xid, pid, and pgd are integers in {0,1} and vid must be constrained to the interval [0.0,1.0]. This can be accomplished by introducing a sigmoid function S(v), and the new particle position is calculated using the following rule:
(3.5)ifrand<S(vid),thenxid=1,elsexid=0,
where rand is a random number selected from a uniform distribution in [0.0,1.0] and the function S(v) is a sigmoid-limiting transformation as follows:(3.6)S(v)=11+e-v.


## 3.4. The Multi-Swarm Optimizer: PS2O

Straight PSO uses the analogy of a single-species population and the suitable definition of the particle dynamics and the particle information network (interaction topology) to reflect the social evolution in the population. However, the situation in nature is much more complex than what this simple metaphor seems to suggest. Indeed, in biological populations there is a continuous interplay between individuals of the same species, and also encounters and interactions of various kinds with other species [22]. The points at issue can be clearly seen when one observes such ecological systems as symbiosis, host-parasite systems, and prey-predator systems, in which two organisms mutually support each other; one exploits the other, or they fight against each other. For instance, mutualistic relations between plants and fungi are very common. The fungus invades and lives among the cortex cells of the secondary roots and, in turn, helps the host plant absorb minerals from the soil. Another well-known example is the “association” between the Nile crocodile and the Egyptian plover, a bird that feeds on any leeches attached to the crocodile’s gums, thus keeping them clean. This kind of “cleaning symbiosis” is also common in fish.Inspired by mutualism phenomenon, in the previous works [18, 19] we extend the single population PSO to the interacting multi-swarm model by constructing hierarchical information networks and enhanced particle dynamics. In our multi-swarms approach, the interaction occurs not only between the particles within each swarm but also between different swarms. That is, the information exchanges on a hierarchical topology of two levels (i.e., the individual level and the swarm level). Many patterns of connection can be used in different levels of our model. The most common ones are rings, two-dimensional and three-dimensional lattices, stars, and hypercubes. Two example hierarchical topologies are illustrated in Figure 2. In Figure 2(a), four swarms at the upper level are connected by a ring, while each swarm (possesses four individual particles at the lower level) is structured as a star. While in Figure 2(b), both levels are structured as rings. Then, we suggest in the proposed model that each individual moving through the solution space should be influenced by three attractors:(i)
its own previous best position,(ii)
best position of its neighbors from its own swarm,(iii)
best position of its neighbor swarms.Hierarchical topology of the multi-swarm.
(a)(b)In mathematical terms, our multi-swarm model is defined as a triplet〈P,T,C〉, where P={S1,S2,…,SM} is a collection of M swarms, and each swarm possesses a members set Sk={X1k,X2k,…,XNk}of N individuals. T is the hierarchical topology of the multi-swarm. C is the enhanced control low of the particle dynamics, which can be formulated as
(3.7)vidk(t)=χ(vidk(t-1)+R1c1(pidk-xidk(t-1))+R2c2(pgdk-xidk(t-1))+R3c3(pgdθ-xidk(t-1))),(3.8)xidk(t)=xidk(t-1)+vidk(t),
where xidk represents the position of the ith particle of the kth swarm, pidk is the personal best position found so far by xidk, pgdk is the best position found so far by this particle’s neighbors within swarm k, pgdθ is the best position found so far by the other swarms in the neighborhood of swarm k (here θ is the index of the swarm which the best position belongs to), c1 is the individual learning rates, c2 is the social learning rate between particles within each swarm, c3 is the social learning rate between different swarms, and R1,R2,R3∈ℜd are random vectors uniformly distributed in [0,1]. Constriction factor χ is calculated by
(3.9)χ=2|2-φ-φ2-4φ|,
where φ=c1+c2+c3, φ>4. Here, the term R1c1(pidk-xidk) is associated with cognition since it takes into account the individual’s own experiences; the term R2c2(pgdk-xidk) represents the social interaction within swarm k; the term R3c3(pgdθ-xidk) takes into account the symbiotic coevolution between dissimilar swarms. The pseudocode for the PS2O algorithm is listed in Algorithm 4.Algorithm 4
(1) Begin(2) Randomizen swarms each possesses m particles;(3)    While (the termination conditions are not met)(4)     For (each swarm k)(5)      Find in the kth swarm neighborhood, the point with the best fitness;(6)      Set this point as pgdθ;(7)          For (each particle i of swarm k)(8)        Find in the particle neighborhood, the point with the best fitness;(9)        Set this point as pgdk;(10)      Update particle velocity using equations (3.7);(11)      Update particle position using equations (3.8);(13)       End For(14)     End For(15)    End While(16)  EndWe should note that, for solving discrete problems, we still use (3.5) and (3.6) to discretize the position vectors in PS2O algorithm.


## 4. Risk Management in VE Base on Evolutionary and SI Algorithms

The detailed design of Risk management algorithm based on EA and SI algorithms is introduced in this section. Since the risk management model described in Section2 has a two-level hierarchical structure, the proposed EA and SI-based risk management algorithm is composed of two types of evolving population that search in different levels, respectively, namely, the upper-population and the lower-population. This designed algorithm reflects a two-phase search process, that is, top-level searching phase and base-level searching phase. In the top-level searching phase, the upper-population searches a continuous space for the optimal investment budget allocation by the sponsor for all VE members. While in the base-level searching phase, the lower-population receives information from upper-population and searches the discrete space for a best action combination for risk management of all VE partners.


### 4.1. Chromosome Representation Scheme and Model Transformation

#### 4.1.1. Definition of Continuous Individual

In upper-population, each individual has a dimension equal ton+1 (i.e., the number of VE members). Each individual is a possible allocation of investment budget for all members that have a real number representation. The ith individual of the upper-population T is defined as follows:(4.1)XiT=(xi1T,xi2T,…,xi(n+1)T),XiT∈ℜn+1.For example, a real-number particle (286.55, 678.33, 456.78, 701.21, 567.62) is an investment budget possible allocation of a VE consisting of 5 members. The first bit means that the owner received investment of 286.55 units. The 2 to 5 bits mean that the amounts of investment allocated to partner 1 to 4 are 678.33, 456.78, 701.21, and 567.62, respectively.


#### 4.1.2. Definition of Discrete Individual

For the lower-population, in order to appropriately represent the action combination by a particle, we design an “action-to-risk-to-partner” representation for the discrete individual. Each discrete individual in each lower-population has a dimension equal to the number ofn×m×W, where W is the number of available actions for each risk factor, m is the number of risk factors of each partner, and n is the number of VE partners. The ith individual of the lower-population L is defined as follows:(4.2)XiL=(xi(111)L,xi(112)L,…,xi(n×m×W)L),xi(αβγ)L∈{0,1},
where xi(αβγ)L equals 1 if the risk factor β of VE partner α is solved by the γth action and 0 otherwise. That is, each partner can only select one action for each risk factor or do nothing with this factor. For example, set n=2, m=4, and W=4; suppose that the action combination of two partners is (2314, 2401), where 0 stands for no action and is selected for the third risk factor of the second partner in VE. By our definition, we have xi(112)L=xi(123)L=xi(131)L=xi(144)L=xi(212)L=xi(224)L=xi(241)L=1 and all other xi(αβγ)L=0 (see Figure 3).Definition of a discrete particle (2314, 2401) for the action combination of two individuals.
(a)(b)


#### 4.1.3. Model Transformation

Then, the base-level objectives, that is, (2.4), formulated in Section 2 are equivalent to the following optimization problem:(4.3)minXFB(XiL)=∑α=1nwαRα(XiαL∣XiαT)=∑α=1n∑β=1m∑λ=1lwαuβfβλ(|xiαβL|)dλ+φ∑α=1n(∑β=1mCβα(|xiαβL|)-xiαT)+,
where uβ is the weight of the risk factor β, dλ is the value corresponding to the risk rating λ, lis the number of risk ratings, and φ is the punishment coefficient. xiαβL=(xiαβ1L,xiαβ2L,…,xiαβWL) and |xiαβL| is defined as the position index of 1 in xiαβL. For example, if xiαβL= (0010), the value of |xiαβkL| is 3. Here fβλ(|xiαβL|) is approximated by the convex decreasing function(4.4)fβλ(|xiαβL|)=exp(-θβλ|xiαβL|)
to assess the probability of risk occurrence at risk rating λ under action |xiαβL|. Here the parameter θβλ is used to describe the effects of different risk factors under different risk ratings. The cost of the action Cβα(|xiαβL|) is assumed to be a concave increasing function of the corresponding action, which is approximated by(4.5)Cβα(|xiαβL|)=100(1-exp(-τβα|xiαβL|)),
and the parameter τβα describes the effects of different risk factors of different partners. The notation (x)+ is defined as follows:(4.6)(x)+={xifx>0,0else.And the top-level objectives, that is, (2.1)–(2.3), formulated in Section 2 are equivalent to the following optimization problem:(4.7)minXFT(XiT)=∑α=0nwαRα(Xi(α+1)T)=w0R0(Xi1T)+FB(XiL*)+ϕ(∑α=1n+1xiαT-Imax)++η∑α=1n(∑β=1m∑λ=1lwαuβfβλ(|xiαβL|)dλ-Rmax)+,
where ϕ and η are the punishment coefficients and XiL* is the last best base-level decision. Here the risk level of the owner R0(Xi1T) is approximated by a convex decreasing function as follows:(4.8)R0(Xi1T)=exp(-0.001Xi1T).In order to easily use EA and SI algorithms to treat the risk management problem in VE, it is clear that the rewritten model, that is, (4.3)–(4.8), is much complex than the original model, that is, (2.1)–(2.4), for there are more variables described in it.


### 4.2. Risk Management Procedure

The overall risk management process based on EA and SI algorithms can be described as follows.Step 1.
The first step in top-level is to randomly initialize the EA and SI-based upper-population. Each individualXiT in the top-level is an instruction and is communicated to the base-level to drive a base-level search process (Steps 2–4).Step 2.
For each top-levelinstructionXiT, the base-level randomly initializes a corresponding lower-population. At each iteration in base-level, for each particle XiL, evaluate its fitness using the base-level optimization function, that is, (4.3).Step 3.
Compare the evaluated fitness values for all individuals in lower-population. Then update each base-level individual by its updating rules according to the selected EA and SI algorithms. For our problem, each partner can only select one action for each risk factor or do nothing with this factor. In order to take care of this problem, for each particle, actionγ is selected for risk factor β of partner α according to following probability:
(4.9)pi(αβγ)=s(vi(αβγ)L)∑γ=1Ws(vi(αβγ)L).
Then the position of each base-level particle is updated by Algorithm 5.Algorithm 5
(1)  Begin(2)  Let Xtemp be a zero vector that has a dimension equal to n×m×W.(3)   For (α=1 to n)(4)   For (β=1 to m)(5)    For (γ=1 to W)(6)     If (rand≤pi(αβγ))// Actionγ is selected for risk β of partner α(7)      Xαβγtempt=1;(8)     Break;(9)     End if(10)  End for(11) End for(12)  End for(13) XiL=Xtemp(14) ENDStep 4.
The base-level search process is repeated until the maximum number of base-level iteration is met. Then send the last best base-level decision variableXiL* to the top-level for the fitness computation of the top-level individual XiT.Step 5.
With the base-level reactionXiL*, each top-level individual XiT is evaluated by the following top-level fitness function, that is, (4.7).Step 6.
Compare the evaluated fitness values for all individuals in upper-population. Then update each top-level individual by its updating rules according to the selected EA and SI algorithms. The top-level computation is repeated until the maximum number of top-level iteration is met.The flowchart of this risk management process is illustrated in the diagram given in Figure4.Figure 4
The risk management process based on EA and SI.


## 4.1. Chromosome Representation Scheme and Model Transformation

### 4.1.1. Definition of Continuous Individual

In upper-population, each individual has a dimension equal ton+1 (i.e., the number of VE members). Each individual is a possible allocation of investment budget for all members that have a real number representation. The ith individual of the upper-population T is defined as follows:(4.1)XiT=(xi1T,xi2T,…,xi(n+1)T),XiT∈ℜn+1.For example, a real-number particle (286.55, 678.33, 456.78, 701.21, 567.62) is an investment budget possible allocation of a VE consisting of 5 members. The first bit means that the owner received investment of 286.55 units. The 2 to 5 bits mean that the amounts of investment allocated to partner 1 to 4 are 678.33, 456.78, 701.21, and 567.62, respectively.


### 4.1.2. Definition of Discrete Individual

For the lower-population, in order to appropriately represent the action combination by a particle, we design an “action-to-risk-to-partner” representation for the discrete individual. Each discrete individual in each lower-population has a dimension equal to the number ofn×m×W, where W is the number of available actions for each risk factor, m is the number of risk factors of each partner, and n is the number of VE partners. The ith individual of the lower-population L is defined as follows:(4.2)XiL=(xi(111)L,xi(112)L,…,xi(n×m×W)L),xi(αβγ)L∈{0,1},
where xi(αβγ)L equals 1 if the risk factor β of VE partner α is solved by the γth action and 0 otherwise. That is, each partner can only select one action for each risk factor or do nothing with this factor. For example, set n=2, m=4, and W=4; suppose that the action combination of two partners is (2314, 2401), where 0 stands for no action and is selected for the third risk factor of the second partner in VE. By our definition, we have xi(112)L=xi(123)L=xi(131)L=xi(144)L=xi(212)L=xi(224)L=xi(241)L=1 and all other xi(αβγ)L=0 (see Figure 3).Definition of a discrete particle (2314, 2401) for the action combination of two individuals.
(a)(b)


### 4.1.3. Model Transformation

Then, the base-level objectives, that is, (2.4), formulated in Section 2 are equivalent to the following optimization problem:(4.3)minXFB(XiL)=∑α=1nwαRα(XiαL∣XiαT)=∑α=1n∑β=1m∑λ=1lwαuβfβλ(|xiαβL|)dλ+φ∑α=1n(∑β=1mCβα(|xiαβL|)-xiαT)+,
where uβ is the weight of the risk factor β, dλ is the value corresponding to the risk rating λ, lis the number of risk ratings, and φ is the punishment coefficient. xiαβL=(xiαβ1L,xiαβ2L,…,xiαβWL) and |xiαβL| is defined as the position index of 1 in xiαβL. For example, if xiαβL= (0010), the value of |xiαβkL| is 3. Here fβλ(|xiαβL|) is approximated by the convex decreasing function(4.4)fβλ(|xiαβL|)=exp(-θβλ|xiαβL|)
to assess the probability of risk occurrence at risk rating λ under action |xiαβL|. Here the parameter θβλ is used to describe the effects of different risk factors under different risk ratings. The cost of the action Cβα(|xiαβL|) is assumed to be a concave increasing function of the corresponding action, which is approximated by(4.5)Cβα(|xiαβL|)=100(1-exp(-τβα|xiαβL|)),
and the parameter τβα describes the effects of different risk factors of different partners. The notation (x)+ is defined as follows:(4.6)(x)+={xifx>0,0else.And the top-level objectives, that is, (2.1)–(2.3), formulated in Section 2 are equivalent to the following optimization problem:(4.7)minXFT(XiT)=∑α=0nwαRα(Xi(α+1)T)=w0R0(Xi1T)+FB(XiL*)+ϕ(∑α=1n+1xiαT-Imax)++η∑α=1n(∑β=1m∑λ=1lwαuβfβλ(|xiαβL|)dλ-Rmax)+,
where ϕ and η are the punishment coefficients and XiL* is the last best base-level decision. Here the risk level of the owner R0(Xi1T) is approximated by a convex decreasing function as follows:(4.8)R0(Xi1T)=exp(-0.001Xi1T).In order to easily use EA and SI algorithms to treat the risk management problem in VE, it is clear that the rewritten model, that is, (4.3)–(4.8), is much complex than the original model, that is, (2.1)–(2.4), for there are more variables described in it.


## 4.1.1. Definition of Continuous Individual

In upper-population, each individual has a dimension equal ton+1 (i.e., the number of VE members). Each individual is a possible allocation of investment budget for all members that have a real number representation. The ith individual of the upper-population T is defined as follows:(4.1)XiT=(xi1T,xi2T,…,xi(n+1)T),XiT∈ℜn+1.For example, a real-number particle (286.55, 678.33, 456.78, 701.21, 567.62) is an investment budget possible allocation of a VE consisting of 5 members. The first bit means that the owner received investment of 286.55 units. The 2 to 5 bits mean that the amounts of investment allocated to partner 1 to 4 are 678.33, 456.78, 701.21, and 567.62, respectively.


## 4.1.2. Definition of Discrete Individual

For the lower-population, in order to appropriately represent the action combination by a particle, we design an “action-to-risk-to-partner” representation for the discrete individual. Each discrete individual in each lower-population has a dimension equal to the number ofn×m×W, where W is the number of available actions for each risk factor, m is the number of risk factors of each partner, and n is the number of VE partners. The ith individual of the lower-population L is defined as follows:(4.2)XiL=(xi(111)L,xi(112)L,…,xi(n×m×W)L),xi(αβγ)L∈{0,1},
where xi(αβγ)L equals 1 if the risk factor β of VE partner α is solved by the γth action and 0 otherwise. That is, each partner can only select one action for each risk factor or do nothing with this factor. For example, set n=2, m=4, and W=4; suppose that the action combination of two partners is (2314, 2401), where 0 stands for no action and is selected for the third risk factor of the second partner in VE. By our definition, we have xi(112)L=xi(123)L=xi(131)L=xi(144)L=xi(212)L=xi(224)L=xi(241)L=1 and all other xi(αβγ)L=0 (see Figure 3).Definition of a discrete particle (2314, 2401) for the action combination of two individuals.
(a)(b)


## 4.1.3. Model Transformation

Then, the base-level objectives, that is, (2.4), formulated in Section 2 are equivalent to the following optimization problem:(4.3)minXFB(XiL)=∑α=1nwαRα(XiαL∣XiαT)=∑α=1n∑β=1m∑λ=1lwαuβfβλ(|xiαβL|)dλ+φ∑α=1n(∑β=1mCβα(|xiαβL|)-xiαT)+,
where uβ is the weight of the risk factor β, dλ is the value corresponding to the risk rating λ, lis the number of risk ratings, and φ is the punishment coefficient. xiαβL=(xiαβ1L,xiαβ2L,…,xiαβWL) and |xiαβL| is defined as the position index of 1 in xiαβL. For example, if xiαβL= (0010), the value of |xiαβkL| is 3. Here fβλ(|xiαβL|) is approximated by the convex decreasing function(4.4)fβλ(|xiαβL|)=exp(-θβλ|xiαβL|)
to assess the probability of risk occurrence at risk rating λ under action |xiαβL|. Here the parameter θβλ is used to describe the effects of different risk factors under different risk ratings. The cost of the action Cβα(|xiαβL|) is assumed to be a concave increasing function of the corresponding action, which is approximated by(4.5)Cβα(|xiαβL|)=100(1-exp(-τβα|xiαβL|)),
and the parameter τβα describes the effects of different risk factors of different partners. The notation (x)+ is defined as follows:(4.6)(x)+={xifx>0,0else.And the top-level objectives, that is, (2.1)–(2.3), formulated in Section 2 are equivalent to the following optimization problem:(4.7)minXFT(XiT)=∑α=0nwαRα(Xi(α+1)T)=w0R0(Xi1T)+FB(XiL*)+ϕ(∑α=1n+1xiαT-Imax)++η∑α=1n(∑β=1m∑λ=1lwαuβfβλ(|xiαβL|)dλ-Rmax)+,
where ϕ and η are the punishment coefficients and XiL* is the last best base-level decision. Here the risk level of the owner R0(Xi1T) is approximated by a convex decreasing function as follows:(4.8)R0(Xi1T)=exp(-0.001Xi1T).In order to easily use EA and SI algorithms to treat the risk management problem in VE, it is clear that the rewritten model, that is, (4.3)–(4.8), is much complex than the original model, that is, (2.1)–(2.4), for there are more variables described in it.


## 4.2. Risk Management Procedure

The overall risk management process based on EA and SI algorithms can be described as follows.Step 1.
The first step in top-level is to randomly initialize the EA and SI-based upper-population. Each individualXiT in the top-level is an instruction and is communicated to the base-level to drive a base-level search process (Steps 2–4).Step 2.
For each top-levelinstructionXiT, the base-level randomly initializes a corresponding lower-population. At each iteration in base-level, for each particle XiL, evaluate its fitness using the base-level optimization function, that is, (4.3).Step 3.
Compare the evaluated fitness values for all individuals in lower-population. Then update each base-level individual by its updating rules according to the selected EA and SI algorithms. For our problem, each partner can only select one action for each risk factor or do nothing with this factor. In order to take care of this problem, for each particle, actionγ is selected for risk factor β of partner α according to following probability:
(4.9)pi(αβγ)=s(vi(αβγ)L)∑γ=1Ws(vi(αβγ)L).
Then the position of each base-level particle is updated by Algorithm 5.Algorithm 5
(1)  Begin(2)  Let Xtemp be a zero vector that has a dimension equal to n×m×W.(3)   For (α=1 to n)(4)   For (β=1 to m)(5)    For (γ=1 to W)(6)     If (rand≤pi(αβγ))// Actionγ is selected for risk β of partner α(7)      Xαβγtempt=1;(8)     Break;(9)     End if(10)  End for(11) End for(12)  End for(13) XiL=Xtemp(14) ENDStep 4.
The base-level search process is repeated until the maximum number of base-level iteration is met. Then send the last best base-level decision variableXiL* to the top-level for the fitness computation of the top-level individual XiT.Step 5.
With the base-level reactionXiL*, each top-level individual XiT is evaluated by the following top-level fitness function, that is, (4.7).Step 6.
Compare the evaluated fitness values for all individuals in upper-population. Then update each top-level individual by its updating rules according to the selected EA and SI algorithms. The top-level computation is repeated until the maximum number of top-level iteration is met.The flowchart of this risk management process is illustrated in the diagram given in Figure4.Figure 4
The risk management process based on EA and SI.


## 5. Experiments Analysis

In this section, a numerical example of a VE is conducted to validate the capability of the proposed VE risk management method. Experiments were conducted with four EA and SI-based algorithms, namely, GA, PSO, ABC, and PS2O, to fully evaluate the performance of the proposed optimization model.


### 5.1. Illustrative Examples

In this section, the total investment isBmax=3500; 10 risk factors are considered for each partner and 4 actions can be selected for each risk factor (i.e., m=10 and W=4); the number of risk ratings is l=3 and the value of each rating is d1=0.165, d2=0.335, and d3=0.500, respectively (according to the values of ratings, the criterion of risk rating is shown in Table 1); the maximum risk level Rmax=0.67, which means that the risk level of each member must be below the medium level; the weight of risk level of each VE member is w0=w1=w2=w3=w4 and the weights uβ of each risk factor for each partner are listed in Table 2; the values of the parameters θβλ and τβα are presented in Tables 3 and 4, respectively; the punishment coefficients ϕ, η, and φ are given as 1.5, 28, and 0.2.Table 1
Criterion of risk rating.
Value of risk probabilityRisk level[0.00, 0.38]Low risk(0.38, 0.67]Medium risk(0.67, 1.00]High riskTable 2
The weights of the risk factors.
Risk factor12345678910uβ0.10.150.100.050.100.100.150.100.050.10Table 3
The summary of parameterθβλ.
βλ12310.100.070.1320.230.200.1730.330.270.3040.370.400.4350.500.470.5360.630.570.6070.730.700.6780.830.770.8090.870.900.93101.000.971.03Table 4
The summary of parameterτβα.
Risk factor12345678910τβα0.10.20.30.40.50.60.70.80.91.0This simulated VE environment can be constructed by one owner and different number of partners. For scalability study purpose, all involved algorithms are tested on three illustrative VE examples with 2, 4, and 9 partners (i.e.,n= 2, 4, 9), respectively.


### 5.2. Settings for Involved Algorithms

In applying EA and SI algorithms to this case, the continuous and binary versions of these algorithms are used in top-level and base-level of the DDM optimization model, respectively. For the top-level algorithms, the maximum generation in each execution for each algorithm is 50; the initialized population size of 10 individuals is the same for all involved algorithms, while the whole population is divided into 2 swarms (each possesses 5 individuals) for PS2O in the initialization step. For the base-level algorithms, the maximum generation for each algorithm is 100; the initialized population size of 20 particles is the same for all involved algorithms, while the whole population is divided into 4 swarms (each possesses 5 individuals) for PS2O in the initialization step. The experiment runs 30 times, respectively, for each algorithm. The other specific parameters of algorithms are given below.GA Settings
The experiment employed a binary coded standard GA having random selection, crossover, mutation, and elite units. Stochastic uniform sampling technique was the chosen selection method. Single-point crossover operation with the rate of 0.8 was employed. Mutation operation restores genetic diversity lost during the application of reproduction and crossover. Mutation rate in the experiment was set to be 0.01.PSO Settings
For continuous PSO, the learning ratesc1 and c2 were both 2.05 and the constriction factor χ=0.729; for binary PSO, the parameters were set to the values c1=c2=2 and χ=1. The ring topology was used for both versions of PSO.ABC Settings
The basic ABC is used in the study. Since there are no literatures using ABC for discrete optimization so far, this experiment just used crossover operation to update individuals in ABC population. That is, the ABC position update (3.1) can be changed to the following equation (5.1) for discrete problems:
(5.1)xij(t)=xkj(t-1).
Then the limit parameter is set to be SN×D for ABC in both continuous and discrete search, where D is the dimension of the problem and SN is the number of employed bees.PS2O Settings
For continuous PS2O, the parameters were set to the values c1=c2=c3=1.3667 (i.e., ϕ=c1+c2+c3≈4.1>4) and then χ=0.729, which is calculated by (3.9); the interaction topology illustrated in Figure 2(a) is used. For discrete PS2O, the parameters were set to the values c1=c2=c3=2 and χ=1; the interaction topology illustrated in Figure 2(b) is used.All algorithms are tested on the risk management problems with 3, 5, and 10 VE members. The representative results obtained are presented in Table5, including the best, worst, mean, and standard deviation of the risk values of VE found in 30 runs. Figures 5(a)–5(c) present the evolution process of all algorithms for the minimization of the VE risks in 3 different scales. For each trial, we can see before proceeding with the EA and SI-based risk management procedure, the risk levels are very high for the VE. Table 5 shows that the resulting risk levels of the VE are in the lower risk level. Therefore the budget and the actions selected by the four EA and SI algorithms for the owner and the partners are very effective to reduce the risks of the VE. From the results, it is clear that the PS2O algorithm can consistently converge to better results than the other three algorithms for all test cases. Also, PS2O is the most fast one for finding good results within relatively few generations.Table 5
Results of all algorithms. In bold are the best.
Scale of VEPSOPS2OGAABC3 membersBest0.21670.20650.19010.2240Worst0.30340.26140.54200.2650Mean0.25140.23540.23560.2436Std0.02020.01090.06260.01125 membersBest0.33960.32180.27270.3166Worst0.48040.35663.22430.3891Mean0.37390.33630.51390.3593Std0.03310.00910.61100.014810 membersBest0.33200.26410.19700.3940Worst4.72461.97852.74494.2746Mean0.77860.60450.89870.7578Std0.90490.69720.38860.9817The iteration courses of all algorithms on different VE scales. (a) 3 members. (b) 4 members. (c) 10 members.
(a)(b)(c)In this experiment, the analysis of variance (ANOVA) test was also carried out to validate the efficacy of four tested EA and SI methods. The graphical statistics analyses are done through box plot. A box plot is a graphical tool, which provides an excellent visual summary of many important aspects of a distribution. The box stretches from the lower hinge (defined as the 25th percentile) to the upper hinge (the 75th percentile) and therefore contains the middle half of the scores in the distribution. The median is shown as a line across the box. Therefore, one-fourth of the distribution is between this line and the top of the box and one-fourth of the distribution is between this line and the bottom of the box.First, the box plots for the results presented in Table5 are shown in Figures 6(a)–6(c). Figure 6 implies the graphical performance representation of all algorithms in 30 runs. From this box plot representation, it is clearly visible and proved that the PS2O provides better results for all the test cases than those of the other three algorithms.ANOVA test for all candidate algorithms on different VE scales of (a) 3 members, (b) 4 members, and (c) 10 members. (Here 1, 2, 3, and 4 are the algorithm index of PSO, PS2O, GA, ABC, resp.).
(a)(b)(c)Second, to compare the robustness of the involved algorithms on the risk manage problem, the experiment can be statistically considered as one-factor experiment, in which the optimization result was the response variable and the scales of the VE were the factor, which had 3 levels: 3, 5, and 10. The results of the ANOVA for the VE risk management in different scales using these algorithms were presented in Figure7 by the box plot. From Figure 7, we can observe that the main effects of the problem scale are not significant for the optimization results obtained by the PS2O algorithm. Therefore, against the scales variation of the testing VE cases, the robustness of the PS2O is much better than those of the PSO, GA, and ABC.ANOVA test for the risk management results with different VE scales optimized by (a) PSO, (b) PS2O, (c) GA, and (d) ABC.
(a)(b)(c)(d)


## 5.1. Illustrative Examples

In this section, the total investment isBmax=3500; 10 risk factors are considered for each partner and 4 actions can be selected for each risk factor (i.e., m=10 and W=4); the number of risk ratings is l=3 and the value of each rating is d1=0.165, d2=0.335, and d3=0.500, respectively (according to the values of ratings, the criterion of risk rating is shown in Table 1); the maximum risk level Rmax=0.67, which means that the risk level of each member must be below the medium level; the weight of risk level of each VE member is w0=w1=w2=w3=w4 and the weights uβ of each risk factor for each partner are listed in Table 2; the values of the parameters θβλ and τβα are presented in Tables 3 and 4, respectively; the punishment coefficients ϕ, η, and φ are given as 1.5, 28, and 0.2.Table 1
Criterion of risk rating.
Value of risk probabilityRisk level[0.00, 0.38]Low risk(0.38, 0.67]Medium risk(0.67, 1.00]High riskTable 2
The weights of the risk factors.
Risk factor12345678910uβ0.10.150.100.050.100.100.150.100.050.10Table 3
The summary of parameterθβλ.
βλ12310.100.070.1320.230.200.1730.330.270.3040.370.400.4350.500.470.5360.630.570.6070.730.700.6780.830.770.8090.870.900.93101.000.971.03Table 4
The summary of parameterτβα.
Risk factor12345678910τβα0.10.20.30.40.50.60.70.80.91.0This simulated VE environment can be constructed by one owner and different number of partners. For scalability study purpose, all involved algorithms are tested on three illustrative VE examples with 2, 4, and 9 partners (i.e.,n= 2, 4, 9), respectively.


## 5.2. Settings for Involved Algorithms

In applying EA and SI algorithms to this case, the continuous and binary versions of these algorithms are used in top-level and base-level of the DDM optimization model, respectively. For the top-level algorithms, the maximum generation in each execution for each algorithm is 50; the initialized population size of 10 individuals is the same for all involved algorithms, while the whole population is divided into 2 swarms (each possesses 5 individuals) for PS2O in the initialization step. For the base-level algorithms, the maximum generation for each algorithm is 100; the initialized population size of 20 particles is the same for all involved algorithms, while the whole population is divided into 4 swarms (each possesses 5 individuals) for PS2O in the initialization step. The experiment runs 30 times, respectively, for each algorithm. The other specific parameters of algorithms are given below.GA Settings
The experiment employed a binary coded standard GA having random selection, crossover, mutation, and elite units. Stochastic uniform sampling technique was the chosen selection method. Single-point crossover operation with the rate of 0.8 was employed. Mutation operation restores genetic diversity lost during the application of reproduction and crossover. Mutation rate in the experiment was set to be 0.01.PSO Settings
For continuous PSO, the learning ratesc1 and c2 were both 2.05 and the constriction factor χ=0.729; for binary PSO, the parameters were set to the values c1=c2=2 and χ=1. The ring topology was used for both versions of PSO.ABC Settings
The basic ABC is used in the study. Since there are no literatures using ABC for discrete optimization so far, this experiment just used crossover operation to update individuals in ABC population. That is, the ABC position update (3.1) can be changed to the following equation (5.1) for discrete problems:
(5.1)xij(t)=xkj(t-1).
Then the limit parameter is set to be SN×D for ABC in both continuous and discrete search, where D is the dimension of the problem and SN is the number of employed bees.PS2O Settings
For continuous PS2O, the parameters were set to the values c1=c2=c3=1.3667 (i.e., ϕ=c1+c2+c3≈4.1>4) and then χ=0.729, which is calculated by (3.9); the interaction topology illustrated in Figure 2(a) is used. For discrete PS2O, the parameters were set to the values c1=c2=c3=2 and χ=1; the interaction topology illustrated in Figure 2(b) is used.All algorithms are tested on the risk management problems with 3, 5, and 10 VE members. The representative results obtained are presented in Table5, including the best, worst, mean, and standard deviation of the risk values of VE found in 30 runs. Figures 5(a)–5(c) present the evolution process of all algorithms for the minimization of the VE risks in 3 different scales. For each trial, we can see before proceeding with the EA and SI-based risk management procedure, the risk levels are very high for the VE. Table 5 shows that the resulting risk levels of the VE are in the lower risk level. Therefore the budget and the actions selected by the four EA and SI algorithms for the owner and the partners are very effective to reduce the risks of the VE. From the results, it is clear that the PS2O algorithm can consistently converge to better results than the other three algorithms for all test cases. Also, PS2O is the most fast one for finding good results within relatively few generations.Table 5
Results of all algorithms. In bold are the best.
Scale of VEPSOPS2OGAABC3 membersBest0.21670.20650.19010.2240Worst0.30340.26140.54200.2650Mean0.25140.23540.23560.2436Std0.02020.01090.06260.01125 membersBest0.33960.32180.27270.3166Worst0.48040.35663.22430.3891Mean0.37390.33630.51390.3593Std0.03310.00910.61100.014810 membersBest0.33200.26410.19700.3940Worst4.72461.97852.74494.2746Mean0.77860.60450.89870.7578Std0.90490.69720.38860.9817The iteration courses of all algorithms on different VE scales. (a) 3 members. (b) 4 members. (c) 10 members.
(a)(b)(c)In this experiment, the analysis of variance (ANOVA) test was also carried out to validate the efficacy of four tested EA and SI methods. The graphical statistics analyses are done through box plot. A box plot is a graphical tool, which provides an excellent visual summary of many important aspects of a distribution. The box stretches from the lower hinge (defined as the 25th percentile) to the upper hinge (the 75th percentile) and therefore contains the middle half of the scores in the distribution. The median is shown as a line across the box. Therefore, one-fourth of the distribution is between this line and the top of the box and one-fourth of the distribution is between this line and the bottom of the box.First, the box plots for the results presented in Table5 are shown in Figures 6(a)–6(c). Figure 6 implies the graphical performance representation of all algorithms in 30 runs. From this box plot representation, it is clearly visible and proved that the PS2O provides better results for all the test cases than those of the other three algorithms.ANOVA test for all candidate algorithms on different VE scales of (a) 3 members, (b) 4 members, and (c) 10 members. (Here 1, 2, 3, and 4 are the algorithm index of PSO, PS2O, GA, ABC, resp.).
(a)(b)(c)Second, to compare the robustness of the involved algorithms on the risk manage problem, the experiment can be statistically considered as one-factor experiment, in which the optimization result was the response variable and the scales of the VE were the factor, which had 3 levels: 3, 5, and 10. The results of the ANOVA for the VE risk management in different scales using these algorithms were presented in Figure7 by the box plot. From Figure 7, we can observe that the main effects of the problem scale are not significant for the optimization results obtained by the PS2O algorithm. Therefore, against the scales variation of the testing VE cases, the robustness of the PS2O is much better than those of the PSO, GA, and ABC.ANOVA test for the risk management results with different VE scales optimized by (a) PSO, (b) PS2O, (c) GA, and (d) ABC.
(a)(b)(c)(d)


## 6. Conclusions

In this paper, we develop an optimization model for minimizing the risks of the virtual enterprise based on evolutionary and swarm intelligence methods. First, a two-level risk management model was introduced to describe the decision processes of the owner and the partners. This DDM model considers the situation that the owner allocates the budget to each member of the VE in order to minimize the risk level of the VE. Accordingly, a transfer optimization model, which can easily use EA and SI algorithms to treat the risk management problem in VE, is elaborately developed. We should note that the proposed optimization model is genetic and extendible: the model does not depend on the optimization algorithm used and other evolutionary and swarm intelligence techniques could be equally well adopted, which enable a comparison of various algorithms for the same application scenario.Experiments show comparative studies on the VE risk management problem for the GA, PSO, ABC, and PS2O. The simulation results show that the PS2O algorithm obtains superior solutions on three testing cases than the other algorithms in terms of optimization accuracy and computation robustness. That is, in PS2O, with the hierarchical interaction topology, a suitable diversity in the whole population can be maintained; at the same time, the enhanced dynamical update rule significantly speeds up the multi-swarm to converge to the global optimum.



---

*Source: 572404-2010-05-24.xml*