17 research outputs found

    On Finding Maximum Cardinality Subset of Vectors with a Constraint on Normalized Squared Length of Vectors Sum

    Full text link
    In this paper, we consider the problem of finding a maximum cardinality subset of vectors, given a constraint on the normalized squared length of vectors sum. This problem is closely related to Problem 1 from (Eremeev, Kel'manov, Pyatkin, 2016). The main difference consists in swapping the constraint with the optimization criterion. We prove that the problem is NP-hard even in terms of finding a feasible solution. An exact algorithm for solving this problem is proposed. The algorithm has a pseudo-polynomial time complexity in the special case of the problem, where the dimension of the space is bounded from above by a constant and the input data are integer. A computational experiment is carried out, where the proposed algorithm is compared to COINBONMIN solver, applied to a mixed integer quadratic programming formulation of the problem. The results of the experiment indicate superiority of the proposed algorithm when the dimension of Euclidean space is low, while the COINBONMIN has an advantage for larger dimensions.Comment: To appear in Proceedings of the 6th International Conference on Analysis of Images, Social Networks, and Texts (AIST'2017

    Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem

    Full text link
    We propose a new genetic algorithm with optimal recombination for the asymmetric instances of travelling salesman problem. The algorithm incorporates several new features that contribute to its effectiveness: (i) Optimal recombination problem is solved within crossover operator. (ii) A new mutation operator performs a random jump within 3-opt or 4-opt neighborhood. (iii) Greedy constructive heuristic of W.Zhang and 3-opt local search heuristic are used to generate the initial population. A computational experiment on TSPLIB instances shows that the proposed algorithm yields competitive results to other well-known memetic algorithms for asymmetric travelling salesman problem.Comment: Proc. of The 11th International Conference on Large-Scale Scientific Computations (LSSC-17), June 5 - 9, 2017, Sozopol, Bulgari

    Estimating attraction basin sizes

    Get PDF
    The performance of local search algorithms is influenced by the properties that the neighborhood imposes on the search space. Among these properties, the number of local optima has been traditionally considered as a complexity measure of the instance, and different methods for its estimation have been developed. The accuracy of these estimators depends on properties such as the relative attraction basin sizes. As calculating the exact attraction basin sizes becomes unaffordable for moderate problem sizes, their estimations are required. The lack of techniques achieving this purpose encourages us to propose two methods that estimate the attraction basin size of a given local optimum. The first method takes uniformly at random solutions from the whole search space, while the second one takes into account the structure defined by the neighborhood. They are tested on different instances of problems in the permutation space, considering the swap and the adjacent swap neighborhoods

    Harmonic vibrations of nanosized magnetoelectric bodies with coupled surface and interphase effects: Mathematical models and finite element approaches

    No full text
    The harmonic problems for piezomagnetoelectric nanosized bodies with taking into account the coupled damping and surface effects are considered on the base of the generalized Gurtin-Murdoch model. In the development of previous investigations, the coupled mechanical, electric and magnetic surface effects with surface inertial terms are introduced into the model. For a homogeneous model, the composite material is considered as homogeneous with the suitable effective material properties. The weak or generalized formulation of the steady-state oscillation problem is given together with the suitable formulation of the modal problem. For numerical solution of these problems, the finite element approximations, leading to a symmetric structure of finite element matrices, are present. The procedures of homogenization of piezomagnetoelectric nanostructured composite materials with piezoelectric and piezomagnetic phases are described on the base of the methods of effective moduli and finite elements

    Mathematical models and finite element approaches for nanosized piezoelectric bodies with uncoulped and coupled surface effects

    No full text
    In this chapter the dynamic problems for piezoelectric nanosized bodies with account for coupled damping and surface effects are considered. For these problems we propose new mathematical model which generalizes the models of the elastic medium with damping in sense of the Rayleigh approach and with surface effects for the cases of piezoelectric materials. Our model of attenuation and surface effects has coupling properties between mechanical and electric fields, both for the damping terms and constitutive equations for piezoelectric materials on the surface. For solving the problems stated the finite element approximations are discussed. A set of effective finite element schemes is examined for finding numerical solutions of week statements for nonstationary problems, steady-state oscillation problems, modal problems and static problems within the framework of modelling of piezoelectric nanosized materials with damping and surface effects. For transient and harmonic problems, we demonstrate that the proposed models allow the use of the mode superposition method. In addition, we note that for transient and static problems we can use efficient finite element algorithms for solving the systems of linear algebraic equations with symmetric quasi-definite matrices both in the case of uncoupled surface effects and in the case of coupled surface effects
    corecore