New Mobility Schema for Highly-Demanded Services and Infrastructures

Autores: Harbil Arregui and Estíbaliz Loyo and Andoni Mujika and Oihana Otaegui

Fecha: 07.06.2011


PDF

Abstract

There are many scenarios where there is still a need to give a real alternative to the private vehicle, e.g., highly demanded services and infrastructures or big events that receive large influx of people that have to move at the same time to the same place. This paper describes the design and development of a new sustainable mobility solution, presenting an integrated real time management system that allows serving several users sharing a common origin or destination with similar schedules. Three different algorithms are tested in order to decide which one performs best to be included in the platform (linear programming, genetic and routing algorithms). The objective of the algorithms is to find the optimal set of routes, which is the one that uses the minimum number of vehicles to service all requests. Also, passengers are ensured that the travelling time increase due to other pick-ups will not exceed a certain percentage of the minimum time required to make the direct journey. Finally, it is concluded that the best approach stands on a combination of the presented algorithms.

BIB_text

@Article {
author = {Harbil Arregui and Estíbaliz Loyo and Andoni Mujika and Oihana Otaegui},
title = {New Mobility Schema for Highly-Demanded Services and Infrastructures},
abstract = {
There are many scenarios where there is still a need to give a real alternative to the private vehicle, e.g., highly demanded services and infrastructures or big events that receive large influx of people that have to move at the same time to the same place. This paper describes the design and development of a new sustainable mobility solution, presenting an integrated real time management system that allows serving several users sharing a common origin or destination with similar schedules. Three different algorithms are tested in order to decide which one performs best to be included in the platform (linear programming, genetic and routing algorithms). The objective of the algorithms is to find the optimal set of routes, which is the one that uses the minimum number of vehicles to service all requests. Also, passengers are ensured that the travelling time increase due to other pick-ups will not exceed a certain percentage of the minimum time required to make the direct journey. Finally, it is concluded that the best approach stands on a combination of the presented algorithms.
}
date = {2011-06-07},
year = {2011},
}
Vicomtech

Parque Científico y Tecnológico de Gipuzkoa,
Paseo Mikeletegi 57,
20009 Donostia / San Sebastián (España)

+(34) 943 309 230

close overlay