Minimizing the passengers' traveling time in the stop location problem

In this paper we consider the location of stops along the edges of an already existing public transportation network. The positive effect of new stops is given by the better access of the passengers to the public transport network, while the passengers' traveling time increases due to the addit...

Descripción completa

Detalles Bibliográficos
Autores: Carrizosa Priego, Emilio José, Harbering, Jonas, Schöbel, Anita
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2016
País:España
Institución:Universidad de Sevilla (US)
Repositorio:idUS. Depósito de Investigación de la Universidad de Sevilla
OAI Identifier:oai:idus.us.es:11441/107715
Acceso en línea:https://hdl.handle.net/11441/107715
https://doi.org/10.1057/jors.2016.3
Access Level:acceso abierto
Palabra clave:integer programming
stop location
passenger traveling time
public transportation
id ES_61cdd94cd54c543f3fbf7e04fcebf3a4
oai_identifier_str oai:idus.us.es:11441/107715
network_acronym_str ES
network_name_str España
repository_id_str
spelling Minimizing the passengers' traveling time in the stop location problemCarrizosa Priego, Emilio JoséHarbering, JonasSchöbel, Anitainteger programmingstop locationpassenger traveling timepublic transportationIn this paper we consider the location of stops along the edges of an already existing public transportation network. The positive effect of new stops is given by the better access of the passengers to the public transport network, while the passengers' traveling time increases due to the additional stopping activities of the trains, which is a negative effect for the passengers. The problem has been treated in the literature where the most common model is to cover all demand points with a minimal number of new stops. In this paper, we follow this line and seek for a set of new stops covering all demand points but instead of minimizing the number of new stops we minimize the additional passengers' traveling time due to the new stops. For computing this additional traveling time we do not only take the stopping times of the vehicles but also acceleration and deceleration of the vehicles into account. We show that the problem is NP-hard, but we are able to derive a finite candidate set and two tractable IP formulations. For linear networks we show that the problem is polynomially solvable. We also discuss the differences to the common models from literature showing that minimizing the number of new stops does not necessarily lead to a solution with minimal additional traveling times for the passengers. We finally provide a case study showing that our new model decreases the traveling times for the passengers while still achieving the minimal number of new stopsTAYLOR & FRANCIS LTDEstadística e Investigación OperativaFQM329: Optimización2016info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfapplication/pdfhttps://hdl.handle.net/11441/107715https://doi.org/10.1057/jors.2016.3reponame:idUS. Depósito de Investigación de la Universidad de Sevillainstname:Universidad de Sevilla (US)InglésJournal of the Operational Research Society, 67 (10), 1325-1337.http://doi.org/10.1057/jors.2016.3info:eu-repo/semantics/openAccessoai:idus.us.es:11441/1077152026-06-17T12:51:07Z
dc.title.none.fl_str_mv Minimizing the passengers' traveling time in the stop location problem
title Minimizing the passengers' traveling time in the stop location problem
spellingShingle Minimizing the passengers' traveling time in the stop location problem
Carrizosa Priego, Emilio José
integer programming
stop location
passenger traveling time
public transportation
title_short Minimizing the passengers' traveling time in the stop location problem
title_full Minimizing the passengers' traveling time in the stop location problem
title_fullStr Minimizing the passengers' traveling time in the stop location problem
title_full_unstemmed Minimizing the passengers' traveling time in the stop location problem
title_sort Minimizing the passengers' traveling time in the stop location problem
dc.creator.none.fl_str_mv Carrizosa Priego, Emilio José
Harbering, Jonas
Schöbel, Anita
author Carrizosa Priego, Emilio José
author_facet Carrizosa Priego, Emilio José
Harbering, Jonas
Schöbel, Anita
author_role author
author2 Harbering, Jonas
Schöbel, Anita
author2_role author
author
dc.contributor.none.fl_str_mv Estadística e Investigación Operativa
FQM329: Optimización
dc.subject.none.fl_str_mv integer programming
stop location
passenger traveling time
public transportation
topic integer programming
stop location
passenger traveling time
public transportation
description In this paper we consider the location of stops along the edges of an already existing public transportation network. The positive effect of new stops is given by the better access of the passengers to the public transport network, while the passengers' traveling time increases due to the additional stopping activities of the trains, which is a negative effect for the passengers. The problem has been treated in the literature where the most common model is to cover all demand points with a minimal number of new stops. In this paper, we follow this line and seek for a set of new stops covering all demand points but instead of minimizing the number of new stops we minimize the additional passengers' traveling time due to the new stops. For computing this additional traveling time we do not only take the stopping times of the vehicles but also acceleration and deceleration of the vehicles into account. We show that the problem is NP-hard, but we are able to derive a finite candidate set and two tractable IP formulations. For linear networks we show that the problem is polynomially solvable. We also discuss the differences to the common models from literature showing that minimizing the number of new stops does not necessarily lead to a solution with minimal additional traveling times for the passengers. We finally provide a case study showing that our new model decreases the traveling times for the passengers while still achieving the minimal number of new stops
publishDate 2016
dc.date.none.fl_str_mv 2016
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv https://hdl.handle.net/11441/107715
https://doi.org/10.1057/jors.2016.3
url https://hdl.handle.net/11441/107715
https://doi.org/10.1057/jors.2016.3
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv Journal of the Operational Research Society, 67 (10), 1325-1337.
http://doi.org/10.1057/jors.2016.3
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv TAYLOR & FRANCIS LTD
publisher.none.fl_str_mv TAYLOR & FRANCIS LTD
dc.source.none.fl_str_mv reponame:idUS. Depósito de Investigación de la Universidad de Sevilla
instname:Universidad de Sevilla (US)
instname_str Universidad de Sevilla (US)
reponame_str idUS. Depósito de Investigación de la Universidad de Sevilla
collection idUS. Depósito de Investigación de la Universidad de Sevilla
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869409445682872320
score 15,301603

Similares en LA Referencia