This paper provides an overview of the author’s Ph.D. thesis [8]. The primary contribution of this research involved developing techniques to extract architectural information about a system directly from its source code. To accomplish this objective a series of software clustering algorithms were developed. These algorithms use metaheuristic search techniques to partition a directed graph gene...

Abstract Metaheuristic optimization algorithms (MOAs) are computational randomized search processes which draw inspiration from physical and biological phenomena, with an application spectrum that extends to numerous fields, ranging engineering design economics. MOAs were originally developed for solving unconstrained NP-complete problems, hence their constrained problems (COPs) requires the im...

The intelligent water drop algorithm is a swarm-based metaheuristic algorithm, inspired by the characteristics of water drops in the river and the environmental changes resulting from the action of the flowing river. Since its appearance as an alternative stochastic optimization method, the algorithm has found applications in solving a wide range of combinatorial and functional optimization pro...

0377-2217/$ see front matter 2010 Elsevier B.V. A doi:10.1016/j.ejor.2010.01.035 * Corresponding author. Tel.: +39 51 2093028; fax: E-mail addresses: [email protected] (Z. Na (P. Toth), [email protected] (L. Galli). In this paper we propose a new heuristic algorithm to solve the unicost version of the well-known set covering problem. The method is based on the electromagnetism metaheuris...

In a distributed services oriented environment, having a myriad of functionally equivalent services, Quality of Service(QoS) emerges as the key differential factor. In this scenario organizations can dynamically select partners for their core business processes expressed as Composite Web Services (CWS). As a consequence, QoS-aware composition should drive an effective selection by optimizing di...

The capacitated p-median problem (CPMP) seeks to obtain the optimal location of p medians considering distances and capacities for the services to be given by each median. This paper presents an efficient hybrid metaheuristic algorithm by combining a proposed cutting-plane neighborhood structure and a tabu search metaheuristic for the CPMP. In the proposed neighborhood structure to move from th...

Regression testing is a very expensive and time consuming process as there may be insufficient resources to re-execute all the test cases in resource and time constrained environment. It acquires a lot of human effort, if done manually. Lot of techniques have been reported on how to select regression tests so that the number of test cases do not boast up too high as the software evolves. The te...

This paper proposes a way to combine the Mesh Adaptive Direct Search (MADS) algorithm, which extends the Generalized Pattern Search (GPS) algorithm, with the Variable Neighborhood Search (VNS) metaheuristic, for nonsmooth constrained optimization. The resulting algorithm retains the convergence properties of MADS, and allows the far reaching exploration features of VNS to move away from local s...