Search results for " Programming"
showing 10 items of 1616 documents
Generating Executable Code from High-Level Social or Socio-Ecological Model Descriptions
2019
Agent-Based Modelling has been used for social simulation because of the several benefits it entails. Social models are often constructed by inter-disciplinary teams that include subject-matter experts with no programming skills. These experts are typically involved in the creation of the conceptual model, but not the verification or validation of the simulation model. The Overview, Design concepts, and Details (ODD) protocol has emerged as a way of presenting a model at a high level of abstraction and as an effort towards improving the reproducibility of Agent-Based Models (ABMs) but it is typically written after a model has been completed. This paper reverses the process and provides non-…
Sensorial discourse and corpus in the digital humanities era: The example of the wine language
2019
International audience; This article intends to define sensorial discourses, to discuss the way they should be analyzed by stressing the importance of corpora. Putting these thoughts into the context of the digital revolution, it will show how corpora should evolve in the digital humanities. The association of digital and sensorial discourses needs to be clarified and this article proposes a way to find new approaches to better analyze them.
Some reflections on semantic–pragmatic cycles
2020
Abstract This paper explores novel ways to consider semantic–pragmatic cycles using a dual strategy: an inwards strategy, whereby the distinctive traits of a pragmatic cycle are established, and an outwards strategy, whereby the categories that delimit semantic–pragmatic cycles are described. The result of this exploration is the distinction between “pragmatic cycle”, “replication”, “concomitance” and “paradigmatic increase” as four different yet related processes. In addition, this study integrates Construction Grammar into the description of each process and shows that the study of semantic–pragmatic cycles can benefit from a constructional approach, adopting Traugott and Trousdale’s (201…
A reflection on the translation of sex-related language in audio-visual texts: the Spanish version of J.K. Rowling’sThe Casual Vacancy
2018
Studies on the way sex-related language has been approached in audio-visual translation are still rather limited. This article documents the range of solutions given in Spanish to the sex-related l...
Reducing disruptive behaviours and improving classroom behavioural climate with class-wide positive behaviour support in middle schools
2017
Disruptive behaviour in classrooms is a significant challenge for learning in schools and a risk factor for students’ academic achievement and a significant source of teachers’ work-related stress. Earlier research shows that clear behavioural expectations, monitoring students’ adherence to them and behaviour-specific praise are effective practices to reduce disruptive behaviour. Although behaviour problems are common in middle schools, most of the interventions have been developed and studied in elementary schools. This randomised study evaluated the effects of a class-wide intervention on classroom behavioural climate and disruptive behaviour, on teacher-experienced stress and on the time…
Variable Fixing for Two-Arc Sequences in Branch-Price-and-Cut Algorithms on Path-Based Models
2020
Variable fixing by reduced costs is a popular technique for accelerating the solution process of mixed-integer linear programs. For vehicle-routing problems solved by branch-price-and-cut algorithms, it is possible to fix to zero the variables associated with all routes containing at least one arc from a subset of arcs determined according to the dual solution of a linear relaxation. This is equivalent to removing these arcs from the network used to generate the routes. In this paper, we extend this technique to routes containing sequences of two arcs. Such sequences or their arcs cannot be removed directly from the network because routes traversing only one arc of a sequence might still b…
Relative Reachability Analysis as a Tool for Urban Mobility Planning
2019
There is a plethora of user-oriented route planning applications and systems that enable the computation of the fastest journey between two locations using different transportation modes, e.g., car, public transport, walking, bicycle. While useful for individuals, they are of limited interest to a class of users that may be interested in a more global and comparative view of transportation systems in general. In this context, we adopt the view of an urban planner. Urban planners may be interested in queries such as "if a new transit stop was to be introduced in a given location, would that bring the travel time to a given point-of-interest (POI) or area-of-interest (AOI) by bus closer to th…
A more efficient cutting planes approach for the green vehicle routing problem with capacitated alternative fuel stations
2021
AbstractThe Green Vehicle Routing Problem with Capacitated Alternative Fuel Stations assumes that, at each station, the number of vehicles simultaneously refueling cannot exceed the number of available pumps. The state-of-the-art solution method, based on the generation of all feasible non-dominated paths, performs well only with up to 2 pumps. In fact, it needs cloning the paths between every pair of pumps. To overcome this issue, in this paper, we propose new path-based MILP models without cloning paths, for both the scenario with private stations (i.e., owned by the fleet manager) and that with public stations. Then, a more efficient cutting plane approach is designed for addressing both…
Exact solution of the soft-clustered vehicle-routing problem
2020
Abstract The soft-clustered vehicle-routing problem (SoftCluVRP) extends the classical capacitated vehicle-routing problem by one additional constraint: The customers are partitioned into clusters and feasible routes must respect the soft-cluster constraint, that is, all customers of the same cluster must be served by the same vehicle. In this article, we design and analyze different branch-and-price algorithms for the exact solution of the SoftCluVRP. The algorithms differ in the way the column-generation subproblem, a variant of the shortest-path problem with resource constraints (SPPRC), is solved. The standard approach for SPPRCs is based on dynamic-programming labeling algorithms. We s…
New exact methods for the time-invariant berth allocation and quay crane assignment problem
2019
Abstract Efficient management of operations in seaport container terminals has become a critical issue, due to the increase in maritime traffic and the strong competition between ports. In this paper we focus on two seaside operational problems: the Berth Allocation Problem and the Quay Crane Assignment Problem, which are considered in an integrated way. For the continuous BACAP problem with time-invariant crane assignment we propose a new mixed integer linear model in which the vessels can be moored at any position on the quay, not requiring any quay discretization. The model is enhanced by adding several families of valid inequalities. The resulting model is able to solve instances with u…