Search results

The purpose of this paper is to develop a bi-objective optimization framework to select prefabricated construction service composition. An improved algorithm-genetic simulated annealing algorithm (GSA) is employed to demonstrate the application of the framework.

The weighted aggregate multi-dimensional collaborative relationship is used to quantitatively evaluate the synergistic effect. The quality of service is measured using the same method. The research proposed a service combination selection framework of prefabricated construction that comprehensively considers the quality of service and synergistic effect. The framework is demonstrated by using a GSA that can accept poor solutions with a certain probability. Furthermore, GSA is compared with the genetic algorithm (GA), simulated annealing algorithm (SA) and particle swarm optimization algorithm (PSO) to validate the performance.

The results indicated that GSA has the largest optimal fitness value and synergistic effect compared with other algorithms, and the convergence time and convergence iteration of the improved algorithm are generally at a low level.

The contribution of this study is that the proposed framework enables project managers to clarify the interactions of the prefabricated construction process and provides guidance for project collaborative management. In addition, GSA helps to improve the probability of successful collaboration between potential partners, therefore enhancing client satisfaction.

Traditional case-adaptation methods have poor accuracy, low efficiency and limited applicability, which cannot meet the needs of knowledge users. To address the shortcomings of the existing research in the industry, this paper proposes a case-adaptation optimization algorithm to support the effective application of tacit knowledge resources.

The attribute simplification algorithm based on the forward search strategy in the neighborhood decision information system is implemented to realize the vertical dimensionality reduction of the case base, and the fuzzy C-mean (FCM) clustering algorithm based on the simulated annealing genetic algorithm (SAGA) is implemented to compress the case base horizontally with multiple decision classes. Then, the subspace K-nearest neighbors (KNN) algorithm is used to induce the decision rules for the set of adapted cases to complete the optimization of the adaptation model.

The findings suggest the rapid enrichment of data, information and tacit knowledge in the field of practice has led to low efficiency and low utilization of knowledge dissemination, and this algorithm can effectively alleviate the problems of users falling into “knowledge disorientation” in the era of the knowledge economy.

This study provides a model with case knowledge that meets users’ needs, thereby effectively improving the application of the tacit knowledge in the explicit case base and the problem-solving efficiency of knowledge users.

The adaptation model can serve as a stable and efficient prediction model to make predictions for the effects of the many logistics and e-commerce enterprises' plans.

This study designs a multi-decision class case-adaptation optimization study based on forward attribute selection strategy-neighborhood rough sets (FASS-NRS) and simulated annealing genetic algorithm-fuzzy C-means (SAGA-FCM) for tacit knowledgeable exogenous cases. By effectively organizing and adjusting tacit knowledge resources, knowledge service organizations can maintain their competitive advantages. The algorithm models established in this study develop theoretical directions for a multi-decision class case-adaptation optimization study of tacit knowledge.

Path planning is an important part of UAV mission planning. The main purpose of this paper is to overcome the shortcomings of the standard particle swarm optimization (PSO) such as easy to fall into the local optimum, so that the improved PSO applied to the UAV path planning can enable the UAV to plan a better quality path.

Firstly, the adaptation function is formulated by comprehensively considering the performance constraints of the flight target as well as the UAV itself. Secondly, the standard PSO is improved, and the improved particle swarm optimization with multi-strategy fusion (MFIPSO) is proposed. The method introduces class sigmoid inertia weight, adaptively adjusts the learning factors and at the same time incorporates K-means clustering ideas and introduces the Cauchy perturbation factor. Finally, MFIPSO is applied to UAV path planning.

Simulation experiments are conducted in simple and complex scenarios, respectively, and the quality of the path is measured by the fitness value and straight line rate, and the experimental results show that MFIPSO enables the UAV to plan a path with better quality.

Aiming at the standard PSO is prone to problems such as premature convergence, MFIPSO is proposed, which introduces class sigmoid inertia weight and adaptively adjusts the learning factor, balancing the global search ability and local convergence ability of the algorithm. The idea of K-means clustering algorithm is also incorporated to reduce the complexity of the algorithm while maintaining the diversity of particle swarm. In addition, the Cauchy perturbation is used to avoid the algorithm from falling into local optimum. Finally, the adaptability function is formulated by comprehensively considering the performance constraints of the flight target as well as the UAV itself, which improves the accuracy of the evaluation model.

Influenced by the constantly changing manufacturing environment, no single dispatching rule (SDR) can consistently obtain better scheduling results than other rules for the dynamic job-shop scheduling problem (DJSP). Although the dynamic SDR selection classifier (DSSC) mined by traditional data-mining-based scheduling method has shown some improvement in comparison to an SDR, the enhancement is not significant since the rule selected by DSSC is still an SDR.

This paper presents a novel data-mining-based scheduling method for the DJSP with machine failure aiming at minimizing the makespan. Firstly, a scheduling priority relation model (SPRM) is constructed to determine the appropriate priority relation between two operations based on the production system state and the difference between their priority values calculated using multiple SDRs. Subsequently, a training sample acquisition mechanism based on the optimal scheduling schemes is proposed to acquire training samples for the SPRM. Furthermore, feature selection and machine learning are conducted using the genetic algorithm and extreme learning machine to mine the SPRM.

Results from numerical experiments demonstrate that the SPRM, mined by the proposed method, not only achieves better scheduling results in most manufacturing environments but also maintains a higher level of stability in diverse manufacturing environments than an SDR and the DSSC.

This paper constructs a SPRM and mines it based on data mining technologies to obtain better results than an SDR and the DSSC in various manufacturing environments.

A cross-domain intelligent software-defined network (SDN) routing method based on a proposed multiagent deep reinforcement learning (MDRL) method is developed.

First, the network is divided into multiple subdomains managed by multiple local controllers, and the state information of each subdomain is flexibly obtained by the designed SDN multithreaded network measurement mechanism. Then, a cooperative communication module is designed to realize message transmission and message synchronization between the root and local controllers, and socket technology is used to ensure the reliability and stability of message transmission between multiple controllers to acquire global network state information in real time. Finally, after the optimal intradomain and interdomain routing paths are adaptively generated by the agents in the root and local controllers, a network traffic state prediction mechanism is designed to improve awareness of the cross-domain intelligent routing method and enable the generation of the optimal routing paths in the global network in real time.

Experimental results show that the proposed cross-domain intelligent routing method can significantly improve the network throughput and reduce the network delay and packet loss rate compared to those of the Dijkstra and open shortest path first (OSPF) routing methods.

Message transmission and message synchronization for multicontroller interdomain routing in SDN have long adaptation times and slow convergence speeds, coupled with the shortcomings of traditional interdomain routing methods, such as cumbersome configuration and inflexible acquisition of network state information. These drawbacks make it difficult to obtain global state information about the network, and the optimal routing decision cannot be made in real time, affecting network performance. This paper proposes a cross-domain intelligent SDN routing method based on a proposed MDRL method. First, the network is divided into multiple subdomains managed by multiple local controllers, and the state information of each subdomain is flexibly obtained by the designed SDN multithreaded network measurement mechanism. Then, a cooperative communication module is designed to realize message transmission and message synchronization between root and local controllers, and socket technology is used to ensure the reliability and stability of message transmission between multiple controllers to realize the real-time acquisition of global network state information. Finally, after the optimal intradomain and interdomain routing paths are adaptively generated by the agents in the root and local controllers, a prediction mechanism for the network traffic state is designed to improve awareness of the cross-domain intelligent routing method and enable the generation of the optimal routing paths in the global network in real time. Experimental results show that the proposed cross-domain intelligent routing method can significantly improve the network throughput and reduce the network delay and packet loss rate compared to those of the Dijkstra and OSPF routing methods.

Despite the enormous need to succeed in the urban model, scientists and policymakers should work consistently to create blueprints to regulate urbanization. The absence of coordination between the crucial requirements and the regional strategies of the local authorities leads to a lack of conformance in urban development. The purpose of this paper is to address this issue.

This study intends to manage future urban growth patterns using integrated methods and then employ the results in the genetic algorithm (GA) model to considerably improve growth behavior. Multi-temporal land-use datasets have been derived from remotely sensed images for the years 1990, 2000, 2010 and 2020. Urban growth patterns and processes were then analyzed with land-use-and-land-cover dynamics. Results were examined for simulation and utilization of the GA.

Model parameters were derived and evaluated, and a preliminary assessment of the effective coefficient in the formation of urbanization is analyzed, showing the city's urbanization pattern has followed along with the transportation infrastructure and outward growth, and the scattering rates are high, with an increase of 5.64% in building area associated with a decrease in agricultural lands and rangelands.

The research achieved a considerable improvement over the growth behavior. The conducted research design was the first of its type in that field to be executed to any specific growth pattern parameters in terms of regulating and policymaking. The method has integrated various artificial intelligence models to monitor, measure and optimize the projected growth by applying this design. Other research on the area was limited to projecting the future of Amman as it is an urbanized distressed city.

Nature’s evolution has shaped intelligent behaviors in creatures like insects and birds, inspiring the field of Swarm Intelligence. Researchers have developed bio-inspired algorithms to address complex optimization problems efficiently. These algorithms strike a balance between computational efficiency and solution optimality, attracting significant attention across domains.

Bio-inspired optimization techniques for feature engineering and its applications are systematically reviewed with chief objective of assessing statistical influence and significance of “Bio-inspired optimization”-based computational models by referring to vast research literature published between year 2015 and 2022.

The Scopus and Web of Science databases were explored for review with focus on parameters such as country-wise publications, keyword occurrences and citations per year. Springer and IEEE emerge as the most creative publishers, with indicative prominent and superior journals, namely, PLoS ONE, Neural Computing and Applications, Lecture Notes in Computer Science and IEEE Transactions. The “National Natural Science Foundation” of China and the “Ministry of Electronics and Information Technology” of India lead in funding projects in this area. China, India and Germany stand out as leaders in publications related to bio-inspired algorithms for feature engineering research.

The review findings integrate various bio-inspired algorithm selection techniques over a diverse spectrum of optimization techniques. Anti colony optimization contributes to decentralized and cooperative search strategies, bee colony optimization (BCO) improves collaborative decision-making, particle swarm optimization leads to exploration-exploitation balance and bio-inspired algorithms offer a range of nature-inspired heuristics.

This study aims to address the inherent uncertainties within closed-loop supply chain (CLSC) networks through the application of a multi-objective approach, specifically focusing on the optimization of integrated production and transportation processes. The primary purpose is to enhance decision-making in supply chain management by formulating a robust multi-objective model.

In dealing with uncertainty, this study uses Pythagorean fuzzy numbers (PFNs) to effectively represent and quantify uncertainties associated with various parameters within the CLSC network. The proposed model is solved using Pythagorean hesitant fuzzy programming, presenting a comprehensive and innovative methodology designed explicitly for handling uncertainties inherent in CLSC contexts.

The research findings highlight the effectiveness and reliability of the proposed framework for addressing uncertainties within CLSC networks. Through a comparative analysis with other established approaches, the model demonstrates its robustness, showcasing its potential to make informed and resilient decisions in supply chain management.

This study successfully addressed uncertainty in CLSC networks, providing logistics managers with a robust decision-making framework. Emphasizing the importance of PFNs and Pythagorean hesitant fuzzy programming, the research offered practical insights for optimizing transportation routes and resource allocation. Future research could explore dynamic factors in CLSCs, integrate real-time data and leverage emerging technologies for more agile and sustainable supply chain management.

This research contributes significantly to the field by introducing a novel and comprehensive methodology for managing uncertainty in CLSC networks. The adoption of PFNs and Pythagorean hesitant fuzzy programming offers an original and valuable approach to addressing uncertainties, providing practitioners and decision-makers with insights to make informed and resilient decisions in supply chain management.

The paper aims to identify a suitable generic brake force distribution ratio (β) corresponding to optimal brake design attributes in a diminutive driving range, where road conditions do not exhibit excessive variations. This will intend for an appropriate allocation of brake force distribution (BFD) to provide dynamic stability to the vehicle during braking.

Two techniques are presented (with and without wheel slip) to satisfy both brake stability and performance while accommodating variations in load sharing and road friction coefficient. Based on parametric optimization of the design variables of hydraulic brake using evolutionary algorithm, taking into account both the laden and unladen circumstances simultaneously, this research develops an improved model for computing and simulating the BFD applied to commercial and passenger vehicles.

The optimal parameter values defining the braking system have been identified, resulting in effective β = 0.695 which enhances the brake forces at respective axles. Nominal slip of 3.42% is achieved with maximum deceleration of 5.72 m/s² maintaining directional stability during braking. The results obtained from both the methodologies are juxtaposed and assessed governing the vehicle stability in straight line motion to prevent wheel lock.

Optimization results establish the practicality, efficacy and applicability of the proposed approaches. The findings provide valuable insights for the design and optimization of hydraulic drum brake systems in modern automobiles, which can lead to safer and more efficient braking systems.

Water pipes degrade over time for a variety of pipe-related, soil-related, operational, and environmental factors. Hence, municipalities are necessitated to implement effective maintenance and rehabilitation strategies for water pipes based on reliable deterioration models and cost-effective inspection programs. In the light of foregoing, the paramount objective of this research study is to develop condition assessment and deterioration prediction models for saltwater pipes in Hong Kong.

As a perquisite to the development of condition assessment models, spherical fuzzy analytic hierarchy process (SFAHP) is harnessed to analyze the relative importance weights of deterioration factors. Afterward, the relative importance weights of deterioration factors coupled with their effective values are leveraged using the measurement of alternatives and ranking according to the compromise solution (MARCOS) algorithm to analyze the performance condition of water pipes. A condition rating system is then designed counting on the generalized entropy-based probabilistic fuzzy C means (GEPFCM) algorithm. A set of fourth order multiple regression functions are constructed to capture the degradation trends in condition of pipelines overtime covering their disparate characteristics.

Analytical results demonstrated that the top five influential deterioration factors comprise age, material, traffic, soil corrosivity and material. In addition, it was derived that developed deterioration models accomplished correlation coefficient, mean absolute error and root mean squared error of 0.8, 1.33 and 1.39, respectively.

It can be argued that generated deterioration models can assist municipalities in formulating accurate and cost-effective maintenance, repair and rehabilitation programs.