A variable neighbourhood search algorithm with compound neighbourhoods for VRPTW
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...
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2016
|
| Online Access: | https://eprints.nottingham.ac.uk/33886/ |
| _version_ | 1848794727734837248 |
|---|---|
| author | Chen, Binhui Qu, Rong Bai, Ruibin Ishibuchi, Hisao |
| author_facet | Chen, Binhui Qu, Rong Bai, Ruibin Ishibuchi, Hisao |
| author_sort | Chen, Binhui |
| building | Nottingham Research Data Repository |
| collection | Online Access |
| description | 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 |
| first_indexed | 2025-11-14T19:20:48Z |
| format | Conference or Workshop Item |
| id | nottingham-33886 |
| institution | University of Nottingham Malaysia Campus |
| institution_category | Local University |
| last_indexed | 2025-11-14T19:20:48Z |
| publishDate | 2016 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | nottingham-338862020-05-04T17:35:30Z https://eprints.nottingham.ac.uk/33886/ A variable neighbourhood search algorithm with compound neighbourhoods for VRPTW Chen, Binhui Qu, Rong Bai, Ruibin Ishibuchi, Hisao 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 2016-02-25 Conference or Workshop Item PeerReviewed Chen, Binhui, Qu, Rong, 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. http://www.scitepress.org/DigitalLibrary/PublicationsDetail.aspx?ID=SIa0Nd3aHTI=&t=1 |
| spellingShingle | Chen, Binhui Qu, Rong Bai, Ruibin Ishibuchi, Hisao A variable neighbourhood search algorithm with compound neighbourhoods for VRPTW |
| title | A variable neighbourhood search algorithm with compound neighbourhoods for VRPTW |
| title_full | A variable neighbourhood search algorithm with compound neighbourhoods for VRPTW |
| title_fullStr | A variable neighbourhood search algorithm with compound neighbourhoods for VRPTW |
| title_full_unstemmed | A variable neighbourhood search algorithm with compound neighbourhoods for VRPTW |
| title_short | A variable neighbourhood search algorithm with compound neighbourhoods for VRPTW |
| title_sort | variable neighbourhood search algorithm with compound neighbourhoods for vrptw |
| url | https://eprints.nottingham.ac.uk/33886/ https://eprints.nottingham.ac.uk/33886/ |