A list based 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:18:32Z
dc.date.available	2014-03-01T01:18:32Z
dc.date.issued	2003	en
dc.identifier.issn	0160-5682	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/15068
dc.subject	Distribution	en
dc.subject	Heuristics	en
dc.subject	Logistics	en
dc.subject	Vehicle routing	en
dc.subject.classification	Management	en
dc.subject.classification	Operations Research & Management Science	en
dc.subject.other	Algorithms	en
dc.subject.other	Cost effectiveness	en
dc.subject.other	Fleet operations	en
dc.subject.other	Graph theory	en
dc.subject.other	Heuristic methods	en
dc.subject.other	Optimization	en
dc.subject.other	Heterogenous fixed fleet vehicle routing problem	en
dc.subject.other	Threshold accepting metaheuristic	en
dc.subject.other	Operations research	en
dc.title	A list based threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem	en
heal.type	journalArticle	en
heal.identifier.primary	10.1057/palgrave.jors.2601443	en
heal.identifier.secondary	http://dx.doi.org/10.1057/palgrave.jors.2601443	en
heal.language	English	en
heal.publicationDate	2003	en
heal.abstract	In real life situations most companies that deliver or collect goods own a heterogeneous fleet of vehicles. Their goal is to find a set of vehicle routes, each starting and ending at a depot, making the best possible use of the given vehicle fleet such that total cost is minimized. The specific problem can be formulated as the Heterogeneous Fixed Fleet Vehicle Routing Problem (HFFVRP), which is a variant of the classical Vehicle Routing Problem. This paper describes a variant of the threshold accepting heuristic for the HFFVRP. The proposed metaheuristic has a remarkably simple structure, it is lean and parsimonious and it produces high quality solutions over a set of published benchmark instances. Improvement over several of previous best solutions also demonstrates the capabilities of the method and is encouraging for further research.	en
heal.publisher	PALGRAVE PUBLISHERS LTD	en
heal.journalName	Journal of the Operational Research Society	en
dc.identifier.doi	10.1057/palgrave.jors.2601443	en
dc.identifier.isi	ISI:000181150000008	en
dc.identifier.volume	54	en
dc.identifier.issue	1	en
dc.identifier.spage	65	en
dc.identifier.epage	71	en