Hybridized ant colony algorithm for the Multi Compartment Vehicle Routing Problem

- Hybridized ant colony algorithm has been proposed to solve the Multi Compartment Vehicle Routing Problem.
- Numerical experiments were performed to evaluate the performance of the algorithm.
- The numerical results showed that the average total length improvement of the proposed HAC over the existing ACS is 5.1%. In addition, the proposed HAC maintains its high performance in large problems on contrary of the existing ACS.
- The numerical result for the effect of hybridizing the ant colony algorithm with local search schemes has been presented.
- Illustration of the benefit of using two-compartment vehicles instead of single-compartment vehicles has been presented.