2007 International Conference on Machine Learning and Cybernetics 2007
DOI: 10.1109/icmlc.2007.4370284
|View full text |Cite
|
Sign up to set email alerts
|

RLC_ACS: An Improved Ant Colony Algorithm for VRPSDP

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2016
2016
2016
2016

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 9 publications
0
1
0
Order By: Relevance
“…Different types of metaheuristics have been used to solve a wide range of stochastic COPs. The following examples illustrate the use of different metaheuristics for solving stochastic VRPs: Ant Colony Optimization (Dorigo, 1992;Bianchi et al, 2006;Zhang, 2007); Evolutionary Computation and Genetic Algorithms (Holland, 1973;Bianchi et al, 2006;Tan et al, 2007;Ismail, 2008;Shanmugam et al, 2011); Iterated Local Search (Lourenço et al, 2003;Bianchi et al, 2006); Large Neighbourhood Search (Shaw, 1998;Lei et al, 2011); Particle Swarm Optimization (Kennedy and Eberhart, 1995;Shanmugam et al, 2011;Moghaddam et al, 2012;Marinakis et al, 2013); Scatter Search (Glover, 1977;Zhang et al, 2012); Simulated Annealing (Kirkpatrick et al, 1983;Teodorovic and Pavkovic, 1992;Bianchi et al, 2006); and Tabu Search (Glover, 1986;Gendreau et al, 1996a, b;Bianchi et al, 2006;Ismail, 2008;Shen et al, 2009). The reader is referred to Bianchi et al (2009) for a thorough survey of metaheuristics applied to other stochastic COPs.…”
Section: Solving Stochastic Cops Through Metaheuristicsmentioning
confidence: 99%
“…Different types of metaheuristics have been used to solve a wide range of stochastic COPs. The following examples illustrate the use of different metaheuristics for solving stochastic VRPs: Ant Colony Optimization (Dorigo, 1992;Bianchi et al, 2006;Zhang, 2007); Evolutionary Computation and Genetic Algorithms (Holland, 1973;Bianchi et al, 2006;Tan et al, 2007;Ismail, 2008;Shanmugam et al, 2011); Iterated Local Search (Lourenço et al, 2003;Bianchi et al, 2006); Large Neighbourhood Search (Shaw, 1998;Lei et al, 2011); Particle Swarm Optimization (Kennedy and Eberhart, 1995;Shanmugam et al, 2011;Moghaddam et al, 2012;Marinakis et al, 2013); Scatter Search (Glover, 1977;Zhang et al, 2012); Simulated Annealing (Kirkpatrick et al, 1983;Teodorovic and Pavkovic, 1992;Bianchi et al, 2006); and Tabu Search (Glover, 1986;Gendreau et al, 1996a, b;Bianchi et al, 2006;Ismail, 2008;Shen et al, 2009). The reader is referred to Bianchi et al (2009) for a thorough survey of metaheuristics applied to other stochastic COPs.…”
Section: Solving Stochastic Cops Through Metaheuristicsmentioning
confidence: 99%