• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Article

A Hybrid Approach for the Capacitated Vehicle Routing Problem with Time Windows

CEUR Workshop Proceedings. 2018. Vol. 2098. P. 66-81.

The Vehicle Routing Problem (VRP) is one of the most popular combinatorial optimization problems which is closely related to the real-life optimization challenges. Being developed for more than 60 years the problem has been considered in many different formulations. In real-life goods distribution such constraints as fleet size and mix, site-dependency constraints, hard and soft time windows, vehicle capacity constraints are very important. In this paper we consider Capacitated Vehicle Routing Problem with hard Time Windows. We propose a hybrid heuristic algorithm which contains elements of ant colony optimization strategy and tabu search technique. Our algorithm shows good performance and results for the well-known Solomon dataset.