Elías Olivares Benítez

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.

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

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.

Partitioning with Variable Neighborhood Search: A bioinspired approach

The artificial vision allows us to reduce a problem by means of techniques that have obeyed the study of the intelligence of living systems. A well-known technique is data mining and pattern recognition, which are disciplines dependent of artificial intelligence that from some data, allow the acquisition of knowledge and in particular, within data mining, a great application in the field of bioinformatics has been found. What is more, the big and diverse expansion of the amount of data produced by problems related to biological behavior has generated the necessity of constructing precise algorithms of prediction and classification. The precision of classification algorithms can be affected by diverse factors, some of them considered generics in any automatic learning algorithm and, therefore, applicable to the distinct research areas. These factors are the ones that have received attention in the field of automatic learning and pattern recognition, where different clustering algorithms are observed, in particular the automatic classification or better known as classification by partitions. In this scenery, is important to discover an analogy about the way that some living beings form groups to survive in their environment finding an optimal sequence or structure or, that group their objects or belongings, against a classification by partitions algorithm. The partitioning is an NP-hard problem, thus the incorporation of approximated methods is necessary. The heuristic that we expose here is Variable Neighborhood Search (VNS) focusing in the way that this heuristic does the search of neighbor conditions by means of neighborhoods to get a satisfactory solution, just like some living beings usually do it when they try to adapt to a neighborhood close to theirs or to the current space. In this work, we focus on describing in a bioinspired way, a technique of data mining known as partitional grouping with the inclusion of VNS with the purpose of finding approximated solutions for a clustering problem.