2016 Chinese Control and Decision Conference (CCDC) 2016
DOI: 10.1109/ccdc.2016.7531345
|View full text |Cite
|
Sign up to set email alerts
|

A solution for simultaneous adaptive ant colony algorithm to memory demand vehicle routing problem with pickups

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 3 publications
0
2
0
Order By: Relevance
“…The first iteration AMP is run so that it can cover the drawback of AAC falling into local minimum and on the result of AMP, i.e., a second iteration of AAC is run. By doing this, we have seen that the path length is minimized for vehicle path planning used in logistics [81].…”
Section: Ant Colony Algorithmmentioning
confidence: 99%
“…The first iteration AMP is run so that it can cover the drawback of AAC falling into local minimum and on the result of AMP, i.e., a second iteration of AAC is run. By doing this, we have seen that the path length is minimized for vehicle path planning used in logistics [81].…”
Section: Ant Colony Algorithmmentioning
confidence: 99%
“…The adaptive ant colony algorithm proposed in the literature [42][43][44] adaptively controls the proportion of pheromone concentration in the current optimal solution and updates the global pheromone concentration of the optimal path in real time by introducing a hyperbolic sine function as an adaptive dynamic factor σ(σ ∈ (0, 1)). In this way, the path exploration results can be effectively implemented when the performance of each path is known.…”
Section: Global Dynamic Selection Of Pathmentioning
confidence: 99%