A hybridisation of adaptive variable neighbourhood search and large neighbourhood search: Application to the vehicle routing problem
In this paper, an adaptive variable neighbourhood search (AVNS) algorithm that incorporates large neighbourhood search (LNS) as a diversification strategy is proposed and applied to the capacitated vehicle routing problem. The AVNS consists of two stages: a learning phase and a multi-level VNS wit...
Saved in:
Main Authors: | , , |
---|---|
Format: | E-Article |
Language: | English |
Published: |
Elsevier Ltd
2016
|
Subjects: | |
Online Access: | http://ir.unimas.my/id/eprint/13926/7/A%20hybridisation%20of%20adaptive%20variable%20neighbourhood%20search%20%28abstract%29.pdf http://ir.unimas.my/id/eprint/13926/ http://www.sciencedirect.com/science/article/pii/S0957417416304596 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Universiti Malaysia Sarawak |
Language: | English |
id |
my.unimas.ir.13926 |
---|---|
record_format |
eprints |
spelling |
my.unimas.ir.139262017-12-29T07:38:22Z http://ir.unimas.my/id/eprint/13926/ A hybridisation of adaptive variable neighbourhood search and large neighbourhood search: Application to the vehicle routing problem Sze, Jeeu Fong Salhi, S. Wassan, N. T Technology (General) In this paper, an adaptive variable neighbourhood search (AVNS) algorithm that incorporates large neighbourhood search (LNS) as a diversification strategy is proposed and applied to the capacitated vehicle routing problem. The AVNS consists of two stages: a learning phase and a multi-level VNS with guided local search. The adaptive aspect is integrated in the local search where a set of highly successful local searches is selected based on the intelligent selection mechanism. In addition, the hybridisation of LNS with the AVNS enables the solution to escape from the local minimum effectively. To make the algorithm more competitive in terms of the computing time, a simple and flexible data structure and a neighbourhood reduction scheme are embedded. Finally, we adapt a new local search move and an effective removal strategy for the LNS. The proposed AVNS was tested on the benchmark data sets from the literature and produced very competitive results Elsevier Ltd 2016-12-15 E-Article PeerReviewed text en http://ir.unimas.my/id/eprint/13926/7/A%20hybridisation%20of%20adaptive%20variable%20neighbourhood%20search%20%28abstract%29.pdf Sze, Jeeu Fong and Salhi, S. and Wassan, N. (2016) A hybridisation of adaptive variable neighbourhood search and large neighbourhood search: Application to the vehicle routing problem. Expert Systems with Applications, 65. pp. 383-397. ISSN 09574174 http://www.sciencedirect.com/science/article/pii/S0957417416304596 DOI: 10.1016/j.eswa.2016.08.060 |
institution |
Universiti Malaysia Sarawak |
building |
Centre for Academic Information Services (CAIS) |
collection |
Institutional Repository |
continent |
Asia |
country |
Malaysia |
content_provider |
Universiti Malaysia Sarawak |
content_source |
UNIMAS Institutional Repository |
url_provider |
http://ir.unimas.my/ |
language |
English |
topic |
T Technology (General) |
spellingShingle |
T Technology (General) Sze, Jeeu Fong Salhi, S. Wassan, N. A hybridisation of adaptive variable neighbourhood search and large neighbourhood search: Application to the vehicle routing problem |
description |
In this paper, an adaptive variable neighbourhood search (AVNS) algorithm that incorporates large neighbourhood
search (LNS) as a diversification strategy is proposed and applied to the capacitated vehicle
routing problem. The AVNS consists of two stages: a learning phase and a multi-level VNS with guided
local search. The adaptive aspect is integrated in the local search where a set of highly successful local
searches is selected based on the intelligent selection mechanism. In addition, the hybridisation of
LNS with the AVNS enables the solution to escape from the local minimum effectively. To make the algorithm
more competitive in terms of the computing time, a simple and flexible data structure and a
neighbourhood reduction scheme are embedded. Finally, we adapt a new local search move and an effective
removal strategy for the LNS. The proposed AVNS was tested on the benchmark data sets from the
literature and produced very competitive results |
format |
E-Article |
author |
Sze, Jeeu Fong Salhi, S. Wassan, N. |
author_facet |
Sze, Jeeu Fong Salhi, S. Wassan, N. |
author_sort |
Sze, Jeeu Fong |
title |
A hybridisation of adaptive variable neighbourhood search and large neighbourhood search: Application to the vehicle routing problem |
title_short |
A hybridisation of adaptive variable neighbourhood search and large neighbourhood search: Application to the vehicle routing problem |
title_full |
A hybridisation of adaptive variable neighbourhood search and large neighbourhood search: Application to the vehicle routing problem |
title_fullStr |
A hybridisation of adaptive variable neighbourhood search and large neighbourhood search: Application to the vehicle routing problem |
title_full_unstemmed |
A hybridisation of adaptive variable neighbourhood search and large neighbourhood search: Application to the vehicle routing problem |
title_sort |
hybridisation of adaptive variable neighbourhood search and large neighbourhood search: application to the vehicle routing problem |
publisher |
Elsevier Ltd |
publishDate |
2016 |
url |
http://ir.unimas.my/id/eprint/13926/7/A%20hybridisation%20of%20adaptive%20variable%20neighbourhood%20search%20%28abstract%29.pdf http://ir.unimas.my/id/eprint/13926/ http://www.sciencedirect.com/science/article/pii/S0957417416304596 |
_version_ |
1644511780784832512 |