U turns #3
Description
We are currently planning the turn by turn navigation of cars that collect garbage. So far we have tested the MCPP Heuristic (Frederickson) and MCPP Heuristic (Yaoyuenyong) algorithms on the streets in our city. Both have found routes quickly and efficiently.
However, I have noticed that the optimal route presented U-turns, which are not only complicated to perform due to the truck’s size but not allowed by law.
In this sense, I would like to kindly ask you whether is there any parameter or algorithm that could help us to find an optimal route in which U-turns are not allowed.
I appreciate very much your help.