Eco-reliable path finding in time-variant and stochastic networks

Wenjie Li, Lixing Yang, Li Wang, Xuesong Zhou, Ronghui Liu, Ziyou Gao

Research output: Contribution to journalArticle

  • 3 Citations

Abstract

This paper addresses a route guidance problem for finding the most eco-reliable path in time-variant and stochastic networks such that travelers can arrive at the destination with the maximum on-time probability while meeting vehicle emission standards imposed by government regulators. To characterize the dynamics and randomness of transportation networks, the link travel times and emissions are assumed to be time-variant random variables correlated over the entire network. A 0–1 integer mathematical programming model is formulated to minimize the probability of late arrival by simultaneously considering the least expected emission constraint. Using the Lagrangian relaxation approach, the primal model is relaxed into a dualized model which is further decomposed into two simple sub-problems. A sub-gradient method is developed to reduce gaps between upper and lower bounds. Three sets of numerical experiments are tested to demonstrate the efficiency and performance of our proposed model and algorithm.

LanguageEnglish (US)
Pages372-387
Number of pages16
JournalEnergy
Volume121
DOIs
StatePublished - Feb 15 2017
Externally publishedYes

Fingerprint

Gradient methods
Mathematical programming
Travel time
Random variables
Experiments

Keywords

  • Eco-reliable path finding
  • Lagrangian relaxation approach
  • Time-variant and stochastic network
  • Vehicle emission

ASJC Scopus subject areas

  • Pollution
  • Energy(all)

Cite this

Li, W., Yang, L., Wang, L., Zhou, X., Liu, R., & Gao, Z. (2017). Eco-reliable path finding in time-variant and stochastic networks. Energy, 121, 372-387. DOI: 10.1016/j.energy.2017.01.008

Eco-reliable path finding in time-variant and stochastic networks. / Li, Wenjie; Yang, Lixing; Wang, Li; Zhou, Xuesong; Liu, Ronghui; Gao, Ziyou.

In: Energy, Vol. 121, 15.02.2017, p. 372-387.

Research output: Contribution to journalArticle

Li, W, Yang, L, Wang, L, Zhou, X, Liu, R & Gao, Z 2017, 'Eco-reliable path finding in time-variant and stochastic networks' Energy, vol. 121, pp. 372-387. DOI: 10.1016/j.energy.2017.01.008
Li W, Yang L, Wang L, Zhou X, Liu R, Gao Z. Eco-reliable path finding in time-variant and stochastic networks. Energy. 2017 Feb 15;121:372-387. Available from, DOI: 10.1016/j.energy.2017.01.008
Li, Wenjie ; Yang, Lixing ; Wang, Li ; Zhou, Xuesong ; Liu, Ronghui ; Gao, Ziyou. / Eco-reliable path finding in time-variant and stochastic networks. In: Energy. 2017 ; Vol. 121. pp. 372-387
@article{c3eddfa71a99498d8c691c6a0e77d723,
title = "Eco-reliable path finding in time-variant and stochastic networks",
abstract = "This paper addresses a route guidance problem for finding the most eco-reliable path in time-variant and stochastic networks such that travelers can arrive at the destination with the maximum on-time probability while meeting vehicle emission standards imposed by government regulators. To characterize the dynamics and randomness of transportation networks, the link travel times and emissions are assumed to be time-variant random variables correlated over the entire network. A 0–1 integer mathematical programming model is formulated to minimize the probability of late arrival by simultaneously considering the least expected emission constraint. Using the Lagrangian relaxation approach, the primal model is relaxed into a dualized model which is further decomposed into two simple sub-problems. A sub-gradient method is developed to reduce gaps between upper and lower bounds. Three sets of numerical experiments are tested to demonstrate the efficiency and performance of our proposed model and algorithm.",
keywords = "Eco-reliable path finding, Lagrangian relaxation approach, Time-variant and stochastic network, Vehicle emission",
author = "Wenjie Li and Lixing Yang and Li Wang and Xuesong Zhou and Ronghui Liu and Ziyou Gao",
year = "2017",
month = "2",
day = "15",
doi = "10.1016/j.energy.2017.01.008",
language = "English (US)",
volume = "121",
pages = "372--387",
journal = "Energy",
issn = "0360-5442",
publisher = "Elsevier Limited",

}

TY - JOUR

T1 - Eco-reliable path finding in time-variant and stochastic networks

AU - Li,Wenjie

AU - Yang,Lixing

AU - Wang,Li

AU - Zhou,Xuesong

AU - Liu,Ronghui

AU - Gao,Ziyou

PY - 2017/2/15

Y1 - 2017/2/15

N2 - This paper addresses a route guidance problem for finding the most eco-reliable path in time-variant and stochastic networks such that travelers can arrive at the destination with the maximum on-time probability while meeting vehicle emission standards imposed by government regulators. To characterize the dynamics and randomness of transportation networks, the link travel times and emissions are assumed to be time-variant random variables correlated over the entire network. A 0–1 integer mathematical programming model is formulated to minimize the probability of late arrival by simultaneously considering the least expected emission constraint. Using the Lagrangian relaxation approach, the primal model is relaxed into a dualized model which is further decomposed into two simple sub-problems. A sub-gradient method is developed to reduce gaps between upper and lower bounds. Three sets of numerical experiments are tested to demonstrate the efficiency and performance of our proposed model and algorithm.

AB - This paper addresses a route guidance problem for finding the most eco-reliable path in time-variant and stochastic networks such that travelers can arrive at the destination with the maximum on-time probability while meeting vehicle emission standards imposed by government regulators. To characterize the dynamics and randomness of transportation networks, the link travel times and emissions are assumed to be time-variant random variables correlated over the entire network. A 0–1 integer mathematical programming model is formulated to minimize the probability of late arrival by simultaneously considering the least expected emission constraint. Using the Lagrangian relaxation approach, the primal model is relaxed into a dualized model which is further decomposed into two simple sub-problems. A sub-gradient method is developed to reduce gaps between upper and lower bounds. Three sets of numerical experiments are tested to demonstrate the efficiency and performance of our proposed model and algorithm.

KW - Eco-reliable path finding

KW - Lagrangian relaxation approach

KW - Time-variant and stochastic network

KW - Vehicle emission

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

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

U2 - 10.1016/j.energy.2017.01.008

DO - 10.1016/j.energy.2017.01.008

M3 - Article

VL - 121

SP - 372

EP - 387

JO - Energy

T2 - Energy

JF - Energy

SN - 0360-5442

ER -