An improved genetic algorithm for the dynamic layout problem, based on a paper that was published in this journal, is formulated and tested in this research. Our genetic algorithm differs from the existing implementation in three ways: first, we adopt a different crossover operator, second, we use mutation, and third, we use a new generational replacement strategy to help increase population di...

A new dynamic friction model for modeling of elliptical vibration assisted turning (EVAT) was developed in this research. The periodic change of the friction force direction is known to be one of the most important causes of this phenomenon. In modeling of machining processes (including the EVAT process), static Coulomb friction model was employed by most of the researchers. Because of the peri...

In multi-component systems, the components are dependent, rather than degenerating independently, leading to changes in maintenance schedules. this situation, study proposes a grouping dynamic strategy. Considering structure of strategy is determined according importance components. The can minimize expected depreciation cost system and divide into optimal groups that meet economic requirements...

The article presents a proposed customized genetic algorithm (CGA) to find the Pareto frontier for bi-objective integer linear programming (ILP) model of routing in dynamic network, where number nodes and edge weights vary over time. Utilizing hybrid method, CGA combines with (DP); it is fast alternative an ILP solver finding efficient solutions, particularly large dimensions. A non-dominated s...

Abstract A genetic algorithm is a biologically inspired stochastic approach to finding solutions optimization problems. However, unlike its deterministic counterpart, it cannot guarantee globally optimal solution since may be trapped within local optimum of the search space. Most researchers have focused on proposing new techniques for various parameters algorithms. That mutation, crossover, or...