scholarly journals On the Difference between Search Space Size and Query Complexity in Contraction Hierarchies

Author(s):  
Claudius Proissl ◽  
Tobias Rupp
2009 ◽  
Vol 20 (07) ◽  
pp. 1063-1079
Author(s):  
ADIL AMIRJANOV

The formalism is presented for modeling of a genetic algorithm (GA) with an adjustment of a search space size. The formalism for modeling of GA with an adjustment of a search space size assumes that the environment and the population form a unique system. In this paper, the formalism is applied to a problem which exhibits an interesting dynamics reminiscent of stabilizing selection in population biology. The equations of motion was derived that expressed the macroscopic statistical properties of population after reproductive genetic operators and an adjustment of a search space size in terms of those prior to the operation. Predictions of the theory are compared with experiments and are shown to predict the average fitness and the variance fitness of the final population accurately.


2008 ◽  
Vol 19 (07) ◽  
pp. 1047-1062 ◽  
Author(s):  
ADIL AMIRJANOV

One way to improve a search strategy in a Genetic Algorithm (GA) is to reduce the search space towards the feasible region where the global optimum is located. The paper describes the effect of an adjustment of a search space size of GA on the macroscopic statistical properties of population such as the average fitness and the variance fitness of population. The set of equations of motion was derived for the one-max problem that expressed the macroscopic statistical properties of population after an adjustment of a search space size in terms of those prior to the operation.


Materials ◽  
2020 ◽  
Vol 13 (5) ◽  
pp. 1175
Author(s):  
Adam Ciszkiewicz

Recent studies in biomechanical modeling suggest a paradigm shift, in which the parameters of biomechanical models would no longer treated as fixed values but as random variables with, often unknown, distributions. In turn, novel and efficient numerical methods will be required to handle such complicated modeling problems. The main aim of this study was to introduce and verify genetic algorithm for analyzing uncertainty in biomechanical modeling. The idea of the method was to encode two adversarial models within one decision variable vector. These structures would then be concurrently optimized with the objective being the maximization of the difference between their outputs. The approach, albeit expensive numerically, offered a general formulation of the uncertainty analysis, which did not constrain the search space. The second aim of the study was to apply the proposed procedure to analyze the uncertainty of an ankle joint model with 43 parameters and flexible links. The bounds on geometrical and material parameters of the model were set to 0.50 mm and 5.00% respectively. The results obtained from the analysis were unexpected. The two obtained adversarial structures were almost visually indistinguishable and differed up to 38.52% in their angular displacements.


Author(s):  
Hira Zaheer ◽  
Millie Pant ◽  
Sushil Kumar ◽  
Oleg Monakhov

Differential Evolution (DE) has attained the reputation of a powerful optimization technique that can be used for solving a wide range of problems. In DE, mutation is the most important operator as it helps in generating a new solution vector. In this paper we propose an additional mutation strategy for DE. The suggested strategy is named DE/rand-best/2. It makes use of an additional parameter called guiding force parameter K, which takes a value between (0,1) besides using the scaling factor F, which has a fixed value. De/rand-best/2 makes use of two difference vectors, where the difference is taken from the best solution vector. One vector difference will be produced with a randomly generated mutation factor K (0,1). It will add a different vector to the old one and search space will increase with a random factor. Result shows that this strategy performs well in comparison to other mutation strategies of DE.


Author(s):  
Ricardo Sérgio Prado ◽  
Rodrigo César Pedrosa Silva ◽  
Frederico Gadelha Guimarães ◽  
Oriane M. Neto

The Differential Evolution (DE) algorithm is an important and powerful evolutionary optimizer in the context of continuous numerical optimization. Recently, some authors have proposed adaptations of its differential mutation mechanism to deal with combinatorial optimization, in particular permutation-based integer combinatorial problems. In this paper, the authors propose a novel and general DE-based metaheuristic that preserves its interesting search mechanism for discrete domains by defining the difference between two candidate solutions as a list of movements in the search space. In this way, the authors produce a more meaningful and general differential mutation for the context of combinatorial optimization problems. The movements in the list can then be applied to other candidate solutions in the population as required by the differential mutation operator. This paper presents results on instances of the Travelling Salesman Problem (TSP) and the N-Queen Problem (NQP) that suggest the adequacy of the proposed approach for adapting the differential mutation to discrete optimization.


2005 ◽  
Vol 03 (04) ◽  
pp. 729-733 ◽  
Author(s):  
STEFANO MANCINI ◽  
LORENZO MACCONE

We propose the use of a quantum algorithm to deal with the problem of searching with errors in the framework of two-person games. Specifically, we present a solution to the Ulam's problem that polynomially reduces its query complexity and makes it independent of the dimension of the search space.


2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Lei Chen ◽  
Hai-Lin Liu

As an important constituent of wireless network planning, location area planning (LAP) directly affects the stability, security, and performance of wireless network. This work proposes a novel evolutionary algorithm (EA) to solve the LAP problem. The difference between the proposed algorithm and the previous EA is mainly how to encode. The new coding method is inspired by the famous four-color theorem in graph theory. Only four numbers are needed to encode all chromosomes by this method. The encoding and decoding process is fast and easy to implement. What is more, illegal solutions can be processed easily in the process of decoding. The design of effective and efficient genetic operators can also benefit from this coding method. The modified evolutionary algorithm with this coding method is especially effective for LAP problem. The use of the principle of fuzzy clustering in initialization can effectively compress the search space in this new algorithm. The computer simulation has been conducted, and the quality of proposed algorithm is confirmed by comparing the results of proposed algorithm with EA and simulated annealing (SA).


2016 ◽  
Vol 645 ◽  
pp. 112-127 ◽  
Author(s):  
Reinhard Bauer ◽  
Tobias Columbus ◽  
Ignaz Rutter ◽  
Dorothea Wagner
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document