@inproceedings{ebc884df34d44d399374a682fd3ed859,
title = "An investigation on compound neighborhoods for VRPTW",
abstract = "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.",
keywords = "Compound neighbourhood, Metaheuristics, Variable neighbourhood search, Vehicle routing problem with time windows",
author = "Binhui Chen and Rong Qu and Ruibin Bai and Hisao Ishibuchi",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing AG 2017.; 5th International Conference on Operations Research and Enterprise Systems, ICORES 2016 ; Conference date: 23-02-2016 Through 25-02-2016",
year = "2017",
doi = "10.1007/978-3-319-53982-9_1",
language = "English",
isbn = "9783319539812",
series = "Communications in Computer and Information Science",
publisher = "Springer Verlag",
pages = "3--19",
editor = "Begona Vitoriano and Parlier, {Greg H.}",
booktitle = "Operations Research and Enterprise Systems - 5th International Conference, ICORES 2016, Revised Selected Papers",
address = "Germany",
}