A bi-objective model for uncertain multi-modal shortest path problems

  • Zhang Y
  • Liu P
  • Yang L
  • et al.
N/ACitations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper employs uncertain programming to investigate the uncertain multi-modal shortest path problem, in which the arc weights (arc travel time, arc travel costs) associated with different transport modes are characterized by uncertain variables. By using the chance-constrained programming approach, we firstly formulate a bi-objective optimization model to minimize the total travel time and travel costs simultaneously with the given confidence levels. Moreover, using the basic concepts and properties in the uncertainty theory, we transform the proposed model into its deterministic crisp equivalent with an explicit proof. Finally, some numerical experiments are implemented to show the performance of the proposed approaches on a multi-modal transportation network with three specific modes.

Cite

CITATION STYLE

APA

Zhang, Y., Liu, P., Yang, L., & Gao, Y. (2015). A bi-objective model for uncertain multi-modal shortest path problems. Journal of Uncertainty Analysis and Applications, 3(1). https://doi.org/10.1186/s40467-015-0032-x

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free