• Artificial bee colony and particle swarm optimization for the estimation of nonlinear regression parameters 

      de los Cobos Silva, Sergio Gerardo; Gutiérrez Andrade, Miguel Ángel; Rincón García, Eric Alfredo; Lara Velázquez, Pedro; Aguilar Cornejo, Manuel (2014-04-03)
      This paper shows the comparison results of ABC (Artificial Bee Colony) and PSO (Particle Swarm Optimization) heuristic tech- niques that were used to estimate parameters for nonlinear regression models. The algorithms were ...
    • Asignación de frecuencias en telefonía celular aplicando el problema de coloracion robusta 

      Lara Velázquez, Pedro; Gallardo López, Lizbeth; Gutiérrez Andrade, Miguel Ángel; de los Cobos Silva, Sergio Gerardo (2010-04-09)
          The Robust Coloring Problem (RCP) is a NP-Hard Problem for which fast andefficient heuristic algorithms has been developed. In this work we present as a PCRthe problem of assignment of frequencies for a cellphone grid. ...
    • Estimación de parámetros de regresión no lineal mediante colonia de abejas artificiales 

      de los Cobos Silva, Sergio Gerardo; Gutiérrez Andrade, Miguel Ángel; Rincón García, Eric Alfredo; Lara Velázquez, Pedro; Aguilar Cornejo, Manuel (2013-04-04)
      Este trabajo presenta los resultados de la técnica heurística de ABC (Artificial Bee Colony) utilizada para estimar los parámetros de modelos de regresión no lineal. El algoritmo fue probado sobre 27 bases de datos de la ...
    • Evaluation of air pollution control policies in Mexico City using finite Markov chain observation model 

      Hoyos, Luis; Lara Velázquez, Pedro; Ortiz, Elba; López Bracho, Rafael; González, Jesús (2010-04-09)
          This paper proposes a Markov observation based model, where the transition ma-trix is formulated using air quality monitoring data for specific pollutant emissions,with the primary objective to analyze the corresponding ...
    • Heuristics for the Robust Coloring Problem 

      Gutiérrez Andrade, Miguel Ángel; Lara Velázquez, Pedro; Lopez Bracho, Rafael; Ramírez Rodríguez, Javier (2011-03-18)
      Let $G$ and $\bar{G}$ be complementary graphs. Given a penalty function defined on the edges of $G$, we will say that the rigidity of a $k$-coloring of $G$ is the sum of the penalties of the edges of G joining vertices of ...
    • New geometrical compactness measures for zones design 

      Rincón García, Eric Alfredo; Gutiérrez Andrade, Miguel Ángel; de los Cobos Silva, Sergio Gerardo; Lara Velázquez, Pedro (2012-07-01)
      The design of compact zones has been studied because of its influence in the creation of zones with regular forms, which are easier to analyze, to investigate or to administer. This paper propose a new method to measure ...
    • An optimization algorithm inspired by musical composition in constrained optimization problems 

      Mora Gutiérrez, Roman Anselmo; Rincón García, Eric Alfredo; Ramírez Rodríguez, Javier; Ponsich, Antonin; Herrera Alcántara, Oscar; Lara Velázquez, Pedro (2013-08-29)
      Many real-world problems can be expressed as an instance of the constrained nonlinear optimization problem (CNOP). This problem has a set of constraints specifies the feasible solution space. In the last years several ...
    • Un Algoritmo Evolutivo para Resolver el Problema de Coloración Robusta 

      Lara Velázquez, Pedro; Gutiérrez Andrade, Miguel Ángel; Ramírez Rodríguez, Javier; López Bracho, Rafael (2012-03-22)
      Let G and \bar{G} be two complementary graphs. Given a penalty function defined over the edges of \bar{G}, it is said that the rigidity of a k-coloring of G is the summation ofthe penalties of the edges of G that join ...