A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem

Nikolakopoulos, A; Sarimveis, H

dc.contributor.author	Nikolakopoulos, A	en
dc.contributor.author	Sarimveis, H	en
dc.date.accessioned	2014-03-01T01:25:51Z
dc.date.available	2014-03-01T01:25:51Z
dc.date.issued	2007	en
dc.identifier.issn	0377-2217	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/17773
dc.subject	Combinatorial optimization	en
dc.subject	Metaheuristics	en
dc.subject	Scheduling	en
dc.subject	Threshold accepting	en
dc.subject	Traveling salesman problem	en
dc.subject.classification	Management	en
dc.subject.classification	Operations Research & Management Science	en
dc.subject.other	Algorithms	en
dc.subject.other	Computational complexity	en
dc.subject.other	Heuristic methods	en
dc.subject.other	Problem solving	en
dc.subject.other	Scheduling	en
dc.subject.other	Combinatorial optimization	en
dc.subject.other	Metaheuristics	en
dc.subject.other	Threshold accepting	en
dc.subject.other	Traveling salesman problem	en
dc.title	A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/j.ejor.2005.12.010	en
heal.identifier.secondary	http://dx.doi.org/10.1016/j.ejor.2005.12.010	en
heal.language	English	en
heal.publicationDate	2007	en
heal.abstract	In real life scheduling, variations of the standard traveling salesman problem are very often encountered. The aim of this work is to present a new heuristic method for solving three such special instances with a common approach. The proposed algorithm uses a variant of the threshold accepting method, enhanced with intense local search, while the candidate solutions are produced through an insertion heuristic scheme. The main characteristic of the algorithm is that it does not require modifications and parameter tuning in order to cope with the three different problems. Computational results on a variety of real life and artificial problems are presented at the end of this work and prove the efficiency and the ascendancy of the proposed method over other algorithms found in the literature. (c) 2005 Elsevier B.V. All rights reserved.	en
heal.publisher	ELSEVIER SCIENCE BV	en
heal.journalName	European Journal of Operational Research	en
dc.identifier.doi	10.1016/j.ejor.2005.12.010	en
dc.identifier.isi	ISI:000242631600043	en
dc.identifier.volume	177	en
dc.identifier.issue	3	en
dc.identifier.spage	1911	en
dc.identifier.epage	1929	en