A path-based greedy algorithm for multi-objective transit routes design with elastic demand

Amirali Zarrinmehr; Mahmoud Saffarzadeh; Seyedehsan Seyedabrishami; Yu Marco Nie

doi:10.1007/s12469-016-0131-1

A path-based greedy algorithm for multi-objective transit routes design with elastic demand

Amirali Zarrinmehr, Mahmoud Saffarzadeh^*, Seyedehsan Seyedabrishami, Yu Marco Nie

^*Corresponding author for this work

Civil and Environmental Engineering

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

5 Scopus citations

Abstract

This paper is concerned with the problem of finding optimal sub-routes from a set of predefined candidate transit routes with the objectives of maximizing transit ridership as well as minimizing operational costs. The main contributions of this paper are: (1) considering transit ridership maximization in a multi-objective bi-level optimization framework; (2) proposing a greedy algorithm for the multi-objective design problem; (3) applying an efficient path-based algorithm to solve the lower level multi-modal traffic assignment problem. Numerical experiments indicate that the proposed algorithm is not only able to approximate the Pareto-optimal solutions with satisfactory accuracy, but also achieves a fast performance even for problems of real-world scale.

Original language	English (US)
Pages (from-to)	261-293
Number of pages	33
Journal	Public Transport
Volume	8
Issue number	2
DOIs	https://doi.org/10.1007/s12469-016-0131-1
State	Published - Sep 1 2016

Keywords

Greedy algorithm
Pareto-optimal
Path-based traffic assignment
Transit ridership
Transit routes design

ASJC Scopus subject areas

Information Systems
Transportation
Mechanical Engineering
Management Science and Operations Research

Access to Document

10.1007/s12469-016-0131-1

Cite this

@article{d3707ab274ab4982af4703920e415aab,

title = "A path-based greedy algorithm for multi-objective transit routes design with elastic demand",

abstract = "This paper is concerned with the problem of finding optimal sub-routes from a set of predefined candidate transit routes with the objectives of maximizing transit ridership as well as minimizing operational costs. The main contributions of this paper are: (1) considering transit ridership maximization in a multi-objective bi-level optimization framework; (2) proposing a greedy algorithm for the multi-objective design problem; (3) applying an efficient path-based algorithm to solve the lower level multi-modal traffic assignment problem. Numerical experiments indicate that the proposed algorithm is not only able to approximate the Pareto-optimal solutions with satisfactory accuracy, but also achieves a fast performance even for problems of real-world scale.",

keywords = "Greedy algorithm, Pareto-optimal, Path-based traffic assignment, Transit ridership, Transit routes design",

author = "Amirali Zarrinmehr and Mahmoud Saffarzadeh and Seyedehsan Seyedabrishami and Nie, {Yu Marco}",

note = "Funding Information: The authors would like to thank the editor and two anonymous reviewers for their constructive comments which helped improve this paper. The research is partially funded by the United States National Science Foundation under the award number CMMI-1402911. Publisher Copyright: {\textcopyright} 2016, Springer-Verlag Berlin Heidelberg.",

year = "2016",

month = sep,

day = "1",

doi = "10.1007/s12469-016-0131-1",

language = "English (US)",

volume = "8",

pages = "261--293",

journal = "Public Transport",

issn = "1613-7159",

publisher = "Springer Verlag",

number = "2",

}

TY - JOUR

T1 - A path-based greedy algorithm for multi-objective transit routes design with elastic demand

AU - Zarrinmehr, Amirali

AU - Saffarzadeh, Mahmoud

AU - Seyedabrishami, Seyedehsan

AU - Nie, Yu Marco

N1 - Funding Information: The authors would like to thank the editor and two anonymous reviewers for their constructive comments which helped improve this paper. The research is partially funded by the United States National Science Foundation under the award number CMMI-1402911. Publisher Copyright: © 2016, Springer-Verlag Berlin Heidelberg.

PY - 2016/9/1

Y1 - 2016/9/1

N2 - This paper is concerned with the problem of finding optimal sub-routes from a set of predefined candidate transit routes with the objectives of maximizing transit ridership as well as minimizing operational costs. The main contributions of this paper are: (1) considering transit ridership maximization in a multi-objective bi-level optimization framework; (2) proposing a greedy algorithm for the multi-objective design problem; (3) applying an efficient path-based algorithm to solve the lower level multi-modal traffic assignment problem. Numerical experiments indicate that the proposed algorithm is not only able to approximate the Pareto-optimal solutions with satisfactory accuracy, but also achieves a fast performance even for problems of real-world scale.

AB - This paper is concerned with the problem of finding optimal sub-routes from a set of predefined candidate transit routes with the objectives of maximizing transit ridership as well as minimizing operational costs. The main contributions of this paper are: (1) considering transit ridership maximization in a multi-objective bi-level optimization framework; (2) proposing a greedy algorithm for the multi-objective design problem; (3) applying an efficient path-based algorithm to solve the lower level multi-modal traffic assignment problem. Numerical experiments indicate that the proposed algorithm is not only able to approximate the Pareto-optimal solutions with satisfactory accuracy, but also achieves a fast performance even for problems of real-world scale.

KW - Greedy algorithm

KW - Pareto-optimal

KW - Path-based traffic assignment

KW - Transit ridership

KW - Transit routes design

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

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

U2 - 10.1007/s12469-016-0131-1

DO - 10.1007/s12469-016-0131-1

M3 - Article

AN - SCOPUS:84984600092

SN - 1613-7159

VL - 8

SP - 261

EP - 293

JO - Public Transport

JF - Public Transport

IS - 2

ER -

A path-based greedy algorithm for multi-objective transit routes design with elastic demand

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this