Please use this identifier to cite or link to this item:
Title: Initialization methods for the TSP with Time Windows using Variable Neighborhood Search
Authors: Papalitsas, Christos
Giannakis, Konstantinos
Andronikos, Theodore
Theotokis, Dimitrios
Sifaleras, Angelo
Type: Book chapter
Subjects: FRASCATI::Natural sciences::Mathematics::Applied Mathematics
FRASCATI::Natural sciences::Computer and information sciences
Keywords: Combinatorial optimization
Traveling Salesman Problem
Time Windows
Variable Neighborhood Search
Issue Date: 2015
Publisher: IEEE
First Page: 1
Last Page: 6
Volume Title: 6th International Conference on Information, Intelligence, Systems and Applications (IISA 2015)
Abstract: This paper presents a General Variable Search heuristic, trying to discover initial, feasible solution for the Travelling Salesman Problem with Time Windows. More specifically, we provide all relevant information regarding TSP-TW, Variable Neighborhood Search (VNS) and initialization methods, then we quote all related work in the direction on solving this NP-HARD problem, and at last we propose our new implementation for generating initial, feasible solution for the TSP-TW. We are thoroughly focused on the behavior of our main algorithm to different random-based or sorting-based initialization procedures of our main implemented algorithm. At last, we show experimentally that in some cases, the use of a sorting function as an initialization function in this algorithm did not work and never returned a feasible solution in some cases.
ISBN: 978-1-4673-9311-9
Other Identifiers: 10.1109/IISA.2015.7388106
Appears in Collections:Department of Applied Informatics

Files in This Item:
File Description SizeFormat 
Initialization methods for the TSP with time windows using variable neighborhood search.pdf265,89 kBAdobe PDFView/Open

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