Search Results - ((solucion algorithm) OR (((evolutionary algorithm) OR (evolucionado algorithm))))
Suggested Topics within your search.
Suggested Topics within your search.
- Algoritmos Genéticos 4
- Genetic Algorithms 4
- Metaheuristics 4
- Scheduling 4
- Logistics Routing 2
- Logística De Ruteo 2
- Logística de Ruteo 2
- Metaheuristicas 2
- Metahurística 2
- Programación 2
- Routing Logistics 2
- Secuenciación 2
- Time Windows 2
- Ventana de Horario 2
- Algorithmic empathy 1
- Algoritmo evolutivo 1
- Cálculo fraccionario 1
- Empatía algorítmica 1
- Evolutionary algorithm 1
- aerodynamic optimization 1
- ala volante 1
- artificial intelligence 1
- bell-shaped spanload distribution 1
- biomedical imaging 1
- chaotic system 1
- cognitive peace 1
- distribución de campana 1
- encriptación 1
- encryption 1
- flying wing 1
Search alternatives:
- algorithm »
- evolutionary »
- evolucionado »
-
1
Solving the bilevel facility location problem under preferences by a stackelberg-evolutionary algorithm
Published 2014“…Also, two reformulations of the bilevel model are presented, reducing it into a mixed-integer single-level problem. An evolutionary algorithm based on the equilibrium in a Stackelberg’s game is proposed to solve the bilevel model. …”
Get full text
Article -
2
Optimización secuencial de alas volantes: distribución de sustentación en campana con trimado óptimo para la estabilidad
Published 2026Subjects: “…Evolutionary algorithm…”
Get full text
Article -
3
-
4
Análisis comparativo de una metaheurística en base a algoritmo genético vs un método de ramificación y corte para un caso de entrega y recolección con restricciones de ventana de h...
Published 2004“…En la solución de problemas combinatorios, es importante evaluar el costo-beneficio entre la obtención de soluciones de alta calidad en detrimento de los recursos computacionales requeridos. …”
Get full text
Article -
5
-
6
-
7
-
8
-
9
-
10
Analyzing the Performance of a Hybrid Heuristic for Solving a Bilevel Location Problem under Different Approaches to Tackle the Lower Level
Published 2016“…The proposed algorithm outperforms the evolutionary algorithm already existing in the literature. …”
Get full text
Article -
11
Solving a green logistics bi-level bi-objective problem.
Published 2017“…Furthermore, a path relinking algorithm is adapted in order to find the Pareto frontier for the bi-level bi-objective multi-commodity problem, in which the no dominated solutions of the tabu search and the co-evolutionary algorithms are used to initialize this procedure. …”
Get full text
Tesis -
12
Solving a green logistics bi-level bi-objective problem.
Published 2017“…Furthermore, a path relinking algorithm is adapted in order to find the Pareto frontier for the bi-level bi-objective multi-commodity problem, in which the no dominated solutions of the tabu search and the co-evolutionary algorithms are used to initialize this procedure. …”
Get full text
Tesis -
13
Inversión conjunta de sísmica de refracción y sondeos eléctricos verticales utilizando programación evolutiva.
Published 2017“…The main objective of the present work is to introduce an algorithm capable of solving the joint inversion of both methods using the Evolutionary Programming technique, a variant of Monte Carlo methods inspired by the evolution of the species and the natural selection from which it was obtained an estimation of parameters quite close to those proposed in direct modeling, it was proved that it is capable of being used in synthetic data contaminated with noise, validating its effectiveness in order to be able to work with real data.…”
Get full text
Tesis -
14
Inversión conjunta de sísmica de refracción y sondeos eléctricos verticales utilizando programación evolutiva.
Published 2017“…The main objective of the present work is to introduce an algorithm capable of solving the joint inversion of both methods using the Evolutionary Programming technique, a variant of Monte Carlo methods inspired by the evolution of the species and the natural selection from which it was obtained an estimation of parameters quite close to those proposed in direct modeling, it was proved that it is capable of being used in synthetic data contaminated with noise, validating its effectiveness in order to be able to work with real data.…”
Get full text
Tesis -
15
Analysis of multiple change-points in normally distributed series
Published 2013“…Obtaining these change-points MLEs could be considered as an optimization problem, so a Construction Heuristic and a Genetic Algorithm (Evolutionary) were developed based on them. …”
Get full text
Tesis -
16
Analysis of multiple change-points in normally distributed series
Published 2013“…Obtaining these change-points MLEs could be considered as an optimization problem, so a Construction Heuristic and a Genetic Algorithm (Evolutionary) were developed based on them. …”
Get full text
Tesis -
17
Performance evaluation and optimization of swarms of robots in a specific task
Published 2019“…The Multi-Objective Particle Swarm Optimization (MOPSO), the Nondominated Sorting Genetic Algorithm II using Differential Evolution (NSGA-II-DE) and the Multiobjective Evolutionary Algorithm based on Decomposition using Differential Evolution (MOEA/D-DE) are used to optimize the control parameters ∆r, ∆o and ∆a for the proposed task in each experiment. …”
Get full text
Tesis -
18
Performance evaluation and optimization of swarms of robots in a specific task
Published 2019“…The Multi-Objective Particle Swarm Optimization (MOPSO), the Nondominated Sorting Genetic Algorithm II using Differential Evolution (NSGA-II-DE) and the Multiobjective Evolutionary Algorithm based on Decomposition using Differential Evolution (MOEA/D-DE) are used to optimize the control parameters ∆r, ∆o and ∆a for the proposed task in each experiment. …”
Get full text
Tesis -
19
Sintesis posicional....
Published 2010“…In this work, a technique based on evolutionary algorithms appears, to obtain an approximated solution of the position equations system, that as well contemplate a greater amount of conditions of design.…”
Get full text
Article -
20
Algoritmo genético para un problema de ruteo con entrega y recolección de producto y con restricciones de ventana de horario
Published 2005“…En la solución cuantitativa de problemas combinatorios es importante evaluar el costo-beneficio que surge al obtener soluciones de alta calidad en detrimento de los recursos económicos y computacionales requeridos. …”
Get full text
Article