Authors: Mladenović, Nenad 
Todosijević, Raca 
Urošević, Dragan 
Affiliations: Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: An efficient general variable neighborhood search for large travelling salesman problem with time windows
Journal: Yugoslav Journal of Operations Research
Volume: 23
Issue: 1
First page: 19
Last page: 30
Issue Date: 2-Aug-2013
Rank: M51
ISSN: 0354-0243
DOI: 10.2298/YJOR120530015M
Abstract: 
General Variable Neighborhood Search (GVNS) is shown to be a powerful and robust methodology for solving travelling salesman and vehicle routing problems. However, its efficient implementation may play a significant role in solving large size instances. In this paper we suggest new GVNS heuristic for solving Travelling salesman problem with time windows. It uses different set of neighborhoods, new feasibility checking procedure and a more efficient data structure than the recent GVNS method that can be considered as a state-of-the-art heuristic. As a result, our GVNS is much faster and more effective than the previous GVNS. It is able to improve 14 out of 25 best known solutions for large test instances from the literature.
Keywords: Time windows | Travelling salesman problem | Variable neighborhood search
Publisher: Faculty of Organizational Sciences, University of Belgrade
Project: Mathematical Modelas and Optimization Methods on Large-Scale Systems 
Development of new information and communication technologies, based on advanced mathematical methods, with applications in medicine, telecommunications, power systems, protection of national heritage and education 

Show full item record

SCOPUSTM   
Citations

36
checked on Dec 2, 2021

Page view(s)

13
checked on Dec 3, 2021

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.