Buscar
Mostrando ítems 1-10 de 200
On The Complexity Of The Traveling Umpire Problem
(ELSEVIER SCIENCE BVAMSTERDAM, 2015)
A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule
(Elsevier Science BvAmsterdamHolanda, 2008)
MAtheuristic Algorithm Based On Neighborhood Structure to Solve The Reconfiguration Problem of Active Distribution Systems
(2021-01-01)
The problem of reconfiguration for active distribution systems is formulated as a stochastic mixed-integer second-order conic programming (MISOCP) model that simultaneously considers the minimization of energy power losses ...
A hybrid method for the probabilistic maximal covering location-allocation problem
(Elsevier B.V., 2015-05-01)
This paper presents a hybrid algorithm that combines a metaheuristic and an exact method to solve the Probabilistic Maximal Covering Location-Allocation Problem. A linear programming formulation for the problem presents ...
Simulating Large Gaussian Random Vectors Subject to Inequality Constraints by Gibbs Sampling
(Springer, 2014)
The Gibbs sampler is an iterative algorithm used to simulate Gaussian random
vectors subject to inequality constraints. This algorithm relies on the fact that
the distribution of a vector component conditioned by the ...
Routing in waste collection: a simulated annealing algorithm for an Argentinean case study
(American Institute of Mathematical Sciences, 2021-11-03)
The management of the collection of Municipal Solid Waste is a complex task for local governments since it consumes a large portion of their budgets. Thus, the use of computer-aided tools to support decision-making can ...
Optimal Power Flow Problem Solution through a Matheuristic Approach
(2021-01-01)
The optimal power flow (OPF) problem is a widely studied subject in the literature that has been solved through classical and metaheuristic optimization techniques. Nowadays, significant advances in computational resources ...
Implementing a Large Neighborhood Search Algorithm for the Vehicle Routing Problem with Time Windows
(UniandesIngeniería IndustrialFacultad de IngenieríaDepartamento de Ingeniería Industrial, 2014)
Optimal two-dimensional packing with rotatable items using a hybrid algorithm of variable neighborhood search and simulated annealingEmpaquetamiento óptimo bidimensional con rotación de piezas usando un algoritmo híbrido de búsqueda en vecindad variable y recocido simulado
(Pereira : Universidad Tecnológica de PereiraFacultad de Ciencias Básicas, 2011)
Metaheurísticas para o problema de roteamento de veículos capacitados: o algoritmo híbrido de otimização por colônia de formigas e a busca híbrida em grande vizinhançaMetaheuristics for the capacitated vehicle routing problem: the hybrid ant colony optimization and hybrid large neighborhood search
(Universidade Federal de UberlândiaBrasilCiência da Computação, 2018)