The Minimization of the Number of Stops Problem

Samuel Deleplanque (1, 2) , Ana Luisa Marques Fernandes (3) , Luiza Bernardes Real (3) , Ricardo Saraiva de Camargo (4) , Alain Quilliot (1)

1 LIMOS - Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes
2 IP - Institut Pascal
3 UFMG - Universidade Federal de Minas Gerais = Federal University of Minas Gerais [Belo Horizonte, Brazil]
4 DCC - UFMG - Departamento de Ciência da Computação [Minas Gerais]

In this paper two optimum models to study the transport of passengers and goods through the VIPA (Automatic individual Public Vehicle) are proposed. The objective is to minimize the number of times the vehicles stop. Since those are autonomous vehicles (they have no driver), the operations of deceleration, acceleration, stopping, opening and closing doors and going out of the circuit to go to the station implies a loss of reliability. Therefore, minimizing the number of times the vehicles stop is crucial to ensure their fleet works efficiently. Moreover, doing this we will achieve less energy expense, the minimization of the total time and the maximization of the number of served clients.

Mots clés: Autonomous Vehicle; Vehicle Scheduling; ILP; Reliability

Domaines: Algorithme et structure de données [cs.DS]

Samuel Deleplanque, Ana Luisa Marques Fernandes, Luiza Bernardes Real, Ricardo Saraiva de Camargo, Alain Quilliot. The Minimization of the Number of Stops Problem. 2014. ⟨hal-00958881⟩