Re: [sumo-user] A question about routeExtension algorithm in taxi servic

[Jakob Erdmann <namdre.sumo@xxxxxxxxx>]

1. There is no objective function. The algorithm is a heuristic for ride sharing that is most suitable for networks with a corridor-like structure.  

2. In each step any free taxi is first assigned to the longest waiting customer. Then any customers which have an overlap with the first customers are added to the dispatch up to the capacity of the taxi..

3. Routing is by fastest path for each customer but routes are extended at the front or the back for sharing customers. This may actually result in a delay for the first customer when the route is extended at the front.

regards,

Jakob

Am Mo., 8. Sept. 2025 um 14:51 Uhr schrieb Seyed Mehdi Meshkani via sumo-user <sumo-user@xxxxxxxxxxx>:

Hello everyone, 

I am using “RouteExtension” method for a shared taxi service. However, I could not find specifications of this method such as: 

1. What is the objective function? 
2. What is the ride matching policy?( i.e. how a new passenger is selected) 
3. What is the routing algorithm when a new passenger is added? (i.e. how the order of passenger for pick-up drop-off changes when a new passenger is selected)

I was wondering if you could provide me with this information. 

Looking forward to hearing from you. 

Regards,

Mehdi

Get Outlook for iOS

_______________________________________________
sumo-user mailing list
sumo-user@xxxxxxxxxxx
To unsubscribe from this list, visit https://www.eclipse.org/mailman/listinfo/sumo-user