A multistart adaptive memory-based tabu search algorithm for the heterogeneous fixed fleet open vehicle routing problem

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalNot applicablepeer-review

38 Scopus Citations
View graph of relations

Author(s)

  • Xiangyong Li
  • Stephen C.H. Leung
  • Peng Tian

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)365-374
Journal / PublicationExpert Systems with Applications
Volume39
Issue number1
Publication statusPublished - Jan 2012

Abstract

This paper addressed the heterogeneous fixed fleet open vehicle routing problem (HFFOVRP), in which the demands of customers are fulfilled by a fleet of fixed number of vehicles with various capacities and related costs. Moreover, the vehicles start at the depot and terminate at one of the customers. This problem is an important variant of the classical vehicle routing problem and can cover more practical situations in transportation and logistics. We propose a multistart adaptive memory programming metaheuristic with modified tabu search algorithm to solve this new vehicle routing problem. The algorithmic efficiency and effectiveness are experimentally evaluated on a set of generated instances. © 2011 Elsevier Ltd. All rights reserved.

Research Area(s)

  • Adaptive memory programming, Distribution management, Heterogeneous fleet, Metaheuristics, Vehicle routing