Search results

This study aims to develop a framework for the optimal selection of construction project portfolios for a construction holding company. The objective is to minimize risks, align the portfolio with the organization’s strategic objectives and maximize portfolio returns and net present value (NPV).

The study develops a multi-objective genetic algorithm approach to optimize the portfolio selection process. The construction company’s portfolio is categorized into four main classes: water projects, building projects, road projects and healthcare projects. A mathematical model is developed, and a genetic algorithm is implemented using MATLAB software. Data from a construction holding company in Iraq, including budget and candidate projects, are used as a case study.

The case study results show that out of the 34 candidate projects, 13 have been recommended for execution. These selected projects span different portfolio classes, such as water, building, road and healthcare projects. The total budget required for executing the selected projects is $64.55m, within the organization’s budget limit. The convergence diagram of the genetic algorithm indicates that the best solutions were achieved around generation 20 and further improved from generation 60 onwards.

The study introduces a specialized framework for project portfolio management in the construction industry, focusing on risk management and strategic alignment. It uses a multi-objective genetic algorithm and risk analysis to minimize risks, increase returns and improve portfolio performance. The case study validates its practical applicability.

This study contributes to project portfolio management by developing a framework specifically tailored for construction holding companies. Integrating a multi-objective genetic algorithm allows for a comprehensive optimization process, taking into account various objectives, including portfolio returns, NPV, risk reduction and strategic alignment. The case study application provides practical insights and validates the effectiveness of the proposed framework in a real-world setting.

This paper aims to develop an algorithm to study the impact of dynamic resource disruption on project makespan and provide a suitable resource disruption ratio for various complex industrial and emergency projects.

This paper addresses the RCPSP in dynamic environments, which assumes resources will be disrupted randomly, that is, the information about resource disruption is not known in advance. To this end, a reactive scheduling model is proposed for the case of random dynamic disruptions of resources. To solve the reactive scheduling model, a hybrid genetic algorithm with a variable neighborhood search is proposed.

The results obtained on the PSLIB instances prove the performance advantage of the algorithm; through sensitivity analysis, it can be obtained, the project makespan increases exponentially as the number of disruptions increase. Furthermore, if more than 50% of the project's resources are randomly disrupted, the project makespan will be significantly impacted.

The paper focuses on the impact of dynamic resource disruptions on project makespan. Few studies have considered stochastic, dynamic resource uncertainty. In addition, this research proposes a reasonable scheduling algorithm for the research problem, and the conclusions drawn from the research provide decision support for project managers.

In recent years, the demand for garments has significantly increased, requiring manufacturers to speed up their production to attract customers. Cut order planning (COP) is one of the most important processes in the apparel manufacturing industry. The appropriate stencil arrangement can reduce costs and fabric waste. The COP problem focuses on determining the size combination for a pattern, which is determined by the length of the cutting table, width, demand order, and height of the cutting equipment.

This study proposes new heuristics: genetic algorithm (GA), symbiotic organism search, and divide-and-search-based Lite heuristic and a One-by-One (ObO) heuristic to address the COP problem. The objective of the COP problem is to determine the optimal combination of stencils to meet demand requirements and minimize the total fabric length.

A comparison between our proposed heuristics and other simulated annealing and GA-based heuristics, and a hybrid approach (conventional algorithm + GA) was conducted to demonstrate the effectiveness and efficiency of the proposed heuristics. The test results show that the ObO heuristic can significantly improve the solution efficiency and find the near optimal solution for extreme demands.

This paper proposes a new heuristic, the One-by-One (ObO) heuristic, to solve the COP problem. The results show that the proposed approaches overcome the long operation time required to determine the fitting arrangement of stencils. In particular, our proposed ObO heuristic can significantly improve the solution efficiency, i.e. finding the near optimal solution for extreme demands within a very short time.

The purpose of this research is to address the complex multiobjective unrelated parallel machine scheduling problem with real-world constraints, including sequence-dependent setup times and periodic machine maintenance. The primary goal is to minimize total tardiness, earliness and total completion times simultaneously. This study aims to provide effective solution methods, including a Mixed-Integer Programming (MIP) model, an Epsilon-constraint method and the Nondominated Sorting Genetic Algorithm (NSGA-II), to offer valuable insights into solving large-sized instances of this challenging problem.

This study addresses a multiobjective unrelated parallel machine scheduling problem with sequence-dependent setup times and periodic machine maintenance activities. An MIP model is introduced to formulate the problem, and an Epsilon-constraint method is applied for a solution. To handle the NP-hard nature of the problem for larger instances, an NSGA-II is developed. The research involves the creation of 45 problem instances for computational experiments, which evaluate the performance of the algorithms in terms of proposed measures.

The research findings demonstrate the effectiveness of the proposed solution approaches for the multiobjective unrelated parallel machine scheduling problem. Computational experiments on 45 generated problem instances reveal that the NSGA-II algorithm outperforms the Epsilon-constraint method, particularly for larger instances. The algorithms successfully minimize total tardiness, earliness and total completion times, showcasing their practical applicability and efficiency in handling real-world scheduling scenarios.

This study contributes original value by addressing a complex multiobjective unrelated parallel machine scheduling problem with real-world constraints, including sequence-dependent setup times and periodic machine maintenance activities. The introduction of an MIP model, the application of the Epsilon-constraint method and the development of the NSGA-II algorithm offer innovative approaches to solving this NP-hard problem. The research provides valuable insights into efficient scheduling methods applicable in various industries, enhancing decision-making processes and operational efficiency.

Prefabricated building has been widely applied in the construction industry all over the world, which can significantly reduce labor consumption and improve construction efficiency compared with conventional approaches. During the construction of prefabricated buildings, the overall efficiency largely depends on the lifting sequence and path of each prefabricated component. To improve the efficiency and safety of the lifting process, this study proposes a framework for automatically optimizing the lifting path of prefabricated building components using building information modeling (BIM), improved 3D-A* and a physic-informed genetic algorithm (GA).

Firstly, the industry foundation class (IFC) schema for prefabricated buildings is established to enrich the semantic information of BIM. After extracting corresponding component attributes from BIM, the models of typical prefabricated components and their slings are simplified. Further, the slings and elements’ rotations are considered to build a safety bounding box. Secondly, an efficient 3D-A* is proposed for element path planning by integrating both safety factors and variable step size. Finally, an efficient GA is designed to obtain the optimal lifting sequence that satisfies physical constraints.

The proposed optimization framework is validated in a physics engine with a pilot project, which enables better understanding. The results show that the framework can intuitively and automatically generate the optimal lifting path for each type of prefabricated building component. Compared with traditional algorithms, the improved path planning algorithm significantly reduces the number of nodes computed by 91.48%, resulting in a notable decrease in search time by 75.68%.

In this study, a prefabricated component path planning framework based on the improved A* algorithm and GA is proposed for the first time. In addition, this study proposes a safety-bounding box that considers the effects of torsion and slinging of components during lifting. The semantic information of IFC for component lifting is enriched by taking into account lifting data such as binding positions, lifting methods, lifting angles and lifting offsets.

This paper aims to develop a method for tuning the parameters of the active disturbance rejection controller (ADRC) for fixed-wing unmanned aerial vehicles (UAVs). The bald eagle search (BES) algorithm has been improved, and a cost function has been designed to enhance the optimization efficiency of ADRC parameters.

A six-degree-of-freedom nonlinear model for a fixed-wing UAV has been developed, and its attitude controller has been formulated using the active disturbance rejection control method. The parameters of the disturbance rejection controller have been fine-tuned using the collaborative mutual promotion bald eagle search (CMP-BES) algorithm. The pitch and roll controllers for the UAV have been individually optimized to obtain the most effective controller parameters.

Inspired by the salp swarm algorithm (SSA), the interaction among individual eagles has been incorporated into the CMP-BES algorithm, thereby enhancing the algorithm's exploration capability. The efficient and accurate optimization ability of the proposed algorithm has been demonstrated through comparative experiments with genetic algorithm, particle swarm optimization, Harris hawks optimization HHO, BES and modified bald eagle search algorithms. The algorithm's capability to solve complex optimization problems has been further proven by testing on the CEC2017 test function suite. A transitional function for fitness calculation has been introduced to accelerate the ability of the algorithm to find the optimal parameters for the ADRC controller. The tuned ADRC controller has been compared with the classical proportional-integral-derivative (PID) controller, with gust disturbances introduced to the UAV body axis. The results have shown that the tuned ADRC controller has faster response times and stronger disturbance rejection capabilities than the PID controller.

The proposed CMP-BES algorithm, combined with a fitness function composed of transition functions, can be used to optimize the ADRC controller parameters for fixed-wing UAVs more quickly and effectively. The tuned ADRC controller has exhibited excellent robustness and disturbance rejection capabilities.

The CMP-BES algorithm and transitional function have been proposed for the parameter optimization of the active disturbance rejection controller for fixed-wing UAVs.

Although the previous generations of the Industrial Revolution have brought many advantages to human life, scientists have been looking for a substantial breakthrough in creating technologies that can improve the quality of human life. Nowadays, we can make our factories smarter using new concepts and tools like real-time self-optimization. This study aims to take a step towards implementing key features of smart manufacturing including  preventive self-maintenance, self-scheduling and real-time decision-making.

A new bi-objective mathematical model based on Industry 4.0 to schedule received customer orders, which minimizes both the total earliness and tardiness of orders and the probability of machine failure in smart manufacturing, was presented. Moreover, four meta-heuristics, namely, the multi-objective Archimedes optimization algorithm (MOAOA), NSGA-III, multi-objective simulated annealing (MOSA) and hybrid multi-objective Archimedes optimization algorithm and non-dominated sorting genetic algorithm-III (HMOAOANSGA-III) were implemented to solve the problem. To compare the performance of meta-heuristics, some examples and metrics were presumed and solved by using the algorithms, and the performance and validation of meta-heuristics were analyzed.

The results of the procedure and a mathematical model based on Industry 4.0 policies showed that a machine performed the self-optimizing process of production scheduling and followed a preventive self-maintenance policy in real-time situations. The results of TOPSIS showed that the performances of the HMOAOANSGA-III were better in most problems. Moreover, the performance of the MOSA outweighed the performance of the MOAOA, NSGA-III and HMOAOANSGA-III if we only considered the computational times of algorithms. However, the convergence of solutions associated with the MOAOA and HMOAOANSGA-III was better than those of the NSGA-III and MOSA.

In this study, a scheduling model considering a kind of Industry 4.0 policy was defined, and a novel approach was presented, thereby performing the preventive self-maintenance and self-scheduling by every single machine. This new approach was introduced to integrate the order scheduling system using a real-time decision-making method. A new multi-objective meta-heuristic algorithm, namely, HMOAOANSGA-III, was proposed. Moreover, the crowding-distance-quality-based approach was presented to identify the best solution from the frontier, and in addition to improving the crowding-distance approach, the quality of the solutions was also considered.

The purpose of this paper is to develop a model considering synergy effect for prefabricated construction service combination selection.

This research defines prefabricated construction service as a service-led construction method that meets the specific requirements of clients. Based on network theory, the multi-dimensional collaborative relationships of the prefabricated construction inter-services are formulated. The synergy effect is quantitatively calculated through the linear weighting of the strengths of collaborative relationships. Further, a weighted synergy network (WSN) is developed, from which a service composition selection model considering the synergy effect is established. Then, a genetic algorithm is employed to implement the model.

The results showed that (1) when the number of prefabricated construction services is increased, the synergy effect of combination options is enhanced; (2) The finer-grained prefabricated construction services, the stronger the synergy effect of service combination; (3) Clients have heterogeneous preferences for collaborative relationships, and there are differences in the synergy effect of service combination.

The contribution of this research includes proposed a method to quantify the synergy effect from the perspective of collaborative relationships, explored the specific procedure for the prefabricated construction service combination selection under the service-led construction, and provided a reference for promoting the development in construction. Besides, the model proposed could be applied to prefabricated construction service composition selection with diverse research boundaries or client preferences by executing the same procedure.

This study aims to solve the problem of job scheduling and multi automated guided vehicle (AGV) cooperation in intelligent manufacturing workshops.

In this study, an algorithm for job scheduling and cooperative work of multiple AGVs is designed. In the first part, with the goal of minimizing the total processing time and the total power consumption, the niche multi-objective evolutionary algorithm is used to determine the processing task arrangement on different machines. In the second part, AGV is called to transport workpieces, and an improved ant colony algorithm is used to generate the initial path of AGV. In the third part, to avoid path conflicts between running AGVs, the authors propose a simple priority-based waiting strategy to avoid collisions.

The experiment shows that the solution can effectively deal with job scheduling and multiple AGV operation problems in the workshop.

In this paper, a collaborative work algorithm is proposed, which combines the job scheduling and AGV running problem to make the research results adapt to the real job environment in the workshop.

This paper aims to determine the type of supplier involvement in terms of time and extent of supplier involvement in automobile product development based on the characteristics of parts in the Iranian automotive industry.

The paper proposes the clustering and analytic hierarchy process (AHP) methods. Combining the K-means clustering method and metaheuristic algorithms, the genetic algorithm (GA) and particle swarm optimization (PSO) algorithm are applied to achieve better clustering results.

The results show that lack of internal knowledge, high technology change and complexity of parts increase the need to outsource the design process. In addition to these reasons, high development costs and high interface complexity justify suppliers’ early involvement.

Most research only presents a conceptual framework for understanding the various levels of supplier involvement in new product development (NPD). However, in the automotive industry, numerous parts have differing degrees of importance and priority, and experts may have varying opinions based on different criteria. Therefore, the existing conceptual model for analyzing the types of involvement of each supplier is not practical. We have formulated a problem-solving approach that utilizes the clustering and AHP methods to analyze data obtained from qualitative research and determine the type of supplier involvement.