A new tabu search heuristic for the open vehicle routing problem

Z. Fu, R. Eglese, Yuk On Li

Research output: Journal article publicationReview articleAcademic researchpeer-review

115 Citations (Scopus)

Abstract

In this paper, another version of the vehicle routing problem (VRP) - the open vehicle routing problem (OVRP) is studied, in which the vehicles are not required to return to the depot, but if they do, it must be by revisiting the customers assigned to them in the reverse order. By exploiting the special structure of this type of problem, we present a new tabu search heuristic for finding the routes that minimize two objectives while satisfying three constraints. The computational results are provided and compared with two other methods in the literature.
Original languageEnglish
Pages (from-to)267-274
Number of pages8
JournalJournal of the Operational Research Society
Volume56
Issue number3
DOIs
Publication statusPublished - 1 Mar 2005

Keywords

  • Distribution management
  • Open vehicle routing problem
  • Tabu search
  • Vehicle routing

ASJC Scopus subject areas

  • Management of Technology and Innovation
  • Strategy and Management
  • Management Science and Operations Research

Cite this