This paper presents an application of a hierarchical social (HS) metaheuristic to region-based segmentation. The original image is modelled as a simplified image graph, which is successively partitioned into two regions, corresponding to the most significant components of the actual image, until a termination condition is met. The graph-partitioning task is solved as a variant of the min-cut pr...

We study the Partition Coloring Problem (PCP), a generalization of the Vertex Coloring Problem where the vertex set is partitioned. The PCP asks to select one vertex for each subset of the partition in such a way that the chromatic number of the induced graph is minimum. We propose a new Integer Linear Programming formulation with an exponential number of variables. To solve this formulation to...

In this paper on which work done is nature inspired algorithm named Bat algorithm. nature is good source for inspiration in life in different way. Even in many search, nature gives good example for optimization many complex problems in engineering fields. Bat algorithm is metaheuristic algorithm like particle swarm, firefly. This paper formulates on echolocation behavior to reduce the crosstalk...

The efficiency of any metaheuristic algorithm largely depends on the way of balancing local intensive exploitation and global diverse exploration. Studies show that bat algorithm can provide a good balance between these two key components with superior efficiency. In this paper, we first review some commonly used metaheuristic algorithms, and then compare the performance of bat algorithm with t...

This paper presents an object-oriented software system that implements a cuckoo search (CS) metaheuristic for unconstrained optimization problems. Yang and Deb developed cuckoo search algorithm in MATLAB and tested it on some standard benchmark functions as well as on some engineering optimization problems where it showed promising results. We developed our algorithm in JAVA programming languag...

In this paper we use a recently proposed metaheuristic, the Ant System, to solve the Vehicle Routing Problem (VRP) in its basic form, i.e. with capacity and distance restrictions, one central depot and identical vehicles. A \hybrid" Ant System algorithm is rst presented and then improved using problem speciic information (savings, capacity utilization). Experiments on various aspects of the alg...

In this work, we present a methodology to minimize the number of potential conflicts between aircraft trajectories based on route-slot allocation techniques. The traffic assignment problem is modeled as a combinatorial optimization problem for which two metaheuristic optimization algorithms are developed and implemented. The first algorithm relies on a standard simulated annealing, while the se...

The capacitated p-median problem (CPMP) seeks to obtain the optimal location of p medians considering distances and capacities for the services to be given by each median. This paper presents an efficient hybrid metaheuristic algorithm by combining a proposed cutting-plane neighborhood structure and a tabu search metaheuristic for the CPMP. In the proposed neighborhood structure to move from th...

This study proposes a new single-solution based metaheuristic, namely the Vortex Search algorithm (VS), for fuzzy clustering of ECG beats. The newly proposed metaheuristic is quite simple and highly competitive when compared to the population-based metaheuristics. In order to study the performance of the proposed method a number of experiments are performed over a dataset which is created by us...

Integrated production-distribution planning (PDP) is one of the most important approaches in supply chain networks. We consider a supply chain network (SCN) consististing of multi suppliers, plants, distribution centers (DCs), and retailers. A bi-objective mixed integer linear programming model for integrating production-distribution designed here aim to simultaneously minimize total net costs ...