A hybrid metaheuristic algorithm for the vehicle routing problem with simultaneous delivery and pick-up service

Zachariadis, EE; Tarantilis, CD; Kiranoudis, CT

dc.contributor.author	Zachariadis, EE	en
dc.contributor.author	Tarantilis, CD	en
dc.contributor.author	Kiranoudis, CT	en
dc.date.accessioned	2014-03-01T01:29:33Z
dc.date.available	2014-03-01T01:29:33Z
dc.date.issued	2009	en
dc.identifier.issn	0957-4174	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/19305
dc.subject	Deliveries pick-ups	en
dc.subject	Guided local search	en
dc.subject	Metaheuristics	en
dc.subject	Simultaneous	en
dc.subject	Tabu search	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	Benchmarking	en
dc.subject.other	Combinatorial mathematics	en
dc.subject.other	Combinatorial optimization	en
dc.subject.other	Customer satisfaction	en
dc.subject.other	Heuristic methods	en
dc.subject.other	Network routing	en
dc.subject.other	Nuclear propulsion	en
dc.subject.other	Online searching	en
dc.subject.other	Packet networks	en
dc.subject.other	Routing algorithms	en
dc.subject.other	Sales	en
dc.subject.other	Solutions	en
dc.subject.other	Tabu search	en
dc.subject.other	Vehicle routing	en
dc.subject.other	Best solutions	en
dc.subject.other	Combinatorial optimization problems	en
dc.subject.other	Deliveries pick-ups	en
dc.subject.other	Exact methods	en
dc.subject.other	Guided local search	en
dc.subject.other	Guided local searches	en
dc.subject.other	High qualities	en
dc.subject.other	Hybrid solutions	en
dc.subject.other	Metaheuristic algorithms	en
dc.subject.other	Metaheuristics	en
dc.subject.other	NP-hard	en
dc.subject.other	Optimal sets	en
dc.subject.other	Routing problems	en
dc.subject.other	Search spaces	en
dc.subject.other	Simultaneous	en
dc.subject.other	VEHICLE ROUTING problems	en
dc.subject.other	Problem solving	en
dc.title	A hybrid metaheuristic algorithm for the vehicle routing problem with simultaneous delivery and pick-up service	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/j.eswa.2007.11.005	en
heal.identifier.secondary	http://dx.doi.org/10.1016/j.eswa.2007.11.005	en
heal.language	English	en
heal.publicationDate	2009	en
heal.abstract	This article addresses a vehicle routing problem variant which considers customers to require simultaneous delivery and pick-Lip service (VRPSPD). The objective of this problem is to determine the optimal set of routes to totally satisfy both the delivery and pick-up demand of the customer population. VRPSPD is an NP-hard combinatorial optimization problem; therefore exact methods are incapable of dealing with large scale VRPSPD instances arising in a wide variety of practical operations. We propose a hybrid solution approach incorporating the rationale of two well-known metaheuristics which have proven to be effective for routing problem variants, namely tabu search and guided local search. The intelligence of the proposed hybrid was designed to achieve a vast exploration of the search space, by escaping from local optima and intensifying at promising solution regions. The performance of our metaheuristic algorithm was tested on benchmark instances involving from 50 to 400 Customers. It produced high quality results, improving several best solutions previously reported. (C) 2007 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.2007.11.005	en
dc.identifier.isi	ISI:000262178000011	en
dc.identifier.volume	36	en
dc.identifier.issue	2 PART 1	en
dc.identifier.spage	1070	en
dc.identifier.epage	1081	en