@inproceedings{7a227f5cef964a5081679a251f91a7ba,
title = "A Variable Neighbourhood Search algorithm with compound neighbourhoods 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 interval and capacity constraints. A Variable Neighbourhood Search algorithm with Compound Neighbourhoods is proposed to solve VRPTW in this paper. A number of independent neighbourhood operators are composed into compound neighbourhood operators in a new way, to explore wider search area concerning two objectives (to minimize the number of vehicles and the total travel distance) simultaneously. Promising results are obtained on benchmark datasets.",
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: Copyright {\textcopyright} 2016 by SCITEPRESS - Science and Technology Publications, Lda. All rights reserved.; 5th International Conference on Operations Research and Enterprise Systems, ICORES 2016 ; Conference date: 23-02-2016 Through 25-02-2016",
year = "2016",
doi = "10.5220/0005661800250035",
language = "English",
series = "ICORES 2016 - Proceedings of the 5th International Conference on Operations Research and Enterprise Systems",
publisher = "SciTePress",
pages = "25--35",
editor = "Begona Vitoriano and Parlier, {Greg H.} and {de Werra}, Dominique",
booktitle = "ICORES 2016 - Proceedings of the 5th International Conference on Operations Research and Enterprise Systems",
}