Individual vs collective route guidance

Abstract

Two route guidance algorithms which distribute guided vehicles following two relevant criteria are developed. An individual criterion is used in order to route guided vehicles following the Wardrop's first principle (the individual equilibrium), and a collective criterion in order to route guided vehicles following the Wardrop's second principle (the minimization of a collective criterion). The authors study in which conditions in terms of percentage of equipped vehicles and total demand these two methods lead to significantly different numerical solutions. The two guidance methods are formalized by two minimization problems which use flows as optimization variables and differ only for the criteria. The optimization algorithm is based on a recurrent use of Dijkstra method for shortest path. The two approaches are studied simultaneously on three networks.