Utilization of the Discrete Differential Evolution for Optimization in Multidimensional Point Clouds

Abstract EN

The Differential Evolution (DE) is a widely used bioinspired optimization algorithm developed by Storn and Price.

It is popular for its simplicity and robustness.

This algorithm was primarily designed for real-valued problems and continuous functions, but several modified versions optimizing both integer and discrete-valued problems have been developed.

The discrete-coded DE has been mostly used for combinatorial problems in a set of enumerative variants.

However, the DE has a great potential in the spatial data analysis and pattern recognition.

This paper formulates the problem as a search of a combination of distinct vertices which meet the specified conditions.

It proposes a novel approach called the Multidimensional Discrete Differential Evolution (MDDE) applying the principle of the discrete-coded DE in discrete point clouds (PCs).

The paper examines the local searching abilities of the MDDE and its convergence to the global optimum in the PCs.

The multidimensional discrete vertices cannot be simply ordered to get a convenient course of the discrete data, which is crucial for good convergence of a population.

A novel mutation operator utilizing linear ordering of spatial data based on the space filling curves is introduced.

The algorithm is tested on several spatial datasets and optimization problems.

The experiments show that the MDDE is an efficient and fast method for discrete optimizations in the multidimensional point clouds.