Backcalculation Analysis of Pavement-Layer Moduli Using Genetic Algorithms

1997 ◽  
Vol 1570 (1) ◽  
pp. 134-142 ◽  
Author(s):  
T. F. Fwa ◽  
C. Y. Tan ◽  
W. T. Chan

Most existing iterative backcalculation programs for pavement layer moduli arrive at their solutions by minimizing an objective function related to the differences between computed and measured surface deflections. Unfortunately, the solution surface of the backcalculation problem of pavement-layer moduli is known to contain many local minima. A potentially good backcalculation procedure would be one that has a strong global search ability to overcome the problem of local minima. The genetic algorithm (GA) is a technique that satisfies this requirement. The development of a backcalculation program known as NUS-GABACK using the genetic-algorithm approach is presented, along with the formulation and operations of the program. A detailed performance evaluation of the GA-based method is made against four other programs by solving five backcalculation problems with different structural composition. It was found that NUS-GABACK performed comparably well against the other programs and demonstrated consistency in the accuracies of backcalculated moduli.

2007 ◽  
Vol 06 (02) ◽  
pp. 115-128
Author(s):  
SEYED MAHDI HOMAYOUNI ◽  
TANG SAI HONG ◽  
NAPSIAH ISMAIL

Genetic distributed fuzzy (GDF) controllers are proposed for multi-part-type production line. These production systems can produce more than one part type. For these systems, "production rate" and "priority of production" for each part type is determined by production controllers. The GDF controllers have already been applied to single-part-type production systems. The methodology is illustrated and evaluated using a two-part-type production line. For these controllers, genetic algorithm (GA) is used to tune the membership functions (MFs) of GDF. The objective function of the GDF controllers minimizes the surplus level in production line. The results show that GDF controllers can improve the performance of production systems. GDF controllers show their abilities in reducing the backlog level. In production systems in which the backlog has a high penalty or is not allowed, the implementation of GDF controllers is advisable.


Author(s):  
Ade chandra Saputra

One of the weakness in backpropagation Artificial neural network(ANN) is being stuck in local minima. Learning rate parameter is an important parameter in order to determine how fast the ANN Learning. This research is conducted to determine a method of finding the value of learning rate parameter using a genetic algorithm when neural network learning stops and the error value is not reached the stopping criteria or has not reached the convergence. Genetic algorithm is used to determine the value of learning rate used is based on the calculation of the fitness function with the input of the ANN weights, gradient error, and bias. The calculation of the fitness function will produce an error value of each learning rate which represents each candidate solutions or individual genetic algorithms. Each individual is determined by sum of squared error value. One with the smallest SSE is the best individual. The value of learning rate has chosen will be used to continue learning so that it can lower the value of the error or speed up the learning towards convergence. The final result of this study is to provide a new solution to resolve the problem in the backpropagation learning that often have problems in determining the learning parameters. These results indicate that the method of genetic algorithms can provide a solution for backpropagation learning in order to decrease the value of SSE when learning of ANN has been static in large error conditions, or stuck in local minima


2010 ◽  
Vol 163-167 ◽  
pp. 2365-2368 ◽  
Author(s):  
Shu Ling Qiao ◽  
Zhi Jun Han

In this paper, determinate beam and indeterminate beam with multiple span are optimized by using genetic algorithm, the mathematic model of optimize beam is built and the processing method of constraint conditions is given. The examples show that the algorithm could be used for optimizing determinate structure, and also optimizing indeterminate structure. Compared to the linear approximation method, genetic algorithm has advantages of being simple, easy, fast convergence and has no use for changing the objective function and constraint conditions to linearity or other processing. Its results agree with linear approximation method’s. It is the other method that can be adopt in engineering field.


Proceedings ◽  
2019 ◽  
Vol 46 (1) ◽  
pp. 18
Author(s):  
Habib Izadkhah ◽  
Mahjoubeh Tajgardan

Software clustering is usually used for program comprehension. Since it is considered to be the most crucial NP-complete problem, several genetic algorithms have been proposed to solve this problem. In the literature, there exist some objective functions (i.e., fitness functions) which are used by genetic algorithms for clustering. These objective functions determine the quality of each clustering obtained in the evolutionary process of the genetic algorithm in terms of cohesion and coupling. The major drawbacks of these objective functions are the inability to (1) consider utility artifacts, and (2) to apply to another software graph such as artifact feature dependency graph. To overcome the existing objective functions’ limitations, this paper presents a new objective function. The new objective function is based on information theory, aiming to produce a clustering in which information loss is minimized. For applying the new proposed objective function, we have developed a genetic algorithm aiming to maximize the proposed objective function. The proposed genetic algorithm, named ILOF, has been compared to that of some other well-known genetic algorithms. The results obtained confirm the high performance of the proposed algorithm in solving nine software systems. The performance achieved is quite satisfactory and promising for the tested benchmarks.


2011 ◽  
Vol 480-481 ◽  
pp. 1055-1060
Author(s):  
Guang Hua Wu ◽  
Lie Hang Gong ◽  
Xin Wei Ji ◽  
Zhong Jun Wu ◽  
Yong Jun Gai

The methodology of the optimal design for the 6-UPU parallel mechanism (PM) is presented based on genetic algorithms. The optimal index which expressed by Jacobian matrix of the PM is first deduced. An optimal model is established, in which the kinematic dexterity of a parallel mechanism is considered as the objective function. The design space, the limiting length of the electric actuators and the limit angles of universal joints are taken as constraints. The real-encoding genetic algorithm is applied to the optimal design of a parallel mechanism, which is proved the validity and advantage for the optimal design of a similar mechanism.


2012 ◽  
Vol 2012 ◽  
pp. 1-7 ◽  
Author(s):  
Rutuparna Panda ◽  
Manoj Kumar Naik

This paper presents a modified bacterial foraging optimization algorithm called crossover bacterial foraging optimization algorithm, which inherits the crossover technique of genetic algorithm. This can be used for improvising the evaluation of optimal objective function values. The idea of using crossover mechanism is to search nearby locations by offspring (50 percent of bacteria), because they are randomly produced at different locations. In the traditional bacterial foraging optimization algorithm, search starts from the same locations (50 percent of bacteria are replicated) which is not desirable. Seven different benchmark functions are considered for performance evaluation. Also, comparison with the results of previous methods is presented to reveal the effectiveness of the proposed algorithm.


Author(s):  
Tessy Badriyah

K-Means is one of the major algorithms widely used in clustering due to its good computational performance. However, K-Means is very sensitive to the initially selected points which randomly selected, and therefore it does not always generate optimum solutions. Genetic algorithm approach can be applied to solve this problem. In this research we examine the potential of applying hybrid GA- KMeans with focus on the area of health care data. We proposed a new technique using hybrid method combining KMeans Clustering and Genetic Algorithms, called the “Hybrid K-Means Genetic Algorithms” (HKGA). HKGA combines the power of Genetic Algorithms and the efficiency of K-Means Clustering. We compare our results with other conventional algorithms and also with other published research as well. Our results demonstrate that the HKGA achieves very good results and in some cases superior to other methods.Keywords: Machine Learning, K-Means, Genetic Algorithms, Hybrid KMeans Genetic Algorithm (HGKA).


2014 ◽  
Vol 17 (11) ◽  
pp. 1669-1679 ◽  
Author(s):  
Shirko Faroughi ◽  
Mehdi Abdollahi Kamran ◽  
Jaehong Lee

This paper presents a novel and versatile method for finding 2-D tensegrity structures form finding. Using this method, different possibilities for the geometry of 2-D tensegrity structures can be found with little information about the structure. As opposed to most existing procedures this method only needs the number of each member prototype, the number of tensegrity nodes and connectivity at each node to be known. The form finding is done by minimizing objective function, which considers the rank deficiencies of the geometry, the prestress coefficients and the semi-positive definite condition of the stiffness matrix. Genetic algorithm as the global search is taken into account first for generating the connectivity matrix, initial prestress coefficients and also minimizing the objective function. Several numerical examples are given to demonstrate the competence and robustness of the current study in searching new different possibility self-equilibrium configuration of tensegrity structures.


2019 ◽  
Vol 14 (2) ◽  
pp. 521-558 ◽  
Author(s):  
Amir Hossein Hosseinian ◽  
Vahid Baradaran ◽  
Mahdi Bashiri

Purpose The purpose of this paper is to propose a new mixed-integer formulation for the time-dependent multi-skilled resource-constrained project scheduling problem (MSRCPSP/t) considering learning effect. The proposed model extends the basic form of the MSRCPSP by three concepts: workforces have different efficiencies, it is possible for workforces to improve their efficiencies by learning from more efficient workers and the availability of workforces and resource requests of activities are time-dependent. To spread dexterity from more efficient workforces to others, this study has integrated the concept of diffusion maximization in social networks into the proposed model. In this respect, the diffusion of dexterity is formulated based on the linear threshold model for a network of workforces who share common skills. The proposed model is bi-objective, aiming to minimize make-span and total costs of project, simultaneously. Design/methodology/approach The MSRCPSP is an non-deterministic polynomial-time hard (NP-hard) problem in the strong sense. Therefore, an improved version of the non-dominated sorting genetic algorithm II (IM-NSGA-II) is developed to optimize the make-span and total costs of project, concurrently. For the proposed algorithm, this paper has designed new genetic operators that help to spread dexterity among workforces. To validate the solutions obtained by the IM-NSGA-II, four other evolutionary algorithms – the classical NSGA-II, non-dominated ranked genetic algorithm, Pareto envelope-based selection algorithm II and strength Pareto evolutionary algorithm II – are used. All algorithms are calibrated via the Taguchi method. Findings Comprehensive numerical tests are conducted to evaluate the performance of the IM-NSGA-II in comparison with the other four methods in terms of convergence, diversity and computational time. The computational results reveal that the IM-NSGA-II outperforms the other methods in terms of most of the metrics. Besides, a sensitivity analysis is implemented to investigate the impact of learning on objective function values. The outputs show the significant impact of learning on objective function values. Practical implications The proposed model and algorithm can be used for scheduling activities of small- and large-size real-world projects. Originality/value Based on the previous studies reviewed in this paper, one of the research gaps is the MSRCPSP with time-dependent resource capacities and requests. Therefore, this paper proposes a multi-objective model for the MSRCPSP with time-dependent resource profiles. Besides, the evaluation of learning effect on efficiency of workforces has not been studied sufficiently in the literature. In this study, the effect of learning on efficiency of workforces has been considered. In the scarce number of proposed models with learning effect, the researchers have assumed that the efficiency of workforces increases as they spend more time on performing a skill. To the best of the authors’ knowledge, the effect of learning from more efficient co-workers has not been studied in the literature of the RCPSP. Therefore, in this research, the effect of learning from more efficient co-workers has been investigated. In addition, a modified version of the NSGA-II algorithm is developed to solve the model.


2008 ◽  
Vol 48 ◽  
Author(s):  
Dmitrij Šešok

In this paper two strategies of optimization are compared: sequential and synchronous topology and shape optimization of trusses. Genetic algorithms are used for optimization. A task of optimization of truss withtwelve possible nodes is solved. Finite elements method is used to calculate an objective function value. Software used in calculations was created by the author.


Sign in / Sign up

Export Citation Format

Share Document