A redistricting problem applied to meter reading in power distribution networks

The capacitated redistricting problem (CRP) has the objective to redefine, under a given criterion, an initial set of districts of an urban area represented by a geographic network. Each node in the network has different types of demands and each district has a limited capacity. Real-world applications consider more than one criteria in the design of the districts, leading to a multicriteria CRP (MCRP). Examples are found in political districting, sales design, street sweeping, garbage collection and mail delivery. This work addresses the MCRP applied to power meter reading and two criteria are considered: compactness and homogeneity of districts. The proposed solution framework is based on a greedy randomized adaptive search procedure and multicriteria scalarization techniques to approximate the Pareto frontier. The computational experiments show the effectiveness of the method for a set of randomly generated networks and for a real-world network extracted from the city of São Paulo. © 2013 Elsevier Ltd.

Desempenho em consciência fonológica, memória operacional, leitura e escrita na dislexia familial

Background: familial dyslexia. Aim: to characterize and compare the phonological awareness, working memory, reading and writing abilities of individuals whose family members are also affected. Method: in this study 10 familial nuclei of natural family relationship of individuals with dyslexia were analyzed. Families of natural individuals living in the west region of the state of São Paulo were selected. Inclusion criteria were: to be a native speaker of the Brazilian Portuguese language, to have 8 years of age or more, to present positive familial history for learning disabilities, That is, to present at least one relative with difficulties in learning. Exclusion criteria were: to present any neurological disorder genetically caused or not, in any of the family members, such as dystonia, extra pyramidal diseases, mental disorder, epilepsy, attention deficit and hyperactivity disorder (ADHA); psychiatric symptoms or conditions; or any other pertinent conditions that could cause errors in the diagnosis. As for the diagnosis of developmental dyslexia, information about the familial history of the adolescents and children was gathered with the parents, so that a detailed pedigree could be delineated. Neurological, psychological, speech-language, and school performance evaluations were made with the individuals and their families. Results: the results of this study suggest that the dyslexic individuals and their respective relatives, also with dyslexia, presented lower performances than the control group in terms of rapid automatic naming, reading, writing and phonological awareness. Conclusion: deficits in phonological awareness, working memory, reading and writing seem to have genetic susceptibility that possibly determine, when in interaction with the environment, the manifestation of dyslexia.

GRASP with evolutionary path-relinking for the capacitated arc routing problem

The Capacitated Arc Routing Problem (CARP) is a well-known NP-hard combinatorial optimization problem where, given an undirected graph, the objective is to find a minimum cost set of tours servicing a subset of required edges under vehicle capacity constraints. There are numerous applications for the CARP, such as street sweeping, garbage collection, mail delivery, school bus routing, and meter reading. A Greedy Randomized Adaptive Search Procedure (GRASP) with Path-Relinking (PR) is proposed and compared with other successful CARP metaheuristics. Some features of this GRASP with PR are (i) reactive parameter tuning, where the parameter value is stochastically selected biased in favor of those values which historically produced the best solutions in average; (ii) a statistical filter, which discard initial solutions if they are unlikely to improve the incumbent best solution; (iii) infeasible local search, where high-quality solutions, though infeasible, are used to explore the feasible/infeasible boundaries of the solution space; (iv) evolutionary PR, a recent trend where the pool of elite solutions is progressively improved by successive relinking of pairs of elite solutions. Computational tests were conducted using a set of 81 instances, and results reveal that the GRASP is very competitive, achieving the best overall deviation from lower bounds and the highest number of best solutions found. © 2011 Elsevier Ltd. All rights reserved.