From 30 July 2018 the research publications of UK based University of Nottingham authors will be handled through the Research Information System (RIS).
To deposit an article after this date please Login to RIS and use the Outputs tab to Add New Output.
(See this blog for further information about this transition.)

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

Item Type:

Conference or Workshop Item
(Paper)

Additional Information:

Published in: Proceedings of 5th the International Conference on Operations Research and Enterprise Systems, pages 25-35.ISBN 9789897581717 DOI: 10.5220/0005661800250035

Schools/Departments:

University of Nottingham Ningbo China > Faculty of Science and Engineering > School of Computer ScienceUniversity of Nottingham, UK > Faculty of Science > School of Computer Science