A local search metaheuristic algorithm for the vehicle routing problem with simultaneous pick-ups and deliveries

Zachariadis, EE; Kiranoudis, CT

dc.contributor.author	Zachariadis, EE	en
dc.contributor.author	Kiranoudis, CT	en
dc.date.accessioned	2014-03-01T01:34:54Z
dc.date.available	2014-03-01T01:34:54Z
dc.date.issued	2011	en
dc.identifier.issn	0957-4174	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/20925
dc.subject	Computational complexity	en
dc.subject	Metaheuristics	en
dc.subject	Simultaneous pick-ups and deliveries	en
dc.subject	Vehicle routing	en
dc.subject.classification	Computer Science, Artificial Intelligence	en
dc.subject.classification	Engineering, Electrical & Electronic	en
dc.subject.classification	Operations Research & Management Science	en
dc.subject.other	Aspiration criteria	en
dc.subject.other	Basic solutions	en
dc.subject.other	Capacity constraints	en
dc.subject.other	Local search	en
dc.subject.other	Local search operators	en
dc.subject.other	Meta heuristic algorithm	en
dc.subject.other	Meta heuristics	en
dc.subject.other	Metaheuristic	en
dc.subject.other	Practical transportation	en
dc.subject.other	Reverse logistics	en
dc.subject.other	Simultaneous pick-ups and deliveries	en
dc.subject.other	Solution approach	en
dc.subject.other	Test problem	en
dc.subject.other	Vehicle Routing Problems	en
dc.subject.other	Computational complexity	en
dc.subject.other	Data structures	en
dc.subject.other	Heuristic algorithms	en
dc.subject.other	Heuristic methods	en
dc.subject.other	Mathematical operators	en
dc.subject.other	Model checking	en
dc.subject.other	Pickups	en
dc.subject.other	Routing algorithms	en
dc.subject.other	Vehicles	en
dc.subject.other	Tabu search	en
dc.title	A local search metaheuristic algorithm for the vehicle routing problem with simultaneous pick-ups and deliveries	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/j.eswa.2010.08.061	en
heal.identifier.secondary	http://dx.doi.org/10.1016/j.eswa.2010.08.061	en
heal.language	English	en
heal.publicationDate	2011	en
heal.abstract	This article proposes a local search metaheuristic solution approach for the vehicle routing problem with simultaneous pick-ups and deliveries (VRPSPD), which models numerous practical transportation operations in the context of reverse logistics. The proposed algorithm is capable of exploring wide solution neighborhoods by statically encoding moves into special data structures. To avoid cycling and induce diversification, the overall search is coordinated by the use of the promises concept which is based on the aspiration criteria of tabu search. The proposed promises implementation is applied to basic solution features, namely solution arcs. In terms of the challenging capacity constraints imposed by the VRPSPD model, we present a constant-time feasibility checking procedure for the employed local search operators. The presented metaheuristic development was tested on eighteen large-scale VRPSPD benchmark instances derived from the literature. It proved to be both robust and effective, improving most of the previously best-known solutions of the examined test problems. (C) 2010 Elsevier Ltd. All rights reserved.	en
heal.publisher	PERGAMON-ELSEVIER SCIENCE LTD	en
heal.journalName	Expert Systems with Applications	en
dc.identifier.doi	10.1016/j.eswa.2010.08.061	en
dc.identifier.isi	ISI:000284863200153	en
dc.identifier.volume	38	en
dc.identifier.issue	3	en
dc.identifier.spage	2717	en
dc.identifier.epage	2726	en