2022
DOI: 10.1016/j.cor.2021.105685
|View full text |Cite
|
Sign up to set email alerts
|

An investigation of nature inspired algorithms on a particular vehicle routing problem in the presence of shift assignment

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 27 publications
0
2
0
Order By: Relevance
“…The inverted generational distance (IGD) and the hyper‐volume (HV) two evaluation indicators are introduced in this paper to evaluate the quality of the Pareto optimal solutions obtained by the multi‐objective HESA. Therein, the IGD indicator (Alp and Alkaya, 2022) is used to measure the convergence and the distribution performance of the obtained Pareto optimal solutions, and also the overall gap including the convergence degree and the diversity of two aspects between the obtained Pareto optimal solutions set and the reference Pareto optimal solutions set. The calculation equations of the IGD are given as follows: IGD=1Si=1Sminj=1,2,,QdFi,Fj$$\begin{equation}{\rm{IGD = }}\frac{1}{S}\sum_{i = 1}^S {{{\min }}_{j = \left\{ {1,2, \ldots ,Q} \right\}}d\left( {F_i^*,{F}_j} \right)} \end{equation}$$…”
Section: Multi‐objective Hesamentioning
confidence: 99%
“…The inverted generational distance (IGD) and the hyper‐volume (HV) two evaluation indicators are introduced in this paper to evaluate the quality of the Pareto optimal solutions obtained by the multi‐objective HESA. Therein, the IGD indicator (Alp and Alkaya, 2022) is used to measure the convergence and the distribution performance of the obtained Pareto optimal solutions, and also the overall gap including the convergence degree and the diversity of two aspects between the obtained Pareto optimal solutions set and the reference Pareto optimal solutions set. The calculation equations of the IGD are given as follows: IGD=1Si=1Sminj=1,2,,QdFi,Fj$$\begin{equation}{\rm{IGD = }}\frac{1}{S}\sum_{i = 1}^S {{{\min }}_{j = \left\{ {1,2, \ldots ,Q} \right\}}d\left( {F_i^*,{F}_j} \right)} \end{equation}$$…”
Section: Multi‐objective Hesamentioning
confidence: 99%
“…The goal of a unique vehicle-routing problem is to find cost-effective routes for a large number of vehicles [ 1 , 2 , 3 ]. Meanwhile, new issues have arisen, especially in traffic factors such as low data rates, energy efficiency, congestion, and the fastest route [ 4 , 5 , 6 ]. This study focuses on seeking the most effective and the shortest route from a source point to a destination point in urban areas.…”
Section: Introductionmentioning
confidence: 99%