In recent years, cloud computing has provided a Software As A Service (SaaS) platform where the software can be reused and applied to fulfill complicated user demands according specific Quality of Services (QoS) constraints. The requirements are formulated as workflow consisting set tasks. However, many services may satisfy functionality each task; thus, searching for composition optimal servic...

conclusions there are few studies on the prevalence of viral hepatitis in the general population of iran. most of the reports are from specific groups of patients. further epidemiologic studies on the general population of iran are recommended to discover the real burden of viral hepatitis. context viral hepatitis is still considered as a major health concern. defining the extent of the burden ...

Artificial Bee Colony algorithm is a global optimization algorithm which is motivated by the foraging behavior of honey bee swarms. Basic Artificial Bee Colony algorithm (ABC) has the advantages of strong robustness, fast convergence and high flexibility, fewer setting parameters, but it has the disadvantages premature convergence in the later search period and the accuracy of the optimal value...

In this paper, a novel hybrid optimization algorithm, which combines a firefly algorithms and Artificial Bee Colony algorithm (FFAABC), is proposed for solving the economic power dispatch (EPD) problem. The hybrid algorithm is structured with two stages. The first stage uses the search by firefly algorithm (FFA) and second stage is a search with Artificial Bee Colony algorithm (ABC). The hybrid...

The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...

The job shop scheduling problem (JSSP) is an NP-hard problem of wide engineering and theoretical background. In this paper, a discrete artificial bee colony based memetic algorithm, named DABC, is proposed for solving JSSP. Firstly, to make artificial bee colony (ABC) suitable for solving JSSP, we present a food source as a discrete job permutation and use the discrete operation to generate a n...

Search-based optimization techniques (e.g., hill climbing, simulated annealing, and genetic algorithms) have been applied to a wide variety of software engineering activities including cost estimation, next release problem, and test generation. Several search based test generation techniques have been developed. These techniques had focused on finding suites of test data to satisfy a number of ...

Proctor assignment refers to assigning proctors to examinations with the objective of having the appropriate number of proctors assigned to examinations, subject to conditions such as minimizing the load of proctoring and preventing any conflicting assignments. This problem is intractable, and hence, heuristics algorithms are needed to find good solutions. In this paper, we propose a new soluti...