We introduce and study orderly spanning trees of plane graphs. This algorithmic tool generalizes canonical orderings, which exist only for triconnected plane graphs. Although not every plane graph admits an orderly spanning tree, we provide an algorithm to compute an orderly pair for any connected planar graph G, consisting of an embedded planar graph H isomorphic to G, and an orderly spanning ...

The advantages of FCM algorithm are that it is mainly applied in point data cluster and can't directly process relational data, for which the paper proposes a clustering algorithm in data mining based on web log. Firstly, the paper improves FCM algorithm which makes it can process relational data, and makes robustness improvement on the algorithm. Then, the traditional FCM algorithm needs to de...

In this paper, we propose a new population-based framework for combining local search with global explorations to solve single-objective unconstraint numerical optimization problems. The idea is to use knowledge about local optima found during the search to a) locate promising regions in the search space and b) identify the suitable step size to move from one optimum to others in each region. T...

This study presents a new method for knowledge transfer in Multi-Population Cultural Algorithms (MPCA) through agent migration. This agent-based algorithm involves having individual agents using one of multiple pre-defined knowledge algorithms to determine behavior, and using the success of it and other agents to decide on which knowledge algorithms to use next. Two or more subpopulations with ...

A cultural algorithm is proposed in this paper. The main novel feature of this approach is the use of differential evolution as a population space. Differential evolution has been found to be very effective when dealing with real valued optimization problems. The knowledge sources contained in the belief space of the cultural algorithm are specifically designed according to the differential evo...

Cultural Algorithms (CAs) are one of the metaheuristics which can adapt in order to work in multi-objectives optimization environments. On the other hand, Bi-Objective Uncapacitated Facility Location Problem (BOUFLP) and particularly Uncapacitated Facility Location Problem (UFLP) are a well know problems in literature. However, a few articles have worked in the sense of applied evolutionary mul...

In this paper, we combine a novel Sequential Graph Coloring Heuristic Algorithm (SGCHA) with a non-systematic method based on a cultural algorithm to solve the graph coloring problem (GCP). The GCP involves finding the minimum number of colors for coloring the graph vertices such that adjacent vertices have distinct colors. In our solving approach, we first use an estimator which is implemented...