Logistics 2009
DOI: 10.1061/40996(330)493
|View full text |Cite
|
Sign up to set email alerts
|

An Improved Ant Colony Optimization for Vehicle Routing Problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

1
76
0

Year Published

2011
2011
2023
2023

Publication Types

Select...
7
2
1

Relationship

0
10

Authors

Journals

citations
Cited by 222 publications
(77 citation statements)
references
References 0 publications
1
76
0
Order By: Relevance
“…The updating of the pheromone trails is a key element to the adaptive learning technique of ACO and the improvement of future solutions (Yu, Yang, & Yao, 2009). This process consists of both pheromone evaporation and new pheromone deposition which can guide ants to explore possible paths and avoid trapping in local optimums.…”
Section: Pheromone Trails Updatingmentioning
confidence: 99%
“…The updating of the pheromone trails is a key element to the adaptive learning technique of ACO and the improvement of future solutions (Yu, Yang, & Yao, 2009). This process consists of both pheromone evaporation and new pheromone deposition which can guide ants to explore possible paths and avoid trapping in local optimums.…”
Section: Pheromone Trails Updatingmentioning
confidence: 99%
“…In the last several decades, researchers mainly focused on heuristics and metaheuristic methods, solutions within rational time, especially for real life applications. As examples of works done that used metaheuristic methods we can mention simulated annealing [1], genetic algorithm [2], [3], tabu search [4], [5], ant colony [6] and particle swarm optimization [7]. These methods of metaheuristic usually take advantage of other methods such as 2-opt or 3-opt or local search methods to improve quality of solutions.…”
Section: Introductionmentioning
confidence: 98%
“…Compared with Tabu search and genetic algorithm (GA), ACO is less applied in VRPTW. However, ACO has successfully been applied to solve capacitated vehicle routing problems, such as (Bullnheimer, Hartl, & Strauss, 1999;Doerner et al, 2002;Doerner, Hartl, Kiechle, Lucka, & Reimann, 2004;Mazzeo & Loiseau, 2004;Yao & Yao, 2007;Yu, Yang, & Yao, 2009).…”
Section: Introductionmentioning
confidence: 98%