Hi Ben and Marcus, Am 24.10.2014 um 14:27 schrieb Marcus Müller: > I know this problem as so called "Travelling Salesman Problem". Maybe you > find interesting things if you search for this.
If I understand the description correctly it is more like a Eulerian Circuit (or Path since the return to the origin was not required) problem because you want to travel every edge not every node. (Computationally the major difference is that for the Eulerian Circuit easy and fast algorithms are known.) >> Am 24..2014 um 11:51 schrieb Ben Postance <[email protected]>: >> Does anyone know if it is possible or a potential method to solve a fleet >> optimization problem using one of SUMO's routers. The major point here is whether you need to take the traffic situation (jams etc.) into account or just need a static solution assuming travel times which are always constant on all the edges. If the latter is the case forget about sumo and its routers and just search the web for an easy algorithm for Eulerian paths. If you need jam effects then you probably need to adapt those algorithms and maybe the shortest path algorithms in SUMO can help here. Please ask back, if this is the case. Best regards, Michael PS: >> PS. I am using SUMO for my PhD and will share full details of my project in >> coming months. Please do so, we are always interested in all kind of scenarios simulated with sumo. ------------------------------------------------------------------------------ _______________________________________________ sumo-user mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/sumo-user
