Search results
1 – 10 of over 1000Tian-Yu Wu, Jianfei Zhang, Yanjun Dai, Tao-Feng Cao, Kong Ling and Wen-Quan Tao
To present the detailed implementation processes of the IDEAL algorithm for two-dimensional compressible flows based on Delaunay triangular mesh, and compare the performance of…
Abstract
Purpose
To present the detailed implementation processes of the IDEAL algorithm for two-dimensional compressible flows based on Delaunay triangular mesh, and compare the performance of the SIMPLE and IDEAL algorithms for solving compressible problems. What’s more, the implementation processes of Delaunay mesh generation and derivation of the pressure correction equation are also introduced.
Design/methodology/approach
Programming completely in C++.
Findings
Five compressible examples are used to test the SIMPLE and IDEAL algorithms, and the comparison with measurement data shows good agreement. The IDEAL algorithm has much better performance in both convergence rate and stability over the SIMPLE algorithm.
Originality/value
The detail solution procedure of implementing the IDEAL algorithm for compressible flows based on Delaunay triangular mesh is presented in this work, seemingly first in the literature.
Details
Keywords
Claire K. Wan and Mingchang Chih
We argue that a fundamental issue regarding how to search and how to switch between different cognitive modes lies in the decision rules that influence the dynamics of learning…
Abstract
Purpose
We argue that a fundamental issue regarding how to search and how to switch between different cognitive modes lies in the decision rules that influence the dynamics of learning and exploration. We examine the search logics underlying these decision rules and propose conceptual prompts that can be applied mentally or computationally to aid managers’ decision-making.
Design/methodology/approach
By applying Multi-Armed Bandit (MAB) modeling to simulate agents’ interaction with dynamic environments, we compared the patterns and performance of selected MAB algorithms under different configurations of environmental conditions.
Findings
We develop three conceptual prompts. First, the simple heuristic-based exploration strategy works well in conditions of low environmental variability and few alternatives. Second, an exploration strategy that combines simple and de-biasing heuristics is suitable for most dynamic and complex decision environments. Third, the uncertainty-based exploration strategy is more applicable in the condition of high environmental unpredictability as it can more effectively recognize deviated patterns.
Research limitations/implications
This study contributes to emerging research on using algorithms to develop novel concepts and combining heuristics and algorithmic intelligence in strategic decision-making.
Practical implications
This study offers insights that there are different possibilities for exploration strategies for managers to apply conceptually and that the adaptability of cognitive-distant search may be underestimated in turbulent environments.
Originality/value
Drawing on insights from machine learning and cognitive psychology research, we demonstrate the fitness of different exploration strategies in different dynamic environmental configurations by comparing the different search logics that underlie the three MAB algorithms.
Details
Keywords
Junlong Peng and Xiang-Jun Liu
This research is aimed to mainly be applicable to expediting engineering projects, uses the method of inverse optimization and the double-layer nested genetic algorithm combined…
Abstract
Purpose
This research is aimed to mainly be applicable to expediting engineering projects, uses the method of inverse optimization and the double-layer nested genetic algorithm combined with nonlinear programming algorithm, study how to schedule the number of labor in each process at the minimum cost to achieve an extremely short construction period goal.
Design/methodology/approach
The method of inverse optimization is mainly used in this study. In the first phase, establish a positive optimization model, according to the existing labor constraints, aiming at the shortest construction period. In the second phase, under the condition that the expected shortest construction period is known, on the basis of the positive optimization model, the inverse optimization method is used to establish the inverse optimization model aiming at the minimum change of the number of workers, and finally the optimal labor allocation scheme that meets the conditions is obtained. Finally, use algorithm to solve and prove with a case.
Findings
The case study shows that this method can effectively achieve the extremely short duration goal of the engineering project at the minimum cost, and provide the basis for the decision-making of the engineering project.
Originality/value
The contribution of this paper to the existing knowledge is to carry out a preliminary study on the relatively blank field of the current engineering project with a very short construction period, and provide a path for the vast number of engineering projects with strict requirements on the construction period to achieve a very short construction period, and apply the inverse optimization method to the engineering field. Furthermore, a double-nested genetic algorithm and nonlinear programming algorithm are designed. It can effectively solve various optimization problems.
Details
Keywords
Abstract
Purpose
The purpose of this study is to propose a precise and standardized strategy for numerically simulating vehicle aerodynamics.
Design/methodology/approach
Error sources in computational fluid dynamics were analyzed. Additionally, controllable experiential and discretization errors, which significantly influence the calculated results, are expounded upon. Considering the airflow mechanism around a vehicle, the computational efficiency and accuracy of each solution strategy were compared and analyzed through numerous computational cases. Finally, the most suitable numerical strategy, including the turbulence model, simplified vehicle model, calculation domain, boundary conditions, grids and discretization scheme, was identified. Two simplified vehicle models were introduced, and relevant wind tunnel tests were performed to validate the selected strategy.
Findings
Errors in vehicle computational aerodynamics mainly stem from the unreasonable simplification of the vehicle model, calculation domain, definite solution conditions, grid strategy and discretization schemes. Using the proposed standardized numerical strategy, the simulated steady and transient aerodynamic characteristics agreed well with the experimental results.
Originality/value
Building upon the modified Low-Reynolds Number k-e model and Scale Adaptive Simulation model, to the best of the authors’ knowledge, a precise and standardized numerical simulation strategy for vehicle aerodynamics is proposed for the first time, which can be integrated into vehicle research and design.
Details
Keywords
Mohd Irfan and Anup Kumar Sharma
A progressive hybrid censoring scheme (PHCS) becomes impractical for ensuring dependable outcomes when there is a low likelihood of encountering a small number of failures prior…
Abstract
Purpose
A progressive hybrid censoring scheme (PHCS) becomes impractical for ensuring dependable outcomes when there is a low likelihood of encountering a small number of failures prior to the predetermined terminal time T. The generalized progressive hybrid censoring scheme (GPHCS) efficiently addresses to overcome the limitation of the PHCS.
Design/methodology/approach
In this article, estimation of model parameter, survival and hazard rate of the Unit-Lindley distribution (ULD), when sample comes from the GPHCS, have been taken into account. The maximum likelihood estimator has been derived using Newton–Raphson iterative procedures. Approximate confidence intervals of the model parameter and their arbitrary functions are established by the Fisher information matrix. Bayesian estimation procedures have been derived using Metropolis–Hastings algorithm under squared error loss function. Convergence of Markov chain Monte Carlo (MCMC) samples has been examined. Various optimality criteria have been considered. An extensive Monte Carlo simulation analysis has been shown to compare and validating of the proposed estimation techniques.
Findings
The Bayesian MCMC approach to estimate the model parameters and reliability characteristics of the generalized progressive hybrid censored data of ULD is recommended. The authors anticipate that health data analysts and reliability professionals will get benefit from the findings and approaches presented in this study.
Originality/value
The ULD has a broad range of practical utility, making it a problem to estimate the model parameters as well as reliability characteristics and the significance of the GPHCS also encourage the authors to consider the present estimation problem because it has not previously been discussed in the literature.
Details
Keywords
Derya Deliktaş and Dogan Aydin
Assembly lines are widely employed in manufacturing processes to produce final products in a flow efficiently. The simple assembly line balancing problem is a basic version of the…
Abstract
Purpose
Assembly lines are widely employed in manufacturing processes to produce final products in a flow efficiently. The simple assembly line balancing problem is a basic version of the general problem and has still attracted the attention of researchers. The type-I simple assembly line balancing problems (SALBP-I) aim to minimise the number of workstations on an assembly line by keeping the cycle time constant.
Design/methodology/approach
This paper focuses on solving multi-objective SALBP-I problems by utilising an artificial bee colony based-hyper heuristic (ABC-HH) algorithm. The algorithm optimises the efficiency and idleness percentage of the assembly line and concurrently minimises the number of workstations. The proposed ABC-HH algorithm is improved by adding new modifications to each phase of the artificial bee colony framework. Parameter control and calibration are also achieved using the irace method. The proposed model has undergone testing on benchmark problems, and the results obtained have been compared with state-of-the-art algorithms.
Findings
The experimental results of the computational study on the benchmark dataset unequivocally establish the superior performance of the ABC-HH algorithm across 61 problem instances, outperforming the state-of-the-art approach.
Originality/value
This research proposes the ABC-HH algorithm with local search to solve the SALBP-I problems more efficiently.
Details
Keywords
Gangting Huang, Qichen Wu, Youbiao Su, Yunfei Li and Shilin Xie
In order to improve the computation efficiency of the four-point rainflow algorithm, a new fast four-point rainflow cycle counting algorithm (FFRA) using a novel loop iteration…
Abstract
Purpose
In order to improve the computation efficiency of the four-point rainflow algorithm, a new fast four-point rainflow cycle counting algorithm (FFRA) using a novel loop iteration mode is proposed.
Design/methodology/approach
In this new algorithm, the loop iteration mode is simplified by reducing the number of iterations, tests and deletions. The high efficiency of the new algorithm makes it a preferable candidate in fatigue life online estimation of structural health monitoring systems.
Findings
The extensive simulation results show that the extracted cycles by the new FFRA are the same as those by the four-point rainflow cycle counting algorithm (FRA) and the three-point rainflow cycle counting algorithm (TRA). Especially, the simulation results indicate that the computation efficiency of the FFRA has improved an average of 12.4 times compared to the FRA and an average of 8.9 times compared to the TRA. Moreover, the equivalence of cycle extraction results between the FFRA and the FRA is proved mathematically by utilizing some fundamental properties of the rainflow algorithm. Theoretical proof of the efficiency improvement of the FFRA in comparison to the FRA is also given.
Originality/value
This merit makes the FFRA preferable in online monitoring systems of structures where fatigue life estimation needs to be accomplished online based on massive measured data. It is noticeable that the high efficiency of the FFRA attributed to the simple loop iteration, which provides beneficial guidance to improve the efficiency of existing algorithms.
Details
Keywords
Keyu Chen, Beiyu You, Yanbo Zhang and Zhengyi Chen
Prefabricated building has been widely applied in the construction industry all over the world, which can significantly reduce labor consumption and improve construction…
Abstract
Purpose
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).
Design/methodology/approach
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.
Findings
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%.
Originality/value
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.
Details
Keywords
Mingke Gao, Zhenyu Zhang, Jinyuan Zhang, Shihao Tang, Han Zhang and Tao Pang
Because of the various advantages of reinforcement learning (RL) mentioned above, this study uses RL to train unmanned aerial vehicles to perform two tasks: target search and…
Abstract
Purpose
Because of the various advantages of reinforcement learning (RL) mentioned above, this study uses RL to train unmanned aerial vehicles to perform two tasks: target search and cooperative obstacle avoidance.
Design/methodology/approach
This study draws inspiration from the recurrent state-space model and recurrent models (RPM) to propose a simpler yet highly effective model called the unmanned aerial vehicles prediction model (UAVPM). The main objective is to assist in training the UAV representation model with a recurrent neural network, using the soft actor-critic algorithm.
Findings
This study proposes a generalized actor-critic framework consisting of three modules: representation, policy and value. This architecture serves as the foundation for training UAVPM. This study proposes the UAVPM, which is designed to aid in training the recurrent representation using the transition model, reward recovery model and observation recovery model. Unlike traditional approaches reliant solely on reward signals, RPM incorporates temporal information. In addition, it allows the inclusion of extra knowledge or information from virtual training environments. This study designs UAV target search and UAV cooperative obstacle avoidance tasks. The algorithm outperforms baselines in these two environments.
Originality/value
It is important to note that UAVPM does not play a role in the inference phase. This means that the representation model and policy remain independent of UAVPM. Consequently, this study can introduce additional “cheating” information from virtual training environments to guide the UAV representation without concerns about its real-world existence. By leveraging historical information more effectively, this study enhances UAVs’ decision-making abilities, thus improving the performance of both tasks at hand.
Details
Keywords
Yumeng Feng, Weisong Mu, Yue Li, Tianqi Liu and Jianying Feng
For a better understanding of the preferences and differences of young consumers in emerging wine markets, this study aims to propose a clustering method to segment the super-new…
Abstract
Purpose
For a better understanding of the preferences and differences of young consumers in emerging wine markets, this study aims to propose a clustering method to segment the super-new generation wine consumers based on their sensitivity to wine brand, origin and price and then conduct user profiles for segmented consumer groups from the perspectives of demographic attributes, eating habits and wine sensory attribute preferences.
Design/methodology/approach
We first proposed a consumer clustering perspective based on their sensitivity to wine brand, origin and price and then conducted an adaptive density peak and label propagation layer-by-layer (ADPLP) clustering algorithm to segment consumers, which improved the issues of wrong centers' selection and inaccurate classification of remaining sample points for traditional DPC (DPeak clustering algorithm). Then, we built a consumer profile system from the perspectives of demographic attributes, eating habits and wine sensory attribute preferences for segmented consumer groups.
Findings
In this study, 10 typical public datasets and 6 basic test algorithms are used to evaluate the proposed method, and the results showed that the ADPLP algorithm was optimal or suboptimal on 10 datasets with accuracy above 0.78. The average improvement in accuracy over the base DPC algorithm is 0.184. As an outcome of the wine consumer profiles, sensitive consumers prefer wines with medium prices of 100–400 CNY and more personalized brands and origins, while casual consumers are fond of popular brands, popular origins and low prices within 50 CNY. The wine sensory attributes preferred by super-new generation consumers are red, semi-dry, semi-sweet, still, fresh tasting, fruity, floral and low acid.
Practical implications
Young Chinese consumers are the main driver of wine consumption in the future. This paper provides a tool for decision-makers and marketers to identify the preferences of young consumers quickly which is meaningful and helpful for wine marketing.
Originality/value
In this study, the ADPLP algorithm was introduced for the first time. Subsequently, the user profile label system was constructed for segmented consumers to highlight their characteristics and demand partiality from three aspects: demographic characteristics, consumers' eating habits and consumers' preferences for wine attributes. Moreover, the ADPLP algorithm can be considered for user profiles on other alcoholic products.
Details