Classification is an important research area in cancer diagnosis. Fuzzy C-means (FCM) is one of the most widely used fuzzy clustering algorithms in real world applications. However there are two major limitations that exist in this method. The first is that a predefined number of clusters must be given in advance. The second is that the FCM technique can get stuck in sub-optimal solutions. In o...

Over the past few years the grown global competition has enforced the manufacturing industries to upgrade their old production strategies with the modern day approaches. As a result of which, recent interest has been developed towards finding an appropriate policy that could enable them to compete with others, and facilitate them to emerge as a market winner. Keeping in mind the abovementioned ...

This paper explores the use of simulated annealing (SA) for solving arbitrary combinatorial optimisation problems. It reviews an existing code called GPSIMAN for solving 0-1 problems, and evaluates it against a commercial branch-and-bound code, OSL. The problems tested include travelling salesman, graph colouring, bin packing, quadratic assignment and generalised assignment. The paper then desc...

In the paper, we propose Tabu Search (TS) based schemes for image segmentation using Markov Random Field (MRF) model. The segmentation problem is formulated as pixel labeling problem and the MAP estimates of the labels were obtained by the two proposed TS algorithms. The TS algorithm was parallelized to improve the overall performance of the scheme. The performance of the algorithms was compare...

1. Abstract In this work we consider the problem of finding all the global maximizers of a given nonlinear optimization problem. We propose a new algorithm that combines the simulated annealing (SA) method with a function stretching technique, to generate a sequence of global maximization problems that are defined whenever a new maximizer is identified. To find the global maximizers, we apply t...

In this paper, we propose a new heuristic algorithm for three-dimensional image reconstruction from coded aperture images based on simulated annealing (SA). Since coded aperture can view an object with a large solid angle, it can provide some tomographic resolution for three-dimensional object. We propose to use a heuristic algorithm to remove the defocused artifacts and to improve the tomograp...

The Vehicle Routing Problem with Time Windows (VRPTW) is an important problem occurring in many logistics systems. The objective of VRPTW is to serve a set of customers within their predefined time windows at minimum cost. Ant Colony System algorithm (ACS) that is capable of searching multiple search areas simultaneously in the solution space is good in diversification. On the other hand, Simul...

This paper presents a novel hybrid evolutionary algorithm that combines Particle Swarm Optimization (PSO) and Simulated Annealing (SA) algorithms. When a local optimal solution is reached with PSO, all particles gather around it, and escaping from this local optima becomes difficult . To avoid premature convergence of PSO, we present a new hybrid evolutionary algorithm, called PSOSA, based on t...

In previous work solutions for the nesting problem are produced using the no fit polygon (NFP), a new evaluation method and three evolutionary algorithms (simulated annealing (SA), tabu search (TS) and genetic algorithms (GA)). Tabu search has been shown to produce the best quality solutions for two problems. In this paper this work is developed. A relatively new type of search algorithm (ant a...

We developed minimal perfect hash functions for a variety of datasets using the probabilistic process of simulated annealing (SA). The SA solution structure is a tree representing an annealed program (algorithm). This solution structure is similar to the structure used in genetic programming. When executed, the SA program produces multiple hash functions for the given data set. An initial hash ...