Share distance among finite fleet

[Martin Sauvage]

Hello,

Congratulations for this great library !

My problem seems to be close to this one:

https://groups.google.com/forum/#!searchin/jsprit-mailing-list/cost/jsprit-mailing-list/5hqLY-Eisr0/4QJ-Jn6aM-4J

Consider a finite N fleet size, I would like to get N routes as similar as possible the same distance cost (no capacity constraint for each route).

Example:

I have 200 products to be served using 3 vehicles: how to get the 3 routes (returning to depot) with an approximatively the same distance for each vehicle?

Do you confirm jsprit cannot solve my problem?

Thanks,

Martin

[Stefan Schroeder]

Hello,

Congratulations for this great library !

Thank you for your kind words :).

Do you confirm jsprit cannot solve my problem?

No. I cannot confirm this. It is a min-max distance problem and you cannot use smth out of the box. However, you can build smth for your own. You just need to play with the distance constraints. For example, reduce the max allowed distance successively so that you can just serve all your customers with your 3 vehicles, thus no jobs should be unassigned. You can do it manually by using the trial and error approach, or you can automate it. I have been successful by designing a two-stage algorithm where in the first stage the max distance is determined, and in the second stage - given the max distance - the routes are determined that min. overall costs. Unfortunately, this code is not open source :(.

Best,
Stefan

Thanks,

Martin

--
You received this message because you are subscribed to the Google Groups "jsprit-mailing-list" group.
To unsubscribe from this group and stop receiving emails from it, send an email to jsprit-mailing-...@googlegroups.com.
To post to this group, send email to jsprit-ma...@googlegroups.com.
Visit this group at http://groups.google.com/group/jsprit-mailing-list.
For more options, visit https://groups.google.com/d/optout.