Software testing is an important stage in the software development process, which key to ensure quality and improve reliability. fault localization most part of testing. In this paper, problem modeled as a combinatorial optimization problem, using function call path starting point. A heuristic search algorithm based on hybrid genetic simulated annealing used locate defects. Experimental results...

Load Balancing is an important factor handling resource during running and execution time in real applications. Virtual machines are used for dynamically access share the resources. As per current scenario cloud computing played major storage, accessing, pooling internet based service offering. Usage of services increased such as online shopping, education, ticketing, etc. Many users can use re...

For the problem of cloud service selection, this paper gives a hybrid algorithm. The hybrid algorithm is composed mainly by Simplex Method and Genetic Algorithm. In this algorithm, a tree traversal sequence encoding scheme and some Simplex Method operations are proposed. The design of the tree traversal sequence encoding can support various types of service combinations. In addition, the hybrid...

In this paper, the flow-shop scheduling problem with unrelated parallel machines at each stage as well as sequence-dependent setup times under minimization of the sum of earliness and tardiness are studied. The processing times, setup times and due-dates are known in advance. To solve the problem, we introduce a hybrid memetic algorithm as well as a particle swarm optimization algorithm combine...

since crosses of lines with suitable genetic distance produce excellent hybrids, the identification of genetic diversity between zea mays l. inbred lines in hybrid maize breeding programs has a high priority. a total of 27 inbred lines plus b73 and mo17 (sc704 parents) were evaluated by 15 inter-simple sequence repeat (issr) primers. inbreds were selected randomly from inbred lines from the agr...

This paper presents a packing algorithm to solve an irregular shape strip packing problem. The polygons are packed in strip material, which limits a bin width but not limits a bin length. The objective of a packing algorithm is to minimize a bin length. This paper proposes a hybrid method of genetic algorithms and tabu search to solve a packing problem. Initially, a hybrid method behaves like r...