Optimization method of prefabricated building project procedure based on QPSO algorithm
2018-07-24GuizhenMAGangWANG
Gui-zhen MA, Gang WANG
(1Department of Civil Engineering, Xinjiang Vocational and Technical College of Construction, Urumqi 830054, China) (2State Key Laboratory of Geohazard Prevention and Geoenvironment Protection, Chengdu University of Technology, Chengdu 610059, China)
Abstract: Aiming at the reasonable arrangement of prefabricated building project procedure, an optimization method of procedure based on Quantum-behaved Particle Swarm Optimization (QPSO) is proposed in this paper. The project process is first coded so that it can be expressed in quantum form. Then, based on the objective function considering the construction period and cost, QPSO algorithm is used to optimize the working plan to get the optimal solution. In addition, in order to improve the convergence ability of QPSO algorithm, a mutation mechanism is incorporated to avoid its falling into local optimum. The experimental results in a case of a prefabricated residential project show that the proposed method can effectively reduce the project duration and cost, and it has high practical value.
Key words: Prefabricated building, Project procedure optimization, Quantum particle swarm optimization, Construction duration and cost
Prefabricated building refers to the construction of building units in accordance with standard building structures, and then transported to the construction site for assembly and production of the building [1]. It can not only improve project quality and construction efficiency but also reduce dust pollution during construction. However, nowadays, assembly process is one of the problems with fabricated buildings [2]. In fact, reasonable and effective process can greatly reduce assembly time and labor costs.
To this end, many types of research have been studying to solve the optimization problem of assembly-type buildings. In other words, to meet the project constraints and other constraints, the rational allocation of processes and resources can achieve the shortest duration or the lowest cost goals. To solve the optimal problem, the most commonly used methods are intelligent evolutionary algorithms, such as genetic algorithm and particle swarm optimization [3]. In recent years, a new evolutionary algorithm, i.e., the Quantum-inspired Evolutionary Algorithm (QEA)[4], has emerged, which uses the representation of quantum bits as the smallest unit of information [5]instead of binary, numeric or symbolic representation. It is superior to genetic algorithm in optimization. Individual quantum bits is a string of qubit called multi-qubit. One of the advantages is the linear overlay of states in the search space that can be represented probabilistically. Therefore, the quantum bit representation has a better community diversity compared to the chromosome representation in genetic algorithms [6]. The quantum gate in QEA is a variant operator that turns an individual toward a better solution and eventually converges to a single optimal solution. Some scholars have combined QEA and Particle Swarm Optimization (PSO) algorithms to form Quantum-Particle Swarm Optimization (QPSO)[7]. A new mechanism of quantum bit representation is used in QPSO, called quantum angle. Subsequently, the location update mechanism in PSO is used to update the QEA quantum bit and make it better than traditional QEA.
Based on the above analysis, this paper presents a QPSO-based assembly building optimization method. Using the QPSO algorithm to optimize the process plan and obtain the optimal plan. The effectiveness of the proposed scheme was verified by the experimental results in a case of a prefabricated residential project.
1 Construction project process optimization problem description
1.1 Examples of fabricated building projects
Take an prefabricated ordinary residential project as an example, the assembly project is a two-story residential building with three rooms on each floor and a balcony on the second floor. All engineering structures are prefabricated in the factory, and only the installation and splicing of structural components are included in the assembly project. The project can be decomposed into 19 processes, each process constraints and interdependence. The preceding process is the previous one of this process, that is, the process must be started after finishing the preceding process[8]. The latter process is the next process after the process is completed. There are two different assembly options for each process, normal assembly and expedited assembly, and they both require different working hours and costs, as shown in Table 1.
Table 1 Project process constraints and working hours and costs

Process codeProcess nameprevious processlatter processConstruction work hours (h)Normal work-ing hoursExpedited work-ing hoursConstruction costs (million)Normal costExpedited costs1Make assembly planno2、321.50.050.072Base formation and measurement142.41.90.080.093Assembly transport14430.500.704Column hoisting2、357.25.80.480.575Column pouring463.62.90.270.326Beam hoisting579.67.90.680.817Beam between steel fixed681.21.00.080.098Beam between the pouring79、10、121.51.30.090.119Plate hoisting811129.60.981.2010Electrical pipeline reserved811430.050.0611Plating pouring9、1014、15、182.41.11.21.4512Staircase hoisting8133.62.90.240.2913Staircase lap12141.41.20.050.0614Staircase and surface seams pouring13、11171.41.20.050.0615Balcony hoisting11162.42.10.180.2516Balcony seams pouring15181.21.00.120.1517Exterior wall hoisting1418129.60.981.1718External wall pouring11、16、17192.41.90.240.2919End acceptance18no

Fig.1 Construction project process network diagram
1.2 Optimize the objective function
The objective of project process optimization in this paper is to minimize the construction duration and cost under the condition of meeting the project duration, which is a multi-objective optimization by reasonably arranging the execution sequence and assembly scheme of each process. The following equation simulates the construction costfC:
Wherecikis the construction costs ofkth construction program in theith process, whilek=1 means normal construction andk=2 means urgent construction, andnis the number of processes of the whole project.
Construction periodfTcan be expressed as:
fT=tn;tj=maxti+djk
(2)
Where,tiis the completion time of theith process, anddjkis the completion time of thekth construction program in thejth process. And while, theith process is the previous process of thejth.
Thus, considering the construction costfCand construction periodfTvia a weight factor, the final objective functionfcould be expressed as:
f=λfC+(1-λ)fT
(3)
To ensure the construction period within the deadline, the importance of shortening the construction period is less than the construction cost, therefore, this article setλ=0.6.
2 Optimization of construction project process based on QPSO
2.1 Quantum calculation

To effectively use quantum computing, effective quantum algorithms should be created. Quantum algorithm applies a series of quantum operations on the quantum system, which can effectively solve the NP complete problem. One of the most famous algorithm is quantum evolutionary algorithm (QEA).
2.2 QPSO algorithm
Due to the traditional Quantum Revolving Door (QEA), QDs are updated by QWRs, and their operation is complicated and their update angles are fixed, making them easy to reach local optimum [9]. Thus, the scholars introduce the position update formula in PSO algorithm to replace the quantum revolving door in QEA to update the angular increment and form QPSO algorithm.


(4)

Quantum revolving door becomes:
(5)
In Eq.(5),replace
QPSO uses the PSO’s concept of group intelligence to treat all multi-quantum bits in a population as an intelligent population--a quantum group. Firstly, the QPSO finds the local best quantum angle and finds the global best quantum angle from the local best quantum angle [10]. Then based on these values, the quantum angle update formula is used to update the quantum angle. The QEA-based QPSO procedure is as follows:


(6)
(3) Calculated fitness ofP(t), evaluates each binary solutionP(t) via a fitness functionFto determine the best and best of individuals in this iteration.
(4) Replace the traditional Quantum Gate Update stepQ(t) with the following location update formula, where the quantum angle update formula is:


(7)
2.3 Incorporate the mutation mechanism
In the QPSO algorithm, although the angle update mechanism and the dynamic inertia weight are introduced in the PSO, the change of angle is getting smaller and smaller in the later iteration, and it is still possible to reach the local optimum. To this end, this article incorporates a mutation mechanism to improve the QPSO algorithm. When judging the stop of the iterative solution, the mutation process is started.
A mechanism is established at first to determine whether QPSO optimization is in a quiescent state or not. In this paper, the ratiokg-pof the global best valueFgbestto the average individual best valueFpbestis used as the basis for judgment. The optimal value of individuals inN=20 consecutive iterations is set for average. The expression is as follows:
(8)
If afterNconsecutive iterations, the optimal angle of the individual of the quantum has almost no change, that is,kg-ptends to 1, and then the optimization process at this time can be determined in a stopped state.
(9)
Finally, a random value is generated for each quantum by a random function rand (0, 1). If the value is smaller than the mutation probability of the quantumpi, the mutation of 1/2 qubit can be realized via a quantum non-gate in the quantum. Variation operations are expressed as follows:
(10)
3 Case analysis
As shown in Table 1, an example of an assembly-type building project is used, which contains a total of 19 processes. In order to apply the QPSO algorithm, the optimized problem should be encoded as a quantum representation. In this case, the quantum code is a matrixMof 19×4, and the four columns in the matrix contain the process number, the construction scheme number, the construction period and the cost of each process, as follows:
The maximum completion time for this project is set as 65 hours. Aiming at minimizing the objective function and optimizing the process of the project, QPSO algorithm iterates 100 times and the solution obtained after the iteration of the algorithm is shown in Table 2. The total completion time of the construction program is 55.4 hours and the total cost is 68 400 yuan. Compared with the construction in accordance with the standard project list of processes, the completion time and cost of the optimal solution get decreased by 10.4% and 13.6%, respectively. The effectiveness of this optimization program and feasibility have been verified.
Table 2 Project process optimization results

Process codeprevious processlatter processConstruction program1-2、3Normal214Normal314Urgent42、35Normal546Normal657Normal768Normal879Normal9811、10、12Urgent10911Normal119、1014、18Normal12913Normal131214Normal1413、1115、17Normal151416Normal161518Normal171418Urgent1811、16、1719Normal1918-Normal
4 Conclusion
This paper presents a QPSO-based assembly building optimization method. Considering the construction period and cost, we construct the optimal objective function and use the QPSO algorithm to optimize the working plan and get the optimal solution. Experiments on a prefabricated residential project show that the proposed method is effective in reducing the project duration and cost.
In further study, we will take the human resource constraints of each process into consideration so as to make it more appropriate to the actual situation.
Acknowledgements
This paper is supported by National Natural Science Foundation of China (No.41172327); Technical research on assembling monolithic concrete shear wall residence and application.
杂志排行
机床与液压的其它文章
- Occupant protection evaluation for rear-end crash based on integrated simulation
- Comprehensive evaluation of energy efficiency in airline enterprise based on grey weight correlation
- Background modeling based on improved parameter estimation for moving target detection
- Control method of engine switch based on power tracing constraint
- Security architecture of Internet of things using recursive encryption algorithm and CoAP
- Mixed image noise removal based on non-local self-similar dictionary learning
