An Ant Colony Algorithm with Memory Grouping List for Multi-Depot Vehicle Routing Problem

Wei Zeng; Yong Le He; Xiao Jun Zheng

doi:10.4028/www.scientific.net/AMR.926-930.3354

Paper Titles

A Hybrid Particle Swarm Optimization Algorithm for Dynamic Environments
p.3338

A New Fast Algorithm for Intra Prediction Mode Selection in the High Efficiency Video Coding (HEVC) Standard
p.3342

A Satisfaction Differential Evolution Algorithm for Detailed Machine Layout in Assembly Plant
p.3346

A Text Location Method for Web Images
p.3350

An Ant Colony Algorithm with Memory Grouping List for Multi-Depot Vehicle Routing Problem
p.3354

An Innovative Game Method for Multilevel-Objective Optimization
p.3359

Algorithm Optimization of Shape Setup Calculation in Hot Strip Mill
p.3364

Bidirectional Maximal Matching Word Segmentation Algorithm with Rules
p.3368

Capsule Defects Classification Based on Hierarchical Support Vector Machines
p.3373

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 926-930An Ant Colony Algorithm with Memory Grouping List...

An Ant Colony Algorithm with Memory Grouping List for Multi-Depot Vehicle Routing Problem

Abstract:

Multi-depot vehicle routing problem (MDVRP for short) is complex and a typical NP-Hard problem in manufactories, especially in assembly plant. We herein present an ant colony algorithm with memory grouping list (ACMGL for short) to solve this problem. To handle affiliation between clients and depots, we present certain point grouping (CP Grouping) and uncertain point grouping (UP Grouping) and obtain variable grouping purposes, make a grouping memory list for each depot store the optimal value and path of uncertain grouping after UP grouping, and thus improve the efficiency of the operation. Experimental results verified our algorithm in the computational efficiency.

You might also be interested in these eBooks

Progress in Applied Sciences, Engineering and Technology

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 926-930)

Pages:

3354-3358

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.926-930.3354

Citation:

Cite this paper

Online since:

May 2014

Authors:

Wei Zeng, Yong Le He, Xiao Jun Zheng*

Keywords:

Ant Colony Algorithm, MDVRP, Memory Grouping List

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[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.

DOI: 10.1109/acc.2012.6315583

Google Scholar

[2] G. N. Yucenur and N. C. Demirel: Expert Systems with Applications, vol. 38 (2011), pp.11859-11865.

Google Scholar

[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.774920.

DOI: 10.1117/12.869032

Google Scholar

[4] J. Yao and B. Yao: A parallel ant colony optimization for multi-depot vehicle routing problem, (2007).

Google Scholar

[5] R. Dondo and J. Cerda: European Journal of Operational Research, vol. 176 (2007), pp.1478-1507.

Google Scholar