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

Research output: Contribution to journalArticlepeer-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 languageEnglish (US)
Pages (from-to)261-293
Number of pages33
JournalPublic Transport
Volume8
Issue number2
DOIs
StatePublished - 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

Fingerprint Dive into the research topics of 'A path-based greedy algorithm for multi-objective transit routes design with elastic demand'. Together they form a unique fingerprint.

Cite this