A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem

Tarantilis, CD; Kiranoudis, CT; Vassiliadis, VS

dc.contributor.author	Tarantilis, CD	en
dc.contributor.author	Kiranoudis, CT	en
dc.contributor.author	Vassiliadis, VS	en
dc.date.accessioned	2014-03-01T01:19:51Z
dc.date.available	2014-03-01T01:19:51Z
dc.date.issued	2004	en
dc.identifier.issn	0377-2217	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/15725
dc.subject	Combinatorial optimization	en
dc.subject	Distribution	en
dc.subject	Logistics	en
dc.subject	Metaheuristics	en
dc.subject	Routing	en
dc.subject.classification	Management	en
dc.subject.classification	Operations Research & Management Science	en
dc.subject.other	Algorithms	en
dc.subject.other	Heuristic methods	en
dc.subject.other	Optimization	en
dc.subject.other	Traffic control	en
dc.subject.other	Vehicles	en
dc.subject.other	Vehicle routing problem (VRP)	en
dc.subject.other	Operations research	en
dc.title	A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/S0377-2217(02)00669-0	en
heal.identifier.secondary	http://dx.doi.org/10.1016/S0377-2217(02)00669-0	en
heal.language	English	en
heal.publicationDate	2004	en
heal.abstract	The purpose of this paper is to present a new metaheuristic, termed the backtracking adaptive threshold accepting algorithm, for solving the heterogeneous fixed fleet vehicle routing problem (HFFVRP). The HFFVRP is a variant of the classical vehicle routing problem (VRP) and has attracted much less attention in the operational research (OR) literature than the classical VRP. It involves the design of a set of minimum cost routes, originating and terminating at a depot, for a fleet with fixed number of vehicles of each type, with various capacities, and variable costs to service a set of customers with known demands. The numerical results show that the proposed algorithm is robust and efficient. New best solutions are reported over a set of published benchmark problems. (C) 2002 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/S0377-2217(02)00669-0	en
dc.identifier.isi	ISI:000185697000011	en
dc.identifier.volume	152	en
dc.identifier.issue	1	en
dc.identifier.spage	148	en
dc.identifier.epage	158	en