improved multi-ant-colony algorithm for solving multi- objective vehicle routing problems

Classical vehicle routing problems (vrp) involves supply of goods/services from a central depot to geographically scattered customers. besides the classical objective of minimizing the total travelled distance, the present work also considers simultaneous optimization of two additional objectives namely minimizing make span and minimizing distance imbalance. a mathematical model for this multi- objective version of vrp (mo-vrptw) has been developed. a meta-heuristic based on multiple ant colony system for solving this mo-vrptw has also been proposed. firefly algorithm (fa) has also been applied to avoid local optima. two new migration operators named migration-i and migration-ii and multi-pheromone matrices have been developed to further improve the solution set. the proposed algorithm has been tested on a number of benchmark problems and its superiority over other state of art approaches and nsga-ii one of the commonly used method for multi-objective optimization problems is demonstrated.