A computer-implemented method for computing open routes, comprising: providing the initial location coordinates ( l at O , lon O ) of the user and a maximum time duration T max for a route, digitally assigning in a random way destination location coordinates ( la t p Np , lo n p Np ), a value of safety preference S p , a value of inclination preference I p and a value of duration preference D p , wherein 0≤ S p ≤ 1, 0≤ I p ≤ 1 and 0≤ D p ≤ 1, and wherein S p + I p + D p = 1, applying a heuristic algorithm for digitally calculating a candidate route r p by means of a route planning engine, said candidate route r p starting at the initial location coordinates (lat O , lon O ), ending at the destination location coordinates ( la t p Np , lo n p Np ), fulfilling said values of safety preference S p , inclination preference I p and duration preference D p , and for digitally checking whether the calculated candidate route r p fulfils the time constraints regarding said maximum time duration T max and a time duration tolerance value and, if the time constraints are fulfilled, selecting said route and calculating a security value and a distance value associated to the route, and if the time constraints are not fulfilled, discarding the candidate route, repeating the steps of digitally assigning in a random way destination location coordinates, a value of safety preference, a value of inclination preference and a value of duration preference, digitally calculating a candidate route and digitally checking the fulfilment of time constraints in the calculated route and if applicable, calculating a security value and a distance value for the route, until a set of selected routes has been obtained by balancing the Pareto trade-off between the route safety level and the distance of the route. providing the initial location coordinates ( l at O , lon O ) of the user and a maximum time duration T max for a route, digitally assigning in a random way destination location coordinates ( la t p Np , lo n p Np ), a value of safety preference S p , a value of inclination preference I p and a value of duration preference D p , wherein 0≤ S p ≤ 1, 0≤ I p ≤ 1 and 0≤ D p ≤ 1, and wherein S p + I p + D p = 1, applying a heuristic algorithm for digitally calculating a candidate route r p by means of a route planning engine, said candidate route r p starting at the initial location coordinates (lat O , lon O ), ending at the destination location coordinates ( la t p Np , lo n p Np ), fulfilling said values of safety preference S p , inclination preference I p and duration preference D p , and for digitally checking whether the calculated candidate route r p fulfils the time constraints regarding said maximum time duration T max and a time duration tolerance value and, if the time constraints are fulfilled, selecting said route and calculating a security value and a distance value associated to the route, and if the time constraints are not fulfilled, discarding the candidate route, if the time constraints are fulfilled, selecting said route and calculating a security value and a distance value associated to the route, and if the time constraints are not fulfilled, discarding the candidate route, repeating the steps of digitally assigning in a random way destination location coordinates, a value of safety preference, a value of inclination preference and a value of duration preference, digitally calculating a candidate route and digitally checking the fulfilment of time constraints in the calculated route and if applicable, calculating a security value and a distance value for the route, until a set of selected routes has been obtained by balancing the Pareto trade-off between the route safety level and the distance of the route. <EOS>