this paper presents a clear monograph on the optimization of thermal instability resistance of the fg (functionally graded) flat structures. for this aim, two fg flat structures, namely an fg beam and an fg circular plate, are considered. these structures are assumed to obey the first-order shear deformation theory, three-parameters power-law distribution of the constituents, and clamped bounda...

The Large Neighborhood Search metaheuristic for solving Constrained Optimization Problems has been proved to be effective on a wide range of problems. This Local Search heuristic has the particularity of using a complete search (such as Constraint Programming) to explore the large neighborhoods obtained by relaxing a fragment of the variables of the current solution. Large Neighborhood Search h...

Given a set of elements and a symmetric matrix representing dissimilarities between them, the maximally diverse grouping problem asks to find a partitioning of the elements into a fixed number of restricted size-groups such that the sum of pairwise dissimilarities between elements in the same group is maximized. We present multistart simulated annealing, hybrid genetic and variable neighborhood...

Ant algorithms were first written about in 1991 and since then they have been applied to many problems with great success. During these years the algorithms themselves have been modified for improved performance and also been influenced by research in other fields. Since the earliest Ant algorithms, heuristics and local search have been the primary knowledge sources. This thesis asks the questi...

This paper presents a variable neighborhood search (VNS) algorithm for solving bandwidth coloring problem (BCP) and bandwidth multicoloring problem (BMCP). BCP and BMCP are generalizations of the well known vertex coloring problem and they are of a great interest from both theoretical and practical points of view. Presented VNS combines a shaking procedure which perturbs the colors for an incre...

In this paper, we propose a Particle Swarm Optimization (PSO) based solution to the Orienteering Problem. A major problem in many PSO applications is the premature convergence of some particles to local optimums. To overcome this problem in our application, such particles are re-initiated; consequently, the exploration capability of PSO is improved. Furthermore, by employing Reduced Variable Ne...

The p-Center problem consists of locating p facilities and assigning clients to them in order to minimize the maximum distance between a client and the facility to which he or she is allocated. In this paper, we present a basic Variable Neighborhood Search and two Tabu Search heuristics for the p-Center problem without the triangle inequality. Both proposed methods use the 1-interchange (or ver...

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...

In this study, we propose a robust variant of a dynamic facility location problem that arises from optimizing the emergency service network of Police Special Forces Units (PSFUs) in the Republic of Serbia. We present for the first time a mathematical programming formulation of the problem under consideration. We further propose a Variable Neighborhood Search (VNS) method with an efficient local...