María Beatríz Bernábe Loranca

A Neighborhood Combining Approach in GRASP's Local Search for Quadratic Assignment Problem Solutions

In this paper we describe a study for the search of solutions of the combinatorial optimization problem Quadratic Assignment Problem (QAP) through the implementation of a Greedy Randomized Adaptive Procedure Search (GRASP) and have been compared with the best solutions known in the literature, obtaining robust results in terms of the value of the objective function and the execution time. Also a comparison with the ant algorithm is presented with the aim of comparing the meta-heuristic. The most important contribution of this paper is the use of the combination of different neighborhood structures in the GRASP improvement phase. The experiment was performed for a set of test instances available in QAPLIB. The QAP belongs to the Np-hard class whereby this approximation algorithm is implemented.

A Balancing Proposal for Population Variables in Multiobjective Problems: Towards Pareto’s Frontier for Homogeneity

Clustering is one of the most successful techniques for territorial design, location-allocation problems etc. In this type of problems, the parameters are usually optimized by means of a single objective. However, real applications are far from being solved without the application of multi-objective approaches. In this paper we present a bi-objective partitioning proposal to solve problems that involve census-based variables for territorial design (TD), known to be a high complexity computational problems. Two quality measures for partitioning are chosen, which are simultaneously optimized. The first quality measure obeys a geometrical concept of distances, whereas the second measure focuses in the calculation of balance for a descriptive variable. A formulation is included with a flexible notation for the second objective about variable population and this is our main contribution. Furthermore, our model allows for implementations in several languages and it is possible to reach quality solutions within a reasonable computation time.

A Location Allocation Model for a Territorial Design Problem with Dense Demand

translation into other languages reserved by the publisher. No part of this journal may be reproduced or used in any form or by any means without written permission from the publisher, except for noncommercial, educational use including classroom teaching purposes. Product or company names used in this journal are for identification purposes only. Inclusion of the names of the products or companies does not indicate a claim of ownership by IGI Global of the trademark or registered trademark. The views expressed in this journal are those of the authors but not necessarily of IGI Global.

Design of Experiments for a multi-objective partitioning problem

In this paper we present a factorial statistical experiment for a combinatorial optimization problem bi-objective, which optimizes two functions in conflict: geometric compactness and homogeneity to variables of a population problem, it belongs to the area of design territory. Such problems invests its utmost in the biobjetivo grouping to build groups of areas under Partitioning properties where territorial partitions must be as compact and homogeneous as possible. the resolution of compromise between two objectives must be approached with a multi-objective technique to find non-dominated solutions which in turn form the set of solutions framed in a Pareto Front. A new method is proposed to find the set of solutions not dominated based on basic aspects of order theory, particularly Hasse diagram for the Minim and computational cost management has been incorporated the metaheuristic called Variable Neighborhood Search (VNS). Finally to calibrate the parameters of VNS has been done using a factorial experiment known as Box Benhken and Response Surfaces, thus we have achieved an ideal combination of parameters to obtain satisfactory solutions to the multiobjetivo problem.

Un resumen de la planificación de proyectos de innovación tecnológica

El presente trabajo de investigacion muestra un modelo matematico del problema de asignacion de recursos economicos a proyectos de innovacion tecnologica y una solucion mediante estrategias de optimizacion y herramientas informaticas. Un proyecto de innovacion tecnologica generalmente presenta propuestas de nuevas ideas que permiten el desarrollo de nuevos procesos de mejora en la produccion, comercializacion, producto, actividad comercial, modelo de negocio, modelo de logistica o de servicio al cliente de una empresa. Los planes de apoyo economico para las empresas son mediante los Consejos Nacionales de Ciencia y Tecnologia. Los consejos nacionales permiten asignar apoyos economicos a las empresas proponentes. Con la finalidad de contribuir a que mas empresas se vean beneficiadas con dicho apoyo, la presente investigacion muestra una nueva estrategia de calculo optimizado del recurso de cada propuesta de innovacion tecnologica permitiendo establecer el recurso economico requerido para su desarrollo. El metodo utilizado para encontrar una solucion a la optimizacion del recurso solicitado se realizo por medio de la conceptualizacion matematica de un modelo, generando instancias basadas en comportamientos reales y estocasticos. La herramienta utilizada para encontrar el costo optimo de cada propuesta de innovacion tecnologica fue mediante el modelo CPLEX. El resultado de la experimentacion utilizando instancias generadas presento ahorros considerables que pueden utilizarse para apoyar mas propuestas de empresas proponentes. A futuro se espera establecer convenios con el concejo nacional de ciencia y tecnologia de Mexico para la utilizacion de la herramienta. Palabras Clave: Innovacion tecnologica, optimizacion, modelo matematico.

PROBLEMA DE PROGRAMACION EN PROYECTOS DE INNOVACIÓN TECNOLÓGICA (PSP-TI)

RESUMEN: El Proyecto de innovacion tecnologica es un proyecto que es responsable de la creacion e implementacion de nuevas ideas tecnologicas que proporcionan un valor para el cliente o por negocios. Los proyectos de innovacion tecnologica intentan cumplir con los requisitos y expectativas de tiempo, costo y calidad de los procesos que conjugar la oportunidad del mercado con una necesidad o una invencion tecnologica que tiene por objetivo la produccion, comercializacion y operacion de un nuevo proceso, producto, actividad comercial, modelo de negocio, modelo de logistica o de servicio al cliente. En este articulo, original y unico en el mundo a la fecha, se presenta la solucion computacional inspirada en el problema de la calendarizacion de los proyectos de innovacion tecnologica con la finalidad de realizar un uso optimo de los recursos de tiempo, dinero y recursos humanos de empresas que desarrollen proyectos de Innovacion Tecnologica y participen en la gestion de apoyos economicos de fuentes de financiamiento internacionales. Se desarrollo un nuevo modelo matematico para el proyecto de calendarizacion de los proyectos de innovacion tecnologica, y la caracterizacion de instancias generadas al azar y reales sobre proyectos enviados al Consejo Nacional de Ciencia y Tecnologia de Mexico. Se uso el software llamado CPLEX para encontrar el costo optimo del proyecto de calendarizacion de proyectos de Innovacion Tecnologica. Lo que genero computacionalmente un calculo de ahorro de

Simulated Annealing and Variable Neighborhood Search Hybrid Metaheuristic for the Geographic Clustering Simulated Annealing and Variable Neighborhood Search Hybrid Metaheuristic for the Geographic Clustering Simulated Annealing and Variable Neighborhood Search Hybrid Metaheuristic for the Geographic

5,991,100.50. Se espera en un futuro cercano poder realizar convenios de uso de la solucion computacional en las futuras convocatorias de apoyos economicos que realice el consejo de ciencia y tecnologia. Con el uso de la solucion computacional se esperara un ahorro considerable en varios proyectos, lo que permitira poder financiar muchos otros proyectos. Palabras Clave: Problema de Calendarizacion de Proyectos, Innovacion Tecnologica.

Multiple Correspondences and Log-linear Adjustment in E-commerce

In this work we present a new hybrid approach for solving the clustering problem for geographic data, which is known to be NP-hard. Two metaheuristics that have proven efficiency in combinatory optimization problems have been chosen for the comparison: Simulated Annealing (SA) and Variable Neighborhood Search (VNS). The proposed model is based on the partitioning around the medoids and on P-median. Previous test runs have shown satisfactory results (in terms of quality and time) for instances of 469 geographic objects, but when instances of greater size are used then variability in the results has been detected. In an effort to achieve better results for the clustering problem, we have incorporated a hybridization of simulated annealing and variable neighborhood search to the geographic clustering problem. We have considered different sizes in the tests runs for distinct groups observing that the solutions obtained with the hybrid approach, named SA-VNS hybrid, overcome SA and VNS when they have been implemented individually. Finally, with the aim of evaluating the benefits of the meta-heuristic proposed, we have measured the internal connection of the obtained clusters by means of the Dunn Index. The results obtained show that the hybrid SA-VNS performs better than SA and VNS with respect to the compactness feature.

A Comparative Study of Simulated Annealing and Variable Neighborhood Search for the Geographic Clustering Problem.

When an exploratory data analysis is performed where more than two qualitative variables are present, the application of univariate, bivariate and multivariate statistical techniques allows to successfully describe the dataset. Particularly, the single correspondence technique gives important correlation and dimensionality reduction results, which helps when giving an objective interpretation of the data. In this paper the technique known as factor analysis of multiple correspondences is used, which is a generalization of the single correspondence technique used to corroborate results. The log-linear adjustment is used too, with the purpose of continuing with the Principal Components and Cluster Analyses [3]. The binary variables under study are the result of the e-commerce sites’ evaluation process for the quality attributes of the ”Functionality” feature [8, 9]. These data is concentrated in a binary table of 49 sites and 17 attributes [3, 8]. (See table A.1 in the appendix for the list of variables).