Alta velocidad ferroviaria en California(USA): cuarta parte (IV) Fresno-Sacramento (Roseville) = High speed railway in California (USA): fourth part (IV) Fresno-Sacramento (Roseville)

Implantación de la Red de Alta velocidad Ferroviaria en California. Tramo Fresno-Sacramento. El presente articúlo es la cuarta parte de la serie "Alta Velocidad Ferroviaria en California (CHSRS)". Recoge la Alternativa "Stockton Arch", que el Proyecto FARWEST presenta a la prevista por la Authority (CHSRA), para la Línea HSR Fresno-Sacramento, en programación y en trazado. Éste discurre, desde la gran Terminal de Fresno (implantada en las afueras al suroeste de la ciudad) por el segmento sur del "mar interior" (que en el Terciario Superior ocupaba el actual Valle Central), hasta Stockton, y por el segmento norte, hasta Sacramento. El Paet de Ripperdan (~ pK 40) queda conectado por carretera con el PAET de Oroloma de la Línea HSR Fresno-San Francisco (Golden Gate Alternative). La última parte del trazado de la Línea HSR Fresno-Sacramento (Stockton Arch Alternative), coincide en alineación y rasante con la Línea HSR San Francisco-Sacramento (Crossing Bay Alternative) a la altura de Roseville, donde se emplaza la gran terminal norte de la red de California, desde la que se unirá ésta con la de Nevada, por Reno. This article forras the fourth part of the series entitled "High Speed Railway in California (CHSRS)". It addresses the "Stockton Arch" alternative, which the FARWESTProjectpresents in scheduling and in alignment as to that provided for by the Authority (CHSRA) for the Fresno-Sacramento HSR Line. The latter runs from the grand Fresno Terminal (located in the outskirts to the southwest ofthe city) through the south segment ofthe "inland sea" (which oceupied the current Central Valley in the Upper Tertiary) to Stockton and through the north segment to Sacramento. The Ripperdan TSAP (post ofpassing and stabling trains), — kilometer point 40, conneets with the Oroloma TSAP ofthe Fresno-San Francisco HSR Line (Golden Gate Alternative) by road. The last part of the Fresno-Sacramento HSR Line alignment (Stockton Arch Alternative), coincides in alignment and grade with the San Francisco-Sacramento HSR Line (Crossing Bay Alternative) at Roseville, where the great north terminal ofthe California network is located, from which the latter will be linked with Nevada s network through Reno.

Train scheduling in high speed railways: considering competitive effects

The railway planning problem is usually studied from two different points of view: macroscopic and microscopic. We propose a macroscopic approach for the high-speed rail scheduling problem where competitive effects are introduced. We study train frequency planning, timetable planning and rolling stock assignment problems and model the problem as a multi-commodity network flow problem considering competitive transport markets. The aim of the presented model is to maximize the total operator profit. We solve the optimization model using realistic probleminstances obtained from the network of the Spanish railwa operator RENFE, including other transport modes in Spain

Train scheduling and rolling stock assignment in high speed trains

The Train Timetabling Problem (TTP) has been widely studied for freight and passenger rail systems. A lesser effort has been devoted to the study of high-speed rail systems. A modeling issue that has to be addressed is to model departure time choice of passengers on railway services. Passengers who use these systems attempt to travel at predetermined hours due to their daily life necessities (e.g., commuter trips). We incorporate all these features into TTP focusing on high-speed railway systems. We propose a Rail Scheduling and Rolling Stock (RSch-RS) model for timetable planning of high-speed railway systems. This model is composed of two essential elements: i) an infrastructure model for representing the railway network: it includes capacity constraints of the rail network and the Rolling-Stock constraints; and ii) a demand model that defines how the passengers choose the departure time. The resulting model is a mixed-integer programming model which objective function attempts to maximize the profit for the rail operator

Integral Bridge for High-Speed Railway

The structural continuity of fully integral bridges entails many advantages and some drawbacks. Among the latter, the cyclic expansions and contractions of the deck caused by seasonal thermal variations impose alternating displacements at the piers and abutments, with effects that may be difficult to establish reliably. The advantages include easier construction and cheaper maintenance but, especially, horizontal loads can be transmitted to the ground in a much better way than in conventional bridges. This paper first presents a methodology for dealing with the problems that the cyclic displacements imposed raise at the abutments and at the bridge piers. At the former, large pressures may develop, possibly accompanied by undesirable surface settlements. At the latter, the degree of cracking and the ability to carry the specified loads may be in question. Having quantified the drawbacks, simplified but realistic analyses are conducted of the response of an integral bridge to braking and seismic loads. It is shown that integral bridges constitute an excellent alternative in the context of the requirements posed by new high-speed railway lines.

A simplified approach to determine aerodynamic damping of railway overheads

The railway overhead (or catenary) is the system of cables responsible for providing electric current to the train. This system has been reported as wind-sensitive (Scanlon et al., 2000), and particularly to the occurrence of galloping phenomena. Galloping phenomena of the railway overhead consists of undamped cable oscillations triggered by aerodynamic forces acting on the contact wire. As is well known, aerodynamic loads on the contact wire depends on the incident flow mean velocity and the angle of attack. The presence of embankments or hills modifies both vertical velocities profiles and angles of attack of the flow (Paiva et al., 2009). The presence of these cross-wind related oscillations can interfere with the safe operation of the railway service (Johnson, 1996). Therefore a correct modelling of the phenomena is required to avoid these unwanted oscillations.

Performance of Scheduling Policies in Adversarial Networks with Non-synchronized Clocks

In this paper we generalize the Continuous Adversarial Queuing Theory (CAQT) model (Blesa et al. in MFCS, Lecture Notes in Computer Science, vol. 3618, pp. 144–155, 2005) by considering the possibility that the router clocks in the network are not synchronized. We name the new model Non Synchronized CAQT (NSCAQT). Clearly, this new extension to the model only affects those scheduling policies that use some form of timing. In a first approach we consider the case in which although not synchronized, all clocks run at the same speed, maintaining constant differences. In this case we show that all universally stable policies in CAQT that use the injection time and the remaining path to schedule packets remain universally stable. These policies include, for instance, Shortest in System (SIS) and Longest in System (LIS). Then, we study the case in which clock differences can vary over time, but the maximum difference is bounded. In this model we show the universal stability of two families of policies related to SIS and LIS respectively (the priority of a packet in these policies depends on the arrival time and a function of the path traversed). The bounds we obtain in this case depend on the maximum difference between clocks. This is a necessary requirement, since we also show that LIS is not universally stable in systems without bounded clock difference. We then present a new policy that we call Longest in Queues (LIQ), which gives priority to the packet that has been waiting the longest in edge queues. This policy is universally stable and, if clocks maintain constant differences, the bounds we prove do not depend on them. To finish, we provide with simulation results that compare the behavior of some of these policies in a network with stochastic injection of packets.

Dynamic analysis using finite elements to calculate the critical wear section of the contact wire in suburban railway overhead conductor rails

The purpose of this study is to determine the critical wear levels of the contact wire of the catenary on metropolitan lines. The study has focussed on the zones of contact wire where localised wear is produced, normally associated with the appearance of electric arcs. To this end, a finite element model has been developed to study the dynamics of pantograph-catenary interaction. The model includes a zone of localised wear and a singularity in the contact wire in order to simulate the worst case scenario from the point of view of stresses. In order to consider the different stages in the wire wear process, different depths and widths of the localised wear zone were defined. The results of the dynamic simulations performed for each stage of wear let the area of the minimum resistant section of the contact wire be determined for which stresses are greater than the allowable stress. The maximum tensile stress reached in the contact wire shows a clear sensitivity to the size of the local wear zone, defined by its width and depth. In this way, if the wear measurements taken with an overhead line recording vehicle are analysed, it will be possible to calculate the potential breakage risk of the wire. A strong dependence of the tensile forces of the contact wire has also been observed. These results will allow priorities to be set for replacing the most critical sections of wire, thereby making maintenance much more efficient. The results obtained show that the wire replacement criteria currently borne in mind have turned out to be appropriate, although in some wear scenarios these criteria could be adjusted even more, and so prolong the life cycle of the contact wire.

Comparison of vibration and rolling noise emission of resilient and solid monobloc railway wheels in underground lines

Flat or worn wheels rolling on rough or corrugated tracks can provoke airborne noise and ground-borne vibration, which can be a serious concern for nearby neighbours of urban rail transit lines. Among the various treatments used to reduce vibration and noise, resilient wheels play an important role. In conventional resilient wheels, a slightly prestressed V­shaped rubber ring is mounted between the steel wheel centre and tyre. The elastic layer enhances rolling noise and vibration suppression, as well as impact reduction on the track. In this paper the effectiveness of resilient wheels in underground lines, in comparison to monobloc ones, is assessed. The analysed resilient wheel is able to carry greater loads than standard resilient wheels used for light vehicles. It also presents a greater radial resiliency and a higher axial stiffness than conventional V­wheels. The finite element method was used in this study. A quarter car model was defined, in which the wheelset was modelled as an elastic body. Several simulations were performed in order to assess the vibrational behaviour of elastic wheels, including modal, harmonic and random vibration analysis, the latter allowing the introduction of realistic vertical track irregularities, as well as the influence of the running speed. Due to numerical problems some simplifications were needed. Parametric variations were also performed, in which the sensitivity of the whole system to variations of rubber prestress and Poisson’s ratio of the elastic material was assessed.Results are presented in the frequency domain, showing a better performance of the resilient wheels for frequencies over 200 Hz. This result reveals the ability of the analyzed design to mitigate rolling noise, but not structural vibrations, which are primarily found in the lower frequency range.

Tiled Projector Displays Correction for Dark Scenes in Railway Simulators

Tiled projector displays are a common choice for training simulators, where a high resolution output image is required. They are cheap for the resolution that they can reach and can be configured in many different ways. Nevertheless, such kinds of displays require geometric and color correction so that the composite image looks seamless. Display correction is an even bigger challenge when the projected images include dark scenes combined with brighter scenes. This is usually a problem for railway simulators when the train is positioned inside a tunnel and the black offset effect becomes noticeable. In this paper, a method for fast photometric and geometric correction of tiled display systems where dark and bright scenes are combined is presented. The image correction is carried out in two steps. First, geometric alignment and overlapping areas attenuation for brighter scenes is applied. Second, in the event of being inside a tunnel, the brightness of the scene is increased in certain areas using light sources in order to create the impression of darkness but minimizing the effect of the black offset

Dynamic effect of high speed railway traffic loads on the ballast track settlement

The traditional ballast track structures are still being used in high speed railways lines with success, however technical problems or performance features have led to non-ballast track solution in some cases. A considerable maintenance work is needed for ballasted tracks due to the track deterioration. Therefore it is very important to understand the mechanism of track deterioration and to predict the track settlement or track irregularity growth rate in order to reduce track maintenance costs and enable new track structures to be designed. The objective of this work is to develop the most adequate and efficient models for calculation of dynamic traffic load effects on railways track infrastructure, and then evaluate the dynamic effect on the ballast track settlement, using a ballast track settlement prediction model, which consists of the vehicle/track dynamic model previously selected and a track settlement law. The calculations are based on dynamic finite element models with direct time integration, contact between wheel and rail and interaction with railway cars. A initial irregularity profile is used in the prediction model. The track settlement law is considered to be a function of number of loading cycles and the magnitude of the loading, which represents the long-term behavior of ballast settlement. The results obtained include the track irregularity growth and the contact force in the final interaction of numerical simulation

Dynamic Analysis of high Speed Railway Traffic Loads on Ballasted Track

This paper reports the studies carried out to develop and calibrate the optimal models for the objectives of this work. In particular, quarter bogie model for vehicle, rail-wheel contact with Lagrangian multiplier method, 2D spatial discretization were selected as the optimal decisions. Furthermore, the 3D model of coupled vehicle-track also has been developed to contrast the results obtained in the 2D model. The calculations were carried out in the time domain and envelopes of relevant results were obtained for several track profiles and speed ranges. Distributed elevation irregularities were generated based on power spectral density (PSD) distributions. The results obtained include the wheel-rail contact forces, forces transmitted to the bogie by primary suspension. The latter loads are relevant for the purpose of evaluating the performance of the infrastructure

Safety-related issues for high-speed railway bridges

Railway bridges have specific requirements related to safety, which often are critical aspects of design. In this paper the main phenomena are reviewed, namely vertical dynamic effects for impact effect of moving loads and resonance in high-speed, service limit states which affect the safety of running traffic, and lateral dynamic effects.

Performance of Scheduling Policies in Adversarial Networks with Non-synchronized Clocks

In this paper we generalize the Continuous Adversarial Queuing Theory (CAQT) model (Blesa et al. in MFCS, Lecture Notes in Computer Science, vol. 3618, pp. 144–155, 2005) by considering the possibility that the router clocks in the network are not synchronized. We name the new model Non Synchronized CAQT (NSCAQT). Clearly, this new extension to the model only affects those scheduling policies that use some form of timing. In a first approach we consider the case in which although not synchronized, all clocks run at the same speed, maintaining constant differences. In this case we show that all universally stable policies in CAQT that use the injection time and the remaining path to schedule packets remain universally stable. These policies include, for instance, Shortest in System (SIS) and Longest in System (LIS). Then, we study the case in which clock differences can vary over time, but the maximum difference is bounded. In this model we show the universal stability of two families of policies related to SIS and LIS respectively (the priority of a packet in these policies depends on the arrival time and a function of the path traversed). The bounds we obtain in this case depend on the maximum difference between clocks. This is a necessary requirement, since we also show that LIS is not universally stable in systems without bounded clock difference. We then present a new policy that we call Longest in Queues (LIQ), which gives priority to the packet that has been waiting the longest in edge queues. This policy is universally stable and, if clocks maintain constant differences, the bounds we prove do not depend on them. To finish, we provide with simulation results that compare the behavior of some of these policies in a network with stochastic injection of packets.

Energy and power aware scheduling algorithm modeling for battery powered embedded systems

Energy management has always been recognized as a challenge in mobile systems, especially in modern OS-based mobile systems where multi-functioning are widely supported. Nowadays, it is common for a mobile system user to run multiple applications simultaneously while having a target battery lifetime in mind for a specific application. Traditional OS-level power management (PM) policies make their best effort to save energy under performance constraint, but fail to guarantee a target lifetime, leaving the painful trading off between the total performance of applications and the target lifetime to the user itself. This thesis provides a new way to deal with the problem. It is advocated that a strong energy-aware PM scheme should first guarantee a user-specified battery lifetime to a target application by restricting the average power of those less important applications, and in addition to that, maximize the total performance of applications without harming the lifetime guarantee. As a support, energy, instead of CPU or transmission bandwidth, should be globally managed as the first-class resource by the OS. As the first-stage work of a complete PM scheme, this thesis presents the energy-based fair queuing scheduling, a novel class of energy-aware scheduling algorithms which, in combination with a mechanism of battery discharge rate restricting, systematically manage energy as the first-class resource with the objective of guaranteeing a user-specified battery lifetime for a target application in OS-based mobile systems. Energy-based fair queuing is a cross-application of the traditional fair queuing in the energy management domain. It assigns a power share to each task, and manages energy by proportionally serving energy to tasks according to their assigned power shares. The proportional energy use establishes proportional share of the system power among tasks, which guarantees a minimum power for each task and thus, avoids energy starvation on any task. Energy-based fair queuing treats all tasks equally as one type and supports periodical time-sensitive tasks by allocating each of them a share of system power that is adequate to meet the highest energy demand in all periods. However, an overly conservative power share is usually required to guarantee the meeting of all time constraints. To provide more effective and flexible support for various types of time-sensitive tasks in general purpose operating systems, an extra real-time friendly mechanism is introduced to combine priority-based scheduling into the energy-based fair queuing. Since a method is available to control the maximum time one time-sensitive task can run with priority, the power control and time-constraint meeting can be flexibly traded off. A SystemC-based test-bench is designed to assess the algorithms. Simulation results show the success of the energy-based fair queuing in achieving proportional energy use, time-constraint meeting, and a proper trading off between them. La gestión de energía en los sistema móviles está considerada hoy en día como un reto fundamental, notándose, especialmente, en aquellos terminales que utilizando un sistema operativo implementan múltiples funciones. Es común en los sistemas móviles actuales ejecutar simultaneamente diferentes aplicaciones y tener, para una de ellas, un objetivo de tiempo de uso de la batería. Tradicionalmente, las políticas de gestión de consumo de potencia de los sistemas operativos hacen lo que está en sus manos para ahorrar energía y satisfacer sus requisitos de prestaciones, pero no son capaces de proporcionar un objetivo de tiempo de utilización del sistema, dejando al usuario la difícil tarea de buscar un compromiso entre prestaciones y tiempo de utilización del sistema. Esta tesis, como contribución, proporciona una nueva manera de afrontar el problema. En ella se establece que un esquema de gestión de consumo de energía debería, en primer lugar, garantizar, para una aplicación dada, un tiempo mínimo de utilización de la batería que estuviera especificado por el usuario, restringiendo la potencia media consumida por las aplicaciones que se puedan considerar menos importantes y, en segundo lugar, maximizar las prestaciones globales sin comprometer la garantía de utilización de la batería. Como soporte de lo anterior, la energía, en lugar del tiempo de CPU o el ancho de banda, debería gestionarse globalmente por el sistema operativo como recurso de primera clase. Como primera fase en el desarrollo completo de un esquema de gestión de consumo, esta tesis presenta un algoritmo de planificación de encolado equitativo (fair queueing) basado en el consumo de energía, es decir, una nueva clase de algoritmos de planificación que, en combinación con mecanismos que restrinjan la tasa de descarga de una batería, gestionen de forma sistemática la energía como recurso de primera clase, con el objetivo de garantizar, para una aplicación dada, un tiempo de uso de la batería, definido por el usuario, en sistemas móviles empotrados. El encolado equitativo de energía es una extensión al dominio de la energía del encolado equitativo tradicional. Esta clase de algoritmos asigna una reserva de potencia a cada tarea y gestiona la energía sirviéndola de manera proporcional a su reserva. Este uso proporcional de la energía garantiza que cada tarea reciba una porción de potencia y evita que haya tareas que se vean privadas de recibir energía por otras con un comportamiento más ambicioso. Esta clase de algoritmos trata a todas las tareas por igual y puede planificar tareas periódicas en tiempo real asignando a cada una de ellas una reserva de potencia que es adecuada para proporcionar la mayor de las cantidades de energía demandadas por período. Sin embargo, es posible demostrar que sólo se consigue cumplir con los requisitos impuestos por todos los plazos temporales con reservas de potencia extremadamente conservadoras. En esta tesis, para proporcionar un soporte más flexible y eficiente para diferentes tipos de tareas de tiempo real junto con el resto de tareas, se combina un mecanismo de planificación basado en prioridades con el encolado equitativo basado en energía. En esta clase de algoritmos, gracias al método introducido, que controla el tiempo que se ejecuta con prioridad una tarea de tiempo real, se puede establecer un compromiso entre el cumplimiento de los requisitos de tiempo real y el consumo de potencia. Para evaluar los algoritmos, se ha diseñado en SystemC un banco de pruebas. Los resultados muestran que el algoritmo de encolado equitativo basado en el consumo de energía consigue el balance entre el uso proporcional a la energía reservada y el cumplimiento de los requisitos de tiempo real.

Automatic optimization of dynamic scheduling in logic programs

Abstract is not available.