Hybrid 2-stage Imperialist Competitive Algorithm with Ant Colony Optimization for Solving Multi-Depot Vehicle Routing Problem
This research proposes a hybrid algorithm to solve complex Multi-Depot Vehicle Routing Problems (MDVRPs). It combines the Imperialist Competitive Algorithm (ICA) for assigning customers to specific depots with Ant Colony Optimization (ACO) for determining the actual routes and sequences. The method aims to find optimal solutions by using ICA for strategic assignment and ACO for efficient vehicle routing.