Search results

This study aims to reduce the redundant weight of the anti-roll torsion bar brought by the traditional empirical design and improving its strength and stiffness.

Based on the finite element approach coupled with the improved beluga whale optimization (IBWO) algorithm, a collaborative optimization method is suggested to optimize the design of the anti-roll torsion bar structure and weight. The dimensions and material properties of the torsion bar were defined as random variables, and the torsion bar's mass and strength were investigated using finite elements. Then, chaotic mapping and differential evolution (DE) operators are introduced to improve the beluga whale optimization (BWO) algorithm and run case studies.

The findings demonstrate that the IBWO has superior solution set distribution uniformity, convergence speed, solution correctness and stability than the BWO. The IBWO algorithm is used to optimize the anti-roll torsion bar design. The error between the optimization and finite element simulation results was less than 1%. The weight of the optimized anti-roll torsion bar was lessened by 4%, the maximum stress was reduced by 35% and the stiffness was increased by 1.9%.

The study provides a methodological reference for the simulation optimization process of the lateral anti-roll torsion bar.

Ant Colony Optimization and Particle Swarm Optimization represent two widely used Swarm Intelligence (SI) optimization techniques. Information processing using Multiple-Valued Logic (MVL) is carried out using more than two discrete logic levels. In this paper, we compare two the SI-based algorithms in synthesizing MVL functions. A benchmark consisting of 50,000 randomly generated 2-variable 4-valued functions is used for assessing the performance of the algorithms using the benchmark. Simulation results show that the PSO outperforms the ACO technique in terms of the average number of product terms (PTs) needed. We also compare the results obtained using both ACO-MVL and PSO-MVL with those obtained using Espresso-MV logic minimizer. It is shown that on average, both of the SI-based techniques produced better results compared to those produced by Espresso-MV. We show that the SI-based techniques outperform the conventional direct-cover (DC) techniques in terms of the average number of product terms required.

This study aims to examine the impact of the decision makers’ risk preference on logistics routing problem, contributing to logistics behavior analysis and route integration optimization under uncertain environment. Due to the unexpected events and complex environment in modern logistics operations, the logistics process is full of uncertainty. Based on the chance function of satisfying the transportation time and cost requirements, this paper focuses on the fourth party logistics routing integrated optimization problem considering the chance preference of decision makers from the perspective of satisfaction.

This study used the quantitative method to investigate the relationship between route decision making and human behavior. The cumulative prospect theory is used to describe the loss, gain and utility function based on confidence levels. A mathematical model and an improved ant colony algorithm are employed to solve the problems. Numerical examples show the effectiveness of the proposed model and algorithm.

The study’s findings reveal that the dual-population improvement strategy enhances the algorithm’s global search capability and the improved algorithm can solve the risk model quickly, verifying the effectiveness of the improvement method. Moreover, the decision-maker is more sensitive to losses, and the utility obtained when considering decision-makers' risk attitudes is greater than that obtained when the decision-maker exhibits risk neutrality.

In an uncertain environment, the logistics decision maker’s risk preference directly affects decision making. Different parameter combinations in the proposed model could be set for decision-makers with different risk attitudes to fit their needs more accurately. This could help managers design effective transportation plans and improve service levels. In addition, the improved algorithm can solve the proposed problem quickly, stably and effectively, so as to help the decision maker to make the logistics path decision quickly according to the required confidence level.

Considering the uncertainty in logistics and the risk behavior of decision makers, this paper studies integrated routing problem from the perspective of opportunity preference. Based on the chance function of satisfying the transportation time and cost requirements, a fourth party logistics routing integrated optimization problem model considering the chance preference of decision makers is established. According to the characteristics of the problem, an improved dual-population ant colony algorithm is designed to solve the proposed model. Numerical examples show the effectiveness the proposed methods.

In order to solve the problems faced by First Order Reliability Method (FORM) and First Order Saddlepoint Approximation (FOSA) in structural reliability optimization, this paper aims to propose a new Reliability-based Design Optimization (RBDO) strategy for offshore engineering structures based on Original Probabilistic Model (OPM) decoupling strategy. The application of this innovative technique to other maritime structures has the potential to substantially improve their design process by optimizing cost and enhancing structural reliability.

In the strategy proposed by this paper, sequential optimization and reliability assessment method and surrogate model are used to improve the efficiency for solving RBDO. The strategy is applied to the analysis of two marine engineering structure cases of ship cargo hold structure and frame ring of underwater skirt pile gripper. The effectiveness of the method is proved by comparing the original design and the optimized results.

In this paper, the proposed new RBDO strategy is used to optimize the design of the ship cargo hold structure and the frame ring of the underwater skirt pile gripper. According to the results obtained, compared with the original design, the structure of optimization design has better reliability and stability, and reduces the risk of failure. This optimization can also better balance the relationship between performance and cost. Therefore, it is recommended for related RBDO problems in the field of marine engineering.

In view of the limitations of FORM and FOSA that may produce multiple MPPs for a single performance function, the new RBDO strategy proposed in this study provides valuable insights and robust methods for the optimization design of offshore engineering structures. It emphasizes the importance of combining advanced MPP search technology and integrating SORA and surrogate models to achieve more economical and reliable design.

Surface roughness has a serious impact on the fatigue strength, wear resistance and life of mechanical products. Realizing the evolution of surface quality through theoretical modeling takes a lot of effort. To predict the surface roughness of milling processing, this paper aims to construct a neural network based on deep learning and data augmentation.

This study proposes a method consisting of three steps. Firstly, the machine tool multisource data acquisition platform is established, which combines sensor monitoring with machine tool communication to collect processing signals. Secondly, the feature parameters are extracted to reduce the interference and improve the model generalization ability. Thirdly, for different expectations, the parameters of the deep belief network (DBN) model are optimized by the tent-SSA algorithm to achieve more accurate roughness classification and regression prediction.

The adaptive synthetic sampling (ADASYN) algorithm can improve the classification prediction accuracy of DBN from 80.67% to 94.23%. After the DBN parameters were optimized by Tent-SSA, the roughness prediction accuracy was significantly improved. For the classification model, the prediction accuracy is improved by 5.77% based on ADASYN optimization. For regression models, different objective functions can be set according to production requirements, such as root-mean-square error (RMSE) or MaxAE, and the error is reduced by more than 40% compared to the original model.

A roughness prediction model based on multiple monitoring signals is proposed, which reduces the dependence on the acquisition of environmental variables and enhances the model's applicability. Furthermore, with the ADASYN algorithm, the Tent-SSA intelligent optimization algorithm is introduced to optimize the hyperparameters of the DBN model and improve the optimization performance.

The proposed model has been aimed to predict stock market signals by designing an accurate model. In this sense, the stock market is analysed by the technical analysis of Japanese Candlestick, which is combined by the following meta heuristic algorithms: support vector machine (SVM), meta-heuristic algorithms, particle swarm optimization (PSO), imperialist competition algorithm (ICA) and genetic algorithm (GA).

In addition, among the developed algorithms, the most effective one is chosen to determine probable sell and buy signals. Moreover, the authors have proposed comparative results to validate the designed model in this study with the same basic models of three articles in the past. Hence, PSO is used as a classification method to search the solution space absolutelyand with the high speed of running. In terms of the second model, SVM and ICA are examined by the time. Where the ICA is an improver for the SVM parameters. Finally, in the third model, SVM and GA are studied, where GA acts as optimizer and feature selection agent.

Results have been indicated that, the prediction accuracy of all new models are high for only six days, however, with respect to the confusion matrixes results, it is understood that the SVM-GA and SVM-ICA models have correctly predicted more sell signals, and the SCM-PSO model has correctly predicted more buy signals. However, SVM-ICA has shown better performance than other models considering executing the implemented models.

In this study, the authors to analyze the data the long length of time between the years 2013–2021, makes the input data analysis challenging. They must be changed with respect to the conditions.

In this study, two methods have been developed in a candlestick model, they are raw based and signal-based approaches which the hit rate is determined by the percentage of correct evaluations of the stock market for a 16-day period.

The density peak clustering algorithm (DP) is proposed to identify cluster centers by two parameters, i.e. ρ value (local density) and δ value (the distance between a point and another point with a higher ρ value). According to the center-identifying principle of the DP, the potential cluster centers should have a higher ρ value and a higher δ value than other points. However, this principle may limit the DP from identifying some categories with multi-centers or the centers in lower-density regions. In addition, the improper assignment strategy of the DP could cause a wrong assignment result for the non-center points. This paper aims to address the aforementioned issues and improve the clustering performance of the DP.

First, to identify as many potential cluster centers as possible, the authors construct a point-domain by introducing the pinhole imaging strategy to extend the searching range of the potential cluster centers. Second, they design different novel calculation methods for calculating the domain distance, point-domain density and domain similarity. Third, they adopt domain similarity to achieve the domain merging process and optimize the final clustering results.

The experimental results on analyzing 12 synthetic data sets and 12 real-world data sets show that two-stage density peak clustering based on multi-strategy optimization (TMsDP) outperforms the DP and other state-of-the-art algorithms.

The authors propose a novel DP-based clustering method, i.e. TMsDP, and transform the relationship between points into that between domains to ultimately further optimize the clustering performance of the DP.

Facing the diverse needs of large-scale customers, based on available railway service resources and service capabilities, this paper aims to research the design method of railway freight service portfolio, select optimal service solutions and provide customers with comprehensive and customized freight services.

Based on the characteristics of railway freight services throughout the entire process, the service system is decomposed into independent units of service functions, and a railway freight service combination model is constructed with the goal of minimizing response time, service cost and service time. A model solving algorithm based on adaptive genetic algorithm is proposed.

Using the computational model, an empirical analysis was conducted on the entire process freight service plan for starch sold from Xi'an to Chengdu as an example. The results showed that the proposed optimization model and algorithm can effectively guide the design of freight plans and provide technical support for real-time response to customers' diversified entire process freight service needs.

With the continuous optimization and upgrading of railway freight source structure, customer demands are becoming increasingly diverse and personalized. Studying and designing a reasonable railway freight service plan throughout the entire process is of great significance for timely response to customer needs, improving service efficiency and reducing design costs.

The paper aims to investigate the comfort-related performances of an innovative solar shading solution based on a new composite patented material that consists of a cement-based matrix coupled with a stretchable three-dimensional textile. The paper’s aim is, through a performance-based generative design approach, to develop a high-performance static shading system able to guarantee adequate daylit spaces, a connection with the outdoors and a glare-free environment in the view of a holistic and occupant-centric daylight assessment.

The paper describes the design and simulation process of a complex static shading system for digital manufacturing purposes. Initially, the optical material properties were characterized to calibrate radiance-based simulations. The developed models were then implemented in a multi-objective genetic optimization algorithm to improve the shading geometries, and their performance was assessed and compared with traditional external louvres and overhangs.

The system developed demonstrates, for a reference office space located in Milan (Italy), the potential of increasing useful daylight illuminance by 35% with a reduced glare of up to 70%–80% while providing better uniformity and connection with the outdoors as a result of a topological optimization of the shape and position of the openings.

The paper presents the innovative nature of a new composite material that, coupled with the proposed performance-based optimization process, enables the fabrication of optimized shading/cladding surfaces with complex geometries whose formability does not require ad hoc formworks, making the process fast and economic.

The present paper aims to address challenges associated with path planning and obstacle avoidance in mobile robotics. It introduces a pioneering solution called the Bi-directional Adaptive Enhanced A* (BAEA*) algorithm, which uses a new bidirectional search strategy. This approach facilitates simultaneous exploration from both the starting and target nodes and improves the efficiency and effectiveness of the algorithm in navigation environments. By using the heuristic knowledge A*, the algorithm avoids unproductive blind exploration, helps to obtain more efficient data for identifying optimal solutions. The simulation results demonstrate the superior performance of the BAEA* algorithm in achieving rapid convergence towards an optimal action strategy compared to existing methods.

The paper adopts a careful design focusing on the development and evaluation of the BAEA* for mobile robot path planning, based on the reference [18]. The algorithm has remarkable adaptability to dynamically changing environments and ensures robust navigation in the context of environmental changes. Its scale further enhances its applicability in large and complex environments, which means it has flexibility for various practical applications. The rigorous evaluation of our proposed BAEA* algorithm with the Bidirectional adaptive A* (BAA*) algorithm [18] in five different environments demonstrates the superiority of the BAEA* algorithm. The BAEA* algorithm consistently outperforms BAA*, demonstrating its ability to plan shorter and more stable paths and achieve higher success rates in all environments.

The paper adopts a careful design focusing on the development and evaluation of the BAEA* for mobile robot path planning, based on the reference [18]. The algorithm has remarkable adaptability to dynamically changing environments and ensures robust navigation in the context of environmental changes. Its scale further enhances its applicability in large and complex environments, which means it has flexibility for various practical applications. The rigorous evaluation of our proposed BAEA* algorithm with the Bi-directional adaptive A* (BAA*) algorithm [18] in five different environments demonstrates the superiority of the BAEA* algorithm.

The rigorous evaluation of our proposed BAEA* algorithm with the BAA* algorithm [18] in five different environments demonstrates the superiority of the BAEA* algorithm. The BAEA* algorithm consistently outperforms BAA*, demonstrating its ability to plan shorter and more stable paths and achieve higher success rates in all environments.

The originality of this paper lies in the introduction of the bidirectional adaptive enhancing A* algorithm (BAEA*) as a novel solution for path planning for mobile robots. This algorithm is characterized by its unique characteristics that distinguish it from others in this field. First, BAEA* uses a unique bidirectional search strategy, allowing to explore the same path from both the initial node and the target node. This approach significantly improves efficiency by quickly converging to the best paths and using A* heuristic knowledge. In particular, the algorithm shows remarkable capabilities to quickly recognize shorter and more stable paths while ensuring higher success rates, which is an important feature for time-sensitive applications. In addition, BAEA* shows adaptability and robustness in dynamically changing environments, not only avoiding obstacles but also respecting various constraints, ensuring safe path selection. Its scale further increases its versatility by seamlessly applying it to extensive and complex environments, making it a versatile solution for a wide range of practical applications. The rigorous assessment against established algorithms such as BAA* consistently shows the superior performance of BAEA* in planning shorter paths, achieving higher success rates in different environments and cementing its importance in complex and challenging environments. This originality marks BAEA* as a pioneering contribution, increasing the efficiency, adaptability and applicability of mobile robot path planning methods.