Computational study of neighborhood operator performance on the Traveling Salesman Problem with Time Windows in neighborhood search based frameworks (RTS, VNS)

Michael Bögl, Günther Zäpfel, Michael Affenzeller

Research output: Chapter in Book/Report/Conference proceedingsConference contributionpeer-review

5 Citations (Scopus)

Abstract

In this work we analyze the performance of different neighborhood operators in terms of solution quality in different neighborhood search based frameworks, namely Reactive Tabu Search and Variable Neighborhood Search, on the Traveling Salesman Problem with Time Windows. We compare the impact of the two different search concepts on the solution quality by embedding the same operators and hence be able to precisely state the impact of the basic concept. Additionally, we analyze the improvement of those search strategies compared to a simple local search procedure. The neighborhood operators under consideration are 1-shift, nodeexchange, lexicographic 2-opt, lexicographic 3-opt and or-opt.

Original languageEnglish
Title of host publicationLINDI 2011 - 3rd IEEE International Symposium on Logistics and Industrial Informatics, Proceedings
Pages39-44
Number of pages6
DOIs
Publication statusPublished - 2011
Event3rd IEEE International Symposium on Logistics and Industrial Informatics, LINDI 2011 - Budapest, Hungary
Duration: 25 Aug 201127 Aug 2011

Publication series

NameLINDI 2011 - 3rd IEEE International Symposium on Logistics and Industrial Informatics, Proceedings

Conference

Conference3rd IEEE International Symposium on Logistics and Industrial Informatics, LINDI 2011
CountryHungary
CityBudapest
Period25.08.201127.08.2011

Fingerprint Dive into the research topics of 'Computational study of neighborhood operator performance on the Traveling Salesman Problem with Time Windows in neighborhood search based frameworks (RTS, VNS)'. Together they form a unique fingerprint.

Cite this