Search results

How to get a lighter and stronger anti-rolling torsion bar has become a barrier for the development of high-speed railway vehicles. The purpose of this paper is to realize the multi-objective optimization of an anti-rolling torsion bar with a Modified Non-dominated Sorting Genetic Algorithm III (MNSGA-III), which aims to obtain a better design scheme of an anti-rolling torsion bar device.

First, the Non-dominated Sorting Genetic Algorithm III (NSGA-III) uses a simulated binary crossover (SBX) operator and a polynomial mutation operator, while the MNSGA-III algorithm proposed in this paper introduces an arithmetic crossover and an adaptive mutation operator to change the crossover and mutate operator in NSGA-III. Second, two algorithms are tested by ZDT3, ZDT4 functions. Both algorithms set the same population size and evolutionary generation, and then compare the results of NSGA-III and MNSGA-III. Finally, MNSGA-III is applied to the multi-objective model of an anti-rolling torsion bar which is established by taking the mass and stiffness of the torsion bar as the optimization object. After that, it obtains the Pareto solution set by solving the multi-objective model with MNSGA-III. The only optimal solution selected from the Pareto solution set is compared with the traditional design scheme of an anti-rolling torsion bar.

The MNSGA-III converges faster than NSGA-III. Besides, MNSGA-III has better diversity of Pareto solutions than NSGA-III and is closer to the ideal Pareto frontier. Comparing with the results before the optimization, it shows that the volume of the anti-rolling torsion bar reduces by 1.6 percent and the stiffness increases by 3.3 percent. The optimized data verifies the effectiveness of this method proposed in this paper.

The simulated binary crossover operator and polynomial mutation operator of NSGA-III are changed into an arithmetic crossover operator and an adaptive mutation operator, respectively, which improves the optimization performance of the algorithm.

The multi-objective optimization configuration strategy is proposed due to the configuration of EMAs in fault-tolerant control of active magnetic bearing with redundant electromagnetic actuators involving high-dimensional, nonlinear, conflicting goals.

A multi-objective optimization model for bias current coefficients is established based on the nonlinear model of active magnetic bearings with redundant electromagnetic actuators. Based on the non-dominated sorting genetic algorithm III, a numerical method is used to obtain feasible and non-inferior sets for the bias current coefficient.

(1) The conflicting relationship among the three optimization objectives was analyzed for various failure modes of EAMs. (2) For different EMAs' failure modes, the multi-objective optimization configuration strategy can simultaneously achieve the optimal or sub-optimal effective EMF, flux margins, and stability of EMF. Moreover, the characteristics of the optimal Pareto front are consistent with the physical properties of the AMB. (3) Compared with the feasible configuration of C0, the non-inferior configurations can significantly improve the performance of AMB, and the advantages of the multi-objective optimization configuration strategy become more prominent as the asymmetry of the residual supporting structure intensifies.

i) Considering the variation of the rotor displacement during the support reconstruction, a decision-making model that can accurately characterize the dynamic performance of AMB is presented. (ii) The interaction law between AMB and rotor under different failure modes of EMAs is analyzed, and the configuration principles for redundant EMAs are proposed. (iii) Based on the dynamic characteristics of AMB during the support reconstruction, effective EMF, energy consumption, and the Pearson correlation coefficient between the desired EMFs and the decoupled control currents are used as objective functions. iv. The NSGA-III is combined with the decision-making model to address the multi-objective optimization configuration problem of C0.

Although the previous generations of the Industrial Revolution have brought many advantages to human life, scientists have been looking for a substantial breakthrough in creating technologies that can improve the quality of human life. Nowadays, we can make our factories smarter using new concepts and tools like real-time self-optimization. This study aims to take a step towards implementing key features of smart manufacturing including  preventive self-maintenance, self-scheduling and real-time decision-making.

A new bi-objective mathematical model based on Industry 4.0 to schedule received customer orders, which minimizes both the total earliness and tardiness of orders and the probability of machine failure in smart manufacturing, was presented. Moreover, four meta-heuristics, namely, the multi-objective Archimedes optimization algorithm (MOAOA), NSGA-III, multi-objective simulated annealing (MOSA) and hybrid multi-objective Archimedes optimization algorithm and non-dominated sorting genetic algorithm-III (HMOAOANSGA-III) were implemented to solve the problem. To compare the performance of meta-heuristics, some examples and metrics were presumed and solved by using the algorithms, and the performance and validation of meta-heuristics were analyzed.

The results of the procedure and a mathematical model based on Industry 4.0 policies showed that a machine performed the self-optimizing process of production scheduling and followed a preventive self-maintenance policy in real-time situations. The results of TOPSIS showed that the performances of the HMOAOANSGA-III were better in most problems. Moreover, the performance of the MOSA outweighed the performance of the MOAOA, NSGA-III and HMOAOANSGA-III if we only considered the computational times of algorithms. However, the convergence of solutions associated with the MOAOA and HMOAOANSGA-III was better than those of the NSGA-III and MOSA.

In this study, a scheduling model considering a kind of Industry 4.0 policy was defined, and a novel approach was presented, thereby performing the preventive self-maintenance and self-scheduling by every single machine. This new approach was introduced to integrate the order scheduling system using a real-time decision-making method. A new multi-objective meta-heuristic algorithm, namely, HMOAOANSGA-III, was proposed. Moreover, the crowding-distance-quality-based approach was presented to identify the best solution from the frontier, and in addition to improving the crowding-distance approach, the quality of the solutions was also considered.

In situations where the crew is reduced, the optimization of crew task allocation and sequencing (CTAS) can significantly enhance the operational efficiency of the man-machine system by rationally distributing workload and minimizing task completion time. Existing related studies exhibit a limited consideration of workload distribution and involve the violation of precedence constraints in the solution process. This study proposes a CTAS method to address these issues.

The method defines visual, auditory, cognitive and psychomotor (VACP) load balancing objectives and integrates them with workload balancing and minimum task completion time to ensure equitable workload distribution and task execution efficiency, and then a multi-objective optimization model for CTAS is constructed. Subsequently, it designs a population initialization strategy and a repair mechanism to maintain sequence feasibility, and utilizes them to improve the non-dominated sorting genetic algorithm III (NSGA-III) for solving the CTAS model.

The CTAS method is validated through a numerical example involving a mission with a specific type of armored vehicle. The results demonstrate that the method achieves equitable workload distribution by integrating VACP load balancing and workload balancing. Moreover, the improved NSGA-III maintains sequence feasibility and thus reduces computation time.

The study can achieve equitable workload distribution and enhance the search efficiency of the optimal CTAS scheme. It provides a novel perspective for task planners in objective determination and solution methodologies for CTAS.

Although the multi-criteria technique analytic hierarchy process (AHP) has successfully been applied in many areas, either selecting or ranking alternatives or to derive priority vector (weights) for a set of criteria, there is a significant drawback in using this technique if the pairwise comparison matrix (PCM) has inconsistent comparisons, in other words, a consistency ratio (CR) above the value of 0.1, the final solution cannot be validated. Many studies have been developed to treat the inconsistency problem, but few of them tried to satisfy different quality measures, which are minimum inconsistency (fMI), the total number of adjusted pairwise comparisons (fNC), original rank preservation (fKT), minimum average weights adjustment (fWA) and finally, minimum L1 matrix norm between the original PCM and the adjusted PCM (fLM).

The approach is defined in four steps: first, the decision-maker should choose which quality measures she/he wishes to use, ranging from one to all quality measures. In the second step, the authors encode the PCM to be used in a many-objective optimization algorithm (MOOA), and each pairwise comparison can be adjusted individually. The authors generate consistent solutions from the obtained Pareto optimal front that carry the desired quality measures in the third step. Lastly, the decision-maker selects the most suitable solution for her/his problem. Remarkably, as the decision-maker can choose one (mono-objective), two (multi-objective), three or more (many-objectives) quality measures, not all MOOAs can handle or perform well in mono- or multi-objective problems. The unified non-sorting algorithm III (U-NSGA III) is the most appropriate MOOA for this type of scenario because it was specially designed to handle mono-, multi- and many-objective problems.

The use of two quality measures should not guarantee that the adjusted PCM is similar to the original PCM; hence, the decision-maker should consider using more quality measures if the objective is to preserve the original PCM characteristics.

For the first time, a many-objective approach reduces the CR to consistent levels with the ability to consider one or more quality measures and allows the decision-maker to adjust each pairwise comparison individually.

The construction industry is tasked with creating sustainable, efficient and cost-effective buildings. This study aims to develop a building information modeling (BIM)-based multiobjective optimization (MOO) model integrating the nondominated sorting genetic algorithm III (NSGA-III) to enhance sustainability. The goal is to reduce embodied energy and cost in the design process.

Through a case study research method, this study uses BIM, NSGA-III and real-world data in five phases: literature review, identification of factors, BIM model development, MOO model creation and validation in the architecture, engineering and construction sectors.

The innovative BIM-based MOO model optimizes embodied energy and cost to achieve sustainable construction. A commercial building case study validation showed a reduction of 30% in embodied energy and 21% in cost. This study validates the model’s effectiveness in integrating sustainability goals, enhancing decision-making, collaboration, efficiency and providing superior assessment.

This model delivers a unified approach to sustainable design, cutting carbon footprint and strengthening the industry’s ability to attain sustainable solutions. It holds potential for broader application and future integration of social and economic factors.

The research presents a novel BIM-based MOO model, uniquely focusing on sustainable construction with embodied energy and cost considerations. This holistic and innovative framework extends existing methodologies applicable to various buildings and paves the way for additional research in this area.

The purpose of this paper is to develop a model which schedules activities and allocates resources in a resource constrained project management problem. This paper also considers learning rate and uncertainties in the activity durations.

An activity schedule with requirements of different resource units is used to calculate the objectives: makespan and resource efficiency. A comparisons between non-dominated sorting genetic algorithm – II (NSGA-II) and non-dominated sorting genetic algorithm – III (NSGA-III) is done to calculate near optimal solutions. Buffers are introduced in the activity schedule to take uncertainty into account and learning rate is used to incorporate the learning effect.

The results show that NSGA-III gives better near optimal solutions than NSGA-II for multi-objective problem with different complexities of activity schedule.

The paper does not considers activity sequencing with multiple activity relations (for instance partial overlapping among different activities) and dynamic events occurring in between or during activities.

The paper helps project managers in manufacturing industry to schedule the activities and allocate resources for a near-real world environment.

This paper takes into account both the learning rate and the uncertainties in the activity duration for a resource constrained project management problem. The uncertainty in both the individual durations of activities and the whole project duration time is taken into consideration. Genetic algorithms were used to solve the problem at hand.

This paper aims to evaluate two operational modes of the worker allocation problem (WAP) in the multiple U-line system (MULS). Five objectives are optimised simultaneously for the most complicated operational modes, i.e. machine-dominant working and fixed-station walking. Besides, the benefits of using multiline workstations (MLWs) are investigated.

The elite non-dominated sorting differential evolutionary III (ENSDE III) algorithm is developed as a solution technique. Also, the largest remaining available time heuristic is proposed as a baseline in determining the number and utilisation of workers when the use of MLWs is not allowed.

ENSDE III outperforms the cutting-edged multi-objective evolutionary algorithms, i.e. multi-objective evolutionary algorithm based on decomposition and non-dominated sorting differential evolutionary III, under two key Pareto metrics, i.e. generational distance and inverted generational distance, regardless of the problem size. The best-found number of workers from ENSDE III is substantially lower than the upper bound. The MULS with MLWs requires fewer workers than the one without.

Although this research has extended several issues in the basic model of multiple U-line systems, some assumptions were used to facilitate mathematical computation as follows. The U-line system in this research assumed that all lines were produced only a single product. Besides, all workers were well-trained to gain the same skill. These assumptions could be extended in the future.

The implication of this research is the benefits of multiline workstations (MLWs) used in the multiple U-line system. Instead of leaving each individual line to operate independently, all lines should be working in parallel through the use of MLWs to gain benefits in terms of worker reduction, balancing worker’s workload, higher system utilisation.

This research is the first to address the WAP in the MULS with machine-dominant working and fixed-station walking modes. Worker’s fatigue due to standing and walking while working is incorporated into the model. The novel ENSDE III algorithm is developed to optimise the multi-objective WAP in a Pareto sense. The benefits of exploiting MLWs are also illustrated.

The purpose of this study is to provide a novel portfolio asset prediction by means of the modified deep learning and hybrid meta-heuristic concept. In the past few years, portfolio optimization has appeared as a demanding and fascinating multi-objective problem, in the area of computational finance. Yet, it is accepting the growing attention of fund management companies, researchers and individual investors. The primary issues in portfolio selection are the choice of a subset of assets and its related optimal weights of every chosen asset. The composition of every asset is chosen in a manner such that the total profit or return of the portfolio is improved thereby reducing the risk at the same time.

This paper provides a novel portfolio asset prediction using the modified deep learning concept. For implementing this framework, a set of data involving the portfolio details of different companies for certain duration is selected. The proposed model involves two main phases. One is to predict the future state or profit of every company, and the other is to select the company which is giving maximum profit in the future. In the first phase, a deep learning model called recurrent neural network (RNN) is used for predicting the future condition of the entire companies taken in the data set and thus creates the data library. Once the forecasting of the data is done, the selection of companies for the portfolio is done using a hybrid optimization algorithm by integrating Jaya algorithm (JA) and spotted hyena optimization (SHO) termed as Jaya-based spotted hyena optimization (J-SHO). This optimization model tries to get the optimal solution including which company has to be selected, and optimized RNN helps to predict the future return while using those companies. The main objective model of the J-SHO-based RNN is to maximize the prediction accuracy and J-SHO-based portfolio asset selection is to maximize the profit. Extensive experiments on the benchmark datasets from real-world stock markets with diverse assets in various time periods shows that the developed model outperforms other state-of-the-art strategies proving its efficiency in portfolio optimization.

From the analysis, the profit analysis of proposed J-SHO for predicting after 7 days in next month was 46.15% better than particle swarm optimization (PSO), 18.75% better than grey wolf optimization (GWO), 35.71% better than whale optimization algorithm (WOA), 5.56% superior to JA and 35.71% superior to SHO. Therefore, it can be certified that the proposed J-SHO was effective in providing intelligent portfolio asset selection and prediction when compared with the conventional methods.

This paper presents a technique for providing a novel portfolio asset prediction using J-SHO algorithm. This is the first work uses J-SHO-based optimization for providing a novel portfolio asset prediction using the modified deep learning concept.

The paper aims to propose an innovative two-stage decision model to address the sustainable-resilient supplier selection and order allocation (SSOA) problem in the single-valued neutrosophic (SVN) environment.

First, the sustainable and resilient performances of suppliers are evaluated by the proposed integrated SVN-base-criterion method (BCM)-an acronym in Portuguese of interactive and multi-criteria decision-making (TODIM) method, with consideration of the uncertainty in the decision-making process. Then, a novel multi-objective optimization model is formulated, and the best sustainable-resilient order allocation solution is found using the U-NSGA-III algorithm and TOPSIS method. Finally, based on a real-life case in the automotive manufacturing industry, experiments are conducted to demonstrate the application of the proposed two-stage decision model.

The paper provides an effective decision tool for the SSOA process in an uncertain environment. The proposed SVN-BCM-TODIM approach can effectively handle the uncertainties from the decision-maker’s confidence degree and incomplete decision information and evaluate suppliers’ performance in different dimensions while avoiding the compensatory effect between criteria. Moreover, the proposed order allocation model proposes an original way to improve sustainable-resilient procurement values.

The paper provides a supplier selection process that can effectively integrate sustainability and resilience evaluation in an uncertain environment and develops a sustainable-resilient procurement optimization model.