An effective local search approach for the Vehicle Routing Problem with Backhauls

Zachariadis, EE; Kiranoudis, CT

dc.contributor.author	Zachariadis, EE	en
dc.contributor.author	Kiranoudis, CT	en
dc.date.accessioned	2014-03-01T02:07:37Z
dc.date.available	2014-03-01T02:07:37Z
dc.date.issued	2012	en
dc.identifier.issn	09574174	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/29595
dc.subject	Backhauls	en
dc.subject	Computational complexity	en
dc.subject	Metaheuristics	en
dc.subject	Vehicle routing	en
dc.subject.other	Aspiration criteria	en
dc.subject.other	Backhauls	en
dc.subject.other	Bench-mark problems	en
dc.subject.other	Fibonacci heap	en
dc.subject.other	Local search	en
dc.subject.other	Metaheuristic	en
dc.subject.other	Metaheuristics	en
dc.subject.other	Minimum cost	en
dc.subject.other	Practical transportation	en
dc.subject.other	Priority queues	en
dc.subject.other	Vehicle Routing Problems	en
dc.subject.other	Computational complexity	en
dc.subject.other	Data structures	en
dc.subject.other	Heuristic methods	en
dc.subject.other	Network routing	en
dc.subject.other	Routing algorithms	en
dc.subject.other	Tabu search	en
dc.title	An effective local search approach for the Vehicle Routing Problem with Backhauls	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/j.eswa.2011.09.004	en
heal.identifier.secondary	http://dx.doi.org/10.1016/j.eswa.2011.09.004	en
heal.publicationDate	2012	en
heal.abstract	This paper deals with a practical transportation model known as the Vehicle Routing Problem with Backhauls (VRPB), which aims at designing the minimum cost route set for satisfying both delivery and pick-up demands. In methodological terms, we propose a local search metaheuristic which explores rich solution neighborhoods composed of exchanges of variable-length customer sequences. To efficiently investigate these rich solution neighborhoods, tentative local search move are statically encoded by data structures stored in Fibonacci Heaps which are special priority queue structures offering fast minimum retrieval, insertion and deletion capabilities. To avoid cycling phenomena and induce diversification, we introduce the concept of promises, which is a parameter-free mechanism based on the regional aspiration criterion used in Tabu Search implementations. The proposed metaheuristic development was tested on well-known VRPB benchmark instances. It exhibited fine performance, as it consistently generated the best-known solutions for all the examined benchmark problems. © 2011 Elsevier Ltd. All rights reserved.	en
heal.journalName	Expert Systems with Applications	en
dc.identifier.doi	10.1016/j.eswa.2011.09.004	en
dc.identifier.volume	39	en
dc.identifier.issue	3	en
dc.identifier.spage	3174	en
dc.identifier.epage	3184	en