# Hybrid Particle Swarm and Differential Evolution Algorithm for Solving Multimode Resource-Constrained Project Scheduling Problem

Authors: Lieping Zhang; Yingxiong Luo; Yu Zhang
Journal: Journal of Control Science and Engineering
 (2015)

---

## Abstract

In order to find a feasible solution for the multimode resource-constrained project scheduling problem (MRCPSP), a hybrid of particle swarm optimization (PSO) and differential evolution (DE) algorithm is proposed in this paper. The proposed algorithm uses a two-level coding structure. The upper-level structure is coded for scheduling sequence, which is optimized by PSO algorithm. The lower-level structure is coded for project execution mode, and DE algorithm is used to solve the optimal scheduling model. The effectiveness and advantages of the proposed algorithm are illustrated by using the test function of project scheduling problem library (PSPLIB) and comparing with other scheduling methods. The results show that the proposed algorithm can well solve MRCPSP.


---

## Body

## 1. Introduction

Resource-constrained project scheduling problem (RCPSP) is a project scheduling problem of how to arrange the task start-up time to minimize the total project time reasonably in the conditions of resource constraints and project timing constraints [1]. Multimode resource-constrained project scheduling problem (MRCPSP) is an extension of RCPSP, which is a kind of Nondeterministic Polynomial (NP) problem. On the basis of traditional RCPSP, MRCPSP considers a variety of optional modes of the task and the dependent relationships of resources. It can select task model and attribute dynamically. Comparing with the RCPSP, MRCPSP is closer to the real problem and is of more theoretical as well as practical significance [2]. The optimization solution methods of MRCPSP can be divided into precise algorithm, heuristic algorithm, and intelligent optimization algorithm [3]. Precise algorithm adopts the branch-and-bound method as the main solving method, and it can get the optimal solution. But it is not suitable for solving large-scale scheduling problem. Heuristic algorithm has a strong ability to solve large-scale scheduling problem and the characteristic of the computing speed. But it cannot guarantee obtaining the optimal solution. Intelligent optimization algorithm can get the optimization solution or suboptimal solution by using the algorithm optimization mechanism and evaluation mechanism in a limited set of feasible solutions. Intelligent optimization algorithm is an effective solving method for MRCPSP. Jarboui et al. proposed a combinatorial particle swarm optimization (PSO) algorithm to solve MRCPSP [4]. Van Peteghem and Vanhoucke proposed a scatter search algorithm for MRCPSP, which is executed with different improvement methods [5]. Tseng and Chen presented a two-phase genetic local search algorithm that combines the genetic algorithm and the local search method to solve MRCPSP [6]. Damak et al. proposed a differential evolution (DE) algorithm to solve MRCPSP with multiple execution modes for each activity and minimization of the makespan [7]. Wang and Fang proposed an estimation of distribution algorithm to solve MRCPSP [8]. Li and Zhang presented an ant colony optimization-based methodology for solving the MRCPSP considering both renewable and nonrenewable resources [9]. Liu et al. presented a memetic algorithm to solve MRCPSP, in which a new fitness function and two very effective local search procedures are used in the proposed algorithm [10].The methods mentioned above have their different merits and shortcomings. But if we take the combination of several methods into account properly, a better balance between quality and efficiency of solving may be achieved. In this case, we can get the optimum solution and obtain the ultimate solution for different actual demands. Liu et al. proposed a novel hybrid algorithm named PSO-DE, which integrates PSO with DE algorithm to solve constrained numerical and engineering optimization problems [11]. Zhang and Kang proposed a hybrid of ant colony and particle swarm optimization algorithms for solving MRCPSP, which can well solve MRCPSP [12]. Chen and Sandnes proposed a two-PSO algorithm to solve MRCPSP, in which constriction PSO is proposed for the activity priority determination while discrete PSO is employed for mode assignment [13].A hybrid of particle swarm and differential evolution algorithm is proposed for solving MRCPSP. In that algorithm, the scheduling orders are determined by the upper-level algorithm with PSO algorithm, and the task execution modes are determined by the lower-level algorithm with DE algorithm, which can get faster convergence of the algorithm and avoids falling into local optimum. Based on the verification of many MRCPSP’s instances in PSPLIB, the simulation results show that the proposed algorithm can effectively solve the MRCPSP.


## 2. Descriptions of MRCPSP

The MRCPSP can be described as follows. A project has a series of tasks, and there is a certain logic sequence between them as the technical process and many other reasons. Meanwhile, among several patterns, individual task can choose one of them to complete, and each pattern corresponds to a set of known time limits for project and resource requirements. Solution of the problem is to generate a scheduling scheme that enables one or some of the goals to achieve the optimization, which can meet the work of the precedence constraints relations and resource constraints condition.In this paper, what we study is to minimize the time limit for a project in MRCPSP. The upper bound of the time limit for a project is defined asD¯. The task j(j=1,2,…,J) must select one from execution models Mj. Furthermore, in the process of implementation, the execution model cannot be interrupted or changed. In m(1⩽m⩽Mj) kinds of mode to perform the work j requires k kinds of renewable resources, denoted by rjmkρ, and n kinds of nonrenewable resources, denoted by rjmnν, and the execution time is denoted by djm. There is only one execution mode for virtual task 1 and J, which does not consume resources, and the time limit for the project is zero. Among them, renewable resources are denoted by ρ and nonrenewable resources are denoted by ν. In the whole time of the project and each stage of the project, the kth kind of renewable resources can amount to a constant, denoted by Rkρ(k=1,2,…,K), and the nth kind of nonrenewable total resources, denoted by Rnν(n=1,2,…,N). If the task J selects the mth kind of modes to execute and complete in the stage of t, then χjmt=1; otherwise, χjmt=0, wherein χjmt is a decision variable. The mathematical model for MRCPSP can be described as follows [14]:(1)min⁡∑t=EFjLFjt·xjmt(2)s.t.∑m=1Mj∑t=EFjLFjxjmt=1,j=1,2,…,J(3)∑m=1Mi∑t=EFiLFit·ximt≤∑m=1Mj∑t=EFJLFjt·xjmt-djm,j=2,…,J,i∈Pj(4)∑j=1J∑m=1Mjrjmkρ∑q=max⁡t,EFjmin⁡t+dm-1,LFjxjmq≤Rkρ,k=1,…,K,t=1,…,D¯(5)∑j=1J∑m=1Mjrjmnν∑t=EFjLFjxjmt≤Rnν,n=1,…,N.Among them,xjmt∈0,1, and j=1,2,…,J, and m=1,2…,Mj, and t=EFj,…,LFj, EFj, LFj, respectively, corresponds to the earliest completion time and finish time at the latest of the task j, and Pj is the direct predecessor task set of j. Equation (1) is the objective function which means the shortest time limit for the total project. Equation (2) means that a task can only be completed once in an execution mode. Equation (3) represents the precedence constraints. According to the constructed network model and network planning methods, the end time of each task is equal to the sum of its start time and the time limit for a task, and the tight task must be carried out at the end of the work. Equation (4) ensures the amount of renewable resources in every stage will not be larger than the amount available. Equation (5) ensures that the amount of nonrenewable resources consumed in the entire project will not be larger than the amount available.


## 3. Algorithm Design

The upper-level individual coding of the designed algorithm controls the task scheduling orders, and the lower-level individual coding manages the task execution modes. After determining the task scheduling orders, it can find the optimal execution mode in the scheduling order. Due to the fact that the range of execution mode’s values is just an integer in the range [1,3], it is a very small range and it will make the PSO algorithm easily fall into local optimum. Hence, the DE algorithm was introduced into the proposed algorithm to solve the optimal execution mode, which has stronger global convergence ability and robustness, and then optimize the task scheduling sequence with the PSO algorithm.


### 3.1. Coding Design

The upper-level individual of algorithm uses the particle coding based on priority rules. The numbers of tasks are represented by the search space dimension of particle swarm, a total ofJ. At the same time, all dimension values xij of particle xi are random real numbers in the range [0,1]. The value represents the priority order of particle j kinds of dimension. The higher the value, the greater the priority. While the virtual start task of the project’s first task is the first task to be executed, the last task is the virtual end task of the project, which is the final project task. All the priority values that can set virtual start task are xij=1, the priority values of the virtual end task are xij=0, and the other priority values of task are in the range (0,1). Moreover, the task priority values are different.In order to let the priority rules satisfy the task’s precedence constraints, we need to adjust the task priority value. Specific adjustment method is as follows. Compare the priority values of current task and preceding task; the value will not be adjusted if it is lower than the latter. Otherwise, exchange both of the priority values. And then, consider the preceding task as the current task and compare it with its preceding task. As long as they are exchanged, repeat this step until no values need to be exchanged or there is no preceding task. After this adjustment, we can get the priority rules that met the requirements of the task precedence constraints. The low level of algorithm controls the execution mode coding. Assuming that the execution modes of the taskj are Mj kinds, the execution mode of J is in the range [1,Mj]; note that the value of the execution mode is integer.


### 3.2. A Hybrid of PSO and DE Algorithm

#### 3.2.1. PSO Algorithm Based on Inertia Weight

In ann-dimensional search space, population X={x1,…,x2,…,xm} is composed of m particles, and the particle position is xi=xi1,xi2,…,ximT, and the particle velocity is Vi=vi1,vi2,…,vinT. The corresponding individual extreme value is Pi=pi1,pi2,…,pimT, and the global extreme value of the entire population is Pg=pg1,pg2,…,pgmT. Taking into account the premature convergence and poor global convergence to the basic PSO algorithm in the practical application, we adopted the PSO algorithm based on inertia weight to promote the global searching ability and the local search ability [15]. According to the principle of following the current optimal particle, xi particle, which introduced the inertia weight w, will change its speed and position according to(6)vidt+1=wvidt+c1r1pidt-xidt+c2r2pgdt-xidt(7)xidt+1=xidt+vidt+1,where d=1,2,…,n, which means the dth dimension of the particle, and i=1,2,…,m, which means the particle i. m is the population size. t means the current evolution times. r1 and r2 are random numbers distributed in the range [0,1]. c1 and c2, respectively, correspond to accelerated constant of the individual particle and the group particle. vidt+1, vidt, xidt+1, and xidt, respectively, represent the velocity and the position of the ith particle in the (t+1)th generation and the tth generation.The value of inertia weightw can affect the algorithm’s global search ability and local search ability. Related research results show that when w decline linearly from 0.9 to 0.4, the algorithm can converge quickly to the optimal solution [16]. Therefore, this paper adopts the dynamic inertia weight, and the value of w changes in line in the searching process of the particle swarm algorithm, as shown in(8)w=0.9-ncncmax∗0.5,where nc is the current number of cycles and ncmax is the maximum number of cycles.


#### 3.2.2. DE Algorithm

DE algorithm is a simple and efficient parallel search algorithm, which has better robustness and faster convergence capability than other evolution algorithms. And it can be used to solve the MRCPSP. The low-level individual of the designed algorithm uses the DE algorithm to find the optimal execution mode in the scheduling sequence given.For the individualXr1,G, a new individual Vi,G+1 can be obtained by(9)Vi,G+1=Xr1,G+F×Xr2,G-Xr3,G,where i=1,2,…,N. r1 and r2 as well as r3 are different random integers in the range [1,N], and they are different from the subscript index i. The variation factor F is a real constant in the range [0,2], the main function of which is to control the degree of amplification of differential vector (Xr2,G-Xr3,G).The interlace operation is as shown below:(10)Ui,G+1=u1i,G+1,u2i,G+1,…,uDi,G+1.In the equation(11)uji,G+1=Vji,G+1,ifrandbj≤CRorj=mbriXji,G+1,ifrandbj>CR,j≠mbri,j=1,2,…,D,where randb(j) is a uniform distribution probability in the range [0,1], CR is the crossover probability predefined by the user, CR∈(0,1), and mbr(i) is a random number generated in the range [1,D].In order to determine whether vectorUi,G+1 can be (G+1)th generation of population individuals, compare Ui,G+1 with Xi,G; if the former fitness value is better than the latter, replace Xi,G with Ui,G+1 in (G+1)th generation; otherwise, reserve Xi,G.


### 3.3. Scheduling Generation Strategy

Scheduling generation strategy based on priority rules includes serial scheduling scheme and parallel scheduling scheme. In this paper, we use serial scheduling scheme to solve the problem. For an upper individualxi, we can get xi′ according to sorting the order of xi from big to small. And the serial number of original individual xi is stored in the order of xi′ to yi. For example, if the original individuals are [1,0.3,0.5,0.2,0.4,0.7,0], then the sorted individuals are [1,0.7,0.5,0.4,0.3,0.2,0], and the value of yi is [1,6,3,5,2,4,7]. Select an element yij in order from yi according to the value of yij to determine the start time of scheduling task xi and yij. Choose a larger one from the current time and all the preceding task finish time of the current task as the current task start time, and the end time of the current task is determined by the lower layer determined time limit for project plus the current task start time. Update the current time in accordance with the use of resources. When the available resources run out, update the current time. And when the end time of a task is greater than the current time, release its consumed resources in turn. Meanwhile, make the current time equal to the end time of the task that releases resources, until available resources meet the requirements of the current task. The end time of virtual end of task is the project completion time, namely, the value of algorithm fitness function.


### 3.4. Algorithm Implementation Processes

The major steps of the proposed algorithm can be outlined as follows.Step 1.
Initialize the upper-level populations to generatem individuals position (priority rules) (x1,x2,…,xm) and velocity (v1,v2,…,vm).Step 2.
Adjust the priority rules to meet the task precedence constraints represented in (3).Step 3.
Initialize the lower-level populations to generaten individuals (the task execution modes).Step 4.
The lower-level populations, respectively, execute mutation and interlace operation according to (9) and (10).Step 5.
The lower-level populations execute selection operation and optimize the execution mode.Step 6.
If the lower-level populations reached the maximum numbers of iterations, then go to Step7, or go to Step 4 to continue to optimize the execution mode.Step 7.
Respectively, update the velocity and position of the upper populations according to (6) and (7).Step 8.
If the upper-level populations reached the maximum numbers of iterations, the algorithm ends, or go to Step2.


## 3.1. Coding Design

The upper-level individual of algorithm uses the particle coding based on priority rules. The numbers of tasks are represented by the search space dimension of particle swarm, a total ofJ. At the same time, all dimension values xij of particle xi are random real numbers in the range [0,1]. The value represents the priority order of particle j kinds of dimension. The higher the value, the greater the priority. While the virtual start task of the project’s first task is the first task to be executed, the last task is the virtual end task of the project, which is the final project task. All the priority values that can set virtual start task are xij=1, the priority values of the virtual end task are xij=0, and the other priority values of task are in the range (0,1). Moreover, the task priority values are different.In order to let the priority rules satisfy the task’s precedence constraints, we need to adjust the task priority value. Specific adjustment method is as follows. Compare the priority values of current task and preceding task; the value will not be adjusted if it is lower than the latter. Otherwise, exchange both of the priority values. And then, consider the preceding task as the current task and compare it with its preceding task. As long as they are exchanged, repeat this step until no values need to be exchanged or there is no preceding task. After this adjustment, we can get the priority rules that met the requirements of the task precedence constraints. The low level of algorithm controls the execution mode coding. Assuming that the execution modes of the taskj are Mj kinds, the execution mode of J is in the range [1,Mj]; note that the value of the execution mode is integer.


## 3.2. A Hybrid of PSO and DE Algorithm

### 3.2.1. PSO Algorithm Based on Inertia Weight

In ann-dimensional search space, population X={x1,…,x2,…,xm} is composed of m particles, and the particle position is xi=xi1,xi2,…,ximT, and the particle velocity is Vi=vi1,vi2,…,vinT. The corresponding individual extreme value is Pi=pi1,pi2,…,pimT, and the global extreme value of the entire population is Pg=pg1,pg2,…,pgmT. Taking into account the premature convergence and poor global convergence to the basic PSO algorithm in the practical application, we adopted the PSO algorithm based on inertia weight to promote the global searching ability and the local search ability [15]. According to the principle of following the current optimal particle, xi particle, which introduced the inertia weight w, will change its speed and position according to(6)vidt+1=wvidt+c1r1pidt-xidt+c2r2pgdt-xidt(7)xidt+1=xidt+vidt+1,where d=1,2,…,n, which means the dth dimension of the particle, and i=1,2,…,m, which means the particle i. m is the population size. t means the current evolution times. r1 and r2 are random numbers distributed in the range [0,1]. c1 and c2, respectively, correspond to accelerated constant of the individual particle and the group particle. vidt+1, vidt, xidt+1, and xidt, respectively, represent the velocity and the position of the ith particle in the (t+1)th generation and the tth generation.The value of inertia weightw can affect the algorithm’s global search ability and local search ability. Related research results show that when w decline linearly from 0.9 to 0.4, the algorithm can converge quickly to the optimal solution [16]. Therefore, this paper adopts the dynamic inertia weight, and the value of w changes in line in the searching process of the particle swarm algorithm, as shown in(8)w=0.9-ncncmax∗0.5,where nc is the current number of cycles and ncmax is the maximum number of cycles.


### 3.2.2. DE Algorithm

DE algorithm is a simple and efficient parallel search algorithm, which has better robustness and faster convergence capability than other evolution algorithms. And it can be used to solve the MRCPSP. The low-level individual of the designed algorithm uses the DE algorithm to find the optimal execution mode in the scheduling sequence given.For the individualXr1,G, a new individual Vi,G+1 can be obtained by(9)Vi,G+1=Xr1,G+F×Xr2,G-Xr3,G,where i=1,2,…,N. r1 and r2 as well as r3 are different random integers in the range [1,N], and they are different from the subscript index i. The variation factor F is a real constant in the range [0,2], the main function of which is to control the degree of amplification of differential vector (Xr2,G-Xr3,G).The interlace operation is as shown below:(10)Ui,G+1=u1i,G+1,u2i,G+1,…,uDi,G+1.In the equation(11)uji,G+1=Vji,G+1,ifrandbj≤CRorj=mbriXji,G+1,ifrandbj>CR,j≠mbri,j=1,2,…,D,where randb(j) is a uniform distribution probability in the range [0,1], CR is the crossover probability predefined by the user, CR∈(0,1), and mbr(i) is a random number generated in the range [1,D].In order to determine whether vectorUi,G+1 can be (G+1)th generation of population individuals, compare Ui,G+1 with Xi,G; if the former fitness value is better than the latter, replace Xi,G with Ui,G+1 in (G+1)th generation; otherwise, reserve Xi,G.


## 3.2.1. PSO Algorithm Based on Inertia Weight

In ann-dimensional search space, population X={x1,…,x2,…,xm} is composed of m particles, and the particle position is xi=xi1,xi2,…,ximT, and the particle velocity is Vi=vi1,vi2,…,vinT. The corresponding individual extreme value is Pi=pi1,pi2,…,pimT, and the global extreme value of the entire population is Pg=pg1,pg2,…,pgmT. Taking into account the premature convergence and poor global convergence to the basic PSO algorithm in the practical application, we adopted the PSO algorithm based on inertia weight to promote the global searching ability and the local search ability [15]. According to the principle of following the current optimal particle, xi particle, which introduced the inertia weight w, will change its speed and position according to(6)vidt+1=wvidt+c1r1pidt-xidt+c2r2pgdt-xidt(7)xidt+1=xidt+vidt+1,where d=1,2,…,n, which means the dth dimension of the particle, and i=1,2,…,m, which means the particle i. m is the population size. t means the current evolution times. r1 and r2 are random numbers distributed in the range [0,1]. c1 and c2, respectively, correspond to accelerated constant of the individual particle and the group particle. vidt+1, vidt, xidt+1, and xidt, respectively, represent the velocity and the position of the ith particle in the (t+1)th generation and the tth generation.The value of inertia weightw can affect the algorithm’s global search ability and local search ability. Related research results show that when w decline linearly from 0.9 to 0.4, the algorithm can converge quickly to the optimal solution [16]. Therefore, this paper adopts the dynamic inertia weight, and the value of w changes in line in the searching process of the particle swarm algorithm, as shown in(8)w=0.9-ncncmax∗0.5,where nc is the current number of cycles and ncmax is the maximum number of cycles.


## 3.2.2. DE Algorithm

DE algorithm is a simple and efficient parallel search algorithm, which has better robustness and faster convergence capability than other evolution algorithms. And it can be used to solve the MRCPSP. The low-level individual of the designed algorithm uses the DE algorithm to find the optimal execution mode in the scheduling sequence given.For the individualXr1,G, a new individual Vi,G+1 can be obtained by(9)Vi,G+1=Xr1,G+F×Xr2,G-Xr3,G,where i=1,2,…,N. r1 and r2 as well as r3 are different random integers in the range [1,N], and they are different from the subscript index i. The variation factor F is a real constant in the range [0,2], the main function of which is to control the degree of amplification of differential vector (Xr2,G-Xr3,G).The interlace operation is as shown below:(10)Ui,G+1=u1i,G+1,u2i,G+1,…,uDi,G+1.In the equation(11)uji,G+1=Vji,G+1,ifrandbj≤CRorj=mbriXji,G+1,ifrandbj>CR,j≠mbri,j=1,2,…,D,where randb(j) is a uniform distribution probability in the range [0,1], CR is the crossover probability predefined by the user, CR∈(0,1), and mbr(i) is a random number generated in the range [1,D].In order to determine whether vectorUi,G+1 can be (G+1)th generation of population individuals, compare Ui,G+1 with Xi,G; if the former fitness value is better than the latter, replace Xi,G with Ui,G+1 in (G+1)th generation; otherwise, reserve Xi,G.


## 3.3. Scheduling Generation Strategy

Scheduling generation strategy based on priority rules includes serial scheduling scheme and parallel scheduling scheme. In this paper, we use serial scheduling scheme to solve the problem. For an upper individualxi, we can get xi′ according to sorting the order of xi from big to small. And the serial number of original individual xi is stored in the order of xi′ to yi. For example, if the original individuals are [1,0.3,0.5,0.2,0.4,0.7,0], then the sorted individuals are [1,0.7,0.5,0.4,0.3,0.2,0], and the value of yi is [1,6,3,5,2,4,7]. Select an element yij in order from yi according to the value of yij to determine the start time of scheduling task xi and yij. Choose a larger one from the current time and all the preceding task finish time of the current task as the current task start time, and the end time of the current task is determined by the lower layer determined time limit for project plus the current task start time. Update the current time in accordance with the use of resources. When the available resources run out, update the current time. And when the end time of a task is greater than the current time, release its consumed resources in turn. Meanwhile, make the current time equal to the end time of the task that releases resources, until available resources meet the requirements of the current task. The end time of virtual end of task is the project completion time, namely, the value of algorithm fitness function.


## 3.4. Algorithm Implementation Processes

The major steps of the proposed algorithm can be outlined as follows.Step 1.
Initialize the upper-level populations to generatem individuals position (priority rules) (x1,x2,…,xm) and velocity (v1,v2,…,vm).Step 2.
Adjust the priority rules to meet the task precedence constraints represented in (3).Step 3.
Initialize the lower-level populations to generaten individuals (the task execution modes).Step 4.
The lower-level populations, respectively, execute mutation and interlace operation according to (9) and (10).Step 5.
The lower-level populations execute selection operation and optimize the execution mode.Step 6.
If the lower-level populations reached the maximum numbers of iterations, then go to Step7, or go to Step 4 to continue to optimize the execution mode.Step 7.
Respectively, update the velocity and position of the upper populations according to (6) and (7).Step 8.
If the upper-level populations reached the maximum numbers of iterations, the algorithm ends, or go to Step2.


## 4. Simulation Analyses

In order to test the effectiveness of the algorithm, the standard MRCPSP instances of PSLIB are used to validate the effectiveness of the algorithm. The selected task is J18. The task contains 2 kinds of renewable resources and 2 kinds of nonrenewable resources, in which the renewable resources areR1=26, R2=27, and the nonrenewable resources are N1=48, N2=51. We compare the proposed algorithm with different iterations. The upper-level PSO algorithm parameters of the proposed algorithm are described as follows: the individual particle acceleration constant is selected as c1=2 and the group of particle acceleration constants is selected as c2=2, the number of populations is selected as 10, and the number of iterations is taken as 10. The parameters of lower-level DE algorithm are described as follows [17]: the interlace probability is selected as CR = 0.4, the variation factor is selected as F=0.7, and both of the numbers of populations and iterations are selected as 10. A Gantt chart of optimal solution is shown in Figure 1.Figure 1
Gantt chart of the optimal solution.When the upper-level iteration numbers are, respectively, 10 and 15, the solved results of the proposed algorithm are shown in Table1. In accordance with Table 1, we can know that the proposed algorithm is effective for MRCPSP, and, with the increase of the number of iterations, the probability of obtaining the optimal solution increased.Table 1
Computing results vary from different number of iterations in the upper level.
Upper-level number of iterations
Average deviation (%)
Optimal solutionratio (%)
10
0.78
83.33
15
0.44
93.33In order to test the feasibility of the proposed algorithm, we compare the proposed algorithm with two layers’ PSO algorithm based on inertia weight. The parameters of two layers’ PSO algorithm based on inertia weight are described as follows: the individual particle acceleration constantsc1 and c2 are selected as 2, the numbers of populations are selected as 10, and the numbers of iterations are selected as 10. The parameters of the proposed algorithm are described as before, in which the number of iterations of PSO algorithm is selected as 10. The corresponding results are shown in Table 2. In accordance with Table 2, we can know that the average deviation and optimum ratio of PSODE algorithm are higher than those of PSO algorithm.Table 2
Results comparison of PSODE algorithm and PSO algorithm.
Algorithm
Average deviation (%)
Optimum ratio (%)
PSODE
0.78
83.33
PSO
5.67
40In order to further test the feasibility and the effectiveness of the proposed algorithm, we compare it with the solving results of [12]. Projects J10 and J20 have 536 and 554 optimal solutions, respectively, and projects J10 and J20 have two kinds of renewable resources and two kinds of nonrenewable resources, respectively, and every instance has three modes. Project J10 has a total of 12 tasks, and project J20 has a total of 22 tasks, and both the first task and the last task are virtual tasks, which do not consume the time and the resources. The parameters of the proposed algorithm are described as before. The results comparison of the proposed algorithm and the method of [12] is shown in Table 3. According to the results in Table 3, the proposed algorithm is better than the method of [12] in average deviation and optimal solution rate.Table 3
Results comparison of the proposed algorithm and other methods.
Project
Population size
J10
J20
Average deviation
Optimal solution rate
Average deviation
Optimal solution rate
This paper
10-10
0%
100%
1.82%
76.67%
Reference [12]
10-10
0%
100%
1.28%
71.5%


## 5. Conclusions

A new algorithm for MRCPSP combined PSO algorithm and DE algorithm is proposed in this paper. The optimal project execution modes are obtained by DE algorithm after the determination of the task scheduling sequence; then the task scheduling sequences are optimized by PSO algorithm. In order to confirm the validity of the algorithm, we take an experiment based on the standard MRCPSP instances of PSLIB and other scheduling methods. The experimental and comparison results show that the proposed algorithm has a better performance in average deviation and optimal solution rate.



---

*Source: 923791-2015-10-05.xml*