Real Time Software Solution for the Integration of Dynamic On-Demand Services in Rural Public Transport
Egileak: Harbil Arregui and Estíbaliz Loyo and Borja Orbegozo and Iván Jiménez and Oihana Otaegui
Data: 30.06.2011
Abstract
On-demand public transport satisfies many of the needs that traditional public transport, with fixed predetermined routes and schedules, cannot fulfill. Both schemas are able to work together, as it is discussed in this paper, being ondemand services a good alternative in the areas and time intervals where low demand makes fixed routes unsustainable. This work presents a new integrated real-time management system for road public transport services, focusing on the integration of three kinds of services: fixed services, on-demand fixed services and on-demand dynamic services. The architecture of the system and the features of the tailored algorithm for dynamic services are detailed in the paper. The main objective of the algorithm is to solve the multi-vehicle Dial-a-Ride Problem (DARP) minimizing the number of vehicles and the total distance of the routes. A heterogeneous capacitated fleet is used to serve the customers and the cost matrix is asymmetric, as real-life conditions are assumed. The desired quality of service is set by configurable parameters (e.g., waiting time window and maximum ride time). The algorithm is designed to work with two operating modes (insertion and optimization), concluding that a fast response can be achieved with the insertion mode, improving the results with the optimization mode.
BIB_text
@Article {
author = {Harbil Arregui and Estíbaliz Loyo and Borja Orbegozo and Iván Jiménez and Oihana Otaegui},
title = {Real Time Software Solution for the Integration of Dynamic On-Demand Services in Rural Public Transport},
pages = {259-264},
keywds = {
Innovative Transit Systems
}
abstract = {
On-demand public transport satisfies many of the needs that traditional public transport, with fixed predetermined routes and schedules, cannot fulfill. Both schemas are able to work together, as it is discussed in this paper, being ondemand services a good alternative in the areas and time intervals where low demand makes fixed routes unsustainable. This work presents a new integrated real-time management system for road public transport services, focusing on the integration of three kinds of services: fixed services, on-demand fixed services and on-demand dynamic services. The architecture of the system and the features of the tailored algorithm for dynamic services are detailed in the paper. The main objective of the algorithm is to solve the multi-vehicle Dial-a-Ride Problem (DARP) minimizing the number of vehicles and the total distance of the routes. A heterogeneous capacitated fleet is used to serve the customers and the cost matrix is asymmetric, as real-life conditions are assumed. The desired quality of service is set by configurable parameters (e.g., waiting time window and maximum ride time). The algorithm is designed to work with two operating modes (insertion and optimization), concluding that a fast response can be achieved with the insertion mode, improving the results with the optimization mode.
}
isbn = {978-1-4577-0991-3},
date = {2011-06-30},
year = {2011},
}
author = {Harbil Arregui and Estíbaliz Loyo and Borja Orbegozo and Iván Jiménez and Oihana Otaegui},
title = {Real Time Software Solution for the Integration of Dynamic On-Demand Services in Rural Public Transport},
pages = {259-264},
keywds = {
Innovative Transit Systems
}
abstract = {
On-demand public transport satisfies many of the needs that traditional public transport, with fixed predetermined routes and schedules, cannot fulfill. Both schemas are able to work together, as it is discussed in this paper, being ondemand services a good alternative in the areas and time intervals where low demand makes fixed routes unsustainable. This work presents a new integrated real-time management system for road public transport services, focusing on the integration of three kinds of services: fixed services, on-demand fixed services and on-demand dynamic services. The architecture of the system and the features of the tailored algorithm for dynamic services are detailed in the paper. The main objective of the algorithm is to solve the multi-vehicle Dial-a-Ride Problem (DARP) minimizing the number of vehicles and the total distance of the routes. A heterogeneous capacitated fleet is used to serve the customers and the cost matrix is asymmetric, as real-life conditions are assumed. The desired quality of service is set by configurable parameters (e.g., waiting time window and maximum ride time). The algorithm is designed to work with two operating modes (insertion and optimization), concluding that a fast response can be achieved with the insertion mode, improving the results with the optimization mode.
}
isbn = {978-1-4577-0991-3},
date = {2011-06-30},
year = {2011},
}
