Dynamic Vehicle Routing Problem: Solution by Ant Colony Optimization with Hybrid Immigrant Schemes | Zendy

K. M. Dhanya | Zendy; S. Kanmani | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Dynamic Vehicle Routing Problem: Solution by Ant Colony Optimization with Hybrid Immigrant Schemes

Author(s) -

K. M. Dhanya,

S. Kanmani

Publication year - 2017

Publication title -

international journal of intelligent systems and applications

Language(s) - English

Resource type - Journals

eISSN - 2074-9058

pISSN - 2074-904X

DOI - 10.5815/ijisa.2017.07.06

Subject(s) - ant colony optimization algorithms , computer science , vehicle routing problem , heuristics , routing (electronic design automation) , diversification (marketing strategy) , mathematical optimization , metaheuristic , artificial intelligence , computer network , mathematics , marketing , business , operating system

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, HIACOII 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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research