An Improved Parallelized Multi-Objective Optimization Method for Complex Geographical Spatial Sampling: AMOSA-II

Abstract

Complex geographical spatial sampling usually encounters various multi-objective optimization problems, for which effective multi-objective optimization algorithms are much needed to help advance the field. To improve the computational efficiency of the multi-objective optimization process, the archived multi-objective simulated annealing (AMOSA)-II method is proposed as an improved parallelized multi-objective optimization method for complex geographical spatial sampling. Based on the AMOSA method, multiple Markov chains are used to extend the traditional single Markov chain; multi-core parallelization technology is employed based on multi-Markov chains. The tabu-archive constraint is designed to avoid repeated searches for optimal solutions. Two cases were investigated: one with six typical traditional test problems, and the other for soil spatial sampling optimization applications. Six performance indices of the two cases were analyzed—computational time, convergence, purity, spacing, min-spacing and displacement. The results revealed that AMOSA-II performed better which was more effective in obtaining preferable optimal solutions compared with AMOSA and NSGA-II. AMOSA-II can be treated as a feasible means to apply in other complex geographical spatial sampling optimizations.

Optimal deployment of the online monitoring equipment at the edges of substations considering spatial constraint

“…In addition, compared with classical swarm intelligence optimization algorithms such as particle swarm optimization (PSO) and ant colony algorithm (ACO), SA has the ability to avoid falling into local optima and is suitable for solving the complex combinatorial optimization problems mentioned above. Therefore, based on the original archived multi-objective simulated annealing (AMOSA) algorithm, 31,32 this paper proposes an archived multi-objective simulated annealing algorithm based on the tendency Markov chain (IAMOSA) drawing on the tendency of the particle swarm optimization algorithm with multiple Markov chain populations being designed to form the particle swarms, so that the algorithm has high search efficiency. It produces a certain tendency under the condition of ensuring the randomness of the solutions.…”

Spatial Patterns of Urban Innovation and Their Evolution from Perspectives of Capacity and Structure: Taking Shenzhen as an Example

“…Hence, it is necessary to divide the study area into multiple areal spatial un according to certain rules and then to assign the discrete point data to the areal spat units. In this paper, ArcGIS software is used to calculate the distance between pate points data and grid range coordinates, and patent points are allocated to the nearest gr To select the unit size, the experience of spatial sampling optimization is referenc [33,34]. According to the size of the study area and the number of study data points, t size of the spatially divided grids is calculated using the following (Equation (1)):…”

Parallelized A Posteriori Multiobjective Optimization in RF Design

“…Another way is parallelization, which is able to decrease the time even more, depending on the number of parallel processors. While many parallelization attempts have been used in the area of evolutionary multiobjective optimization algorithms [5][6][7][8][9][10][11] and other types of metaheuristics [12][13][14][15][16], we are utilizing our original multiobjective optimization method with an asymptotically uniform coverage of the Pareto front, which improves on [17][18][19][20][21] substantially. Part of the published research aims at using alternative computing platforms (GPUs, CUDA) [6,22,23].…”