Scatter Search in software testing, comparison and collaboration with Estimation of Distribution Algorithms

Sagarna, Ramón; Lozano, José A.

doi:10.1016/j.ejor.2004.08.006

Cited by 45 publications

(39 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…We show in the same table the results of our (5+1)-ES, the best in coverage percentage. If we focus on the coverage of the Table 7 our (5+1)-ES has the best behavior at the same time as the algorithms of [7,14,15]. Comparing the number of evaluations we find the best (lowest) value in the work of Sagarna and Lozano [14] followed by our (5+1)-ES.…”

Section: Previous Resultsmentioning

confidence: 83%

“…In spite of all the previous considerations we include in Table 7 the best average coverage results reported for the triangle classifier algorithm in [2,7,14,15] and their needed number of evaluations (program tests). We show in the same table the results of our (5+1)-ES, the best in coverage percentage.…”

Section: Previous Resultsmentioning

confidence: 99%

“…We use the average condition-decision coverage and a corrected coverage to measure the quality of the solutions. In [7,14,15] the authors report only on the branch coverage. On the other hand, the coverage measurement used in [2] is obtained by using a proprietary software: DeepCover.…”

Section: Previous Resultsmentioning

confidence: 99%

“…In [13] the authors explain how a Tabu Search algorithm can be applied to generate test data obtaining maximum branch coverage. Sagarna and Lozano tackle the problem by using an Estimation of Distribution Algorithm (EDA) in [14] and they compare a Scatter Search (SS) with EDAs in [15].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Software Testing with Evolutionary Strategies

Alba

Chicano

2006

Rapid Integration of Software Engineering Techniques

View full text Add to dashboard Cite

Abstract. This paper applies the Evolutionary Strategy (ES) metaheuristic to the automatic test data generation problem. The problem consists in creating automatically a set of input data to test a program. This is a required step in software development and a time consuming task in all software companies. We describe our proposal and study the influence of some parameters of the algorithm in the results. We use a benchmark of eleven programs that includes fundamental algorithms in computer science. Finally, we compare our ES with a Genetic Algorithm (GA), a well-known algorithm in this domain. The results show that the ES obtains in general better results than the GA for the benchmark used.

show abstract

Section: Previous Resultsmentioning

confidence: 83%

Section: Previous Resultsmentioning

confidence: 99%

Section: Previous Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Software Testing with Evolutionary Strategies

Alba

Chicano

2006

Rapid Integration of Software Engineering Techniques

View full text Add to dashboard Cite

show abstract

“…Şekil 3: Dağınık Arama Süreci (Sagarna ve Lozano, 2006) Aramanın durumuna bağlı olarak referans kümesinin nasıl güncelleneceği stratejini içeren DA meta sezgiseli, aynı zamanda referans kümesinin ne zaman değişmeyeceğini ve yeni çözümler üreterek aramayı farklılaştırması gerektiğini bilmelidir (Perez vd.,2005). Arama prosedürünün sonlanma kriterine bağlı olarak DA, referans kümesindeki iyi ve uygun çözümleri sağlamış olur (El-Sayed vd., 2008).…”

Section: şEkilunclassified

Permütasyon Akış Tipi Çizelgeleme Probleminin Dağınık Arama İle Optimizasyonu

Bozkurt¹,

Çiçekli²

2018

eab

View full text Add to dashboard Cite

Scheduling is one of the decision-making processes that play a critical role in the production and service industries. Flow job scheduling is one of the types of scheduling where "n" job can be processed at "m" machines consequently. When the complexity of this problem increases, obtaining the optimum solution becomes difficult. But, solution can be found near the optimum in these complex problems by using the scatter search which is one of the meta heuristics. Scatter search method which is a branch of the evolutionary approach is an advantageous optimization technique due to producing two or more solution. In this study, the new model is developed for optimizing the permutation flowshop scheduling problem by scatter search.

show abstract

A hybrid Univariate Marginal Distribution Algorithm for dynamic economic dispatch of units considering valve-point effects and ramp rates

Zhang

2013

Int. Trans. Electr. Energ. Syst.

View full text Add to dashboard Cite

Summary This paper presents a new approach for dynamic economic dispatch (DED) problem in power system by using a hybrid Univariate Marginal Distribution Algorithm (HUMDA). The DED problem with valve‐point effects and ramp rate limits is a nonliner constrained optimization problem with non‐convex and non‐smooth characteristics. In the proposed method, a two‐stage adaptive mechanism is devised to control parameters of the Univariate Marginal Distribution Algorithm in continuous domains (UMDAc) dynamically and lead the algorithm with better search efficiency; a chaotic local search operator is integrated with UMDAc to effectively avoid premature convergence. Moreover, a constraint handle according to the two‐stage adaptive mechanism is proposed, and the results show that the strategy can handle constraints effectively. Finally, the efficiency of the proposed method is validated on two test systems consisting of 5, 10 and 30 thermal units. The results show the superiority of the proposed method while it is compared with other works in the area. Copyright © 2013 John Wiley & Sons, Ltd.

show abstract

Scatter Search in software testing, comparison and collaboration with Estimation of Distribution Algorithms

Cited by 45 publications

References 27 publications

Software Testing with Evolutionary Strategies

Software Testing with Evolutionary Strategies

Permütasyon Akış Tipi Çizelgeleme Probleminin Dağınık Arama İle Optimizasyonu

A hybrid Univariate Marginal Distribution Algorithm for dynamic economic dispatch of units considering valve-point effects and ramp rates

Contact Info

Product

Resources

About