Next Article in Journal
Physics-Guided Self-Supervised Few-Shot Learning for Ultrasonic Defect Detection in Concrete Structures
Next Article in Special Issue
Finite Element Analysis and Parametric Study on the Push-Out Performance of Shear Connectors in Long-Span Composite Bridges
Previous Article in Journal
Numerical Simulation Study on Fire Resistance Performance of Prefabricated Shear Walls Connected by Sleeve Grouting
Previous Article in Special Issue
Statistical Analysis of Factors Influencing Segmental Joint Opening in a Soft Soil Tunnel
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Optimization of Precast Concrete Production with a Differential Evolutionary Algorithm

1
School of Management, Hefei University of Technology, Hefei 230009, China
2
College of Civil Engineering, Hefei University of Technology, Hefei 230009, China
3
Engineering Research Center of Low-Carbon Technology and Equipment for Cement-Based Materials, Ministry of Education, Hefei University of Technology, Hefei 230009, China
4
Anhui Key Laboratory of Civil Engineering Structures and Materials, Hefei University of Technology, Hefei 230009, China
5
School of Civil and Hydraulic Engineering, Huazhong University of Science and Technology, Wuhan 430074, China
6
National Center of Technology Innovation for Digital Construction, Huazhong University of Science and Technology, Wuhan 430074, China
*
Author to whom correspondence should be addressed.
Buildings 2025, 15(23), 4226; https://doi.org/10.3390/buildings15234226
Submission received: 14 October 2025 / Revised: 14 November 2025 / Accepted: 20 November 2025 / Published: 23 November 2025

Abstract

This study investigates the limitations of existing models in optimizing equipment resource allocation for the large-scale production of precast concrete components in highway engineering. There are abundant investigations on scheduling models of precast concrete components. However, there is a scientific problem that previous models often overlooked the interruptibility of specific processes and the possibility of performing tasks outside of regular working hours, leading to suboptimal resource utilization. To address this limitation, an improved differential evolution (DE) algorithm was developed, which incorporates an adaptive mutation operator and a dual mutation strategy to enhance population diversity and accelerate convergence speed. The proposed optimization model significantly reduced equipment resource consumption. In a real-world case study, the model achieved an 11.11% reduction in project duration and a 21.4% increase in production capacity under the same resource configuration. The improved DE algorithm demonstrated superior performance in maintaining population diversity and accelerating convergence. These findings provide a scientifically grounded approach for enhancing productivity and resource efficiency in prefabricated construction, with potential applications extending beyond highway projects.

1. Introduction

A nation’s economic activity is based on its transportation system, and the ease of access to transportation has a direct impact on people’s quality of life. More significantly, highways foster social cohesion, facilitate contact and interactions between cities and villages, and connect them all. The Outline for Building a Strong Transport Country, released in 2019 by China’s State Council and the CPC Central Committee, stated that China should essentially be transformed into a strong transport nation by 2035 [1]. The Chinese government has suggested building a state-of-the-art, comprehensive, three-dimensional transportation network, as well as planning and building facilities for civil aviation, water transportation, railroads, and roads, in order to ensure that China becomes a transportation powerhouse. Furthermore, China is leading the world in highway infrastructure, with a total length of 5.35 million kilometers by the end of 2022—an increase of 1.12 million kilometers in just 10 years. Of those highways, 177,000 km are expressways that are open to traffic [2].
In highway engineering, the manufacturing of precast concrete components is not only essential for fulfilling construction specifications, but it is also a crucial component in enhancing productivity and security. The possible advantages of prefabrication for construction quality, efficiency, and environmental impact are demonstrated by its cleaner construction, high degree of industrialization, and low energy consumption [3,4]. There has been a surge in research on precast concrete plants around the world [5,6,7]. Recent optimization studies demonstrate significant progress across multiple sectors: Tuluca et al. developed genetic algorithm-based scheduling optimization for precast component production, achieving notable efficiency improvements in building construction applications [8]. For large-scale nuclear power constructions, Lu et al. established multi-objective optimization models addressing complex technical and economic constraints in concrete production [9]. Wang et al. implemented advanced deep learning systems for quality control in energy infrastructure projects, demonstrating substantial enhancements in product consistency and reliability [10]. Even more important, however, is the fact that modular construction and the assembly of prefabricated components can significantly reduce construction time [11]. The research fervor for optimizing various aspects of precast components has been high [12,13,14]. That said, the mishandling of production scheduling of modular components is a primary cause of poor project performance, leading to cost overruns, schedule delays, and quality problems [15]. The production optimization of large prefabricated components of highway bridges still needs to be improved, and that goal has strong support from the state. Optimization of processes, line layouts, and standard work procedures can reduce lead times [16]. For instance, the production process of prefabricated parts is frequently interrupted by unforeseen events, such as emergency orders and mechanical failures, but the optimization of large prefabricated component scheduling is the most significant issue at hand. Although the manufacturing cycle of prefabricated components typically is brief, the size and complexity of the components necessitate a more complex production process, which further complicates the traditional workshop production mode.
Prefabricated elements of conventional buildings have been the subject of the majority of early studies. The manufacturing of large concrete components has increased due to the rapid development of highway engineering, and workshop scheduling optimization remains challenging because of the low levels of automation and mechanization involved. The precast components of highway engineering are larger, span a greater distance, and require stricter production lines than the precast components of construction engineering do, and these features complicate the production process, in addition to restricting the current methodology for equipment resource allocation. Furthermore, because certain processes, such as steel binding and template installation, can be interrupted, researchers are turning their attention to the flexibility of production scheduling.
With the rapid development of assembly construction technology, the production of precast concrete components has attracted a great deal of attention. The problems of precast concrete production can be reduced to the problem of assembly line production [17]. The production scheduling problem in regard to prefabricated-component production plants has been extensively studied by scholars both domestically and internationally [14,15,18,19]. In order to optimally minimize the prefabricated-component production completion time, scholars began by studying the traditional flow shop sequencing problem [20] and proposed the idea of production shop scheduling [21]. Following these publications, the optimization problem gained prominence in the literature. For the issue of qualified productivity and timely delivery of prefabricated components, production scheduling is crucial [22], but it becomes challenging to schedule such manufacturing optimally. A parallel rescheduling strategy for multiple precast concrete production lines to minimize schedule changes and prevent major material rescheduling while managing production contingencies [23] has been explored, as has defining an existing prefabrication workflow to identify measures for increased labor time utilization rates [24]. The transportation of prefabricated components with a delivery time window has been established, and an optimal scheduling method to balance delivery timeliness and transportation has been sought [25]. Static scheduling was the main emphasis of early research, but dynamic scheduling is desperately needed to address the numerous interruptions that arise in real-world scenarios [26]. Furthermore, many studies have not considered the actual production environment [27,28], which limits research advancement, with only a few scholars having considered this factor [29]. Furthermore, by employing a novel mathematical model based on the permutation flow shop scheduling problem and solving it using an iterated greedy algorithm, the system performance is enhanced while considering shift work constraints [30]. A dynamic multi-objective green shop scheduling problem, optimizing total completion time, energy consumption, and carbon emission under uncertain order insertion [31]. A bi-population deep Q-network was developed to solve the distributed flexible job shop scheduling problem with transportation under a PC manufacturing environment [32].
As is shown in Table 1, many studies have assumed that production resources are not limited, and they have not considered the impact of limited resources on the production cycle, which is inconsistent with the actual real-world situation. Therefore, in order to address this shortcoming, some researchers have imposed maximum restrictions on the use of molds to optimize production plans [33,34]. In addition, there are constraints on factory workers and cranes [20]—internal resource constraints such as inventory, labor, and workspace [35], as well as constraints on buffer zones between production stations—that are considered in studies’ improved models [4,36]. At the same time, the characteristics of prefabricated components in highway projects have great limitations in terms of production resources. It is believed that production scheduling is a nondeterministic polynomial (NP) problem [17,36]. Thus, researchers have studied the heuristic method in order to quickly arrive at the best answer, and it has been used in the study of prefabricated-component production scheduling [7]. Among heuristic algorithms, intelligent optimization algorithms primarily have consisted of differential evolution algorithms, ant colony optimization algorithms, genetic algorithms (GAs), and tabu search algorithms [37,38,39]. Genetic algorithms have been found to perform better in prefabrication scheduling [17].
Notwithstanding these advancements, a discernible gap persists in the current body of knowledge. Conventional production scheduling models often fail to adequately incorporate two critical characteristics of large-scale precast plants: the interruptibility of specific processes and the potential for multi-shift or off-hour operations to enhance production continuity. This oversight limits the practical applicability and optimization potential of existing models in real-world, large-scale production environments for highway components, where such factors are paramount for efficient resource utilization.
As a result, this study created a model for optimized resource allocation of big precast concrete equipment that takes into account the “interruptibility” of certain processes, as well as the features of large precast components in highway engineering. This study used a differential evolution (DE) algorithm that is population-based and was first proposed by Storn and Price in 1997. Since its proposal, it has been widely used in many fields, ranging from engineering optimization, image processing, and machine learning [41,42,43] to wireless power transmission [44], finance [45,46], medicine [47], and energy [48,49]. Many scholars have also improved the algorithm, which has been applied to the shop floor scheduling problem [50,51,52]. The algorithm uses disparities across populations to solve continuous optimization issues. The DE’s attractive features include robustness to parameters, minimal space complexity, strong algorithm performance, and ease of use.
The selection of the DE algorithm is well-justified by its proven effectiveness in handling complex optimization problems. Babu et al. demonstrated DE’s superiority over the Non-dominated Sorting Genetic Algorithm in chemical synthesis optimization [53]; Xu et al. developed an adaptive DE variant with multiple mutation strategies for dynamic optimization scenarios [54]; and Eduardo et al. confirmed DE’s capability in handling high-dimensional optimization tasks through big data clustering applications [55]. These studies collectively validate DE’s advantages in continuous search spaces, adaptive mutation mechanisms, and robust performance—making it particularly suitable for the equipment resource optimization problem addressed in this study.
Furthermore, the ongoing refinement of DE algorithms continues to yield significant advancements in both mutation strategies and parameter adaptation mechanisms. For instance, Cui et al. proposed an adaptive DE based on archive reuse [56], while Bu et al. developed a multi-strategy framework utilizing adaptive hash clustering [57]. Innovations also include leveraging local binary patterns for parameter adaptation in multimodal optimization [58], designing deeply-informed mutation strategies to escape local optima [59], and adapting mutation operators based on fitness landscape analysis [60]. Further enhancing the paradigm, researchers have effectively hybridized DE with other optimizers [61], devised dual-stage self-adaptive mechanisms with ensemble strategies [62]. These developments collectively underscore the dynamic evolution and robust capabilities of adaptive DE in solving complex, high-dimensional problems.
The rest of this article is structured as follows. First, the following section provides a literature review. In Section 3, titled “Materials and Methods,” the characteristics, production process, and production line optimization of precast concrete components for highway engineering are introduced. Then, the optimization model is built and solved. Finally, the study’s findings are discussed, the conclusions that can be drawn from the findings are summarized, and their implications are noted. The overall research framework of this paper is illustrated in Figure 1.

2. Materials and Methods

2.1. Analysis of the Production for Precast Concrete Components for Highway Project

2.1.1. Flow Shop Production for Precast Concrete Components

Depending on the production method, precast production can be categorized into two types: flow shop production and fixed location production, with flow shop production being more efficient [34]. Flow shop production is divided into five processes: molding, the placing of rebars and embedded parts, casting, curing, and mold stripping. Each process is carried out on stationary machinery, with a mobile pallet moving the production components on the assembly line to the next process.
The production process of precast concrete components is different from the traditional industrial flow production process and needs to consider the work hours of the workers, as well as the continuity of the process. Moreover, the process of the traditional flow shop is generally not interruptible, whereas some processes for precast concrete components can be interrupted—such as reinforcement tying, moldboard installation, and stripping. Hence, when these processes cannot be completed during work hours, the remaining parts can be continued the next day without interruption. In addition, some processes must be started during working hours.
Unlike the highly automated manufacturing industry, the intelligent assembly line production of precast components cannot be completely separated from manual labor. For example, in the steam curing process, after demolding, the components need to be moved to the steam curing area through the manual control of the steel pedestal, thus requiring that the start time of steam curing be within the working time of workers. However, the process of steam curing is automatically controlled through intelligent monitoring within the control system, so the process of curing can be carried out at any time. These production characteristics must be reflected in the modeling of production for precast concrete components.
The complexity of the production process for precast concrete components leads to a wide range of machinery and equipment, most of which is expensive. It is therefore necessary to optimize the equipment resourcing plan in a scientific and reasonable manner in order to reduce the costs of the precast plant as much as possible and to increase the utilization rate of the equipment.

2.1.2. Layout of Production Lines

According to the precast yard construction mode, the production mode for precast concrete bridge components can be divided into a conventional production line, a fixed mold table production line, and a circular production line. In comparison with a fixed table production line, the circular production lines are conducive to saving production space, integrating various processes, and enhancing production efficiency.
In order to optimize production, this study used an integrated circular production line that was centered on the process flow route, and each process facility was arranged along the production flow direction, with stations for each process. The centerpiece of the construction process was the mobile cart, which was capable of moving around. The process moved through the hydraulic system to drive the mobile cart sequentially to different operating zones, in order to achieve reinforcement processing, reinforcement assembly, steel mold installation, concrete pouring and vibration, moldboard hydraulic stripping, steam curing, tensioning and grouting, and other mobile operations on the assembly line, and then it returned to the starting point through the return track, thus following a circular loop of the circular production line (Figure 2).
The disadvantage of an integrated circular production line is that the production space is generally linear and the layout is fixed. In addition, the production equipment corresponds to a specific product, with high replacement costs being required when changing product types, so the degree of flexibility is relatively low. The advantages of the integrated circular production line are the orderly organization of each step of the production process in a linear space, the optimization of logistics and process paths, and the separation of production functions—which manifests in the relative independence of each process—ease of management, ease of carrying out specialized work, and good compatibility with the degree of automation, as well as a higher degree of automation. For large prefabricated T-beams, the dimensions and models are more standardized. Moreover, the large span, large cross-section size, reinforcement, and beam arrangement are more standardized, which is conducive to standardized and automated construction and has high levels of compatibility with the circular production line, thus making the adoption of the circular production line arrangement appropriate.

2.1.3. Production Characteristics of Precast Concrete Components for Highway Projects

In contrast to traditional precast components, highway project precast components are huge in size, reaching 25 m or more in length. This is the result of the characteristics of highway projects, which require precast beams and slabs to meet larger spans and carry more loads than ordinary civil buildings must support. In fact, in order to satisfy the load requirements, the precast components of highway projects must be configured with complex steel reinforcement. Although some automatic welding machines are able to apply reinforcing grids, in practice, this process is still heavily manual because of the intricacy of internal reinforcement. The complexity of the reinforcement also affects the vibrating process. According to an onsite survey, the automatic vibrating system and manual vibrating coexist.
Larger dimensions and higher load-carrying requirements make the precast component process for highway projects more complex than that for ordinary precast components. There are a total of seven processes: reinforcement processing (M1), reinforcement assembling (M2), steel moldboard installation (M3), concrete pouring and vibrating (M4), moldboard hydraulic stripping (M5), steam curing (M6), and tensioning and grouting (M7) (Figure 3). The typical cycle time for these processes to produce one precast concrete component lasts for 2 h, 3 h, 1.5 h, 14 h, 16 h and 1 h, respectively.
In the past, these highway construction components could only be manufactured at the construction site or in the open air. Now, however, with the increasing industrialization of construction, these components can also be fabricated on assembly lines, but the challenges that come with that progress are also evident. The production pallets, steel moldboards, and other machinery need to be customized for the huge size of the components, and the investment cost for each line is huge. Because of their massive size, such components cannot be turned or lifted on the production line; they can only move forward or backward on a set course. This implies that all lines must be straight and parallel, which increases the footprint of the production workshop. Therefore, it is important to determine the number of sets of machines at the planning stage of the workshop, to enable a configuration of the production line that controls production costs.

2.2. Optimization Model for the Allocation of Production Equipment for Precast Concrete Components for Highway Projects

2.2.1. Basic Assumptions for the Allocation Model of Production Equipment

Working from the characteristics of the production process of large precast concrete components, several assumptions were made for the allocation model of production equipment, as follows
(a)
A machine is capable of processing only one part of a component at a time.
(b)
There is no priority in the processing of different components.
(c)
No other component process can be inserted while the current component is being processed.
(d)
Once a process is started, it must be completed before the next process can be carried out.
(e)
The processing sequence of components must follow the production flow.
(f)
No consideration is given to unexpected situations, such as machinery breakdown and maintenance.
(g)
The adjustment time for machinery and equipment and the transportation time of components between adjacent processes are included in the processing time of the corresponding process.
The model’s parameters were then set, as follows:
N denotes the set of precast component groups, N = {1, 2, 3, …, i, …, n}, where n is the total number of precast component groups and i is produced as the ith component.
M denotes the set of processes, M = {1, 2, 3, …, j, …, m}, where m is the total number of processes and j is the jth process of production.
Uj denotes the sets of machines for the jth process, Uj = {1, 2, 3, …, kj, …, uj}, where uj is the total number of sets of machines in the jth process and kj is the kth machine.
x ( i j , k j ) indicates whether the jth process of the ith component is performed on the k j t h kj set of machines.
C i j denotes the completion time of the jth process of the ith component.
t i j denotes the processing time of the jth process of the ith component.
Hw denotes the hours worked in a day.
D i j indicates the number of days worked at a time.
F T indicates the set processing period.

2.2.2. Optimization Model for the Allocation of Production Equipment

The issue to be optimized for allocating the production equipment of the prefabrication plant can be expressed as follows. There are n components to be processed in the prefabrication plant flow shop, with m processes for each component. The jth process of the ith component has a set of optional processing machines Uj to determine the optimal allocation of equipment resources, in order to meet the requirements of the duration and the number of components to be processed. The objective is to determine the optimal allocation of equipment resources under the conditions of meeting the schedule and the number of components to be processed.
The objective function was:
m i n   Z = j = 1 m u j
The objective function is stated in Equation (1). The term j = 1 m u j is the sum of the number of sets of machines for all processes, and its minimization allowed for the minimization of the number of sets of machines for each process.
The constraints were as follows:
(1)
Constraints of the production machinery:
x ( i j , k j ) = 1 , t h e   j t h   p r o c e s s   o f   t h e   i t h   c o m p o n e n t   i s   p e r f o r m e d   o n   k j t h   s e t   o f   m a c h i n e s 0 , o r
k = 1 u j x ( i j ; k j ) = 1
Equation (2) is a description of the state of the set of machines and production information. Equation (3) indicates that a process of a component can only be performed on one set of machines and only once.
(2)
Constraints of the completion time
T i j = max { C i 1   j , C i   j 1 } + t j ,
D i j = i n t { T i j / 24 }
Equation (4) calculates the completion time without considering the working time, which is the start time plus the processing time. Equation (5) utilizes a forward rounding function to calculate the number of days in which the completion time is located.
C i j = T i j , i f   T i j < 24 D i j + H w T i j + H w , i f   T i j 24 D i j + H w           j 1,2 , 3,5
C i j = T i j , i f   T i j < 24 D i j + H w 24 D i j + t j , i f   T i j 24 D i j + H w         j 4,7
C i j = T i j , i f   T i j < 24 D i j + H w 24 ( D i j + 1 ) , i f   24 D + H w T i j < 24 ( D i j + 1 ) T i j , i f   24 D i j + H w T i j < 24 ( D i j + 1 ) j 6
Equations (6)–(8) depict the constraints on the completion times of individual processes. Processes were categorized into three types, on the basis of whether they were interruptible and could only be performed during working hours.
(1)
A the process that is interruptible and can only be performed during working hours: processing (M1), reinforcement assembling (M2), steel moldboard installation (M3), and moldboard hydraulic stripping (M5). Production tasks that are not completed during working hours are scheduled to continue the next day, and this is formulated in Equation (6).
(2)
A process that is not interruptible and can only be performed during working hours: concrete pouring and vibrating (M4) and grouting (M7). Production tasks that are not completed during working hours will not be scheduled on the initial day, but will be scheduled for the next day in terms of starting production. This situation is described in Equation (7).
(3)
A process that is not interruptible and is allowed to take place during non-working hours: steam curing (M6). Whereas the next process needs to be carried out during work hours, the end time for a production task completed during non-working hours will be set as the start time of the next day. The end time for a production task completed during work hours remains the same. Equation (8) expresses this case (Figure 4).
C n m F T
Equation (9) is a constraint on the overall time. Here, C n m is the completion time of the last process of the last component (i.e., the final completion time), which must be inferior to the time limit.

2.3. Improved Differential Evolution for the Optimization Model

The mathematical optimization model above shows that the resource allocation optimization model for mechanical equipment is not a typical linear programming model and that it is challenging to find a workable solution that uses normal optimization techniques. For practical application, the intelligent optimization method has a strong adaptive ability for solving complex and challenging optimization problems, even though it cannot guarantee the optimality of the solution, which the conventional optimization method can. In order to solve the model, therefore, this research used the differential evolutionary algorithm. An algorithm flowchart is shown in Figure 5.

2.3.1. Encoding

In this study, process-based integer coding was used. The coding took into account six aspects: the number of components, number of processes, machinery and equipment numbers, the time for processing, the process start time, and the process end time. R is a 7n × 6 matrix, and Column 1 is the component number, with its value being an integer from 1 to n. Each integer occurs seven times and each component needs to go through seven processes to be considered to have completed processing, which is mathematically expressed as Equation (10):
R = 1 1 1 2 1 2 2 3 1 3 1 1 1 4 1 1.5 n 7 2 16

2.3.2. Population Initialization

The population initialization process included setting relevant parameters, such as the population size (NP), individual dimension (D), maximum iteration number (Gmax), initial variation operator (F0), and crossover operator (CR). The initial population is then formed by randomly creating NP individuals with dimension D.

2.3.3. Mutation Operations

In order to attain a faster convergence speed, as well as to maintain the diversity of the population, this study adopted the adaptive mutation operator, basing the approach on the combination of the DE/rand/1/bin mutation strategy and the DE/best/1/bin mutation strategy. The adaptive mutation operator was larger at the start of the iteration, and the primary mutation strategy, DE/rand/1/bin, could guarantee population diversity in order to prevent premature convergence. As the number of iterations increased, the mutation operator decreased and the rate of convergence increased.
F G = F 0 2 exp 1 G m a x / ( G m i n + 1 G )
v 1 , G = x r 1 , G + F G · x r 2 , G x r 3 , G , r a n d ( 0,1 ) F G x b e s t + F G · x r 1 , G x r 2 , G , o t h e r w i s e
Equation (12), where i = 1, 2, 3, …, n, r1, r2, r3 ∈ {1, NP} and i ≠ r1, r2, r3, rand(0, 1) ∈ (0, 1), and xbest is denoted as the best individual in the current population. The adaptive mechanism in Equation (11) ensures a smooth transition from global exploration to local refinement by exponentially decreasing the mutation operator FG as evolution progresses. This design promotes diversity early in the search while enabling precise convergence near optimal solutions later. Equation (12) implements a dual-strategy approach that stochastically alternates between the exploratory DE/rand/1 strategy and the exploitative DE/best/1 strategy. This balanced combination effectively navigates the complex solution space of equipment allocation.

2.3.4. Crossover Operation

To retain some information from the original individual while updating it, the target individual underwent a mutation and created a new, mutated individual. This mutated individual was then cross-operated with the target individual to facilitate the exchange of information. The target individual xi,G and its variant individual vi,G underwent a crossover operation, as described by Equation (13), to produce the test individual ui,G.
u i , G j = ν i , G j , i f   r a n d ( 0,1 ) C R     o r     j = r a n d ( D ) x i , G j , o t h e r w i s e
Equation (13), where i = 1, 2, 3, …, n, j = 1, 2, 3, …, D, CR ∈ (0, 1), and rand(D) is a [1, D] random integer, prevents invalid crossover operations and guarantees that there is at least one dimension of (rand(D)) information coming from the variant individuals.

2.3.5. Select Operation

The test individuals and target individuals were selected via one-to-one comparison through the objective function, leaving the individuals with smaller objective values to form a new population in order to complete an iterative search. The target individual xi,G and the test individual ui,G were selected, as shown in Equation (14), to obtain the next generation target individual xi,G+1.
x i , G + 1 = u i , G , i f F ( u i , G ) F ( x i , G ) x i , G , o t h e r w i s e
where i = 1, 2, 3, …, n, F(·) is the objective function.

3. Case Study

3.1. Case Profile

In order to verify the feasibility and effectiveness of the model and algorithm, this study selected the T-beam production line of a precast factory in Anhui Province as an example with which to carry out its research on the optimization of equipment resource allocation. This case was an exploratory case study [63,64] with a precast factory that was noted as “A precast factory”. The construction area for “A precast factory” was then divided into a light T-beam-prefabrication area; a box culvert; an arch-culvert prefabrication area; a round-pipe, covered-beam prefabrication area; and a steel processing yard. The factory was primarily responsible for the production of prefabricated components such as lightweight T-beams, cover beams, box culverts, arch culverts, round pipe culverts, and small prefabricated components. In this case, the integrated circular production line mentioned above was used to take full advantage of its high degree of automation. The production order for A prefabrication factory was for a 25-m lightweight T-beam with 1920 pieces and five production lines, with a planned construction period of 18 months. Therefore, as discussed in this section, 1920 T-beams were simulated for equipment configuration optimization. The process included primarily seven processes: reinforcement processing, reinforcement assembling, steel moldboard installation, concrete pouring and vibrating, moldboard hydraulic stripping, steam curing and tensioning, and grouting. The processing times for each process were [2, 3, 1, 1.5, 14, 16, 1]. The work hours of the workshop workers were 8:00 to 12:00 and 14:00 to 18:00, with a single break. break.

3.2. Simulation Analysis

3.2.1. Experimental Preparation

The MATLAB2021 coding software platform was used in this study to implement the equipment resource allocation optimization simulation. The computer used had a CPU main frequency of 3.0 GHz, 16 GB of memory, and Windows 10 installed. A total of 25 distinct simulations were run, with 100 iterations serving as the termination criterion.

3.2.2. Experimental Results and Analysis

The differential evolution algorithm iteration curve is shown in Figure 6. The optimal allocation of equipment resources was [2, 2, 1, 2, 5, 5, 1], which was basically the same as the original proposed program. However, when the construction period was changed to 18.5 months, the optimal allocation became [1, 2, 1, 1, 4, 4, 1], and the number of equipment resources needed was significantly reduced, thus confirming the feasibility and effectiveness of the model and algorithm. Efficient optimization of equipment resource allocation was crucial for increasing the use of equipment in order to lower production costs and boost the business’s economic efficiency.
In order to further verify the validity of the model and algorithm, the schedule, the number of components, and the processing time of the process were adjusted, making it possible to determine the optimal plan for the configuration of the number of resources in terms of equipment, as shown in Appendix A. The results indicated that when the equipment configuration program number was [2, 2, 1, 2, 5, 5, 1], and the processing time for each process [2, 3, 1, 1.5, 14, 16, 1] was reduced by two months, the required schedule was only 16 months, which is 11.11% better than the original program of 18 months.
In consideration of the adjustments of the number of components, the results showed that when using a unified configuration scheme for the number of pieces of equipment, the processing time, and the duration of the work, the maximum number of components produced by the configuration scheme [2, 2, 1, 2, 5, 5, 1] that could be satisfied in the duration of 18 months was 2330, which was an increase of 21.4% compared with the enterprise’s original number of components produced.
A higher monthly production demand resulted in a lower average quantity of equipment needed and a lower cost; in addition, a larger production scale resulted in a somewhat lower average cost of equipment inputs. The models and algorithms presented in this paper can also solve for the duration and the number of components produced, serve to obtain the maximum production demand that can be met by a certain equipment resource allocation scheme, and establish the optimal schedule.

4. Discussion

The case study results demonstrate the effectiveness of the proposed methodology through multiple quantifiable outcomes. Under identical resource configurations, the optimization model achieved an 11.11% reduction in project duration while maintaining the same production scale of 1920 T-beams. Concurrently, the model enabled a 21.4% increase in production capacity—from 1920 to 2330 components—within the original 18-month project timeline. These improvements, systematically validated through the scenario analyses presented in Appendix A.1, Appendix A.2 and Appendix A.3, demonstrate the model’s robust capability to enhance resource utilization efficiency while satisfying complex production constraints.
The consistent performance of the improved Differential Evolution algorithm stems from its carefully designed architecture. The integration of an adaptive mutation operator with a dual mutation strategy (DE/rand/1/bin and DE/best/1/bin) created a dynamic balance between exploration and exploitation throughout the optimization process. This methodological innovation enabled the algorithm to maintain population diversity while achieving accelerated convergence, as empirically demonstrated by the stable iteration curve in Figure 5. The algorithm’s reliability in addressing the high-dimensional equipment allocation challenge is further evidenced by its consistent convergence to feasible solutions across all tested scenarios in Appendix A.1, Appendix A.2 and Appendix A.3.
Compared to conventional approaches in precast production scheduling, the proposed model represents a substantial methodological advancement through its systematic incorporation of two critical production characteristics: process interruptibility and worktime constraints. These features address fundamental aspects of precast operations that are typically oversimplified or neglected in existing methodologies. By accurately representing these production realities within a mathematical optimization framework, our approach provides more practical and operationally relevant solutions for large-scale component manufacturing. This is particularly valuable in highway projects, where the demonstrated improvements in operational efficiency directly translate to enhanced project viability and substantial economic benefits, as quantified in our case study.

5. Conclusions

This study addresses the optimization of equipment resource allocation for the large-scale production of precast concrete components in highway engineering. The conclusions are structured as follows:

5.1. Scientific Results

The primary scientific contributions to construction science are threefold. First, a realistic production line model was successfully developed, incorporating the interruptibility of specific processes and the feasibility of non-working-hour operations, which addresses limitations in conventional scheduling models. Second, a constrained optimization framework was formulated to minimize equipment resources while adhering to process continuity, working-hour restrictions, and project deadlines. Third, an improved differential evolution algorithm was implemented and validated, featuring an adaptive mutation operator and a dual mutation strategy that significantly enhanced population diversity and accelerated convergence speed.

5.2. Applied Engineering Results

The practical engineering value for real-world road projects was demonstrated through a case study. The proposed model and algorithm achieved an 11.11% reduction in project duration and a 21.4% increase in production capacity under the same resource configuration. The optimal equipment allocation scheme effectively reduced resource consumption while meeting production targets, confirming the feasibility and effectiveness of the approach for actual prefabrication factories.

5.3. Limitations and Risks

Despite the achievements, several limitations and risks warrant attention. The model assumes equal priority among components, no transportation time, fixed working hours, and neglects overtime scenarios during schedule compression, which might reduce the real-world applicability. Seasonal climatic variations affecting curing and stripping times are not accounted for, potentially impacting accuracy. The optimization focuses on resource quantity without considering equipment costs, which is critical for economic objectives. Furthermore, real-world uncertainties such as machinery breakdowns, maintenance, and supply chain fluctuations were not incorporated, posing risks to implementation stability.

5.4. Future Prospects

Future research can be pursued in both scientific and applied areas. Scientifically, the model can be extended by integrating cost objectives and climate-adaptive time parameters. It is suggested to compare the proposed algorithm with other algorithms in terms of accuracy or efficiency. The algorithm’s performance can be further refined by integrating the strengths of other intelligent optimization algorithms, aiming to enhance its robustness, convergence speed, and population diversity. From an applied perspective, the framework can be adapted for dynamic rescheduling to manage production disruptions and scaled to other large-scale prefabrication projects, including stadiums and rail systems, to broaden its industrial impact. It is also suggested to consider machinery breakdown and maintenance time and transportation time among different procedures of precast concrete production in order to simulate the actual practices.

Author Contributions

Conceptualization, Y.Q.; Methodology, Y.Q. and N.M.; Software, Y.Q. and N.M.; Validation, N.M. and J.Y.; Formal analysis, Y.Q.; Investigation, N.M. and J.Y.; Resources, J.Y.; Data curation, N.M. and Q.S.; Writing—original draft, Y.Q. and N.M.; Writing—review & editing, Y.Q. and N.M.; Visualization, N.M., J.Y. and Q.S.; Supervision, J.Y.; Project administration, J.Y.; Funding acquisition, J.Y. All authors have read and agreed to the published version of the manuscript.

Funding

The work described in this paper was fully supported by a grant from the National Natural Science Foundation of China (Project No. 72274052).

Data Availability Statement

Data used in this study are available from the author upon reasonable request.

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A

Appendix A.1. Schedule Adjustments

Time/hSchedule/MonthWorkpiece/SizeAmount of Equipment
[2, 3, 1, 1.5, 14, 16, 1]151920[2, 2, 1, 2, 6, 6, 1]
[2, 3, 1, 1.5, 14, 16, 1]15.51920[2, 2, 1, 2, 6, 6, 1]
[2, 3, 1, 1.5, 14, 16, 1]161920[2, 2, 1, 2, 5, 5, 1]
[2, 3, 1, 1.5, 14, 16, 1]16.51920[2, 2, 1, 2, 5, 5, 1]
[2, 3, 1, 1.5, 14, 16, 1]171920[2, 2, 1, 2, 5, 5, 1]
[2, 3, 1, 1.5, 14, 16, 1]17.51920[2, 2, 1, 2, 5, 5, 1]
[2, 3, 1, 1.5, 14, 16, 1]181920[2, 2, 1, 2, 5, 5, 1]
[2, 3, 1, 1.5, 14, 16, 1]18.51920[1, 2, 1, 1, 4, 4, 1]
[2, 3, 1, 1.5, 14, 16, 1]191920[1, 2, 1, 1, 4, 4, 1]
[2, 3, 1, 1.5, 14, 16, 1]19.51920[1, 2, 1, 1, 4, 4, 1]

Appendix A.2. Adjustment of Component Quantity

Time/hSchedule/MonthWorkpiece/SizeAmount of Equipment
[2, 3, 1, 1.5, 14, 16, 1]181920[2, 2, 1, 2, 5, 5, 1]
[2, 3, 1, 1.5, 14, 16, 1]181950[2, 2, 1, 2, 5, 5, 1]
[2, 3, 1, 1.5, 14, 16, 1]182000[2, 2, 1, 2, 5, 5, 1]
[2, 3, 1, 1.5, 14, 16, 1]182050[2, 2, 1, 2, 5, 5, 1]
[2, 3, 1, 1.5, 14, 16, 1]182100[2, 2, 1, 2, 5, 5, 1]
[2, 3, 1, 1.5, 14, 16, 1]182150[2, 2, 1, 2, 5, 5, 1]
[2, 3, 1, 1.5, 14, 16, 1]182200[2, 2, 1, 2, 5, 5, 1]
[2, 3, 1, 1.5, 14, 16, 1]182250[2, 2, 1, 2, 5, 5, 1]
[2, 3, 1, 1.5, 14, 16, 1]182300[2, 2, 1, 2, 5, 5, 1]
[2, 3, 1, 1.5, 14, 16, 1]182320[2, 2, 1, 2, 5, 5, 1]
[2, 3, 1, 1.5, 14, 16, 1]182330[2, 2, 1, 2, 5, 5, 1]
[2, 3, 1, 1.5, 14, 16, 1]182335[2, 2, 1, 2, 6, 6, 1]
[2, 3, 1, 1.5, 14, 16, 1]182350[2, 2, 1, 2, 6, 6, 1]
[2, 3, 1, 1.5, 14, 16, 1]182400[2, 2, 1, 2, 6, 6, 1]
[2, 3, 1, 1.5, 14, 16, 1]182450[2, 2, 1, 2, 6, 6, 1]

Appendix A.3. Production Efficiency in April

Time/hSchedule/MonthWorkpiece/SizeAmount of Equipment
[2, 3, 1, 1.5, 14, 16, 1]30200[3, 4, 2, 3, 9, 9, 2]
[2, 3, 1, 1.5, 14, 16, 1]30195[3, 4, 2, 3, 9, 9, 2]
[2, 3, 1, 1.5, 14, 16, 1]30190[3, 4, 2, 3, 9, 9, 2]
[2, 3, 1, 1.5, 14, 16, 1]30185[2, 3, 1, 2, 8, 8, 1]
[2, 3, 1, 1.5, 14, 16, 1]30180[2, 3, 1, 2, 8, 8, 1]
[2, 3, 1, 1.5, 14, 16, 1]30175[2, 3, 1, 2, 8, 8, 1]
[2, 3, 1, 1.5, 14, 16, 1]30170[2, 3, 1, 2, 8, 8, 1]
[2, 3, 1, 1.5, 14, 16, 1]30165[2, 3, 1, 2, 8, 8, 1]
[2, 3, 1, 1.5, 14, 16, 1]30160[2, 3, 1, 2, 7, 7, 1]
[2, 3, 1, 1.5, 14, 16, 1]30155[2, 3, 1, 2, 7, 7, 1]
[2, 3, 1, 1.5, 14, 16, 1]30150[2, 3, 1, 2, 7, 7, 1]
[2, 3, 1, 1.5, 14, 16, 1]30145[2, 3, 1, 2, 7, 7, 1]
[2, 3, 1, 1.5, 14, 16, 1]30140[2, 3, 1, 2, 6, 6, 1]
[2, 3, 1, 1.5, 14, 16, 1]30135[2, 3, 2, 2, 6, 6, 1]
[2, 3, 1, 1.5, 14, 16, 1]30130[2, 3, 2, 2, 6, 6, 1]
[2, 3, 1, 1.5, 14, 16, 1]30125[2, 2, 1, 2, 6, 6, 1]
[2, 3, 1, 1.5, 14, 16, 1]30120[2, 2, 1, 2, 6, 6, 1]
[2, 3, 1, 1.5, 14, 16, 1]30115[2, 2, 1, 2, 5, 5, 1]
[2, 3, 1, 1.5, 14, 16, 1]30110[2, 2, 1, 2, 5, 5, 1]
[2, 3, 1, 1.5, 14, 16, 1]30105[2, 2, 1, 2, 5, 5, 1]
[2, 3, 1, 1.5, 14, 16, 1]30100[2, 2, 1, 2, 5, 5, 1]
[2, 3, 1, 1.5, 14, 16, 1]3095[2, 2, 1, 2, 5, 5, 1]
[2, 3, 1, 1.5, 14, 16, 1]3090[1, 2, 1, 1, 4, 4, 1]
[2, 3, 1, 1.5, 14, 16, 1]3085[1, 2, 1, 1, 4, 4, 1]
[2, 3, 1, 1.5, 14, 16, 1]3080[1, 2, 1, 1, 4, 4, 1]

References

  1. CPC Central Committee and State Council. Outline of the Construction of a Strong Transportation Country; CPC Central Committee and State Council: Beijing, China, 2019. [Google Scholar]
  2. China Speeds Up Building Modern Highway System; People’s Republic of China: Beijing, China. 2023. Available online: https://www.gov.cn/lianbo/bumen/202312/content_6921054.htm (accessed on 19 November 2025).
  3. Wang, Z.J.; Hu, H.; Gong, J. Framework for modeling operational uncertainty to optimize offsite production scheduling of precast components. Autom. Constr. 2018, 86, 69–80. [Google Scholar] [CrossRef]
  4. Ko, C.H.; Wang, S.F. Precast production scheduling using multi-objective genetic algorithms. Expert Syst. Appl. 2011, 38, 8293–8302. [Google Scholar] [CrossRef]
  5. Tengilimoglu, O.; Akyuz, U. Experimental study on hybrid precast tunnel segments reinforced by macro-synthetic fibres and glass fibre reinforced polymer bars. Tunn. Undergr. Space Technol. 2020, 106, 103612. [Google Scholar] [CrossRef]
  6. Jiang, W.; Wu, L.J. Flow shop optimization of hybrid make-to-order and make-to-stock in precast concrete component production. J. Clean. Prod. 2021, 297, 126708. [Google Scholar] [CrossRef]
  7. Ballard, G.; Harper, N.; Zabelle, T. Learning to see work flow: An application of lean concepts to precast concrete fabrication. Eng. Constr. Archit. Manag. 2003, 10, 6–14. [Google Scholar] [CrossRef]
  8. Huo, Z.; Wu, X.; Cheng, T. Scheduling Model for Prefabricated Component Assembly, Production, and Transportation Stage Based on GA for Prefabricated Buildings. IEEE Access 2024, 12, 60826–60838. [Google Scholar] [CrossRef]
  9. Heo, T.; Mallapragada, D.S.; Macdonald, R. A decomposition algorithm using multiple linear approximations to solve integrated design and scheduling optimization frameworks—Case study of nuclear based co-production of electricity and hydrogen. Comput. Chem. Eng. 2025, 202, 109213. [Google Scholar] [CrossRef]
  10. He, Q.-C.; Hong, T. Integrated facility location and production scheduling in multi-generation energy systems. Oper. Res. Lett. 2018, 46, 153–157. [Google Scholar] [CrossRef]
  11. Hong, J.K.; Shen, G.Q.; Mao, C.; Li, Z.D.; Li, K.J. Life-cycle energy analysis of prefabricated building components: An input-output-based hybrid model. J. Clean. Prod. 2016, 112, 2198–2207. [Google Scholar] [CrossRef]
  12. Liang, Y.; Xu, Z. Intelligent inspection of appearance quality for precast concrete components based on improved YOLO model and multi-source data. Eng. Constr. Archit. Manag. 2025, 32, 1691–1714. [Google Scholar] [CrossRef]
  13. Wang, Q.; Guo, Z.; Mei, T.; Li, Q.; Li, P. Labor crew workspace analysis for prefabricated assemblies’ installation: A 4D-BIM-based approach. Eng. Constr. Archit. Manag. 2018, 25, 374–411. [Google Scholar] [CrossRef]
  14. Zhang, H.; Yu, L. Dynamic transportation planning for prefabricated component supply chain. Eng. Constr. Archit. Manag. 2020, 27, 2553–2576. [Google Scholar] [CrossRef]
  15. Du, J.; Xue, Y.; Sugumaran, V.; Hu, M.; Dong, P. Improved biogeography-based optimization algorithm for lean production scheduling of prefabricated components. Eng. Constr. Archit. Manag. 2023, 30, 1601–1635. [Google Scholar] [CrossRef]
  16. Wang, S.Q.; Tang, J.; Zou, Y.Q.; Zhou, Q.H. Research on production process optimization of precast concrete component factory based on value stream mapping. Eng. Constr. Archit. Manag. 2020, 27, 850–871. [Google Scholar] [CrossRef]
  17. Weng-Tat, C.; Hao, H. An application of genetic algorithms to precast production scheduling. Comput. Struct. 2001, 79, 1605–1616. [Google Scholar] [CrossRef]
  18. Xie, L.-L.; Li, D.; Wu, S.; Chang, R.-D. Solving multi-mode resource-constrained scheduling problem of prefabricated construction using genetic algorithm. Eng. Constr. Archit. Manag. 2025; ahead of print. [Google Scholar] [CrossRef]
  19. Qin, X.; Fang, Z.; Zhang, Z. Multi-objective optimization for production scheduling of precast components considering resource constraints. Comput. Integr. Manuf. Syst. 2021, 27, 2248–2259. [Google Scholar]
  20. Leu, S.S.; Hwang, S.T. GA-based resource-constrained flow-shop scheduling model for mixed precast production. Autom. Constr. 2002, 11, 439–452. [Google Scholar] [CrossRef]
  21. Johnson, S.M. Optimal two- and three-stage production schedules with setup times included. Nav. Res. Logist. 1954, 1, 61–68. [Google Scholar] [CrossRef]
  22. Wang, Z.J.; Hu, H. Improved Precast Production-Scheduling Model Considering the Whole Supply Chain. J. Comput. Civ. Eng. 2017, 31, 04017013. [Google Scholar] [CrossRef]
  23. Ma, Z.L.; Yang, Z.T.; Liu, S.L.; Wu, S. Optimized rescheduling of multiple production lines for flowshop production of reinforced precast concrete components. Autom. Constr. 2018, 95, 86–97. [Google Scholar] [CrossRef]
  24. Cribbs, J.; Root, S. Defining an existing prefabrication workflow to identify measures for increased labour time utilization rates. IOP Conf. Ser. Mater. Sci. Eng. 2021, 1141, 012031. [Google Scholar] [CrossRef]
  25. Dan, Y.R.; Liu, G.W. Integrated scheduling optimization of production and transportation for precast component with delivery time window. Eng. Constr. Archit. Manag. 2024, 31, 3335–3355. [Google Scholar] [CrossRef]
  26. Wang, Z.J.; Hu, H.; Gong, J. Modeling Worker Competence to Advance Precast Production Scheduling Optimization. J. Constr. Eng. Manag. 2018, 144, 04018098. [Google Scholar] [CrossRef]
  27. Weng-Tat, C.; Tan Heng, W. A multiheuristic GA for schedule repair in precast plant production. In Proceedings of the Thirteenth International Conference on Automated Planning and Scheduling, Trento, Italy, 9–13 June 2003; pp. 236–245. [Google Scholar]
  28. Ko, C.H. Production control in precast fabrication: Considering demand variability in production schedules. Can. J. Civ. Eng. 2011, 38, 191–199. [Google Scholar] [CrossRef]
  29. Wang, Z.J.; Liu, Y.S.; Hu, H.; Dai, L. Hybrid Rescheduling Optimization Model under Disruptions in Precast Production Considering Real-World Environment. J. Constr. Eng. Manag. 2021, 147, 04021012. [Google Scholar] [CrossRef]
  30. Ying, K.-C.; Pourhejazy, P.; Lin, S.-C. An exploration of the shift work consideration in production scheduling. J. Comput. Sci. 2025, 92, 102724. [Google Scholar] [CrossRef]
  31. Wu, L.; Zhao, T.; Cai, X.; Cui, Z.; Chen, J. Dynamic multi-objective optimization for uncertain order insertion green shop production scheduling. Appl. Soft Comput. 2025, 182, 113573. [Google Scholar] [CrossRef]
  32. Du, Y.; Li, J.-Q.; Duan, P.-Y.; Geng, X.-X. A deep reinforcement learning driven bi-population evolutionary optimization for precast concrete scheduling with production transportation. Comput. Ind. Eng. 2025, 207, 111354. [Google Scholar] [CrossRef]
  33. Khalili, A.; Chua, D.K. Integrated Prefabrication Configuration and Component Grouping for Resource Optimization of Precast Production. J. Constr. Eng. Manag. 2014, 140, 04013052. [Google Scholar] [CrossRef]
  34. Yang, Z.T.; Ma, Z.L.; Wu, S. Optimized flowshop scheduling of multiple production lines for precast production. Autom. Constr. 2016, 72, 321–329. [Google Scholar] [CrossRef]
  35. Li, S.H.A.; Tserng, H.P.; Yin, S.Y.L.; Hsu, C.W. A production modeling with genetic algorithms for a stationary pre-cast supply chain. Expert Syst. Appl. 2010, 37, 8406–8416. [Google Scholar] [CrossRef]
  36. Ko, C.H.; Wang, S.F. GA-based decision support systems for precast production planning. Autom. Constr. 2010, 19, 907–916. [Google Scholar] [CrossRef]
  37. Glover, F. Tabu search. ORSA J. Comput. 1989, 1. Available online: https://link.springer.com/book/10.1007/978-1-4615-6089-0 (accessed on 19 November 2025). [CrossRef]
  38. Holland, J.H. Adaptation in Natural and Artificial Systems; University of Michigan: Ann Arbor, MI, USA, 1975; pp. 529–530. [Google Scholar]
  39. Dorigo, M.; Maniezzo, V.; Colorni, A. Ant system: Optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. Part B 1996, 26, 29–41. [Google Scholar] [CrossRef]
  40. Chan, W.T.; Hu, H. Production scheduling for precast plants using a flow shop sequencing model. J. Comput. Civ. Eng. 2002, 16, 165–174. [Google Scholar] [CrossRef]
  41. Zhang, J.Q.; Sanderson, A.C. JADE: Adaptive Differential Evolution with Optional External Archive. IEEE Trans. Evol. Comput. 2009, 13, 945–958. [Google Scholar] [CrossRef]
  42. Storn, R.; Price, K. Differential Evolution—A Simple and Efficient Heuristic for global Optimization over Continuous Spaces. J. Glob. Optim. 1997, 11, 341–359. [Google Scholar] [CrossRef]
  43. Vincent, A.M.; Parthasarathy, K.S.S.; Jidesh, P. Flood susceptibility mapping using AutoML and a deep learning framework with evolutionary algorithms for hyperparameter optimization. Appl. Soft Comput. 2023, 148, 110846. [Google Scholar] [CrossRef]
  44. Tian, Y.; Li, T. Power optimization method for wireless power transmission system based on improved differential evolution algorithm. IOP Conf. Ser. Mater. Sci. Eng. 2020, 768, 042035. [Google Scholar] [CrossRef]
  45. Mayo, M. Identifying Market Price Levels Using Differential Evolution. In Applications of Evolutionary Computation: Proceedings of the 16th European Conference (EvoApplications 2013), Vienna, Austria, 3–5 April 2013; Springer: Berlin/Heidelberg, Germany, 2012; pp. 203–212. [Google Scholar]
  46. Seng, J.; Zhang, L. ESG ratings and corporate clean production from the perspective of evolutionary game theory: Evidence from A-share listed companies. Energy Econ. 2025, 152, 108989. [Google Scholar] [CrossRef]
  47. Cao, G.; Zhang, Q.; Zhang, P. Multicore-based parallelized differential evolution for image registration. Comput. Eng. Appl. 2017, 53, 166–172. [Google Scholar] [CrossRef]
  48. Tian, S.; Zhao, Z.; Du, S. Energy-saving optimal scheduling based on improved multiobjective differential evolution algorithm. Eng. J. Wuhan Univ. 2019, 52, 1091–1096+1105. [Google Scholar]
  49. Dugast, F.; Bénac, S.; Marty, P.; Chessé, P. Multiple optimal solutions in synthesis, design and operation optimization of a marine energy system with the differential evolution algorithm. Ocean Eng. 2025, 328, 121064. [Google Scholar] [CrossRef]
  50. Chi-Hua, T.; Meng-Hui, C.; Chia-Yu, H.; Pei-Chann, C. Differential evolutionary algorithms with novel mutation operator for solving the permutation flowshop scheduling problem. In Proceedings of the 2015 International Conference on Control, Automation and Robotics, Singapore, 20–22 May 2015. [Google Scholar]
  51. Qi, X.; Wang, H.; Chen, F.; Tang, Q.; Sun, Y. Novel quantum differential evolutionary algorithm for blocking flow-shop scheduling. J. Comput. Appl. 2015, 35, 663–667. [Google Scholar]
  52. Wenbo, L. An improved differential evolution for permutation flowshop scheduling problem with total flowtime criterion. In Proceedings of the 2012 3rd International Conference on System Science, Engineering Design and Manufacturing Informatization, Chengdu, China, 20–21 October 2012. [Google Scholar]
  53. Babu, B.V.; Chakole, P.G.; Syed Mubeen, J.H. Multiobjective differential evolution (MODE) for optimization of adiabatic styrene reactor. Chem. Eng. Sci. 2005, 60, 4822–4837. [Google Scholar] [CrossRef]
  54. Xu, B.; Cheng, W.; Qian, F.; Huang, X. Self-adaptive differential evolution with multiple strategies for dynamic optimization of chemical processes. Neural Comput. Appl. 2019, 31, 2041–2061. [Google Scholar] [CrossRef]
  55. Hruschka, E.R.; Campello, R.J.; Freitas, A.A. A Survey of Evolutionary Algorithms for Clustering. IEEE Trans. Syst. Man Cybern. Part C 2009, 39, 133–155. [Google Scholar] [CrossRef]
  56. Cui, Z.; Zhao, B.; Zhao, T.; Cai, X.; Chen, J. An adaptive differential evolution algorithm based on archive reuse. Inf. Sci. 2024, 668, 120524. [Google Scholar] [CrossRef]
  57. Bu, X.; Zhang, Q.; Gao, H.; Zhang, H. Multi-strategy differential evolution algorithm based on adaptive hash clustering and its application in wireless sensor networks. Expert Syst. Appl. 2024, 246, 123214. [Google Scholar] [CrossRef]
  58. Zhao, H.; Zhan, Z.-H.; Lin, Y.; Chen, X.; Luo, X.-N.; Zhang, J.; Kwong, S.; Zhang, J. Local Binary Pattern-Based Adaptive Differential Evolution for Multimodal Optimization Problems. IEEE Trans. Cybern. 2020, 50, 3343–3357. [Google Scholar] [CrossRef]
  59. Zhang, Q.; Meng, Z. Adaptive differential evolution algorithm based on deeply-informed mutation strategy and restart mechanism. Eng. Appl. Artif. Intell. 2023, 126, 107001. [Google Scholar] [CrossRef]
  60. Tan, Z.; Li, K.; Wang, Y. Differential evolution with adaptive mutation strategy based on fitness landscape analysis. Inf. Sci. 2021, 549, 142–163. [Google Scholar] [CrossRef]
  61. Mostafa, R.R.; Khedr, A.M.; Al Aghbari, Z.; Afyouni, I.; Kamel, I.; Ahmed, N. An adaptive hybrid mutated differential evolution feature selection method for low and high-dimensional medical datasets. Knowl. Based Syst. 2024, 283, 111218. [Google Scholar] [CrossRef]
  62. Chen, B.; Ouyang, H.; Li, S.; Ding, W. Dual-stage self-adaptive differential evolution with complementary and ensemble mutation strategies. Swarm Evol. Comput. 2025, 93, 101855. [Google Scholar] [CrossRef]
  63. Zeng, N.S.; Ye, X.L.; Liu, Y.; König, M. BIM-enabled Kanban system in construction logistics for real-time demand reporting and pull replenishment. Eng. Constr. Archit. Manag. 2024, 31, 3069–3096. [Google Scholar] [CrossRef]
  64. Jaspers, F. Case study research: Some other applications besides theory building. J. Purch. Supply Manage. 2007, 13, 210–212. [Google Scholar] [CrossRef]
Figure 1. Research framework.
Figure 1. Research framework.
Buildings 15 04226 g001
Figure 2. Circular production line.
Figure 2. Circular production line.
Buildings 15 04226 g002
Figure 3. Highway project precast component fabrication processes.
Figure 3. Highway project precast component fabrication processes.
Buildings 15 04226 g003
Figure 4. Diagram of the executions of production tasks with different characteristics.
Figure 4. Diagram of the executions of production tasks with different characteristics.
Buildings 15 04226 g004
Figure 5. Improved flowchart for the differential evolution algorithm.
Figure 5. Improved flowchart for the differential evolution algorithm.
Buildings 15 04226 g005
Figure 6. Iteration curve for the DE algorithm.
Figure 6. Iteration curve for the DE algorithm.
Buildings 15 04226 g006
Table 1. Literature related to production scheduling.
Table 1. Literature related to production scheduling.
No.AuthorsMethodologyLimitations to Consider in SchedulingResearch Topics
1[21]Easy, correct algorithms-Investigation of optimal two- and three-stage production scheduling strategies, including setup times
2[40]GA-Model of flow shop sequencing, to
ensure on-time delivery of PCs
3[35]GA and branch-and-bound methodLabor and inventoryOptimization of precast production
costs subject to internal resource
constraints
4[30]GAProduction stationsProposal of a decision support system to
optimize production plans
5[33]Mixed integer linear programming modelMoldsProposal of an integrated prefabrication configuration and component grouping approach for resource optimization in precast production
6[28]GAMoldsProposal of an optimized flow shop scheduling method for multiple production lines in precast production
7[26]GA-Consideration of demand variability
using a pure optimization model
8[6]Whale optimization algorithm-Investigation of flow shop optimization methods for hybrid make-to-order and make-to-stock production in precast concrete component manufacturing
Note: GA = genetic algorithm.
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Qian, Y.; Mao, N.; Yu, J.; Shi, Q. Optimization of Precast Concrete Production with a Differential Evolutionary Algorithm. Buildings 2025, 15, 4226. https://doi.org/10.3390/buildings15234226

AMA Style

Qian Y, Mao N, Yu J, Shi Q. Optimization of Precast Concrete Production with a Differential Evolutionary Algorithm. Buildings. 2025; 15(23):4226. https://doi.org/10.3390/buildings15234226

Chicago/Turabian Style

Qian, Yelin, Nianzhang Mao, Jingyu Yu, and Qingyu Shi. 2025. "Optimization of Precast Concrete Production with a Differential Evolutionary Algorithm" Buildings 15, no. 23: 4226. https://doi.org/10.3390/buildings15234226

APA Style

Qian, Y., Mao, N., Yu, J., & Shi, Q. (2025). Optimization of Precast Concrete Production with a Differential Evolutionary Algorithm. Buildings, 15(23), 4226. https://doi.org/10.3390/buildings15234226

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop