Search results

Assembly lines are one of the places where energy consumption is intensive in manufacturing enterprises. The use of robots in assembly lines not only increases productivity but also increases energy consumption and carbon emissions. The purpose of this paper is to minimize the cycle time and total energy consumption simultaneously in parallel robotic assembly lines (PRAL).

Due to the NP-hardness of the problem, A Pareto hybrid discrete firefly algorithm based on probability attraction (PHDFA-PA) is developed. The algorithm parameters are optimized using the Taguchi method. To evaluate the results of the algorithm, a multi-objective programming model and a restarted simulated annealing (RSA) algorithm are used.

According to the comparative study, the PHDFA-PA has a competitive performance with the RSA. Thus, it is possible to achieve a sustainable PRAL through the proposed method by addressing the cycle time and total energy consumption simultaneously.

To the best knowledge of the authors, this is the first study addressing energy consumption in PRAL. The proposed method for PRAL is efficient in solving the multi-objective balancing problem.

The purpose of this paper is to minimize the mean flow time in open shop scheduling problem (OSSP). The scheduling problems consist of n jobs and m machines, in which each job has O operations. The processing time for 50 OSSP was generated using a linear congruential random number.

Different evolutionary algorithms are used to minimize the mean flow time of OSSP. This research study used simulated annealing (SA), Discrete Firefly Algorithm and a Hybrid Firefly Algorithm with SA. These methods are referred as A1, A2 and A3, respectively.

A comparison of the results obtained from the three methods shows that the Hybrid Firefly Algorithm with SA (A3) gives the best mean flow time for 76 percent instances. Also, it has been observed that as the number of jobs increases, the chances of getting better results also increased. Among the first 25 problems (i.e. job ranging from 3 to 7), A3 gave the best results for 13 instances, i.e., for 52 percent of the first 25 instances. While for the last 25 problems (i.e. Job ranging from 8 to 12), A3 gave the best results for all 25 instances, i.e. for 100 percent of the problems.

From the literature it has been observed that no researchers have attempted to solve OOSPs using Firefly Algorithm (FA). In this research work an attempt has been made to apply the FA and its hybridization to solve OSSP. Also the research work carried out in this paper can also be applied for a real-time Industrial problem.

Assembly sequence planning (ASP) plays a vital role in assembly process because it directly influences the feasibility, cost and time of the assembly process. The purpose of this study is to solve ASP problem more efficiently than current algorithms.

A novel assembly subsets prediction method based on precedence graph is proposed to solve the ASP problem. The proposed method adopts the idea of local to whole and integrates a simplified firework algorithm. First, assembly subsets are generated as initial fireworks. Then, each firework explodes to several sparks with higher-level assembly subsets and new fireworks are selected for next generation according to selection strategy. Finally, iterating the algorithm until complete and feasible solutions are generated.

The proposed method performs better in comparison with state-of-the-art algorithms because of the balance of exploration (fireworks) and exploitation (sparks). The size of initial fireworks population determines the diversity of the solution, so assembly subsets prediction method based on precedence graph (ASPM-PG) can explore the solution space. The size of sparks controls the exploitation ability of ASPM-PG; with more sparks, the direction of a specific firework can be adequately exploited.

The proposed method is with simple structure and high efficiency. It is anticipated that using the proposed method can effectively improve the efficiency of ASP and reduce computing cost for industrial applications.

The proposed method finds the optimal sequence in the construction process of assembly sequence rather than adjusting order of a complete assembly sequence in traditional methods. Moreover, a simplified firework algorithm with new operators is introduced. Two basic size parameters are also analyzed to explain the proposed method.

The implied assembly constraints of a computer-aided design (CAD) model (e.g. hierarchical constraints, geometric constraints and topological constraints) represent an important basis for product assembly sequence intelligent planning. Assembly prior knowledge contains factual assembly knowledge and experience assembly knowledge, which are important factors for assembly sequence intelligent planning. This paper aims to improve monotonous assembly sequence planning for a rigid product, intelligent planning of product assembly sequences based on spatio-temporal semantic knowledge is proposed.

A spatio-temporal semantic assembly information model is established. The internal data of the CAD model are accessed to extract spatio-temporal semantic assembly information. The knowledge system for assembly sequence intelligent planning is built using an ontology model. The assembly sequence for the sub-assembly and assembly is generated via attribute retrieval and rule reasoning of spatio-temporal semantic knowledge. The optimal assembly sequence is achieved via a fuzzy comprehensive evaluation.

The proposed spatio-temporal semantic information model and knowledge system can simultaneously express CAD model knowledge and prior knowledge for intelligent planning of product assembly sequences. Attribute retrieval and rule reasoning of spatio-temporal semantic knowledge can be used to generate product assembly sequences.

The assembly sequence intelligent planning example of linear motor highlights the validity of intelligent planning of product assembly sequences based on spatio-temporal semantic knowledge.

The spatio-temporal semantic information model and knowledge system are built to simultaneously express CAD model knowledge and assembly prior knowledge. The generation algorithm via attribute retrieval and rule reasoning of spatio-temporal semantic knowledge is given for intelligent planning of product assembly sequences in this paper. The proposed method is efficient because of the small search space.

Accurate foreign tourist arrivals forecasting can help public and private sectors to formulate scientific tourism planning and improve the allocation efficiency of tourism resources. This paper aims to address the problem of low prediction accuracy of Chinese inbound tourism demand caused by the lack of valid historical data.

A novel hybrid Chinese inbound tourism demand forecasting model combining fractional non-homogenous discrete grey model and firefly algorithm is constructed. In the proposed model, all adjustable parameters of the fractional non-homogenous discrete grey model are optimized simultaneously by the firefly algorithm.

The data sets of annual foreign tourist arrivals to China are used to verify the validity of the proposed model. Experimental results show that the proposed method is effective and can be used as a useful predictor for the prediction of Chinese inbound tourism demand.

The method proposed in this paper is effective and can be used as a feasible approach for forecasting the development trend of Chinese inbound tourism.

This study aims to present a unique hybrid metaheuristic approach to solving the nonlinear analysis of hall currents and electric double layer (EDL) effects in multiphase wavy flow by merging the firefly algorithm (FA) and the water cycle algorithm (WCA).

Nonlinear Hall currents and EDL effects in multiphase wavy flow are originally described by partial differential equations, which are then translated into an ordinary differential equation model. The hybrid FA-WCA technique is used to take on the optimization challenge and find the best possible design weights for artificial neural networks. The fitness function is efficiently optimized by this hybrid approach, allowing the optimal design weights to be determined.

The proposed strategy is shown to be effective by taking into account multiple variables to arrive at a single answer. The numerical results obtained from the proposed method exhibit good agreement with the reference solution within finite intervals, showcasing the accuracy of the approach used in this study. Furthermore, a comparison is made between the presented results and the reference numerical solutions of the Hall Currents and electroosmotic effects in multiphase wavy flow problem.

This comparative analysis includes various performance indices, providing a statistical assessment of the precision, efficiency and reliability of the proposed approach. Moreover, to the best of the authors’ knowledge, this is a new work which has not been explored in existing literature and will add new directions to the field of fluid flows to predict most accurate results.

Inspired optimization algorithms respond to numerous scientific and engineering difficulties based on its flexibility and simplicity. Such algorithms are valid for optimization difficulties devoid of structural alterations.

This paper presents a nature-inspired optimization algorithm, named Sailfish optimizer (SFO) stimulated using sailfish group. Monetary custom of energy is a dangerous problem on wireless sensor network (WSN).

Network cluster is an effective method of reducing node power consumption and increasing network life. An algorithm for selecting cluster head (CHs) based on enhanced cuckoo search was proposed. But this algorithm uses a novel encoding system and wellness work. It integrates a few problems. To overthrow this method many metaheuristic-based CH selection algorithms are presented. To avoid this problem, this paper proposed the SFO algorithm based energy-efficient CH selection of WSN.

The proposed SFO algorithm based energy-efficient algorithm is used for discovering the CHs ideal situation. The simulations under delay, delratio, drop, energy, network lifetime, overhead and throughput are carried out.

The purpose of this article is to analyze the optimization process in depth, elaborating on the components of the entire process and the techniques used. Researchers have been drawn to the expanding trend of optimization since the turn of the century. The rate of research can be used to measure the progress and increase of this optimization procedure. This study is phenomenal to understand the optimization process and different algorithms in addition to their application by keeping in mind the current computational power that has increased the implementation for several engineering applications.

Two-dimensional analysis has been carried out for the optimization process and its approaches to addressing optimization problems, i.e. computational power has increased the implementation. The first section focuses on a thorough examination of the optimization process, its objectives and the development of processes. Second, techniques of the optimization process have been evaluated, as well as some new ones that have emerged to overcome the above-mentioned problems.

This paper provided detailed knowledge of optimization, several approaches and their applications in civil engineering, i.e. structural, geotechnical, hydraulic, transportation and many more. This research provided tremendous emerging techniques, where the lack of exploratory studies is to be approached soon.

Optimization processes have been studied for a very long time, in engineering, but the current computational power has increased the implementation for several engineering applications. Besides that, different techniques and their prediction modes often require high computational strength, such parameters can be mitigated with the use of different techniques to reduce computational cost and increase accuracy.

This paper aims to propose an optimized overview of firefly algorithm (FA) over physical-natural impression of fireflies and its application in mobile robot navigation under the natural intelligence mechanism.

The brightness and luminosity are the decision variables in proposed study. The paper achieves the two major goals of robot navigation; first, the optimum path generation and, second, as an obstacle avoidance by co-in-centric sphere-based geometrical technique. This technique comprises the optimum path decision to objective function and constraints to paths and obstacles as the function of algebraic-geometry co-relation. Co-in-centric sphere is the proposed technique to correlate the constraints.

It is found that the present FA based on concentric sphere is suitable for efficient navigation of mobile robots at the level of optimum significance when compared with other approaches.

The paper introduces a novel approach to implement the FA for unknown and uncertain environment.

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.