Learn More
In this paper, a new hybrid population-based algorithm (PSOGSA) is proposed with the combination of Particle Swarm Optimization (PSO) and Gravitational Search Algorithm (GSA). The main idea is to integrate the ability of exploitation in PSO with the ability of exploration in GSA to synthesize both algorithms' strength. Some benchmark test functions are used(More)
The Gravitational Search Algorithm (GSA) is a novel heuristic optimization method based on the law of gravity and mass interactions. It has been proven that this algorithm has good ability to search for the global optimum, but it suffers from slow searching speed in the last iterations. This work proposes a hybrid of Particle Swarm Optimization (PSO) and(More)
The standard multi layer perceptron neural network (MLPNN) type has various drawbacks, one of which is training requires repeated presentation of training data, which often results in very long learning time. An alternative type of network, almost unique, is the Weightless Neural Network (WNNs) this is also called n-tuple networks or RAM based networks. In(More)
The estimation of software development effort has been centralized mostly on the accuracy of estimates through dealing with heterogeneous datasets regardless of the fact that the software projects are inherently complex and uncertain. In particular, Analogy Based Estimation (ABE), as a widely accepted estimation method, suffers a great deal from the problem(More)
Context: One of the important issues of software testing is to provide an automated test oracle. Test oracles are reliable sources of how the software under test must operate. In particular, they are used to evaluate the actual results that produced by the software. However, in order to generate an automated test oracle, oracle challenges need to be(More)
Global optimization methods play an important role to solve many real-world problems. However, the implementation of single methods is excessively preventive for high dimensionality and nonlinear problems, especially in term of the accuracy of finding best solutions and convergence speed performance. In recent years, hybrid optimization methods have shown(More)
University Course Timetabling (UCT) is a complex problem and cannot be dealt with using only a few general principles. The complicated relationships between time periods, subjects and classrooms make it difficult to obtain feasible solution. Thus, finding feasible solution for UCT is a continually challenging problem. This paper presents a hybrid particle(More)
Development effort is one of the most important metrics that must be estimated in order to design the plan of a project. The uncertainty and complexity of software projects make the process of effort estimation difficult and ambiguous. Analogy-based estimation (ABE) is the most common method in this area because it is quite straightforward and practical,(More)