Multi-cellular-ant algorithm for large scale capacity vehicle route problem

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents a multi-cellular-ant algorithm for large scale capacitated vehicle routing problem with restrictive vehicle capability. The problem is divided into corresponding smaller ones by a decomposition methodology. Relative relationship between subsystems will be solved through cooperative performance among cellular ants to avoid trivial solutions. The empirical results composed with adaptive ant colony algorithm and traditional collaboration show more efficiency and availability. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Li, J., Chai, Y., Li, P., & Yin, H. (2011). Multi-cellular-ant algorithm for large scale capacity vehicle route problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6728 LNCS, pp. 260–266). https://doi.org/10.1007/978-3-642-21515-5_31

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free