Multiple Ant Colony Optimization for a Rich Vehicle Routing Problem: A Case Study

  • Authors:
  • Paola Pellegrini;Daniela Favaretto;Elena Moretti

  • Affiliations:
  • Department of Applied Mathematics, University Ca' Foscari of Venice, Dorsoduro 3825/E, I---30123 Venice, Italy;Department of Applied Mathematics, University Ca' Foscari of Venice, Dorsoduro 3825/E, I---30123 Venice, Italy;Department of Applied Mathematics, University Ca' Foscari of Venice, Dorsoduro 3825/E, I---30123 Venice, Italy

  • Venue:
  • KES '07 Knowledge-Based Intelligent Information and Engineering Systems and the XVII Italian Workshop on Neural Networks on Proceedings of the 11th International Conference
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Starting from a case study, a rich vehicle routing problem is analyzed. It is characterized by multiple time windows, heterogeneous fleet, maximum duration, and multiple visits. Two variants of Ant Colony Optimization are proposed in a multiple colonies framework. Two algorithms are tested, giving results that appear satisfactory with respect to the ones achieved by the firm.