Search results

The present paper describes the applicability of hybrid transfinite element modelling/analysis formulations for non‐linear heat conduction problems involving phase change. The methodology is based on application of transform approaches and classical Galerkin schemes with finite element formulations to maintain the modelling versatility and numerical features for computational analysis. In addition, in conjunction with the above, the effects due to latent heat are modelled using enthalpy formulations to enable a physically realistic approximation to be effectively dealt computationally for materials exhibiting phase change within a narrow band of temperatures. Pertinent details of the approach and computational scheme adapted are described in technical detail. Numerical test cases of comparative nature are presented to demonstrate the applicability of the proposed formulations for numerical modelling/analysis of non‐linear heat conduction problems involving phase change.

The purpose of this study is to propose the generalised integral transform technique to investigate the natural convection behaviour in a vertical cylinder under different boundary conditions, adiabatic and isothermal walls and various aspect ratios.

GITT was used to investigate the steady-state natural convection behaviour in a vertical cylinder with internal uniformed heat generation. The governing equations of natural convection were transferred to a set of ordinary differential equations by using the GITT methodology. The coefficients of the ODEs were determined by the integration of the eigenfunction of the auxiliary eigenvalue problems in the present natural convection problem. The ordinary differential equations were solved numerically by using the DBVPFD subroutine from the IMSL numerical library. The convergence was achieved reasonably by using low truncation orders.

GITT is a powerful computational tool to explain the convection phenomena in the cylindrical cavity. The convergence analysis shows that the hybrid analytical–numerical technique (GITT) has a good convergence performance in relatively low truncation orders in the stream-function and temperature fields. The effect of the Rayleigh number and aspect ratio on the natural convection behaviour under adiabatic and isothermal boundary conditions has been discussed in detail.

The present hybrid analytical–numerical methodology can be extended to solve various convection problems with more involved nonlinearities. It exhibits potential application to solve the convection problem in the nuclear, oil and gas industries.

The purpose of this paper is to establish an intelligent framework to generate the data representatives in snapshot simulation in order to construct the online reduced-order model based on the generated data information. It could greatly reduce the computational time in snapshot simulation and accelerate the computational efficiency in the real-time computation of reduced-order modeling.

The snapshot simulation, which generates the data to construct reduced-order models (ROMs), usually is computationally demanding. In order to accelerate the snapshot generation, this paper presents a discrete element interpolaiton method (DEIM)-embedded hybrid simulation approach, in which the entire snapshot simulation is partitioned into multiple intervals of equal length. One of the three models: the full order model (FOM), local ROM, or local ROM-DEIM which represents a hierarchy of model approximations, fidelities and computational costs, will be adopted in each interval.

The outcome of the proposed snapshot simulation is an efficient ROM-DEIM applicable to various online simulations. Compared with the traditional FOM and the hybrid method without DEIM, the proposed method is able to accelerate the snapshot simulation by 54.4%–63.91% and 10.5%–27.85%, respectively. In the online simulation, ROM-DEIM only takes 4.81%–8.56% of the computational time of FOM, while preserving excellent accuracy (with relative error <1%).

1. A DEIM-embedded hybrid snapshot simulation methodology is proposed to accelerate snapshot data generation and reduced-order model (ROM)-DEIM development. 2. The simulation alternates among FOM, ROM and ROM-DEIM to adaptively generate snapshot data of salient subspace representation while minimizing computational load. 3. The DEIM-embedded hybrid snapshot approach demonstrates excellent accuracy (<1% error) and computational efficiency in both online snapshot simulation and online ROM-DEIM verification simulation.

Improving the accuracy and reducing computational costs of predictions, especially the prediction of time series, is one of the most critical parts of the decision-making processes and management in different areas and organizations. One of the best solutions to achieve high accuracy and low computational costs in time series forecasting is to develop and use efficient hybrid methods. Among the combined methods, parallel hybrid approaches are more welcomed by scholars and often have better performance than sequence ones. However, the necessary condition of using parallel combinational approaches is to estimate the appropriate weight of components. This weighting stage of parallel hybrid models is the most effective factor in forecasting accuracy as well as computational costs. In the literature, meta-heuristic algorithms have often been applied to weight components of parallel hybrid models. However, such that algorithms, despite all unique advantages, have two serious disadvantages of local optima and iterative time-consuming optimization processes. The purpose of this paper is to develop a linear optimal weighting estimator (LOWE) algorithm for finding the desired weight of components in the global non-iterative universal manner.

In this paper, a LOWE algorithm is developed to find the desired weight of components in the global non-iterative universal manner.

Empirical results indicate that the accuracy of the LOWE-based parallel hybrid model is significantly better than meta-heuristic and simple average (SA) based models. The proposed weighting approach can improve 13/96%, 11/64%, 9/35%, 25/05% the performance of the differential evolution (DE), genetic algorithm (GA), particle swarm optimization (PSO) and SA-based parallel hybrid models in electricity load forecasting. While, its computational costs are considerably lower than GA, PSO and DE-based parallel hybrid models. Therefore, it can be considered as an appropriate and effective alternative weighing technique for efficient parallel hybridization for time series forecasting.

In this paper, a LOWE algorithm is developed to find the desired weight of components in the global non-iterative universal manner. Although it can be generally demonstrated that the performance of the proposed weighting technique will not be worse than the meta-heuristic algorithm, its performance is also practically evaluated in real-world data sets.

The purpose of this paper is to present a methodology of hybrid parallelization applied to the discrete element method that combines message-passing interface and OpenMP to improve computational performance. The scheme is based on mapping procedures based on Hilbert space-filling curves (HSFC).

The methodology uses domain decomposition strategies to distribute the computation of large-scale models in a cluster. It also partitions the workload of each subdomain among threads. This additional procedure aims to reach higher computational performance by adjusting the usage of message-passing artefacts and threads. The main objective is to reduce the communication among processes. The work division by threads employs HSFC in order to improve data locality and to avoid related overheads. Numerical simulations presented in this work permit to evaluate the proposed method in terms of parallel performance for models that contain up to 3.2 million particles.

Distinct partitioning algorithms were used in order to evaluate the local decomposition scheme, including the recursive coordinate bisection method and a topological scheme based on METIS. The results show that the hybrid implementations reach better computational performance than those based on message passing only, including a good control of load balancing among threads. Case studies present good scalability and parallel efficiencies.

The proposed approach defines a configurable execution environment for numerical models and introduces a combined scheme that improves data locality and iterative workload balancing.

Most of the conventional humanoid modeling approaches are not successful in coupling different branches of the tree-type humanoid robot. In this paper, a tree-type upper body humanoid robot with mobile base is modeled. The main purpose of this work is to model a non holonomic mobile platform and to develop a hybrid algorithm for avoiding dynamic obstacles. Decoupled Natural Orthogonal Complement methodology effectively combines different branches of the humanoid body during dynamic analysis. Collision avoidance also plays an important role along with modeling methods for successful operation of the upper body wheeled humanoid robot during real-time operations. The majority of path planning algorithms is facing problems in avoiding dynamic obstacles during real-time operations. Hence, a multi-fusion approach using a hybrid algorithm for avoiding dynamic obstacles in real time is introduced.

The kinematic and dynamic modeling of a humanoid robot with mobile platform is done using screw theory approach and Newton–Euler formulations, respectively. Dynamic obstacle avoidance using a novel hybrid algorithm is carried out and implemented in real time. D star lite and a geometric-based hybrid algorithms are combined to generate the optimized path for avoiding the dynamic obstacles. A weighting factor is added to the D star lite variant to optimize the basic version of D star lite algorithm. Lazy probabilistic road map (PRM) technique is used for creating nodes in configuration space. The dynamic obstacle avoidance is experimentally validated to achieve the optimum path.

The path obtained using the hybrid algorithm for avoiding dynamic obstacles is optimum. Path length, computational time, number of expanded nodes are analysed for determining the optimality of the path. The weighting function introduced along with the D star lite algorithm decreases computational time by decreasing the number of expanding nodes during path generation. Lazy evaluation technique followed in Lazy PRM algorithm reduces computational time for generating nodes and local paths.

Modeling of a tree-type humanoid robot along with the mobile platform is combinedly developed for the determination of the kinematic and dynamic equations. This paper also aims to develop a novel hybrid algorithm for avoiding collision with dynamic obstacles with minimal computational effort in real-time operations.

The study aims to optimize truck routes by minimizing social and economic costs. It introduces a strategy involving diverse drones and their potential for reusing at DNs based on flight range. In HTDRP-DC, trucks can select and transport various drones to LDs to reduce deprivation time. This study estimates the nonlinear deprivation cost function using a linear two-piece-wise function, leading to MILP formulations. A heuristic-based Benders Decomposition approach is implemented to address medium and large instances. Valid inequalities and a heuristic method enhance convergence boundaries, ensuring an efficient solution methodology.

Research has yet to address critical factors in disaster logistics: minimizing the social and economic costs simultaneously and using drones in relief distribution; deprivation as a social cost measures the human suffering from a shortage of relief supplies. The proposed hybrid truck-drone routing problem minimizing deprivation cost (HTDRP-DC) involves distributing relief supplies to dispersed demand nodes with undamaged (LDs) or damaged (DNs) access roads, utilizing multiple trucks and diverse drones. A Benders Decomposition approach is enhanced by accelerating techniques.

Incorporating deprivation and economic costs results in selecting optimal routes, effectively reducing the time required to assist affected areas. Additionally, employing various drone types and their reuse in damaged nodes reduces deprivation time and associated deprivation costs. The study employs valid inequalities and the heuristic method to solve the master problem, substantially reducing computational time and iterations compared to GAMS and classical Benders Decomposition Algorithm. The proposed heuristic-based Benders Decomposition approach is applied to a disaster in Tehran, demonstrating efficient solutions for the HTDRP-DC regarding computational time and convergence rate.

Current research introduces an HTDRP-DC problem that addresses minimizing deprivation costs considering the vehicle’s arrival time as the deprivation time, offering a unique solution to optimize route selection in relief distribution. Furthermore, integrating heuristic methods and valid inequalities into the Benders Decomposition approach enhances its effectiveness in solving complex routing challenges in disaster scenarios.

New and ever more demanding applications of microelectronics require advances in design and optimization of components and packages, in relatively short periods of time, while satisfying electrical, thermal, and mechanical specifications, as well as cost and manufacturability expectations, without compromise to reliability and durability. Therefore, time efficient methodologies for detecting, locating and sizing damage early in the product development process are required. In this paper, a novel hybrid methodology, based on a combined use of recent advances in optics and computational modeling, is described and its application is demonstrated by a case study of a microelectronic component subjected to cyclic electro‐thermo‐mechanical loadings. Using the hybrid, optical‐computational approach, displacements and deformations are determined with high spatial resolution and measurement accuracy and provide indispensable data for development, optimization, and thermal management in microelectronics and packaging.

Assembly sequence optimization is a difficult combinatorial optimization problem having to simultaneously satisfy various feasibility constraints and optimization criteria. Applications of evolutionary algorithms have shown a lot of promise in terms of lower computational cost and time. But there remain challenges like achieving global optimum in least number of iterations with fast convergence speed, robustness/consistency in finding global optimum, etc. With the above challenges in mind, this study aims to propose an improved flower pollination algorithm (FPA) and hybrid genetic algorithm (GA)-FPA.

In view of slower convergence rate and more computational time required by the previous discrete FPA, this paper presents an improved hybrid FPA with different representation scheme, initial population generation strategy and modifications in local and global pollination rules. Different optimization objectives are considered like direction changes, tool changes, assembly stability, base component location and feasibility. The parameter settings of hybrid GA-FPA are also discussed.

The results, when compared with previous discrete FPA and GA, memetic algorithm (MA), harmony search and improved FPA (IFPA), the proposed hybrid GA-FPA gives promising results with respect to higher global best fitness and higher average fitness, faster convergence (especially from the previously developed variant of FPA) and most importantly improved robustness/consistency in generating global optimum solutions.

It is anticipated that using the proposed approach, assembly sequence planning can be accomplished efficiently and consistently with reduced lead time for process planning, making it cost-effective for industrial applications.

Different representation schemes, initial population generation strategy and modifications in local and global pollination rules are introduced in the IFPA. Moreover, hybridization with GA is proposed to improve convergence speed and robustness/consistency in finding globally optimal solutions.

Compliant mechanism has been receiving a great interest in precision engineering. However, analytical methods involving their behavior analysis is still a challenge because there are unclear kinematic behaviors. Especially, design optimization for compliant mechanisms becomes an important task when the problem is more and more complex. Therefore, the purpose of this study is to design a new hybrid computational method. The hybridized method is an integration of statistics, numerical method, computational intelligence and optimization.

A tensural bistable compliant mechanism is used to clarify the efficiency of the developed method. A pseudo model of the mechanism is designed and simulations are planned to retrieve the data sets. Main contributions of design variables are analyzed by analysis of variance to initialize several new populations. Next, objective functions are transformed into the desirability, which are inputs of the fuzzy inference system (FIS). The FIS modeling is aimed to initialize a single-combined objective function (SCOF). Subsequently, adaptive neuro-fuzzy inference system is developed to modeling a relation of the main geometrical parameters and the SCOF. Finally, the SCOF is maximized by lightning attachment procedure optimization algorithm to yield a global optimality.

The results prove that the present method is better than a combination of fuzzy logic and Taguchi. The present method is also superior to other algorithms by conducting non-parameter tests. The proposed computational method is a usefully systematic method that can be applied to compliant mechanisms with complex structures and multiple-constrained optimization problems.

The novelty of this work is to make a new approach by combining statistical techniques, numerical method, computational intelligence and metaheuristic algorithm. The feasibility of the method is capable of solving a multi-objective optimization problem for compliant mechanisms with nonlinear complexity.