An evolutive approach for the delineation of local labour markets

This paper presents a new approach to the delineation of local labour markets based on evolutionary computation. The main objective is the regionalisation of a given territory into functional regions based on commuting flows. According to the relevant literature, such regions are defined so that (a) their boundaries are rarely crossed in daily journeys to work, and (b) a high degree of intra-area movement exists. This proposal merges municipalities into functional regions by maximizing a fitness function that measures aggregate intra-region interaction under constraints of inter-region separation and minimum size. Real results are presented based on the latest database from the Census of Population in the Region of Valencia. Comparison between the results obtained through the official method which currently is most widely used (that of British Travel-to-Work Areas) and those from our approach is also presented, showing important improvements in terms of both the number of different market areas identified that meet the statistical criteria and the degree of aggregate intra-market interaction.

A memetic algorithm for the delineation of local labour markets

Given a territory composed of basic geographical units, the delineation of local labour market areas (LLMAs) can be seen as a problem in which those units are grouped subject to multiple constraints. In previous research, standard genetic algorithms were not able to find valid solutions, and a specific evolutionary algorithm was developed. The inclusion of multiple ad hoc operators allowed the algorithm to find better solutions than those of a widely-used greedy method. However, the percentage of invalid solutions was still very high. In this paper we improve that evolutionary algorithm through the inclusion of (i) a reparation process, that allows every invalid individual to fulfil the constraints and contribute to the evolution, and (ii) a hillclimbing optimisation procedure for each generated individual by means of an appropriate reassignment of some of its constituent units. We compare the results of both techniques against the previous results and a greedy method.

Acciones públicas de sensibilización de género: el esfuerzo de la administración regional y local en comunicación publicitaria (1999-2007)

El artículo analiza las iniciativas de comunicación relacionadas con la igualdad de oportunidades entre mujeres y hombres. El objetivo es analizar con enfoque de género las acciones realizadas por parte de las instituciones públicas regionales y locales para sensibilizar y promover la conciliación entre la vida familiar y laboral de seis comunidades autónomas (Andalucía, Cataluña, Comunidad Valenciana, Galicia, Madrid y País Vasco) y de sus capitales, desde 1999 (cuando se aprueba la ley de conciliación) hasta 2007 (se aprueba la ley de igualdad). La información sobre publicidad convencional fue proporcionada por Infoadex. Para la recogida de otro tipo de iniciativas a través de medios menos convencionales se acudió a cuatro fuentes institucionales: 1) Ayuntamientos de las capitales, como fuente estrictamente local, 2) Diputaciones de la capital de la Comunidad Autónoma, como fuente provincial, 3) Direcciones Generales de la Mujer o instituciones análogas como fuente de información a nivel regional o autonómico y, por último, 4) otras concejalías vinculadas al tema de la corresponsabilidad, cuyo radio de acción también es autonómico. Los resultados, aunque con diferencias entre regiones, reflejan carencias en la cobertura de las acciones que llevan a cuestionar la falta de estrategia política en términos de comunicación, pese a la introducción sistemática de estos objetivos en la agenda internacional (ONU y UE) y del gobierno español. En consecuencia, las campañas publicitarias e iniciativas recogidas contribuyen a la visibilización del problema y al empoderamiento, pero no tanto al objetivo de la paridad.

Global behavior of the Douglas–Rachford method for a nonconvex feasibility problem

In recent times the Douglas–Rachford algorithm has been observed empirically to solve a variety of nonconvex feasibility problems including those of a combinatorial nature. For many of these problems current theory is not sufficient to explain this observed success and is mainly concerned with questions of local convergence. In this paper we analyze global behavior of the method for finding a point in the intersection of a half-space and a potentially non-convex set which is assumed to satisfy a well-quasi-ordering property or a property weaker than compactness. In particular, the special case in which the second set is finite is covered by our framework and provides a prototypical setting for combinatorial optimization problems.