Rapid transit network design for optimal cost and origin-destination demand capture

Gabriel Gutiérrez-Jarpa; Carlos Obreque; Gilbert Laporte; Vladimir Marianov

doi:10.1016/j.cor.2013.06.013

Rapid transit network design for optimal cost and origin-destination demand capture

Gabriel Gutiérrez-Jarpa, Carlos Obreque, Gilbert Laporte, Vladimir Marianov

Research output: Contribution to journal › Article › peer-review

43 Citations (SciVal)

Abstract

This paper proposes a tractable model for the design of a rapid transit system. Travel cost is minimized and traffic capture is maximized. The problem is modeled on an undirected graph and cast as an integer linear program. The idea is to build segments within broad corridors to connect some vertex sets. These segments can then be assembled into lines, at a later stage. The model is solved by branch-and-cut within the CPLEX framework. Tests conducted on data from Concepción, Chile, confirm the effectiveness of the proposed methodology.

Original language	English
Pages (from-to)	3000-3009
Number of pages	10
Journal	Computers and Operations Research
Volume	40
Issue number	12
DOIs	https://doi.org/10.1016/j.cor.2013.06.013
Publication status	Published - 2013

Funding

We thank two anonymous referees for their detailed reviews and insightful comments and suggestions. Gabriel Gutiérrez-Jarpa was supported by FONDECYT Grant 11100222 and Grant 205.743/2011 by Pontificia Universidad Católica de Valparaíso. Gilbert Laporte was supported by the Canadian Natural Sciences and Engineering Research Council under Grant 39682-10 . Vladimir Marianov was supported by FONDECYT Grant 1100296 and by Institute Complex Engineering Systems through Grants ICM-MIDEPLAN P-05-004-F and CONICYT FBO16 . This support is gratefully acknowledged.

Keywords

Coverage
Location
Networks
Traffic capture
Transit systems

ASJC Scopus subject areas

General Computer Science
Modelling and Simulation
Management Science and Operations Research

Access to Document

10.1016/j.cor.2013.06.013

Cite this

@article{1d7875615a104bd88d67a26e97e824cc,

title = "Rapid transit network design for optimal cost and origin-destination demand capture",

abstract = "This paper proposes a tractable model for the design of a rapid transit system. Travel cost is minimized and traffic capture is maximized. The problem is modeled on an undirected graph and cast as an integer linear program. The idea is to build segments within broad corridors to connect some vertex sets. These segments can then be assembled into lines, at a later stage. The model is solved by branch-and-cut within the CPLEX framework. Tests conducted on data from Concepci{\'o}n, Chile, confirm the effectiveness of the proposed methodology.",

keywords = "Coverage, Location, Networks, Traffic capture, Transit systems",

author = "Gabriel Guti{\'e}rrez-Jarpa and Carlos Obreque and Gilbert Laporte and Vladimir Marianov",

year = "2013",

doi = "10.1016/j.cor.2013.06.013",

language = "English",

volume = "40",

pages = "3000--3009",

journal = "Computers and Operations Research",

issn = "0305-0548",

publisher = "Elsevier",

number = "12",

}

TY - JOUR

T1 - Rapid transit network design for optimal cost and origin-destination demand capture

AU - Gutiérrez-Jarpa, Gabriel

AU - Obreque, Carlos

AU - Laporte, Gilbert

AU - Marianov, Vladimir

PY - 2013

Y1 - 2013

N2 - This paper proposes a tractable model for the design of a rapid transit system. Travel cost is minimized and traffic capture is maximized. The problem is modeled on an undirected graph and cast as an integer linear program. The idea is to build segments within broad corridors to connect some vertex sets. These segments can then be assembled into lines, at a later stage. The model is solved by branch-and-cut within the CPLEX framework. Tests conducted on data from Concepción, Chile, confirm the effectiveness of the proposed methodology.

AB - This paper proposes a tractable model for the design of a rapid transit system. Travel cost is minimized and traffic capture is maximized. The problem is modeled on an undirected graph and cast as an integer linear program. The idea is to build segments within broad corridors to connect some vertex sets. These segments can then be assembled into lines, at a later stage. The model is solved by branch-and-cut within the CPLEX framework. Tests conducted on data from Concepción, Chile, confirm the effectiveness of the proposed methodology.

KW - Coverage

KW - Location

KW - Networks

KW - Traffic capture

KW - Transit systems

UR - http://www.scopus.com/inward/record.url?scp=84881013976&partnerID=8YFLogxK

U2 - 10.1016/j.cor.2013.06.013

DO - 10.1016/j.cor.2013.06.013

M3 - Article

AN - SCOPUS:84881013976

SN - 0305-0548

VL - 40

SP - 3000

EP - 3009

JO - Computers and Operations Research

JF - Computers and Operations Research

IS - 12

ER -

Rapid transit network design for optimal cost and origin-destination demand capture

Abstract

Funding

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this