Coupling ant colony systems with strong local searches
European Journal of Operational Research, ISSN: 0377-2217, Vol: 220, Issue: 3, Page: 831-843
2012
- 64Citations
- 60Captures
Metric Options: Counts1 Year3 YearSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Article Description
Ant colony system is a well known metaheuristic framework, and many efficient algorithms for different combinatorial optimization problems have been derived from this general framework. In this paper some directions for improving the original framework when a strong local search routine is available, are identified. In particular, some modifications able to speed up the method and make it competitive on large problem instances, on which the original framework tends to be weaker, are described. The resulting framework, called Enhanced Ant Colony System is tested on three well-known combinatorial optimization problems arising in the transportation field. Many new best known solutions are retrieved for the benchmarks available for these optimization problems.
Bibliographic Details
http://www.sciencedirect.com/science/article/pii/S0377221712001889; http://dx.doi.org/10.1016/j.ejor.2012.02.038; http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=84859751410&origin=inward; https://linkinghub.elsevier.com/retrieve/pii/S0377221712001889; https://api.elsevier.com/content/article/PII:S0377221712001889?httpAccept=text/xml; https://api.elsevier.com/content/article/PII:S0377221712001889?httpAccept=text/plain; https://dx.doi.org/10.1016/j.ejor.2012.02.038
Elsevier BV
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know