Dynamic vehicle routing problem: Solution by ant colony optimization with hybrid immigrant schemes

5Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

During past decades, several Meta-Heuristics were considered by researchers to solve Dynamic Vehicle Routing Problem.In this paper, Ant Colony Optimization integrated with Hybrid Immigrant Schemes methods are proposed for solving Dynamic Vehicle Routing Problem. Ant Colony Optimization with hybrid immigrant schemes methods namely HIACO-I, HIACO- II and HIACO-III focused on establishing the proper balance between intensification and diversification. The performance evaluation of the algorithms in which Random Immigrants and Elitism based Immigrants were hybridized in different proportions and added to Ant Colony Optimization algorithm showed that they had produced better results in many dynamic test cases generated from three Vehicle Routing Problem instances.

Cite

CITATION STYLE

APA

Dhanya, K. M., & Kanmani, S. (2017). Dynamic vehicle routing problem: Solution by ant colony optimization with hybrid immigrant schemes. International Journal of Intelligent Systems and Applications, 9(7), 52–60. https://doi.org/10.5815/ijisa.2017.07.06

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