Integrated dial-a-ride and fixed route transit in Ann Arbor, Michigan. Final report.

Urban Mass Transportation Administration, Washington, D.C.

A Ride-Sharing System with High Capacity Vehicles and Flexible Meeting Points

In many major cities, fixed route transit systems such as bus and rail serve millions of trips per day. These systems have people collect at common locations (the station or stop), and board at common times (for example according to a predetermined schedule or headway). By using common service locations and times, these modes can consolidate many trips that have similar origins and destinations or overlapping routes. However, the routes are not sensitive to changing travel patterns, and have no way of identifying which trips are going unserved, or are poorly served, by the existing routes. On the opposite end of the spectrum, personal modes of transportation, such as a private vehicle or taxi, offer service to and from the exact origin and destination of a rider, at close to exactly the time they desire to travel. Despite the apparent increased convenience to users, the presence of a large number of small vehicles results in a disorganized, and potentially congested road network during high demand periods. The focus of the research presented in this paper is to develop a system that possesses both the on-demand nature of a personal mode, with the efficiency of shared modes. In this system, users submit their request for travel, but are asked to make small compromises in their origin and destination location by walking to a nearby meeting point, as well as slightly modifying their time of travel, in order to accommodate other passengers. Because the origin and destination location of the request can be adjusted, this is a more general case of the Dial-a-Ride problem with time windows. The solution methodology uses a graph clustering algorithm coupled with a greedy insertion technique. A case study is presented using actual requests for taxi trips in Washington DC, and shows a significant decrease in the number of vehicles required to serve the demand.

Optimização do transporte de doentes num serviço porta à porta

Dissertação para obtenção do Grau de Mestre em Engenharia Informática

Desenvolvimento de um modelo computacional para a ampliação do atendimento do Programa de Acessibilidade Especial Porta a Porta - PRAE

Worldwide, the demand for transportation services for persons with disabilities, the elderly, and persons with reduced mobility have increased in recent years. The population is aging, governments need to adapt to this reality, and this fact could mean business opportunities for companies. Within this context is inserted the Programa de Acessibilidade Especial porta a porta PRAE, a door to door public transportation service from the city of Natal-RN in Brazil. The research presented in this dissertation seeks to develop a programming model which can assist the process of decision making of managers of the shuttle. To that end, it was created an algorithm based on methods of generating approximate solutions known as heuristics. The purpose of the model is to increase the number of people served by the PRAE, given the available fleet, generating optimized schedules routes. The PRAE is a problem of vehicle routing and scheduling of dial-a-ride - DARP, the most complex type among the routing problems. The validation of the method of resolution was made by comparing the results derived by the model and the currently programming method. It is expected that the model is able to increase the current capacity of the service requests of transport

Contributions to exact approaches in combinatorial optimization

The focus of this thesis is to contribute to the development of new, exact solution approaches to different combinatorial optimization problems. In particular, we derive dedicated algorithms for a special class of Traveling Tournament Problems (TTPs), the Dial-A-Ride Problem (DARP), and the Vehicle Routing Problem with Time Windows and Temporal Synchronized Pickup and Delivery (VRPTWTSPD). Furthermore, we extend the concept of using dual-optimal inequalities for stabilized Column Generation (CG) and detail its application to improved CG algorithms for the cutting stock problem, the bin packing problem, the vertex coloring problem, and the bin packing problem with conflicts. In all approaches, we make use of some knowledge about the structure of the problem at hand to individualize and enhance existing algorithms. Specifically, we utilize knowledge about the input data (TTP), problem-specific constraints (DARP and VRPTWTSPD), and the dual solution space (stabilized CG). Extensive computational results proving the usefulness of the proposed methods are reported.

Justified Fault-Ride-Through Requirements for Wind Turbines in Power Systems

In this paper, a novel adaptive strategy to obtain technically justified fault-ride-through requirements for wind turbines (WTs) is proposed. The main objective is to promote an effective integration of wind turbines into power systems with still low penetration levels of wind power based on technical and economical considerations. The level of requirement imposed by the strategy is increased stepwise over time, depending on system characteristics and on wind power penetration level. The idea behind is to introduce stringent requirements only when they are technically needed for a reliable and secure power system operation. Voltage stability support and fault-ride-through requirements are considered in the strategy. Simulations are based on the Chilean transmission network, a midsize isolated power system with still low penetration levels of wind power. Simulations include fixed speed induction generators and doubly fed induction generators. The effects on power system stability of the wind power injections, integrated into the network by adopting the adaptive strategy, are compared with the effects that have the same installed capacity of wind power but only considering WTs able to fulfill stringent requirements (fault-ride-through capability and support voltage stability). Based on simulations and international experience, technically justified requirements for the Chilean case are proposed.

Contributo dos sistemas de informação geográfica para a mobilidade elétrica : localização de áreas ótimas para Park&Ride baseadas na rede do metro do Porto

Dissertação de mestrado em Gestão do Território na especialidade de Deteção Remota e Sistemas de Informação Geográfica

Dial behavioral responses of Metamysidopsis elongata atlantica (Crustacea, Mysida) to gradients of salinity and temperature

Metamysidopsis atlantica elongata (Bascescu, 1968) is a common mysid in the surf zone of sandy beaches from the state of Rio Grande do Sul, Brazil, where it is frequently recorded forming dense aggregations. Trough laboratory trials, behavioral responses to salinity (10, 20, 25, 28, 30, 40 e 45), temperature (10, 15, 20, 30±1ºC) and light (yes/no) were tested using adult males, adult females and juveniles. Although there was no response to temperature, the species showed clear response to salinity and light. In the presence of light, organisms remained in the bottom of the aquaria, but moved to surface when bottom salinities were increased. In the absence of light, adults moved to the surface. However, juveniles moved down to or remained on the bottom, maybe as a response to avoid adult predation.

[Archives de la Parole]. , Chant populaire d'étudiants : gujarātī (dial. bhīlī), indo-aryen / [Sir George Grierson], éd. ; Linguistic survey of India ; [Lala Teja et Amthabai Dhanjabhai], choeur (hommes)

[Traditions. Asie. Inde. Présidence de Bombay. État du Gujarat. Ahmadabad]

[Archives de la Parole]. , Fable : gujarātī (dial. bhīlī), indo-aryen / [Sir George Grierson], éd. ; Linguistic survey of India ; [Lala Teja], voix

[Traditions. Asie. Inde. Présidence de Bombay. État du Gujarat. Ahmadabad]

Consumer Advisory Bulletin, "Dial 10-10" -- But Only if You Know all the Details, June 2005

The Attorney General’s Consumer Protection Division receives hundreds of calls and consumer complaints every year. Follow these tips to avoid unexpected expense and disappointments. This record is about: "Dial 10-10" -- But Only if You Know all the Details

Consumer Advisory: Buying a Used Vehicle? Don’t Get Taken for a Ride!, May 2013

The Attorney General’s Consumer Protection Division receives hundreds of calls and consumer complaints every year. Follow these tips to avoid unexpected expense and disappointments. This record is about:Buying a Used Vehicle? Don’t Get Taken for a Ride!