Les politiques d’industrialisation des constructions scolaires et leur remise en cause : l’exemple des lycées publics (1956-1986)

S’appuyant sur des archives et publications du ministère de l’Éducation nationale ou d’acteurs éducatifs locaux, cet article éclaire la mise en place des procédés d’industrialisation des constructions d’établissements scolaires du second degré sur plans-types et la remise en cause de cette architecture, notamment après 1968. Il montre les multiples raisons, contraintes et enjeux (politiques, administratifs, techniques, architecturaux, pédagogiques) de ce double processus, heurté et complexe, tout en battant en brèche certaines idées reçues. Ces deux mouvements s’entremêlent en effet bien plus qu’ils ne se succèdent. Certes, ils sont concomitants d’une forte centralisation des politiques éducatives symbolisée par la création d’une direction de l’Équipement scolaire, universitaire et sportif (Desus) au sein du ministère en 1956, mais les plans standardisés d’établissements scolaires comme les critiques des « lycées-casernes » sont anciens puisqu’ils remontent à la fin du xixe siècle et sont donc antérieurs à l’industrialisation. D’autre part, alors que la place de la Desus évolue au gré des réorganisations administratives du ministère (jusqu’à sa disparition en 1986 suite au transfert des lycées aux régions), le ministère engage des réflexions architecturales dès 1969 et programme de nouvelles constructions à titre expérimental, préfigurant le renouveau de l’architecture des lycées d’après la décentralisation.Drawing on archives and publications of the Ministry of National Education or local educational actors, this article sheds light on the implementation of industrialisation processes in the construction on standard plans of secondary school buildings and the calling into question of this architecture, especially after 1968. It shows the multiple reasons, constraints and challenges (political, administrative, technical, architectural, educational) of this stuttering and complex double process, while challenging certain preconceived ideas. These two movements have, in fact, intertwined much more than they have succeeded one another. Admittedly, they were concurrent with a strong centralisation of educational policies symbolised by the creation in 1956, within the ministry, of a “direction de l’Équipement scolaire, universitaire et sportif”, a “directorate of school, university and sports equipment” (DESUS), but the standardised plans of educational buildings as well as the criticism of “barracks-high schools” were long-standing since they dated back to the end of the 19th century and were therefore prior to industrialisation. Furthermore, while the place of the DESUS was evolving according to the administrative reorganisations of the ministry (until its disappearance in 1986 following the transfer of high schools to the regions), the ministry engaged in architectural reflections from 1969 and programmed new constructions on an experimental basis, foreshadowing the renewal of high school architecture after the decentralisation

ParaDisEO-Based Design of Parallel and Distributed Evolutionary Algorithms

The original publication is available at www.springerlink.comInternational audienceParaDisEO is a framework dedicated to the design of parallel and distributed metaheuristics including local search methods and evolutionary algorithms. This paper focuses on the latter aspect. We present the three parallel and distributed models implemented in ParaDisEO and show how these can be exploited in a user-friendly, flexible and transparent way. These models can be deployed on distributed memory machines as well as on shared memory multi-processors, taking advantage of the shared memory in the latter case. In addition, we illustrate the instantiation of the models through two applications demonstrating the efficiency and robustness of the framework

The Missing Link! A New Skeleton for Evolutionary Multi-agent Systems in Erlang

Evolutionary multi-agent systems (EMAS) play a critical role in many artificial intelligence applications that are in use today. In this paper, we present a new generic skeleton in Erlang for parallel EMAS computations. The skeleton enables us to capture a wide variety of concrete evolutionary computations that can exploit the same underlying parallel implementation. We demonstrate the use of our skeleton on two different evolutionary computing applications: (1) computing the minimum of the Rastrigin function; and (2) solving an urban traffic optimisation problem. We show that we can obtain very good speedups (up to 142.44 ×× the sequential performance) on a variety of different parallel hardware, while requiring very little parallelisation effort.Publisher PDFPeer reviewe

A technique based on trade-off maps to visualise and analyse relationships between objectives in optimisation problems

Understanding the relationships between objectives in a multiobjective optimisation problem is important for developing tailored and efficient solving techniques. In particular, when tackling combinatorial optimisation problems with many objectives that arise in real-world logistic scenarios, better support for the decision maker can be achieved through better understanding of the often complex fitness landscape. This paper makes a contribution in this direction by presenting a technique that allows a visualisation and analysis of the local and global relationships between objectives in optimisation problems with many objectives. The proposed technique uses four steps: first the global pairwise relationships are analysed using the Kendall correlation method; then the ranges of the values found on the given Pareto front are estimated and assessed; next these ranges are used to plot a map using Gray code, similar to Karnaugh maps, that has the ability to highlight the trade-offs between multiple objectives; and finally local relationships are identified using scatter-plots. Experiments are presented for three different combinatorial optimisation problems: multiobjective multidimensional knapsack problem, multiobjective nurse scheduling problem and multiobjective vehicle routing problem with time windows. Results show that the proposed technique helps in the gaining of insights into the problem difficulty arising from the relationships between objectives

Distributed evolutionary algorithms and their models: A survey of the state-of-the-art

The increasing complexity of real-world optimization problems raises new challenges to evolutionary computation. Responding to these challenges, distributed evolutionary computation has received considerable attention over the past decade. This article provides a comprehensive survey of the state-of-the-art distributed evolutionary algorithms and models, which have been classified into two groups according to their task division mechanism. Population-distributed models are presented with master-slave, island, cellular, hierarchical, and pool architectures, which parallelize an evolution task at population, individual, or operation levels. Dimension-distributed models include coevolution and multi-agent models, which focus on dimension reduction. Insights into the models, such as synchronization, homogeneity, communication, topology, speedup, advantages and disadvantages are also presented and discussed. The study of these models helps guide future development of different and/or improved algorithms. Also highlighted are recent hotspots in this area, including the cloud and MapReduce-based implementations, GPU and CUDA-based implementations, distributed evolutionary multiobjective optimization, and real-world applications. Further, a number of future research directions have been discussed, with a conclusion that the development of distributed evolutionary computation will continue to flourish

ParadisEO-MOEO: A Software Framework for Evolutionary Multi-Objective Optimization

This chapter presents ParadisEO-MOEO, a white-box object-oriented software framework dedicated to the flexible design of metaheuristics for multi-objective optimization. This paradigm-free software proposes a unified view for major evolutionary multi-objective metaheuristics. It embeds some features and techniques for multi-objective resolution and aims to provide a set of classes allowing to ease and speed up the development of computationally efficient programs. It is based on a clear conceptual distinction between the solution methods and the problems they are intended to solve. This separation confers a maximum design and code reuse. This general-purpose framework provides a broad range of fitness assignment strategies, the most common diversity preservation mechanisms, some elitistrelated features as well as statistical tools. Furthermore, a number of state-of-the-art search methods, including NSGA-II, SPEA2 and IBEA, have been implemented in a user-friendly way, based on the fine-grained ParadisEO-MOEO components

Local Optima Networks of the Permutation Flow-Shop Problem

International audienceThis article extracts and analyzes local optima networks for the permutation flow-shop problem. Two widely used move operators for permutation representations, namely, swap and insertion, are incorporated into the network landscape model. The performance of a heuristic search algorithm on this problem is also analyzed. In particular, we study the correlation between local optima network features and the performance of an iterated local search heuristic. Our analysis reveals that network features can explain and predict problem difficulty. The evidence confirms the superiority of the insertion operator for this problem

Metaheuristics “In the Large”

Many people have generously given their time to the various activities of the MitL initiative. Particular gratitude is due to Adam Barwell, John A. Clark, Patrick De Causmaecker, Emma Hart, Zoltan A. Kocsis, Ben Kovitz, Krzysztof Krawiec, John McCall, Nelishia Pillay, Kevin Sim, Jim Smith, Thomas Stutzle, Eric Taillard and Stefan Wagner. J. Swan acknowledges the support of UK EPSRC grant EP/J017515/1 and the EU H2020 SAFIRE Factories project. P. GarciaSanchez and J. J. Merelo acknowledges the support of TIN201785727-C4-2-P by the Spanish Ministry of Economy and Competitiveness. M. Wagner acknowledges the support of the Australian Research Council grants DE160100850 and DP200102364.Following decades of sustained improvement, metaheuristics are one of the great success stories of opti- mization research. However, in order for research in metaheuristics to avoid fragmentation and a lack of reproducibility, there is a pressing need for stronger scientific and computational infrastructure to sup- port the development, analysis and comparison of new approaches. To this end, we present the vision and progress of the Metaheuristics “In the Large”project. The conceptual underpinnings of the project are: truly extensible algorithm templates that support reuse without modification, white box problem descriptions that provide generic support for the injection of domain specific knowledge, and remotely accessible frameworks, components and problems that will enhance reproducibility and accelerate the field’s progress. We argue that, via such principled choice of infrastructure support, the field can pur- sue a higher level of scientific enquiry. We describe our vision and report on progress, showing how the adoption of common protocols for all metaheuristics can help liberate the potential of the field, easing the exploration of the design space of metaheuristics.UK Research & Innovation (UKRI)Engineering & Physical Sciences Research Council (EPSRC) EP/J017515/1EU H2020 SAFIRE Factories projectSpanish Ministry of Economy and Competitiveness TIN201785727-C4-2-PAustralian Research Council DE160100850 DP20010236