Search Results - ((solution algorithm) OR (((evolutionary algorithm) OR (evolucionado algorithm))))

Search alternatives:

  1. 21

    Solving a green logistics bi-level bi-objective problem. by Maldonado Pinto, Carmen Sayuri

    Published 2017
    “…After that, the multi-commodity bi-level case is studied and the respective adaptation of the tabu search is made. Then, a co-evolutionary algorithm is designed for obtaining good quality bi-level feasible solutions. …”
    Get full text
    Tesis
  2. 22

    Solving a green logistics bi-level bi-objective problem. by Maldonado Pinto, Carmen Sayuri

    Published 2017
    “…After that, the multi-commodity bi-level case is studied and the respective adaptation of the tabu search is made. Then, a co-evolutionary algorithm is designed for obtaining good quality bi-level feasible solutions. …”
    Get full text
    Tesis
  3. 23

    Performance evaluation and optimization of swarms of robots in a specific task by Márquez Vega, Luis Ángel

    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
  4. 24

    Performance evaluation and optimization of swarms of robots in a specific task by Márquez Vega, Luis Ángel

    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
  5. 25

    Inversión conjunta de sísmica de refracción y sondeos eléctricos verticales utilizando programación evolutiva. by Merlo Mejía, Jorge Luis

    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
  6. 26

    Inversión conjunta de sísmica de refracción y sondeos eléctricos verticales utilizando programación evolutiva. by Merlo Mejía, Jorge Luis

    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
  7. 27

    A Hybrid Metaheuristic-Based Approach for the Aerodynamic Optimization of Small Hybrid Wind Turbine Rotors by Herbert Acero, José F., Martínez Lauranchet, Jaime, Probst, Oliver, Méndez Díaz, Santos, Castillo Villar, Krystel K., Valenzuela Rendón, Manuel, Réthoré, Pierre Elouan

    Published 2014
    “…The framework considers an innovative nestedhybrid solution procedure based on two metaheuristics, the virtual gene genetic algorithm and the simulated annealing algorithm, to provide a near-optimal solution to the problem. …”
    Get full text
    Article
  8. 28

    Sintesis posicional.... by Guerra Torres, César, Torres Treviño, Luis Martín, Rodríguez Liñán, Juan Ángel

    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
  9. 29

    Analysis of multiple change-points in normally distributed series by Garza Venegas, Jorge Arturo

    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
  10. 30

    Analysis of multiple change-points in normally distributed series by Garza Venegas, Jorge Arturo

    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
  11. 31

    Flexible jobshop scheduling problem with resource recovery constraints. by Vallikavungal Devassia, Jobish

    Published 2017
    “…Several real instances are solved by this algorithm and a comparison is carried out between the solutions reported by our GRASP and the ones found through the procedure followed by the decision maker. …”
    Get full text
    Tesis
  12. 32

    Flexible jobshop scheduling problem with resource recovery constraints. by Vallikavungal Devassia, Jobish

    Published 2017
    “…Several real instances are solved by this algorithm and a comparison is carried out between the solutions reported by our GRASP and the ones found through the procedure followed by the decision maker. …”
    Get full text
    Tesis
  13. 33

    A branch and cut approach to the orienteering problem with mandatory visits and conflicts by Pérez Franco, Marlene

    Published 2025
    “…The goal is to find the route that maximizes the collected score, including all the mandatory and some optional vertices, without generating conflict between vertices or exceeding the time limit. The B&C algorithm is expected to outperform the performance of the best-known methods existing in the OPMVC literature in terms of computational efficiency and solution quality. …”
    Get full text
    Tesis
  14. 34

    A branch and cut approach to the orienteering problem with mandatory visits and conflicts by Pérez Franco, Marlene

    Published 2025
    “…The goal is to find the route that maximizes the collected score, including all the mandatory and some optional vertices, without generating conflict between vertices or exceeding the time limit. The B&C algorithm is expected to outperform the performance of the best-known methods existing in the OPMVC literature in terms of computational efficiency and solution quality. …”
    Get full text
    Tesis
  15. 35

    Decision policy scenarios for just-in-sequence (JIS) deliveries by Cedillo Campos, Miguel Gastón, Morones Ruelas, Darío, Lizarraga Lizarraga, Giovanni, González Feliu, Jesús, Garza Reyes, José Arturo

    Published 2017
    “…Therefore, the aim of this paper is to propose a genetDesign/methodology/approach: Based on a literature review and real-life information, an abductive reasoning was performed and a case study application of the proposed genetic algorithm conducted in the automotive industry. Findings: The results obtained from the case study indicate that the proposed genetic algorithm offers a reliable solution when facing variability in safety stocks that operate under assumptions such as: i) fixed costs; ii) high inventory turnover; iii) scarce previous information concerning material requirements; and iv) replenishment services as core business value. …”
    Get full text
    Article
  16. 36

    A stochastic location-inventory problem: complexity and mathematical formulations. by Hernández González, Nelly Montserrat

    Published 2017
    “…The result that LIP is NP-hard suggests that any exact algorithm may fail to solve large instances, nevertheless, the strategic nature of the problem indicates that an optimal solution is valuable, since the savings between an optimal and other feasible solution can represent a large amount of money. …”
    Get full text
    Tesis
  17. 37

    A stochastic location-inventory problem: complexity and mathematical formulations. by Hernández González, Nelly Montserrat

    Published 2017
    “…The result that LIP is NP-hard suggests that any exact algorithm may fail to solve large instances, nevertheless, the strategic nature of the problem indicates that an optimal solution is valuable, since the savings between an optimal and other feasible solution can represent a large amount of money. …”
    Get full text
    Tesis
  18. 38

    Optimización de la planificación de servicios by Sánchez Yepez, Gabriela

    Published 2019
    “…The study seeks to propose mathematical formulations and solution algorithms for at least one variant of the problem with the purpose of contribute to the improvement of the state of the art of vehicle routing problems, logistics, and transport. …”
    Get full text
    Tesis
  19. 39

    Optimización de la planificación de servicios by Sánchez Yepez, Gabriela

    Published 2019
    “…The study seeks to propose mathematical formulations and solution algorithms for at least one variant of the problem with the purpose of contribute to the improvement of the state of the art of vehicle routing problems, logistics, and transport. …”
    Get full text
    Tesis
  20. 40

    Lot production size problem and simulation of urban transport by Morales Marroquín, Miguel Lorenzo

    Published 2015
    “…The mathematical model and the algorithm for the lot production size problem, showed in this research, can be used for production planners to help in the scheduling of the manufacturing. …”
    Get full text
    Tesis

Search Tools: