Sharif Digital Repository

In this paper, we propose a hybrid algorithm including Genetic Algorithm (GA), Ant Colony Optimisation (ACO), and Simulated Annealing (SA) metaheuristics for increasing the contrast of images. In this way, contrast enhancement is obtained by global transformation of the input intensities. Ant colony optimisation is used to generate the transfer functions which map the input intensities to the output intensities. Simulated annealing as a local search method is utilised to modify the transfer functions generated by ant colony optimisation. And genetic algorithm has the responsibility of evolutionary process of antsE characteristics. The employed fitness function operates automatically and... 

Bayesian regularised genetic neural network (BRGNN) has been used for modelling the inhibition activity of 141 biphenylalanine derivatives as integrin antagonists. Three local pattern search (PS) methods, simulated annealing and threshold acceptance were combined with BRGNN in the form of a hybrid genetic algorithm (HGA). The results obtained revealed that PS is a suitable method for improving the ability of BRGNN to break out from the local minima. The proposed HGA technique is able to retrieve important variables from complex systems and nonlinear search spaces for optimisation. Two models with 8-3-1 artificial neural network (ANN) architectures were developed for describingα 4β 7 and α 4β... 

In this article, scheduling and rescheduling problems with increasing processing time and new job insertion are studied for reprocessing problems in the remanufacturing process. To handle the unpredictability of reprocessing time, an experience-based strategy is used. Rescheduling strategies are applied for considering the effect of increasing reprocessing time and the new subassembly insertion. To optimize the scheduling and rescheduling objective, a discrete harmony search (DHS) algorithm is proposed. To speed up the convergence rate, a local search method is designed. The DHS is applied to two real-life cases for minimizing the maximum completion time and the mean of earliness and... 

Given a triangulation of a point set on the plane, dilation of any pair of the points is the ratio of their shortest path length to their Euclidean distance. The maximum dilation over all pairs of points is called the dilation of this triangulation. Minimum dilation triangulation problem seeks a triangulation with the least possible dilation of an input point set. For this problem no polynomial time algorithm is known. We present an exact algorithm based on a branch and bound method for finding minimum dilation triangulations. This deterministic algorithm after generating an initial solution, iteratively computes a lower bound for the answer and then applies a branch and bound method to find... 

In this article, scheduling and rescheduling problems with increasing processing time and new job insertion are studied for reprocessing problems in the remanufacturing process. To handle the unpredictability of reprocessing time, an experience-based strategy is used. Rescheduling strategies are applied for considering the effect of increasing reprocessing time and the new subassembly insertion. To optimize the scheduling and rescheduling objective, a discrete harmony search (DHS) algorithm is proposed. To speed up the convergence rate, a local search method is designed. The DHS is applied to two real-life cases for minimizing the maximum completion time and the mean of earliness and... 

We introduce a multimode resource-constrained project scheduling problem with finish-to-start precedence relations among project activities, considering renewable and nonrenewable resource costs. We assume that renewable resources are rented and are not available in all periods of time of the project. In other words, there is a mandated ready date as well as a due date for each renewable resource type so that no resource is used before its ready date. However, the resources are permitted to be used after their due dates by paying penalty costs. The objective is to minimize the total costs of both renewable and nonrenewable resource usage. This problem is called multimode resource-constrained... 

In this paper, we propose a hybrid algorithm including Genetic Algorithm (GA), Ant Colony Optimization (ACO), and Simulated Annealing (SA) metaheuristics for increasing the contrast of images. In this way, the contrast enhancement is obtained by globally transformation of the input intensities. ACO is used to generate the transfer functions which map the input intensities to the output intensities. SA as a local search method is utilized to modify the transfer functions generated by ACO. GA has the responsibility of evolutionary process of ants' characteristics. The results indicate that the new method performs better than the previously presented methods from the subjective and objective...