A hybrid algorithm for vehicle routing problem with time windows

  • Authors:

  • B. Yu;Z. Z. Yang;B. Z. Yao

  • Affiliations:

  • Transportation Management College, Dalian Maritime University, Dalian 116026 PR China;Transportation Management College, Dalian Maritime University, Dalian 116026 PR China;School of Civil Engineering & Architecture, Beijing Jiaotong University, Beijing 100044, PR China

  • Venue:
  • Expert Systems with Applications: An International Journal
  • Year:
  • 2011

Quantified Score

Hi-index 12.06

Visualization

Abstract

Vehicle routing problem with time windows (VRPTW) is a well-known combinatorial problem. Many researches have presented meta-heuristics are effective approaches for VRPTW. This paper proposes a hybrid approach, which consists of ant colony optimization (ACO) and Tabu search, to solve the problem. To improve the performance of ACO, a neighborhood search is introduced. Furthermore, when ACO is close to the convergence Tabu search is used to maintain the diversity of ACO and explore new solutions. Computational experiments are reported for a set of the Solomon's 56 VRPTW and the approach is compared with some meta-heuristic published in literature. Results show that considering the tradeoff of quality and computation time, the hybrid algorithm is a competitive approach for VRPTW.