Hello Jakob,
Thank you very much for the recommendation. I will apply such an algorithm
and let you know if I have further questions.
Regards,
On Wed, Apr 7, 2021 at 1:58 PM Jakob Erdmann wrote:
> Hello Behzad,
> I suppose you could run duarouter twice within a single iteration (once
> with UE e
The easiest solution is to fork sumo and modify the code at
https://github.com/eclipse/sumo/blob/master/src/utils/router/DijkstraRouter.h
This code is the default algorithm used within duarouter and sumo. See also
https://sumo.dlr.de/docs/Simulation/Routing.html#routing_algorithms
Am Mi., 7. Apr.
Thank you. I have my own routing algorithm developped and i want to implement
it on sumo rather than the one SUMO uses by defaults.
De : sumo-dev de la part de Jakob Erdmann
Envoyé : mercredi 7 avril 2021 16:21
À : sumo developer discussions
Objet : Re: [sumo-d
Yes.
Do you want a faster routing algorithm (i.. dijkstra versus A*) or do you
want one that optimizes another target function? Duarouter computes fastest
paths by default but can also optimize any other target function by setting
different edge "weights".
Am Mi., 7. Apr. 2021 um 15:28 Uhr schrieb
Hello,
I want to know please if there is a way to modify the source code of SUMO so
as to integrate a new optimization code, so as to compute shortest paths with
it and not with duarouter.
Best Regards,
Hillary WANKAM
_
EMAIL LEGAL MENTION
Hello Behzad,
I suppose you could run duarouter twice within a single iteration (once
with UE edge weights and once with SO weights) and only use a subset of the
vehicles for each duarouter call. Then you can combine both route files in
the sumo call.
regards,
Jakob
Am Mi., 31. März 2021 um 18:45
