Traditional vehicle routing algorithms consider either
route for EFV or for EUF vehicles. The advantage of the modified
Dijkstra algorithm developed in this study can be seen in the fact
that in addition to planning routes for EFV it can also be used to
plan routes for EUV vehicles. This becomes even more significant
when the TSDSM is used by operators with a heterogeneous fleet,
that is, with a limited number of EFV.