In many countries across the world, fossil fuels, especially petroleum, are the largest energy source for powering the socio-economic system and the transportation sector dominates the consumption of petroleum in these societies. As the petroleum price continuously climbs and the threat of global climate changes becomes more evident, the world is now facing critical challenges in reducing petroleum consumption and exploiting alternative energy sources. A massive adoption of plug-in electric vehicles (PEVs), especially battery electric vehicles (BEVs), offers a very promising approach to change the current energy consumption structure and diminish greenhouse gas emissions and other pollutants. Understanding how individual electric vehicle drivers behave subject to the technological restrictions and infrastructure availability and estimating the resulting aggregate supply-demand effects on urban transportation systems is not only critical to transportation infrastructure development, but also has determinant implications in environment and energy policy enactment. Driving PEVs inevitably changes individual’s travel and activity behaviors and calls for fundamental changes to the existing transportation network and travel demand modeling paradigms to accommodate changing cost structures, technological restrictions, and supply infrastructures. A prominent phenomenon is that all PEV drivers face a distance constraint on their driving range, given the unsatisfactory battery-charging efficiency and scarce battery-charging infrastructures in a long period of the foreseeable future. Incorporating this distance constraint and the resulting behavioral changes into transportation network equilibrium and travel demand models (static and/or dynamic) raises a series of important research questions. This dissertation focuses on analyzing the impact of a massive adoption of BEVs on urban transportation network flows. BEVs are entirely dependent on electricity and cannot go further once the battery is depleted. As a modeling requirement in its simplest form, a distance constraint should be imposed when analyzing and modeling individual behaviors and network congestions. With adding this simple constraint, this research work conceptualizes, formulates and solves mathematical programming models for a set of new BEV-based network routing and equilibrium problems. It is anticipated that the developed models and methods can be extensively used in a systematic way to analyze and evaluate a variety of system planning and policy scenarios in decision-making circumstances of BEV-related technology adoption and infrastructure development. / text

FlexRay is a new automotive network communication protocol for control and interconnection among ECUs (electronic control units) in the cluster. In the FlexRay protocol, a communication cycle consists of static segment and dynamic segment. The static segment is a TDMA scheme designed for transmitting time-triggered messages. Due to its determinism and reliability, it is particularly applicable to X-by-wire applications. Each static slot is allocated to a specified task and the task can transmit message during the exclusive slot. However, if the task has no message to transmit during its assigned slot, the slot cannot be used by other tasks. The overall utilization is low if the bandwidth requirement of each task is not high. To improve the system utilization, we apply the real-time scheduling techniques to devising a deterministic, static cyclic scheduling. The objective is to reduce the demand on the number of static slots needed for scheduling time-triggered tasks. Specifically, we treat the set of static slots that are in the same position in every communication cycle as an individual real-time channel. We model each task as a real-time task, specified by (Ci,Ti). It requires that for every Ti communication cycles, the system must allocate at least Ci time slots to satisfy the real-time constraint of the task. We decompose each such task into a set of subtasks, allocate them to the real-time channels and then apply the rate-monotonic scheduling algorithm to schedule the subtasks within each channel. Finally, we perform computer simulation to evaluate the effectiveness of our proposal. From the simulation results, we conclude that our proposal is able to effectively reduce the demand for the static slots under a wide range of real-time requirements.

We study in this thesis three well known global constraints. The All-Different constraint restricts a set of variables to be assigned to distinct values. The <em>global cardinality constraint</em> (GCC) ensures that a value <em>v</em> is assigned to at least <em>l_v</em> variables and to at most <em>u_v</em> variables among a set of given variables where <em>l_v</em> and <em>u_v</em> are non-negative integers such that <em>l_v</em> &le; <em>u_v</em>. The Inter-Distance constraint ensures that all variables, among a set of variables <em>x</em>₁, . . . , <em>x_n</em>, are pairwise distant from <em>p</em>, i. e. |<em>x_i</em> - <em>x_j</em>| &ge; <em>p</em> for all <em>i</em> &ne; <em>j</em>. The All-Different constraint, the GCC, and the Inter-Distance constraint are largely used in scheduling problems. For instance, in scheduling problems where tasks with unit processing time compete for a single resource, we have an All-Different constraint on the starting time variables. When there are <em>k</em> resources, we have a GCC with <em>l_v</em> = 0 and <em>u_v</em> = <em>k</em> over all starting time variables. Finally, if tasks have processing time <em>t</em> and compete for a single resource, we have an Inter-Distance constraint with <em>p</em> = <em>t</em> over all starting time variables. We present new propagators for the All-Different constraint, the GCC, and the Inter-Distance constraint i. e. , new filtering algorithms that reduce the search space according to these constraints. For a given consistency, our propagators outperform previous propagators both in practice and in theory. The gains in performance are achieved through judicious use of advanced data structures combined with novel results on the structural properties of the constraints.

We study in this thesis three well known global constraints. The All-Different constraint restricts a set of variables to be assigned to distinct values. The <em>global cardinality constraint</em> (GCC) ensures that a value <em>v</em> is assigned to at least <em>l_v</em> variables and to at most <em>u_v</em> variables among a set of given variables where <em>l_v</em> and <em>u_v</em> are non-negative integers such that <em>l_v</em> &le; <em>u_v</em>. The Inter-Distance constraint ensures that all variables, among a set of variables <em>x</em>₁, . . . , <em>x_n</em>, are pairwise distant from <em>p</em>, i. e. |<em>x_i</em> - <em>x_j</em>| &ge; <em>p</em> for all <em>i</em> &ne; <em>j</em>. The All-Different constraint, the GCC, and the Inter-Distance constraint are largely used in scheduling problems. For instance, in scheduling problems where tasks with unit processing time compete for a single resource, we have an All-Different constraint on the starting time variables. When there are <em>k</em> resources, we have a GCC with <em>l_v</em> = 0 and <em>u_v</em> = <em>k</em> over all starting time variables. Finally, if tasks have processing time <em>t</em> and compete for a single resource, we have an Inter-Distance constraint with <em>p</em> = <em>t</em> over all starting time variables. We present new propagators for the All-Different constraint, the GCC, and the Inter-Distance constraint i. e. , new filtering algorithms that reduce the search space according to these constraints. For a given consistency, our propagators outperform previous propagators both in practice and in theory. The gains in performance are achieved through judicious use of advanced data structures combined with novel results on the structural properties of the constraints.

No description available.