Search results

This study aims to examine the perceptions of students about learning science and physics using the engineering design process (EDP).

The study employed a mixed-methods research design: The quantitative session features a pre–post-test control group study. In the qualitative aspect, the study conducted semistructured interviews for data collection. In the experimental group, the flipped classroom (FC) model and an instructional design are combined to design, develop and implement a physics course using the steps of the EDP, while the conventional method was applied to the control group. The respondents are students of the Department of Mechanical Engineering at Cao Thang Technical College in Vietnam for the academic year 2022–2023. The control and experimental groups are composed of 80 students each. An independent sample Mann–Whitney U test is applied to the quantitative data, while thematic analysis is employed for the qualitative data.

The results demonstrate a statistically significant difference between the experimental and control groups in terms of perceptions about learning science and physics using the EDP, which, when combined with a FC, enhances physics learning for engineering students.

This study implemented the EDP in teaching physics to first-year engineering students in the Department of Mechanical Engineering using the combined FC and instructional design models. The results revealed that a difference exists in the perception of the students in terms of integrating the EDP into learning physics between the experimental and control groups. The experimental group, which underwent the EDP, obtained better results than did the control group, which used the conventional method. The results demonstrated that the EDP encouraged the students to explore and learn new content knowledge by selecting the appropriate solution to the problem. The EDP also helped them integrate new knowledge and engineering skills into mechanical engineering. This research also introduced a new perspective on physics teaching and learning using the EDP for engineering college students.

The research findings are important for teaching and learning physics using EDP in the context of engineering education. Thus, educators can integrate the teaching and learning of physics into the EDP to motivate and engage student learning.

Using the EDP combined with a FC designed under stages of the analyze, design, develop, implement and evaluate (ADDIE) model has enhanced the learning of physics for engineering college students.

THE Government, through the Department of Scientific and Industrial Research, is setting up a special organization to carry out scientific research in Mechanical Engineering to meet, and still more to anticipate, the needs of industry and government departments. The eventual annual expenditure will be in the region of £250,000 to £350,000, although it is unlikely that this figure can be reached for some years because of the present difficulties in obtaining suitably qualified staff and buildings. The research is intended mainly to supplement the research carried on in other research organizations in this country, and will largely be confined to those fundamental problems which underlie all mechanical engineering. Thus the subjects in which research is expected to be carried out are:

The purpose of this paper is to investigate the performance of chaotic gravitational search algorithm (CGSA) in solving mechanical engineering design frameworks including welded beam design (WBD), compression spring design (CSD) and pressure vessel design (PVD).

In this study, ten chaotic maps were combined with gravitational constant to increase the exploitation power of gravitational search algorithm (GSA). Also, CGSA has been used for maintaining the adaptive capability of gravitational constant. Furthermore, chaotic maps were used for overcoming premature convergence and stagnation in local minima problems of standard GSA.

The chaotic maps have shown efficient performance for WBD and PVD problems. Further, they have depicted competitive results for CSD framework. Moreover, the experimental results indicate that CGSA shows efficient performance in terms of convergence speed, cost function minimization, design variable optimization and successful constraint handling as compared to other participating algorithms.

The use of chaotic maps in standard GSA is a new beginning for research in GSA particularly convergence and time complexity analysis. Moreover, CGSA can be used for solving the infinite impulsive response (IIR) parameter tuning and economic load dispatch problems in electrical sciences.

The hybridization of chaotic maps and evolutionary algorithms for solving practical engineering problems is an emerging topic in metaheuristics. In the literature, it can be seen that researchers have used some chaotic maps such as a logistic map, Gauss map and a sinusoidal map more rigorously than other maps. However, this work uses ten different chaotic maps for engineering design optimization. In addition, non-parametric statistical test, namely, Wilcoxon rank-sum test, was carried out at 5% significance level to statistically validate the simulation results. Besides, 11 state-of-the-art metaheuristic algorithms were used for comparative analysis of the experimental results to further raise the authenticity of the experimental setup.

In this paper, the authors aim to examine and comparatively evaluate a recently-developed metaheuristic called crystal structure algorithm (CryStAl) – which is inspired by the symmetries in the internal structure of crystalline solids – in solving engineering mechanics and design problems.

A total number of 20 benchmark mathematical functions are employed as test functions to evaluate the overall performance of the proposed method in handling various functions. Moreover, different classical and modern metaheuristic algorithms are selected from the optimization literature for a comparative evaluation of the performance of the proposed approach. Furthermore, five well-known mechanical design examples are utilized to examine the capability of the proposed method in dealing with challenging optimization problems.

The results of this study indicated that, in most cases, CryStAl produced more accurate outputs when compared to the other metaheuristics examined as competitors.

This paper can provide motivation and justification for the application of CryStAl to solve more complex problems in engineering design and mechanics, as well as in other branches of engineering.

CryStAl is one of the newest metaheuristic algorithms, the mathematical details of which were recently introduced and published. This is the first time that this algorithm is applied to solving engineering mechanics and design problems.

In this work, the multi-objective optimization shuffled complex evolution is proposed. The algorithm is based on the extension of shuffled complex evolution, by incorporating two classical operators into the original algorithm: the rank ordering and crowding distance. In order to accelerate the convergence process, a Local Search strategy based on the generation of potential candidates by using Latin Hypercube method is also proposed.

The multi-objective optimization shuffled complex evolution is used to accelerate the convergence process and to reduce the number of objective function evaluations.

In general, the proposed methodology was able to solve a classical mechanical engineering problem with different characteristics. From a statistical point of view, we demonstrated that differences may exist between the proposed methodology and other evolutionary strategies concerning two different metrics (convergence and diversity), for a class of benchmark functions (ZDT functions).

The development of a new numerical method to solve multi-objective optimization problems is the major contribution.

The purpose of this paper is to design an improved multi-objective algorithm with better spread and convergence than some current algorithms. The proposed application is for engineering design problems.

This study proposes two novel approaches which focus on faster convergence to the Pareto front (PF) while adopting the advantages of Strength Pareto Evolutionary Algorithm-2 (SPEA2) for better spread. In first method, decision variables corresponding to the optima of individual objective functions (Utopia Point) are strategically used to guide the search toward PF. In second method, boundary points of the PF are calculated and their decision variables are seeded to the initial population.

The proposed methods are tested with a wide range of constrained and unconstrained multi-objective test functions using standard performance metrics. Performance evaluation demonstrates the superiority of proposed algorithms over well-known existing algorithms (such as NSGA-II and SPEA2) and recent ones such as NSLS and E-NSGA-II in most of the benchmark functions. It is also tested on an engineering design problem and compared with a currently used algorithm.

The algorithms are intended to be used for practical engineering design problems which have many variables and conflicting objectives. A complex example of Welded Beam has been shown at the end of the paper.

The algorithm would be useful for many design problems and social/industrial problems with conflicting objectives.

This paper presents two novel hybrid algorithms involving SPEA2 based on: local search; and Utopia point directed search principles. This concept has not been investigated before.

The purpose of this paper is to propose variants of an adaptive penalty scheme for steady-state genetic algorithms applied to constrained engineering optimization problems.

For each constraint a penalty parameter is adaptively computed along the evolution according to information extracted from the current population such as the existence of feasible individuals and the level of violation of each constraint. The adaptive penalty method (APM), as originally proposed, computes the constraint violations of the initial population, and updates the penalty coefficient of each constraint after a given number of new individuals are inserted in the population. A second variant, called sporadic APM with constraint violation accumulation, works by accumulating the constraint violations during a given insertion of new offspring into the population, updating the penalty coefficients, and fixing the penalty coefficients for the next generations. The APM with monotonic penalty coefficients is the third variation, where the penalty coefficients are calculated as in the original method, but no penalty coefficient is allowed to have its value reduced along the evolutionary process. Finally, the penalty coefficients are defined by using a weighted average between the current value of a coefficient and the new value predicted by the method. This variant is called the APM with damping.

The paper checks new variants of an APM for evolutionary algorithms; variants of an APM, for a steady-state genetic algorithm based on an APM for a generational genetic algorithm, largely used in the literature previously proposed by two co-authors of this manuscript; good performance of the proposed APM in comparison with other techniques found in the literature; innovative and general strategies to handle constraints in the field of evolutionary computation.

The proposed algorithm has no limitations and can be applied in a large number of evolutionary algorithms used to solve constrained optimization problems.

The proposed algorithm can be used to solve real world problems in engineering as can be viewed in the references, presented in this manuscript, that use the original (APM) strategy. The performance of these variants is examined using benchmark problems of mechanical and structural engineering frequently discussed in the literature.

It is the first extended analysis of the variants of the APM submitted for possible publication in the literature, applied to real world engineering optimization problems.

To expose engineering students to using modern technologies, such as multimedia packages, to learn, visualize and solve engineering problems, such as in mechanics dynamics.

A multimedia problem‐solving prototype package is developed to help students solve an engineering problem in a step‐by‐step approach. A learning architecture model for developing an interactive technology‐assisted problem solving (TAPS) package for visualizing engineering concepts has been discussed.

The learning model was found to be easy to follow and use and the engineering package can be designed in an easy and visually appealing format. The TAPS package implemented and described in this paper could support and provide students with a better understanding of the basic concepts in an engineering mechanics dynamics course in particular.

The evaluation of the TAPS package materials comprised mainly quantitative methods which provided validation of the package approach for the acquisition of procedural skills and related basic concepts. More work is necessary to employ qualitative approaches for more detailed analysis of usability of particular materials of the TAPS package.

The main originality of the paper can be seen from the development of the package that guides the student intelligently to solve the selected engineering problem. In addition, important user tools are also included which the user may need to use if necessary.

The purpose of this paper is to propose a novel improved teaching and learning-based algorithm (TLBO) to enhance its convergence ability and solution accuracy, making it more suitable for solving large-scale optimization issues.

Utilizing multiple cooperation mechanisms in teaching and learning processes, an improved TBLO named CTLBO (collectivism teaching-learning-based optimization) is developed. This algorithm introduces a new preparation phase before the teaching and learning phases and applies multiple teacher–learner cooperation strategies in teaching and learning processes. Applying modularization idea, based on the configuration structure of operators of CTLBO, six variants of CTLBO are constructed. For identifying the best configuration, 30 general benchmark functions are tested. Then, three experiments using CEC2020 (2020 IEEE Conference on Evolutionary Computation)-constrained optimization problems are conducted to compare CTLBO with other algorithms. At last, a large-scale industrial engineering problem is taken as the application case.

Experiment with 30 general unconstrained benchmark functions indicates that CTLBO-c is the best configuration of all variants of CTLBO. Three experiments using CEC2020-constrained optimization problems show that CTLBO is one powerful algorithm for solving large-scale constrained optimization problems. The application case of industrial engineering problem shows that CTLBO and its variant CTLBO-c can effectively solve the large-scale real problem, while the accuracies of TLBO and other meta-heuristic algorithm are far lower than CLTBO and CTLBO-c, revealing that CTLBO and its variants can far outperform other algorithms. CTLBO is an excellent algorithm for solving large-scale complex optimization issues.

The innovation of this paper lies in the improvement strategies in changing the original TLBO with two-phase teaching–learning mechanism to a new algorithm CTLBO with three-phase multiple cooperation teaching–learning mechanism, self-learning mechanism in teaching and group teaching mechanism. CTLBO has important application value in solving large-scale optimization problems.

Bat algorithm (BA) is a global optimization method, but has a worse performance on engineering optimization problems. The purpose of this study is to propose a novel chaotic bat algorithm based on catfish effect (CE-CBA), which can effectively deal with optimization problems in real-world applications.

Incorporating chaos strategy and catfish effect, the proposed algorithm can not only enhance the ability for local search but also improve the ability to escape from local optima traps. On the one hand, the performance of CE-CBA has been evaluated by a set of numerical experiment based on classical benchmark functions. On the other hand, five benchmark engineering design problems have been also used to test CE-CBA.

The statistical results of the numerical experiment show the significant improvement of CE-CBA compared with the standard algorithms and improved bat algorithms. Moreover, the feasibility and effectiveness of CE-CBA in solving engineering optimization problems are demonstrated.

This paper proposed a novel BA with two improvement strategies including chaos strategy and catfish effect for the first time. Meanwhile, the proposed algorithm can be used to solve many real-world engineering optimization problems with several decision variables and constraints.