I'm trying to implement a simplified version of RAPTOR algorithm for journey planning. Raptor tries to find fastest route based on the arrival and departure time in each stop. There is a concept of a route that is an ordered list of stops that a bus serves, and the trip is an instance of the route where each stop has arrival and departure time. So every route has many trips during the day.

I want to consider the case where buses are very frequent (i.e. passing every 10 seconds!), so you wait a negligible amount of time at a stop. It still takes time to go from stop A to B but when you are at a stop you don't wait at all because the bus is coming. Now we have more trips and raptor may become slower because it takes as input the routes and the trips. I wonder if anyone has implemented something similar in RAPTOR or some graph based approach (Dijkstra, A*...)

  • $\begingroup$ Do you have a specific question? We're a question-and-answer site, so we require you to articulate a specific question in your post. Questions usually end with a question mark. Requests for software packages are off-topic here. We're seeking objectively answerable technical questions about computer science that are likely to be useful to others again in the future. $\endgroup$ – D.W. Mar 1 at 18:38

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.