A list based threshold accepting algorithm for the capacitated 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:17:21Z
dc.date.available	2014-03-01T01:17:21Z
dc.date.issued	2002	en
dc.identifier.issn	0020-7160	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/14479
dc.subject	Logistics networks	en
dc.subject	Meta-heuristics	en
dc.subject	Threshold accepting	en
dc.subject	Vehicle routing	en
dc.subject.classification	Mathematics, Applied	en
dc.subject.other	Decision support systems	en
dc.subject.other	Heuristic methods	en
dc.subject.other	Problem solving	en
dc.subject.other	Vehicles	en
dc.subject.other	Logistics networks	en
dc.subject.other	Meta-heuristics	en
dc.subject.other	Threshold accepting	en
dc.subject.other	Vehicle routing	en
dc.subject.other	Algorithms	en
dc.title	A list based threshold accepting algorithm for the capacitated vehicle routing problem	en
heal.type	journalArticle	en
heal.identifier.primary	10.1080/00207160210948	en
heal.identifier.secondary	http://dx.doi.org/10.1080/00207160210948	en
heal.language	English	en
heal.publicationDate	2002	en
heal.abstract	The aim of this study is to describe a new stochastic search meta-heuristic algorithm for solving the Capacitated Vehicle Routing Problem (CVRP), termed as the List Based Threshold Accepting (LBTA) algorithm. The main advantage of this algorithm over the majority of other meta-heuristics is that it produces quite satisfactory solutions in reasonable amount of time by tuning only one parameter of the algorithm. This property makes this algorithm a reliable and a practical tool for every decision support system designed for solving real life vehicle routing problems. © 2002 Taylor and Francis Ltd.	en
heal.publisher	TAYLOR & FRANCIS LTD	en
heal.journalName	International Journal of Computer Mathematics	en
dc.identifier.doi	10.1080/00207160210948	en
dc.identifier.isi	ISI:000176035600002	en
dc.identifier.volume	79	en
dc.identifier.issue	5	en
dc.identifier.spage	537	en
dc.identifier.epage	553	en