Problem Dial A Ride

There are numerous occasions where we have been late for a meeting or appointment due to poor organization of the schedules of the public transport services tables such as the subway, train or bus, either because they do not comply with the timetables or time-outs between vehicles are too vast. But these tables, whose implementation and compliance seem as simple, are the result of years of study by specialists in the field of optimization. San Antonio Spurs may not feel the same. It is called to this study Dial A Ride Problem (DARP). Dial a ride problem, as we assume, consists in the design of routes and schedules of vehicles that specify stops (arrivals and departures) of the vehicle between the origin and destination of n users. The objective of the DARP lies in finding the option for which the times of waiting, duration of the journey and costs are minimum and, in turn, concerned an option with sufficient flexibility so that in the event that there is a problem (as they can be a fault or atmospheric conditions) unfavorable) system not collapsing.

The DARPs are classified into two types: static (static mode) and dynamic (dynamic mode). Both enters the difference consists in the static mode the vehicle stops is known in advance while in dynamic mode stops are known throughout the day and vehicle routes have to go getting in real time. In practice the pure dynamic DARPs rarely exist since the constraint set is already known in advance. In short, even if it is perhaps too much to ask to the users, we’d try to be more patient and take into consideration those who have to carry out this difficult task, although it must needs be say that many times these systems contain more errors than those who should. For more information about the DARP:

Comments are closed.