Vehicle Routing Problem (VRP) is a real life constraint satisfaction problem to find minimal travel distances of vehicles to serve customers. Capacitated VRP (CVRP) is the simplest form of VRP considering vehicle capacity constraint. Constructive and clustering are the two popular approaches to solve CVRP. A constructive approach creates routes and attempts to minimize the cost at the same time...

Clustering is one of the most commonly techniques in Data Mining. Kmeans is one of the most popular clustering techniques due to its simplicity and efficiency. However, it is sensitive to initialization and easily trapped in local optima. K-harmonic means clustering solves the problem of initialization using a built-in boosting function, but it is suffering from running into local optima. Parti...

Graph clustering is a difficult optimization problem that arises in Software Engineering. This paper presents a framework for graph clustering where users play a strong role. In the framework, a soft computing method produces a clustering of the graph and a visualization of it is provided using some graph drawing techniques. Through the visualization the user can then analyze the clustering and...

Unsupervised fuzzy clustering algorithms are one of many approaches used in image segmentation. The Fuzzy C-means algorithm (FCM) and the Possibilistic C-means algorithm (PCA) have been widely used. There is also the generalized possibilistic algorithm (GPCA). GPCA was proposed recently and is a general form of the previous algorithms. These clustering algorithms can be trapped to the local opt...

The World Wide Web serves as a huge widely distributed global information service center. The tremendous amount of information on the web is improving day by day. So, the process of finding the relevant information on the web is a major challenge in Information Retrieval. This leads the need for the development of new techniques for helping users to effectively navigate, summarize and organize ...

clustering is a widespread data analysis and data mining technique in many fields of study such as engineering, medicine, biology and the like. the aim of clustering is to collect data points. in this paper, a cultural algorithm (ca) is presented to optimize partition with n objects into k clusters. the ca is one of the effective methods for searching into the problem space in order to find a n...

Knowing the fact that the main weakness of the most standard methods including k-means and hierarchical data clustering is their sensitivity to initialization and trapping to local minima, this paper proposes a modification of convex data clustering  in which there is no need to  be peculiar about how to select initial values. Due to properly converting the task of optimization to an equivalent...

permeability can be directly measured using cores taken from the reservoir in the laboratory. due to high cost associated with coring, cores are available in a limited number of wells in a field. many empirical models, statistical methods, and intelligent techniques were suggested to predict permeability in un-cored wells from easy-to-obtain and frequent data such as wireline logs. the main obj...

This paper proposes the exchange market algorithm (EMA) to solve the combined economic and emission dispatch (CEED) problems in thermal power plants. The EMA is a new, robust and efficient algorithm to exploit the global optimum point in optimization problems. Existence of two seeking operators in EMA provides a high ability in exploiting global optimum point. In order to show the capabilities ...