A Personalized Urban Multicriteria Shortest Path Stochastic Optimization Algorithm

Drivers’ route choice behavior is usually personalized and multicriteria in practice. Therefore, the urban shortest path problem is the personalized urban multicriteria shortest path (PUMSP) problem. However, the solutions of the PUMSP problem are difficult to meet the drivers’ travel habits in the state of the art. To solve this problem, first, a new stochastic optimization algorithm based on the iterative calculation of a valid route set is proposed in this paper. The effective and reasonable path searching mechanism is designed based on drivers’ route choice habits. Then, the evaluation method of calculation results is given. The comparative experimental results with the genetic algorithm show that the proposed algorithm has reached better results in the evaluation parameters and computing time. The experimental results also demonstrate that it is meaningful to consider drivers’ travel law in the personalized urban multicriteria shortest path algorithm design for avoiding obtaining impractical routes solutions.