The AM2 aluminum airfield matting system is currently deployed by the United States military for the creation of temporary, rapidly constructed airfields. The ability to predict the number of allowable aircraft passes across an AM2 installation is challenging because of the complex design of the joining system and the fatigue behavior of critical stress elements in the joints. Prior to the writing of this dissertation, the prevailing methods used to predict the performance of AM2 were based on the CBR design procedure for flexible pavements using a small number of full-scale test sections over CBRs ranging from 4 to 10% and simulated aircraft that are no longer in service. The primary objectives of this dissertation are to present the results from nine full-scale experiments conducted on sections of AM2 matting installed on unstabilized soil and gravel subgrades with CBRs of 6, 10, 15, 25, and 100%, and to provide improved relationships that can be used to predict subgrade deformation underneath an AM2 mat installation and the associated fatigue damage when subjected to F-15E and C-17 traffic. Additionally, a laboratory fixture and procedure is described that can be used to evaluate an AM2 style joint in fatigue and directly relate its performance to in-situ field CBR conditions without requiring the expense of full-scale testing. These relationships are suitable to be implemented into design and evaluation frameworks currently used for airfield pavements and matting systems. The main body of this dissertation is a compilation of three complementary articles that describe different components of the main objectives and results from the full-scale experiments on AM2 mat surfaced airfields. The subgrade deformation relationships developed for the F-15E aircraft are presented in Chapter 2, the fatigue damage relationships and the development of the laboratory procedure for the F-15E aircraft are presented in Chapter 3, and the subgrade deformation relationships, fatigue relationships, and laboratory experiments for the C-17 are included in Chapter 4. Chapter 5 presents conclusions and recommendations.

This thesis, after presenting recent advances obtained for the two-dimensional bin packing problem, focuses on the case where guillotine restrictions are imposed. A mathematical characterization of non-guillotine patterns is provided and the relation between the solution value of the two-dimensional problem with guillotine restrictions and the two-dimensional problem unrestricted is being studied from a worst-case perspective. Finally it presents a new heuristic algorithm, for the two-dimensional problem with guillotine restrictions, based on partial enumeration, and computationally evaluates its performance on a large set of instances from the literature. Computational experiments show that the algorithm is able to produce proven optimal solutions for a large number of problems, and gives a tight approximation of the optimum in the remaining cases.

Logistics involves planning, managing, and organizing the flows of goods from the point of origin to the point of destination in order to meet some requirements. Logistics and transportation aspects are very important and represent a relevant costs for producing and shipping companies, but also for public administration and private citizens. The optimization of resources and the improvement in the organization of operations is crucial for all branches of logistics, from the operation management to the transportation. As we will have the chance to see in this work, optimization techniques, models, and algorithms represent important methods to solve the always new and more complex problems arising in different segments of logistics. Many operation management and transportation problems are related to the optimization class of problems called Vehicle Routing Problems (VRPs). In this work, we consider several real-world deterministic and stochastic problems that are included in the wide class of the VRPs, and we solve them by means of exact and heuristic methods. We treat three classes of real-world routing and logistics problems. We deal with one of the most important tactical problems that arises in the managing of the bike sharing systems, that is the Bike sharing Rebalancing Problem (BRP). We propose models and algorithms for real-world earthwork optimization problems. We describe the 3DP process and we highlight several optimization issues in 3DP. Among those, we define the problem related to the tool path definition in the 3DP process, the 3D Routing Problem (3DRP), which is a generalization of the arc routing problem. We present an ILP model and several heuristic algorithms to solve the 3DRP.

Detta är en rapport om framtagningen av ett samlingsverktyg som ska underlätta arbetet med mångkultur, för förskollärare, i grupper med låg heterogenitet. Verktyget består av ett instruktionshäfte med tillhörande världskarta och bilder på maträtter. Med hjälp av diskussioner om mat och dess ursprung kommer förhoppningsvis medvetenheten kring omvärlden och kulturer i barngruppen öka. Jag har utgått ifrån tidigare forskning om mångkultur och samlingar i förskolan i framställandet av verktyget. Syftet med detta arbete är att utveckla en produkt vars mål är att underlätta arbetet för förskolläraren, med mångkultur i grupper med låg heterogenitet. Frågeställning: Hur kan man, med hjälp av mat, underlätta arbetet med mångkultur för förskollärare?

In this thesis we study selected topics in the field of Mixed Integer Programming (MIP), in particular Mixed Integer Linear and Nonlinear Programming (MI(N)LP). We set a focus on the influences of Constraint Programming (CP). First, we analyze Mathematical Programming approaches to water network optimization, a set of challenging optimization problems frequently modeled as non-convex MINLPs. We give detailed descriptions of many variants and survey solution approaches from the literature. We are particularly interested in MILP approximations and present a respective computational study for water network design problems. We analyze this approach by algorithmic considerations and highlight the importance of certain convex substructures in these non-convex MINLPs. We further derive valid inequalities for water network design problems exploiting these substructures. Then, we treat Mathematical Programming problems with indicator constraints, recalling their most popular reformulation techniques in MIP, leading to either big-M constraints or disjunctive programming techniques. The latter give rise to reformulations in higher-dimensional spaces, and we review special cases from the literature that allow to describe the projection on the original space of variables explicitly. We theoretically extend the respective results in two directions and conduct computational experiments. We then present an algorithm for MILPs with indicator constraints that incorporates elements of CP into MIP techniques, including computational results for the JobShopScheduling problem. Finally, we introduce an extension of the class of MILPs so that linear expressions are allowed to have non-contiguous domains. Inspired by CP, this permits to model holes in the domains of variables as a special case. For such problems, we extend the theory of split cuts and show two ways of separating them, namely as intersection and lift-and-project cuts, and present computational results. We further experiment with an exact algorithm for such problems, applied to the Traveling Salesman Problem with multiple time windows.

In this thesis we deal with two problems of resource allocation solved through a Mixed-Integer Linear Programming approach and a Mixed-Integer Nonlinear Chance Constraint Programming approach. In the first part we propose a framework to model general guillotine restrictions in two dimensional cutting problems formulated as Mixed-Integer Linear Programs (MILP). The modeling framework requires a pseudo-polynomial number of variables and constraints, which can be effectively enumerated for medium-size instances. Our modeling of general guillotine cuts is the first one that, once it is implemented within a state of-the-art MIP solver, can tackle instances of challenging size. Our objective is to propose a way of modeling general guillotine cuts via Mixed Integer Linear Programs (MILP), i.e., we do not limit the number of stages (restriction (ii)), nor impose the cuts to be restricted (restriction (iii)). We only ask the cuts to be guillotine ones (restriction (i)). We mainly concentrate our analysis on the Guillotine Two Dimensional Knapsack Problem (G2KP), for which a model, and an exact procedure able to significantly improve the computational performance, are given. In the second part we present a Branch-and-Cut algorithm for a class of Nonlinear Chance Constrained Mathematical Optimization Problems with a finite number of scenarios. This class corresponds to the problems that can be reformulated as Deterministic Convex Mixed-Integer Nonlinear Programming problems, but the size of the reformulation is large and quickly becomes impractical as the number of scenarios grows. We apply the Branch-and-Cut algorithm to the Mid-Term Hydro Scheduling Problem, for which we propose a chance-constrained formulation. A computational study using data from ten hydro plants in Greece shows that the proposed methodology solves instances orders of magnitude faster than applying a general-purpose solver for Convex Mixed-Integer Nonlinear Problems to the deterministic reformulation, and scales much better with the number of scenarios.

This study concerns teachers’ use of digital technologies in student assessment, and how the learning that is developed through the use of technology in mathematics can be evaluated. Nowadays math teachers use digital technologies in their teaching, but not in student assessment. The activities carried out with technology are seen as ‘extra-curricular’ (by both teachers and students), thus students do not learn what they can do in mathematics with digital technologies. I was interested in knowing the reasons teachers do not use digital technology to assess students’ competencies, and what they would need to be able to design innovative and appropriate tasks to assess students’ learning through digital technology. This dissertation is built on two main components: teachers and task design. I analyze teachers’ practices involving digital technologies with Ruthven’s Structuring Features of Classroom Practice, and what relation these practices have to the types of assessment they use. I study the kinds of assessment tasks teachers design with a DGE (Dynamic Geometry Environment), using Laborde’s categorization of DGE tasks. I consider the competencies teachers aim to assess with these tasks, and how their goals relate to the learning outcomes of the curriculum. This study also develops new directions in finding how to design suitable tasks for student mathematical assessment in a DGE, and it is driven by the desire to know what kinds of questions teachers might be more interested in using. I investigate the kinds of technology-based assessment tasks teachers value, and the type of feedback they give to students. Finally, I point out that the curriculum should include a range of mathematical and technological competencies that involve the use of digital technologies in mathematics, and I evaluate the possibility to take advantage of technology feedback to allow students to continue learning while they are taking a test.

The subject of this work concerns the study of the immigration phenomenon, with emphasis on the aspects related to the integration of an immigrant population in a hosting one. Aim of this work is to show the forecasting ability of a recent finding where the behavior of integration quantifiers was analyzed and investigated with a mathematical model of statistical physics origins (a generalization of the monomer dimer model). After providing a detailed literature review of the model, we show that not only such a model is able to identify the social mechanism that drives a particular integration process, but it also provides correct forecast. The research reported here proves that the proposed model of integration and its forecast framework are simple and effective tools to reduce uncertainties about how integration phenomena emerge and how they are likely to develop in response to increased migration levels in the future.

No description available.

In this thesis, we focus on mathematical optimization models and algorithms for solving routing and logistic problems. The first contribution regards a path and mission planning problem, called Carrier-Vehicle Traveling Salesman Problem (CVTSP), for a system of heterogeneous vehicles. A Mixed-Integer Second Order Conic Programming (MISOCP) model and a Benders-like enumeration algorithm are presented for solving CVTSP. The second work concerns a class of routing problems, referred to as Interceptor Vehicle Routing Problems (IVRPs). They generalize VRPs in the sense that target points are allowed to move from their initial location according to a known motion. We present a novel MISOCP formulation and a Branch-and-Price algorithm based on a Lagrangian Relaxation of the vehicle-assignment constraints. Other two contributions focus on waste flow management problems: the former considers a deterministic setting in which a Mixed-Integer Linear Programming (MILP) formulation is used as a Decision Support System for a real-world waste operator, whereas the latter deals with the uncertainty of the waste generation amounts by means of Two-Stage Multiperiod Stochastic Mixed-Integer Programming formulations. Finally, we give an overview on the optimization challenges arising in electric car-sharing systems, both at strategic and tactical planning level.