A variable neighbourhood search algorithm with compound neighbourhoods for VRPTW

Chen, Binhui and Qu, Rong and Bai, Ruibin and Ishibuchi, Hisao (2016) A variable neighbourhood search algorithm with compound neighbourhoods for VRPTW. In: The 2016 International Conference on Operations Research and Enterprise Systems, 23-25 February 2016, Rome, Italy.

Full text not available from this repository.

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)
RIS ID: https://nottingham-repository.worktribe.com/output/775168
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 Science
University of Nottingham, UK > Faculty of Science > School of Computer Science
Depositing User: Qu, Rong
Date Deposited: 10 Jun 2016 09:27
Last Modified: 04 May 2020 17:35
URI: http://eprints.nottingham.ac.uk/id/eprint/33886

Actions (Archive Staff Only)

Edit View Edit View