Results 41 to 50 of about 28,166 (165)
Neurogenetic Algorithm for Solving Combinatorial Engineering Problems
Journal of Applied Mathematics, 2012 Diversity of the population in a genetic algorithm plays an important role in impeding premature convergence. This paper proposes an adaptive neurofuzzy inference system genetic algorithm based on sexual selection.
M. Jalali Varnamkhasti, Nasruddin Hassan
doaj +1 more source
Grobner Basis Approach to Some Combinatorial Problems [PDF]
Computer Science Journal of Moldova, 2012 We consider several simple combinatorial problems and discuss different ways to express them using polynomial equations and try to describe the \GB of the corresponding ideals. The main instruments are complete symmetric polynomials that help to express
Victor Ufnarovski
doaj
Flexible Wolf Pack Algorithm for Dynamic Multidimensional Knapsack Problems
Research, 2020 Optimization problems especially in a dynamic environment is a hot research area that has attracted notable attention in the past decades. It is clear from the dynamic optimization literatures that most of the efforts have been devoted to continuous ...
Husheng Wu, Renbin Xiao
doaj +1 more source
Novelty and imitation within the brain: a Darwinian neurodynamic approach to combinatorial problems. [PDF]
Sci Rep, 2021 Czégel D +4 more
europepmc +1 more source
Transfer Reinforcement Learning for Combinatorial Optimization Problems
AlgorithmsReinforcement learning is an important technique in various fields, particularly in automated machine learning for reinforcement learning (AutoRL).
Gleice Kelly Barbosa Souza +5 more
doaj +1 more source
Operations Research Perspectives, 2015 Many combinatorial optimization problems (COPs) encountered in real-world logistics, transportation, production, healthcare, financial, telecommunication, and computing applications are NP-hard in nature. These real-life COPs are frequently characterized
Angel A. Juan +4 more
doaj +1 more source
Combinatorial reconstruction problems
Journal of Combinatorial Theory, Series B, 1989 A general technique for tackling reconstruction problems is presented and applied to some old and some new instances of such problems. In particular it is shown that every polygon wih \(m>8\) vertices in the plane is determined, up to isometry, by the set of isometry types of its vertex deleted subpolygons.
Alon, N +3 more
openaire +1 more source
Tạp chí Khoa học Đại học Đà Lạt, 2017 The Traveling Salesman Problem (TSP) is the most prominent of the combinatorial optimization problems that belongs to NP-Hard. The best algorithm for solving TSP is the branch-bound algorithm with exponential-time complexity.
Đỗ Như An
doaj +1 more source
A general ant colony model to solve combinatorial optimization problems
Revista Colombiana de Computación, 2001 An Ants System is an artificial system based on the behavior of real ant colonies, which is used to solve combinatorial problems. Keywords: Combinatorial Optimization Problem,AntSystem, the Graph Partitioning and The Traveling Salesman Problems.
José Aguilar
doaj
OPTIMIZATION FOR ONE CLASS OF COMBINATORIAL PROBLEMS UNDER UNCERTAINTY
Adaptivni Sistemi Avtomatičnogo Upravlinnâ, 2019 We formalize uncertainty and compromise solution concepts, compromise criteria and conditions for a sufficiently common class of combinatorial optimization problems which functional contains a linear convolution of weights and of arbitrary numerical ...
A. A. Pavlov
doaj +1 more source