Search results
1 – 10 of over 11000Assembly sequence optimization is a difficult combinatorial optimization problem having to simultaneously satisfy various feasibility constraints and optimization criteria…
Abstract
Purpose
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.
Design/methodology/approach
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.
Findings
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.
Practical implications
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.
Originality/value
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.
Details
Keywords
Karen L. Ricciardi and Stephen H. Brill
The Hermite collocation method of discretization can be used to determine highly accurate solutions to the steady‐state one‐dimensional convection‐diffusion equation (which can be…
Abstract
Purpose
The Hermite collocation method of discretization can be used to determine highly accurate solutions to the steady‐state one‐dimensional convection‐diffusion equation (which can be used to model the transport of contaminants dissolved in groundwater). This accuracy is dependent upon sufficient refinement of the finite‐element mesh as well as applying upstream or downstream weighting to the convective term through the determination of collocation locations which meet specified constraints. Owing to an increase in computational intensity of the application of the method of collocation associated with increases in the mesh refinement, minimal mesh refinement is sought. Very often this optimization problem is the one where the feasible region is not connected and as such requires a specialized optimization search technique. This paper aims to focus on this method.
Design/methodology/approach
An original hybrid method that utilizes a specialized adaptive genetic algorithm followed by a hill‐climbing approach is used to search for the optimal mesh refinement for a number of models differentiated by their velocity fields. The adaptive genetic algorithm is used to determine a mesh refinement that is close to a locally optimal mesh refinement. Following the adaptive genetic algorithm, a hill‐climbing approach is used to determine a local optimal feasible mesh refinement.
Findings
In all cases the optimal mesh refinements determined with this hybrid method are equally optimal to, or a significant improvement over, mesh refinements determined through direct search methods.
Research limitations
Further extensions of this work could include the application of the mesh refinement technique presented in this paper to non‐steady‐state problems with time‐dependent coefficients with multi‐dimensional velocity fields.
Originality/value
The present work applies an original hybrid optimization technique to obtain highly accurate solutions using the method of Hermite collocation with minimal mesh refinement.
Details
Keywords
Parviz Fattahi, Naeeme Bagheri Rad, Fatemeh Daneshamooz and Samad Ahmadi
The purpose of this paper is to present a mathematical model and a new hybrid algorithm for flexible job shop scheduling problem with assembly operations. In this problem, each…
Abstract
Purpose
The purpose of this paper is to present a mathematical model and a new hybrid algorithm for flexible job shop scheduling problem with assembly operations. In this problem, each product is produced by assembling a set of several different parts. At first, the parts are processed in a flexible job shop system, and then at the second stage, the parts are assembled and products are produced.
Design/methodology/approach
As the problem is non-deterministic polynomial-time-hard, a new hybrid particle swarm optimization and parallel variable neighborhood search (HPSOPVNS) algorithm is proposed. In this hybrid algorithm, particle swarm optimization (PSO) algorithm is used for global exploration of search space and parallel variable neighborhood search (PVNS) algorithm for local search at vicinity of solutions obtained in each iteration. For parameter tuning of the metaheuristic algorithms, Taguchi approach is used. Also, a statistical test is proposed to compare the ability of metaheuristics at finding the best solution in the medium and large sizes.
Findings
Numerical experiments are used to evaluate and validate the performance and effectiveness of HPSOPVNS algorithm with hybrid particle swarm optimization with a variable neighborhood search (HPSOVNS) algorithm, PSO algorithm and hybrid genetic algorithm and Tabu search (HGATS). The computational results show that the HPSOPVNS algorithm achieves better performance than competing algorithms.
Practical implications
Scheduling of manufacturing parts and planning of assembly operations are two steps in production systems that have been studied independently. However, with regard to many manufacturing industries having assembly lines after manufacturing stage, it is necessary to deal with a combination of these problems that is considered in this paper.
Originality/value
This paper proposed a mathematical model and a new hybrid algorithm for flexible job shop scheduling problem with assembly operations.
Details
Keywords
Bruno Dalanezi Mori, Hélio Fiori de Castro and Katia Lucchesi Cavalca
The purpose of this paper is to present an application of the simulated annealing algorithm to the redundant system reliability optimization. Its main aim is to analyze and…
Abstract
Purpose
The purpose of this paper is to present an application of the simulated annealing algorithm to the redundant system reliability optimization. Its main aim is to analyze and compare this optimization method performance with those of similar application.
Design/methodology/approach
The methods that were used to compare results are the genetic algorithm, the Lagrange Multipliers, and the evolution strategy. A hybrid algorithm composed by simulated annealing and genetic algorithm was developed in order to achieve the general applicability of the methods. The hybrid algorithm also tries to exploit the positive aspects of each method.
Findings
The results presented by the simulated annealing and the hybrid algorithm are significant, and validate the methods as a robust tool for parameter optimization in mechanical projects development.
Originality/value
The main objective is to propose a method for redundancy optimization in mechanical systems, which are not as large as electric and electronic systems, but involves high costs associated to redundancy and requires a high level of safety standards like: automotive and aerospace systems.
Details
Keywords
Dianzi Liu, Chengyang Liu, Chuanwei Zhang, Chao Xu, Ziliang Du and Zhiqiang Wan
In real-world cases, it is common to encounter mixed discrete-continuous problems where some or all of the variables may take only discrete values. To solve these non-linear…
Abstract
Purpose
In real-world cases, it is common to encounter mixed discrete-continuous problems where some or all of the variables may take only discrete values. To solve these non-linear optimization problems, the use of finite element methods is very time-consuming. The purpose of this study is to investigate the efficiency of the proposed hybrid algorithms for the mixed discrete-continuous optimization and compare it with the performance of genetic algorithms (GAs).
Design/methodology/approach
In this paper, the enhanced multipoint approximation method (MAM) is used to reduce the original nonlinear optimization problem to a sequence of approximations. Then, the sequential quadratic programing technique is applied to find the continuous solution. Following that, the implementation of discrete capability into the MAM is developed to solve the mixed discrete-continuous optimization problems.
Findings
The efficiency and rate of convergence of the developed hybrid algorithms outperforming GA are examined by six detailed case studies in the ten-bar planar truss problem, and the superiority of the Hooke–Jeeves assisted MAM algorithm over the other two hybrid algorithms and GAs is concluded.
Originality/value
The authors propose three efficient hybrid algorithms, the rounding-off, the coordinate search and the Hooke–Jeeves search-assisted MAMs, to solve nonlinear mixed discrete-continuous optimization problems. Implementations include the development of new procedures for sampling discrete points, the modification of the trust region adaptation strategy and strategies for solving mix optimization problems. To improve the efficiency and effectiveness of metamodel construction, regressors f defined in this paper can have the form in common with the empirical formulation of the problems in many engineering subjects.
Details
Keywords
Manish Kumar Singla, Parag Nijhawan and Amandeep Singh Oberoi
The purpose of the proposed hybrid method aims to increase population efficiency, and a local search is used to further improve the value of the global best solution. An…
Abstract
Purpose
The purpose of the proposed hybrid method aims to increase population efficiency, and a local search is used to further improve the value of the global best solution. An experimental observation suggests that the model’s statistical outcomes are more aligned with the real-time experimental findings.
Design/methodology/approach
A novel metaheuristic efficient hybrid algorithm, i.e. hybrid particle swarm optimization rat search algorithm, is introduced and applied for parameter extraction of hybrid energy system. This proposed hybrid method rules out the chances of local minima, hence enhancing the precision of the parametric estimation. The parameter extraction and error is calculated for the solar photovoltaic (PV)–fuel cell system using the proposed algorithm.
Findings
Nonparametric statistical tests are also conducted to indicate the findings of the outcome parameters using various metaheuristic algorithms. The proposed algorithm is better than the rest of the compared algorithms in the study.
Originality/value
The authors proposed a novel algorithm, and this proposed algorithm is implemented on hybrid solar PV and fuel cell-based system for parameter extraction. The nonparametric test results clearly suggest that the proposed algorithm is far more effective for parameter estimation of the test system.
Details
Keywords
Jingbin Hao, Xin Chen, Hao Liu and Shengping Ye
To remanufacture a disused part, a hybrid process needs to be taken in part production. Therefore, a reasonable machining route is necessary to be developed for the hybrid…
Abstract
Purpose
To remanufacture a disused part, a hybrid process needs to be taken in part production. Therefore, a reasonable machining route is necessary to be developed for the hybrid process. This paper aims to develop a novel process planning algorithm for additive and subtractive manufacturing (ASM) system to achieve this purpose.
Design/methodology/approach
First, a skeleton of the model is generated by using thinning algorithm. Then, the skeleton tree is constructed based on topological structure and shape feature. Further, a feature matching algorithm is developed for recognizing the different features between the initial model and the final model based on the skeleton tree. Finally, a reasonable hybrid machining route of the ASM system is generated in consideration of the machining method of each different sub-feature.
Findings
This paper proposes a hybrid process planning algorithm for the ASM system. Further, it generates new process planning insights on the hybrid process service provider market.
Practical implications
The proposed process planning algorithm enables engineers to obtain a proper hybrid machining route before product fabrication. And thereby, it extends the machining capability of the hybrid process to manufacture some parts accurately and efficiently.
Originality/value
This study addresses one gap in the hybrid process literature. It develops the first hybrid process planning strategy for remanufacturing of disused parts based on skeleton tree matching, which generates a more proper hybrid machining route than the currently available hybrid strategy studies. Also, this study provides technical support for the ASM system to repair damaged parts.
Details
Keywords
Shifa Sulaiman and A.P. Sudheer
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…
Abstract
Purpose
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.
Design/methodology/approach
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.
Findings
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.
Originality/value
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.
Details
Keywords
Nima Gerami Seresht, Rodolfo Lourenzutti, Ahmad Salah and Aminah Robinson Fayek
Due to the increasing size and complexity of construction projects, construction engineering and management involves the coordination of many complex and dynamic processes and…
Abstract
Due to the increasing size and complexity of construction projects, construction engineering and management involves the coordination of many complex and dynamic processes and relies on the analysis of uncertain, imprecise and incomplete information, including subjective and linguistically expressed information. Various modelling and computing techniques have been used by construction researchers and applied to practical construction problems in order to overcome these challenges, including fuzzy hybrid techniques. Fuzzy hybrid techniques combine the human-like reasoning capabilities of fuzzy logic with the capabilities of other techniques, such as optimization, machine learning, multi-criteria decision-making (MCDM) and simulation, to capitalise on their strengths and overcome their limitations. Based on a review of construction literature, this chapter identifies the most common types of fuzzy hybrid techniques applied to construction problems and reviews selected papers in each category of fuzzy hybrid technique to illustrate their capabilities for addressing construction challenges. Finally, this chapter discusses areas for future development of fuzzy hybrid techniques that will increase their capabilities for solving construction-related problems. The contributions of this chapter are threefold: (1) the limitations of some standard techniques for solving construction problems are discussed, as are the ways that fuzzy methods have been hybridized with these techniques in order to address their limitations; (2) a review of existing applications of fuzzy hybrid techniques in construction is provided in order to illustrate the capabilities of these techniques for solving a variety of construction problems and (3) potential improvements in each category of fuzzy hybrid technique in construction are provided, as areas for future research.
Details
Keywords
The purpose of this paper is to propose a hybrid algorithm of the heuristic algorithm and the orthogonal design to optimize schemes of welding points (WPs). Assembly variation…
Abstract
Purpose
The purpose of this paper is to propose a hybrid algorithm of the heuristic algorithm and the orthogonal design to optimize schemes of welding points (WPs). Assembly variation plays an important role in product manufacture. Different schemes of WPs can influence the sensitivity matrices between part and assembly variations.
Design/methodology/approach
The paper proposes a hybrid algorithm to optimize schemes of WPs among components. The hybrid algorithm is composed of the heuristic algorithm and the orthogonal design. The heuristic algorithm is used to optimize the initial scheme; moreover, the last result is generated according to the orthogonal table. Although the algorithm cannot assure generating the optimal scheme, it can acquire the satisfying result by using few times of finite element analysis.
Findings
Finally, a rear bracket lamp assembly is illustrated to optimize the schemes of WPs between two components. Results show that the algorithm is efficient to generate the optimized WPs scheme for sheet metal assemblies.
Originality/value
A hybrid algorithm is proposed to optimize schemes of WPs among components, which is composed of the heuristic algorithm and the orthogonal design.
Details