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

Online clustering reduction based on parametric and non-parametric correlation for a many-objective vehicle routing problem with demand responsive transport

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(3 citation statements)
references
References 26 publications
0
3
0
Order By: Relevance
“…In MO-VRPs, Pareto-dominance is often used in conjunction with an evolutionary algorithm (EA) framework, such as NSGA-II (37), MOEA/D (38), and SPEA2 (39). Most EAs in both research and application areas follow a similar framework, using a search operator based on Pareto domination and an iterative reproduction operator (40).…”
Section: Multi-objective Optimization Methodsmentioning
confidence: 99%
“…In MO-VRPs, Pareto-dominance is often used in conjunction with an evolutionary algorithm (EA) framework, such as NSGA-II (37), MOEA/D (38), and SPEA2 (39). Most EAs in both research and application areas follow a similar framework, using a search operator based on Pareto domination and an iterative reproduction operator (40).…”
Section: Multi-objective Optimization Methodsmentioning
confidence: 99%
“…PCC 26,27 is one of the linear correlation coefficients in statistics and can be used to display the degree of linear correlation between two variables. Unlike Spearman's rank coefficient of correlation 28,29 and the Kendall tau rank correlation coefficient, 30,31 PCCs are obtained based on calculating the variance and covariance of the data, which are more sensitive to outliers in the data and better reflect the linear relationship between the variables. In this paper, we use the PCCs to measure the correlation between SH and diversity.…”
Section: Pearson Correlation Coefficient (Pccs)mentioning
confidence: 99%
“…Wang and Lin [37] developed a scenario-based heuristic algorithm in which an index of "intimacy degree" is defined for grouping customers into different clusters. Mendes et al [38] used a Pearson's and τ-Kendall hierarchical cluster approach to reduce the dimensionality of the multi-objective vehicle routing problem solved by the MOEA/D evolutionary approach. Oezdamar and Demir [39] described a hierarchical clustering and heuristic routing procedure to coordinate vehicle routing in large-scale disaster distribution planning.…”
Section: Literature Reviewmentioning
confidence: 99%