Search
Now showing items 1-10 of 15
Un problema de localización de plantas de gran escala
(2009-02-19)
En este artículo se desarrolla un algoritmo heurístico y su correspondiente implementación para resolver un problema de localización de plantas (facility location) de gran escala, en donde surgen potencialmente más de 640 ...
Una propuesta de Modelamiento para los Sistemas de Recompensa
Una propuesta de Modelamiento para los Sistemas de Recompensa
(2012-03-01)
One of the most important subjects of interest, in nearly any human activity, is the perception of salary. It could even be said that the decision of following a career depends deeply on the perspective that the individual ...
El problema del multicubrimiento: una aplicación para la selección de paradas en la red de transporte de la Ciudad de México
El problema del multicubrimiento: una aplicación para la selección de paradas en la red de transporte de la Ciudad de México
(2009-02-20)
In this paper an heuristic algorithm is developed. Its implementation is developedas well, in order to solve a sampling problem in the urban transportation network in Mexico City. The problem consist of the selection of ...
Asignación de frecuencias en telefonía celular aplicando el problema de coloracion robusta
Asignación de frecuencias en telefonía celular aplicando el problema de coloracion robusta
(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. ...
Aplicación de la búsqueda tabú en regresión no lineal
Aplicación de la búsqueda tabú en regresión no lineal
(2009-02-20)
We implement the combinatorial optimization technique known as tabu search inthe parameter estimation problem in a given non linear model. For the generationof neighbors, the implementation is based on a discretization of ...
Una caracterización sobre las soluciones para el problema de reaprovisionamiento conjunto
Una caracterización sobre las soluciones para el problema de reaprovisionamiento conjunto
(2009-02-20)
In this paper an introduction is given to a multiple-item inventory problem, knownas the Joint Replenishment Problem (JRP). This is a real world problem which hasbeen extensively studied. The JRP has a continuous decision ...
Simulated Annealing–Golden section algorithm for the multiproduct replenishment problem with stochastic demand.
Algoritmo recocido simulado–sección dorada para el problema de reaprovisionamiento multiproducto con demanda estocástica
(2010-07-02)
The joint replenishment problem (JRP) has been studied for over 30 years and there are both heuristic and exact algorithms to determine the frequency of orders and fundamental cycle; in recent years ithas been considered ...
Fuzzy Regression VS. Ordinary Least Squares Regression: Case Study
Regresión Borrosa VS. Regresión por Mínimos Cuadrados Ordinarios: Caso de Estudio
(2011-03-18)
The objective of this paper is to disseminate the technique of fuzzy regression and to give a practical example of its use. To this end, classical regression is compared to several fuzzy regression models on a problem ...
New geometrical compactness measures for zones design
Nuevas medidas de compacidad geométrica para el diseño de zonas
(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 ...
Método heurístico para particionamiento óptimo
Método heurístico para particionamiento óptimo
(2009-02-20)
Many data analysis problems deal with non supervised partitioning of a data set,in non empty clusters well separated between them and homogeneous within the clusters.An ideal partitioning is obtained when any object can ...