The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the ...

Support Vector Machines are considered to be excellent patterns classification techniques. The process of classifying a pattern with high classification accuracy counts mainly on tuning Support Vector Machine parameters which are the generalization error parameter and the kernel function parameter. Tuning these parameters is a complex process and Ant Colony Optimization can be used to overcome ...

The first ant colony optimization (ACO) called ant system was inspired through studying of the behavior of ants in 1991 by Macro Dorigo and co-workers [1]. An ant colony is highly organized, in which one interacting with others through pheromone in perfect harmony. Optimization problems can be solved through simulating ant’s behaviors. Since the first ant system algorithm was proposed, there is...

Abstract In this paper, multi-objective optimization (MOO) of Al2O3-water nanofluid flow in microchannel heat sinks (MCHS) with triangular ribs is performed using Computational Fluid Dynamics (CFD) techniques and Non-dominated Sorting Genetic Algorithms (NSGA II). At first, nanofluid flow is solved numerically in various MCHS with triangular ribs using CFD techniques. Finally, the CFD data will...

....... An important problem in the realm of evolutionary multi-objective optimization (MOO) is that of finding all non-dominated fronts (NDFs). We specifically address the computational efficiency of the non-dominated sorting algorithm for finding the non-dominated fronts for the non-dominated sorting genetic algorithm II (NSGA-II) algorithm. We introduce the Limiting Index Sort (LIS) algorith...

This paper presents a method of optimized PID parameter self-adapted ant colony algorithm with aberrance gene, based on ant colony algorithm. This method overcomes genetic algorithm’s defects of repeated iteration, slower solving efficiency, ordinary ant colony algorithm’s defects of slow convergence speed, easy to get stagnate, and low ability of full search. For a given system, the results of...

Processes that simulate natural phenomena have successfully been applied to a number of problems for which no simple mathematical solution is known or is practicable. Such meta-heuristic algorithms include genetic algorithms, particle swarm optimization and ant colony systems and have received increasing attention in recent years. This paper extends ant colony systems and discusses a novel data...

A novel version of Ant Colony Optimization (ACO) algorithms for solving continuous space problems is presented in this paper. The basic structure and concepts of the originally reported ACO are preserved and adaptation of the algorithm to the case of continuous space is implemented within the general framework. The stigmergic communication is simulated through considering certain direction vect...

This paper presents a particle swarm ant colony optimization for design of truss structures. The algorithm is based on the particle swarm optimizer with passive congregation and ant colony optimization. The particle swarm ant colony optimization applies the particle swarm optimizer with passive congregation for global optimization and ant colony approach is employed to update positions of parti...

One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...