Search results

The purpose of this paper is to investigate a new and practical decision support model of the coordinated replenishment and delivery (CRD) problem with multi-warehouse (M-CRD) to improve the performance of a supply chain. Two algorithms, tabu search-RAND (TS-RAND) and adaptive hybrid different evolution (AHDE) algorithm, are developed and compared as to the performance of each in solving the M-CRD problem.

The proposed M-CRD is more complex and practical than classical CRDs, which are non-deterministic polynomial-time hard problems. According to the structure of the M-CRD, a hybrid algorithm, TS-RAND, and AHDE are designed to solve the M-CRD.

Results of M-CRDs with different scales show that TS-RAND and AHDE are good candidates for handling small-scale M-CRD. TS-RAND can also find satisfactory solutions for large-scale M-CRDs. The total cost (TC) of M-CRD is apparently lower than that of a CRD with a single warehouse. Moreover, the TC is lower for the M-CRD with a larger number of optional warehouses.

The proposed M-CRD is helpful for managers to select the suitable warehouse and to decide the delivery scheduling with a coordinated replenishment policy under complex operations management situations. TS-RAND can be easily used by practitioners because of its robustness, easy implementation, and quick convergence.

Compared with the traditional CRDs with one warehouse, a better policy with lower TC can be obtained by the new M-CRD. Moreover, the proposed TS-RAND is a good candidate for solving the M-CRD.

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.

Three-axis accelerometers play a vital role in monitoring the vibrations in aircraft machinery, especially in variable flight temperature environments. The sensitivity of a three-axis accelerometer under different temperature conditions needs to be calibrated before the flight test. Hence, the authors investigated the efficiency and sensitivity calibration of three-axis accelerometers under different conditions. This paper aims to propose the novel calibration algorithm for the three-axis accelerometers or the similar accelerometers.

The authors propose a hybrid genetic algorithm–particle swarm optimisation–back-propagation neural network (GA–PSO–BPNN) algorithm. This method has high global search ability, fast convergence speed and strong non-linear fitting capability; it follows the rules of natural selection and survival of the fittest. The authors describe the experimental setup for the calibration of the three-axis accelerometer using a three-comprehensive electrodynamic vibration test box, which provides different temperatures. Furthermore, to evaluate the performance of the hybrid GA–PSO–BPNN algorithm for sensitivity calibration, the authors performed a detailed comparative experimental analysis of the BPNN, GA–BPNN, PSO–BPNN and GA–PSO–BPNN algorithms under different temperatures (−55, 0 , 25 and 70 °C).

It has been showed that the prediction error of three-axis accelerometer under the hybrid GA–PSO–BPNN algorithm is the least (approximately ±0.1), which proved that the proposed GA–PSO–BPNN algorithm performed well on the sensitivity calibration of the three-axis accelerometer under different temperatures conditions.

The designed GA–PSO–BPNN algorithm with high global search ability, fast convergence speed and strong non-linear fitting capability has been proposed to decrease the sensitivity calibration error of three-axis accelerometer, and the hybrid algorithm could reach the global optimal solution rapidly and accurately.

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.

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.

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.

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.

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.

Some functional properties of engineering materials, i.e. physical, mechanical and thermal ones, depend directly on the microstructure, which is a result of processes occurring in the material during the forming and thermomechanical processing. The proper microstructure can be obtained in many cases by the phase transformation. This phenomenon is one of the most important processes during hot forming and heat treatment. The purpose of this paper is to develop a new comprehensive hybrid model for modeling diffusion phase transformations. A problem has been divided into several tasks and is carried out on several stages. The purpose of this stage is a development of the structure of a hybrid model, development of an algorithm used in the diffusion module and one-dimensional heat flow and diffusion modeling. Generally, the processes of phase transformations are studied well enough but there are not many tools for their complex simulations. The problems of phase transformation simulation are related to the proper consideration of diffusion, movement of phase boundaries and kinetics of transformation. The proposed new model at the final stage of development will take into account the varying grain growth rate, different shape of growing grains and will allow for proper modeling of heat flow and carbon diffusion during the transformation in many processes, where heating, annealing and cooling can be considered (e.g. homogenizing and normalizing).

One of the most suitable methods for modeling of microstructure evolution during the phase transformation is cellular automata (CA), while lattice Boltzmann method (LBM) suits for modeling of diffusion and heat flow. Then, the proposed new hybrid model is based on CA and LBM methods and uses high performing parallel computations.

The first simulation results obtained for one-dimensional modeling confirm the correctness of interaction between LBM and CA in common numerical solution and the possibility of using these methods for modeling of phase transformations. The advantages of the LBM method can be used for the simulation of heat flow and diffusion during the transformation taking into account the results obtained from the simulations. LBM creates completely new possibilities for modeling of phase transformations in combination with CA.

The studies are focused on diffusion phase transformations in solid state in condition of low cooling rate (e.g. transformation of austenite into ferrite and pearlite) and during the heating and annealing (e.g. transformation of the ferrite-pearlite structure into austenite, the alignment of carbon concentration in austenite and growth of austenite grains) in carbon steels within a wide range of carbon content. The paper presents the comprehensive modeling system, which can operate with the technological processes with phase transformation during heating, annealing or cooling.

A brief review of the modeling of phase transformations and a description of the structure of a new CA and LBM hybrid model and its modules are presented in the paper. In the first stage of model implementation, the one-dimensional LBM model of diffusion and heat flow was developed. The examples of simulation results for several variants of modeling with different boundary conditions are shown.

Meta-heuristic algorithms are efficient in achieving the optimal solution for engineering problems. Hybridization of different algorithms may enhance the quality of the solutions and improve the efficiency of the algorithms. The purpose of this paper is to propose a novel, robust hybrid meta-heuristic optimization approach by adding differential evolution (DE) mutation operator to the accelerated particle swarm optimization (APSO) algorithm to solve numerical optimization problems.

The improvement includes the addition of DE mutation operator to the APSO updating equations so as to speed up convergence.

A new optimization method is proposed by introducing DE-type mutation into APSO, and the hybrid algorithm is called differential evolution accelerated particle swarm optimization (DPSO). The difference between DPSO and APSO is that the mutation operator is employed to fine-tune the newly generated solution for each particle, rather than random walks used in APSO.

A novel hybrid method is proposed and used to optimize 51 functions. It is compared with other methods to show its effectiveness. The effect of the DPSO parameters on convergence and performance is also studied and analyzed by detailed parameter sensitivity studies.

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.

Driven by sustainable production, mobile robots are introduced as a new clean-energy material handling tool for mixed-model assembly lines (MMALs), which reduces energy consumption and lineside inventory of workstations (LSI). Nevertheless, the previous part feeding scheduling method was designed for conventional material handling tools without considering the flexible spatial layout of the robotic mobile fulfillment system (RMFS). To fill this gap, this paper focuses on a greening mobile robot part feeding scheduling problem with Just-In-Time (JIT) considerations, where the layout and number of pods can be adjusted.

A novel hybrid-load pod (HL-pod) and mobile robot are proposed to carry out part feeding tasks between material supermarkets and assembly lines. A bi-objective mixed-integer programming model is formulated to minimize both total energy consumption and LSI, aligning with environmental and sustainable JIT goals. Due to the NP-hard nature of the proposed problem, a chaotic differential evolution algorithm for multi-objective optimization based on iterated local search (CDEMIL) algorithm is presented. The effectiveness of the proposed algorithm is verified by dealing with the HL-pod-based greening part feeding scheduling problem in different problem scales and compared to two benchmark algorithms. Managerial insights analyses are conducted to implement the HL-pod strategy.

The CDEMIL algorithm's ability to produce Pareto fronts for different problem scales confirms its effectiveness and feasibility. Computational results show that the proposed algorithm outperforms the other two compared algorithms regarding solution quality and convergence speed. Additionally, the results indicate that the HL-pod performs better than adopting a single type of pod.

This study proposes an innovative solution to the scheduling problem for efficient JIT part feeding using RMFS and HL-pods in automobile MMALs. It considers both the layout and number of pods, ensuring a sustainable and environmental-friendly approach to production.

Since the last few decades, Artificial Neural Networks have been the center of attraction of a large number of researchers for solving diversified problem domains. Due to its distinguishing features such as generalization ability, robustness and strong ability to tackle nonlinear problems, it appears to be more popular in financial time series modeling and prediction. In this paper, a Pi-Sigma Neural Network is designed for foretelling the future currency exchange rates in different prediction horizon. The unrevealed parameters of the network are interpreted by a hybrid learning algorithm termed as Shuffled Differential Evolution (SDE). The main motivation of this study is to integrate the partitioning and random shuffling scheme of Shuffled Frog Leaping algorithm with evolutionary steps of a Differential Evolution technique to obtain an optimal solution with an accelerated convergence rate. The efficiency of the proposed predictor model is actualized by predicting the exchange rate price of a US dollar against Swiss France (CHF) and Japanese Yen (JPY) accumulated within the same period of time.