An investigation on compound neighborhoods for VRPTW

Binhui Chen, Rong Qu, Ruibin Bai, Hisao Ishibuchi

Research output: Chapter in Book/Conference proceedingConference contributionpeer-review

5 Citations (Scopus)


The Vehicle Routing Problem with Time Windows (VRPTW) consists of constructing least cost routes from a depot to a set of geographically scattered service points and back to the depot, satisfying service time intervals and capacity constraints. A Variable Neighbourhood Search algorithm which can simultaneously optimize both objectives of VRPTW (to minimize the number of vehicles and the total travel distance) is proposed in this paper. The three compound neighbourhood operators are developed with regards to problem characteristics of VRPTW. Compound neighbourhoods combine a number of independent neighbourhood operators to explore a larger scale of neighbourhood search space. Performance of these operators has been investigated and is evaluated on benchmark problems.

Original languageEnglish
Title of host publicationOperations Research and Enterprise Systems - 5th International Conference, ICORES 2016, Revised Selected Papers
EditorsBegona Vitoriano, Greg H. Parlier
PublisherSpringer Verlag
Number of pages17
ISBN (Print)9783319539812
Publication statusPublished - 2017
Event5th International Conference on Operations Research and Enterprise Systems, ICORES 2016 - Rome, Italy
Duration: 23 Feb 201625 Feb 2016

Publication series

NameCommunications in Computer and Information Science
ISSN (Print)1865-0929


Conference5th International Conference on Operations Research and Enterprise Systems, ICORES 2016


  • Compound neighbourhood
  • Metaheuristics
  • Variable neighbourhood search
  • Vehicle routing problem with time windows

ASJC Scopus subject areas

  • General Computer Science
  • General Mathematics


Dive into the research topics of 'An investigation on compound neighborhoods for VRPTW'. Together they form a unique fingerprint.

Cite this