2011
DOI: 10.1016/j.eswa.2010.07.064
|View full text |Cite
|
Sign up to set email alerts
|

Multi-objective α-reliable path finding in stochastic networks with correlated link costs: A simulation-based multi-objective genetic algorithm approach (SMOGA)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
38
0

Year Published

2011
2011
2024
2024

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 82 publications
(38 citation statements)
references
References 28 publications
0
38
0
Order By: Relevance
“…The method needs to sample random variables from sampling space. It is easily workable to perform sampling experiments in engineering practice [25,26,27,28]. In the paper, we assume that the sampling space Ψ may be discretized and be known in advance.…”
Section: Mean and Variance Of Link Travel Timementioning
confidence: 99%
See 1 more Smart Citation
“…The method needs to sample random variables from sampling space. It is easily workable to perform sampling experiments in engineering practice [25,26,27,28]. In the paper, we assume that the sampling space Ψ may be discretized and be known in advance.…”
Section: Mean and Variance Of Link Travel Timementioning
confidence: 99%
“…There are several methods solving the problem such as sensitivity analysis-based method [39,40], cutting constraint method [41] and intelligent optimization method (e.g. genetic algorithm [25,26,27,28,29], Particle Swarm Optimization algorithm [42]). In this paper, we adopt the sensitivity analysis-based conjugate sub-gradient projection method to solve the congestion pricing problem.…”
Section: Accepted Manuscriptmentioning
confidence: 99%
“…The work in [11] was an extension of an earlier paper [12], which did not consider the spatial and temporal correlations. In another recent work, a multi-objective reliable path finding method in stochastic networks with correlated link costs were proposed in [13]. This simulation study considered multiple requirements of travel time reliability based on an α-reliable path finding method in [14].…”
Section: Introductionmentioning
confidence: 97%
“…Under the framework, the correlation between links is considered hence path travel time is nonadditive (Fan et al, 2005;Dong and Mahmassani, 2009). Path travel time can be derived from link travel time covariance matrix (Sen et al, 2001;Xing and Zhou, 2011;Shahabi et al, 2013), temporal and spatial correlations (Miller-Hooks and Mahmassani, 2003;Gao and Chabini, 2006), or simulation-based approaches (Ji et al, 2011;Huang and Gao, 2012;Zockaie et al, 2013;Zockaie et al, 2014). Some research also focuses on the penalties due to late arrival and the corresponding route choice (Watling, 2006;Chen and Zhou, 2010).…”
Section: Introduction and Backgroundsmentioning
confidence: 99%