In [6] solutions for the nesting problem are produced using the No Fit Polygon (NFP), simulated annealing (SA) and a new evaluation method. It showed that SA could out perform hill climbing, thus suggesting that evolutionary approaches produce better solutions than a standard search algorithm. In this paper this work is developed. Genetic algorithms (GA) and tabu search (TS) are compared with t...

In this paper, we investigate and compare, through extensive simulation, the use of three meta-heuristic algorithms in order to find ‘‘good’’ feasible solutions for the global topology planning problem of universal mobile telecommunications system (UMTS) networks. The latter has been shown to be NP-hard as it is composed of three different subproblems (each one being NP-hard): the cell planning...

Singapore Management University, 469 Buki t T imah Road Singapore 259756 [email protected] Fei X iao School of Comput ing National University of Singapore 3 Science Drive 2 Singapore 117543 [email protected] We propose a Node Centroid method with Hil lClimbing to solve the well-known matrix bandwidth minimization problem, which is to permute rows and columns of the matrix to minimize its band...

Virtualization is widely used owing to its advantages, such as flexibility, scalability, and cost reduction. One important advantage is the decrease in power consumption, which is obtained by concentrating virtual machines (VMs) into a fewer physical machines (PMs). This is done by optimally placing VMs to their hosts. This placement problem is an intractable combinatorial optimization problem....

The dynamic space allocation problem (DSAP) presented here is a relatively new problem in the literature. It looks at the optimization of space/resource assignments during the implementation of project activities. More specifically, the DSAP assigns project activities and their required resources to workspaces and idle resources to storage spaces with respect to minimizing the sum of the distan...

Fuzzy controllers are represented by if-then rules and thus can provide a user friendly and understandable knowledge representation. Evolutionary algorithms have been widely used for optimal design of fuzzy controllers. In this paper, we first present the state-of-art adaptive fuzzy control design using evolutionary algorithms and then attempt to enhance the performance of the simple genetic se...

Parallel implementations of metaheuristics appear quite naturally as an effective alternative to speed up the search for approximate solutions of combinatorial optimization problems. They not only allow solving larger problems or finding improved solutions with respect to their sequential counterparts, but they also lead to more robust algorithms. We review some trends in parallel computing and...

Search techniques such as Genetic Algorithms, Simulated Annealing, Tabu Search and Random Walk Algorithms have been used extensively for global optimization. This paper presents an experimental analysis of the performance of these algorithms for the problem of selecting the optimal location of base stations in a mobile communication system. The effect of varying the value of important parameter...

In order to deliver a complete reliable software product, testing is performed. As testing phase carries on, cost of testing process increases and it directly affects the overall project cost. Many a times it happens that the actual cost becomes more than the estimated cost. Cost is considered as the most important parameter with respect to software testing, in software industry. In recent year...

The purpose of this work is that of presenting a version of the Reactive Tabu Search method (RTS) that is suitable for constrained problems, and that of testing RTS on a series of constrained and unconstrained Combinatorial Optimization tasks. The benchmark suite consists of many instances of the N-K model and of the Multiknapsack problem with various sizes and diiculties, deened with portable ...