An ant colony algorithm with memory grouping list for multi-depot vehicle routing problem

Advanced Materials Research

Volumn 926-930, Issue , 2014, Pages 3354-3358

  Zeng, Wei ^a   He, Yong Le ^b   Zheng, Xiao Jun ^c  

^a CHINA NORTH VEHICLE RESEARCH INSTITUTE   (China)

^b DALIAN UNIVERSITY OF TECHNOLOGY   (China)

^c DALIAN UNIVERSITY   (China)

Author keywords

Ant colony algorithm; MDVRP; Memory grouping list

Indexed keywords

COMPUTATIONAL COMPLEXITY; NETWORK ROUTING; ROUTING ALGORITHMS;

ANT COLONY ALGORITHMS; ASSEMBLY PLANTS; MDVRP; MULTI-DEPOT VEHICLE ROUTING PROBLEMS; OPTIMAL VALUES;

ALGORITHMS;

EID: 84902248639     PISSN: 10226680     EISSN: None     Source Type: Book Series    
DOI: 10.4028/www.scientific.net/AMR.926-930.3354     Document Type: Conference Paper

References (5)

1. K. S. V. Narasimha, E. Kivelevitch, and M. Kumar: "Ant Colony optimization technique to Solve the min-max multi depot vehicle routing problem," in 2012 American Control Conference, ACC 2012, June 27, 2012 - June 29, 2012, Montreal, QC, Canada, 2012, pp. 3980-3985.
2. G. N. Yucenur and N. C. Demirel: Expert Systems with Applications, vol. 38 (2011), p. 11859-11865.
3. H.S. Liang, "Hybrid tabu search for the multi-depot vehicle routing problem," in 2010 International Conference on Display and Photonics, 12-13 July 2010, USA, 2010, p.774-920.
4. J. Yao and B. Yao: A parallel ant colony optimization for multi-depot vehicle routing problem, 2007.
5. R. Dondo and J. Cerda: Europeaun Journal of Operational Research, vol. 176 (2007), p.1478-1507.