A Guided Tabu Search for the Vehicle Routing Problem with two-dimensional loading constraints

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	0377-2217	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/19302
dc.subject	Guided Local Search	en
dc.subject	Loading constraints	en
dc.subject	Tabu Search	en
dc.subject	Vehicle routing	en
dc.subject.classification	Management	en
dc.subject.classification	Operations Research & Management Science	en
dc.subject.other	Data storage equipment	en
dc.subject.other	Heuristic methods	en
dc.subject.other	Loading	en
dc.subject.other	Network routing	en
dc.subject.other	Online searching	en
dc.subject.other	Packet networks	en
dc.subject.other	Routing algorithms	en
dc.subject.other	Tabu search	en
dc.subject.other	Two dimensional	en
dc.subject.other	Vehicles	en
dc.subject.other	Algorithmic parameters	en
dc.subject.other	Best solutions	en
dc.subject.other	Capacitated vehicle routing problems	en
dc.subject.other	Customer demands	en
dc.subject.other	Generalisation	en
dc.subject.other	Guided Local Search	en
dc.subject.other	Guided local searches	en
dc.subject.other	Loading constraints	en
dc.subject.other	Loading surfaces	en
dc.subject.other	Memory structures	en
dc.subject.other	Metaheuristic	en
dc.subject.other	Metaheuristic algorithms	en
dc.subject.other	Minimum costs	en
dc.subject.other	Search processes	en
dc.subject.other	VEHICLE ROUTING problems	en
dc.subject.other	Vehicle routing	en
dc.title	A Guided Tabu Search for the Vehicle Routing Problem with two-dimensional loading constraints	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/j.ejor.2007.05.058	en
heal.identifier.secondary	http://dx.doi.org/10.1016/j.ejor.2007.05.058	en
heal.language	English	en
heal.publicationDate	2009	en
heal.abstract	We present a metaheuristic methodology for the Capacitated Vehicle Routing Problem with two-dimensional loading constraints (2L-CVRP). 2L-CVRP is a generalisation of the Capacitated Vehicle Routing Problem, in which customer demand is formed by a set of two-dimensional, rectangular, weighted items. The purpose of this problem is to produce the minimum cost routes, starting and terminating at a central depot, to satisfy the customer demand. Furthermore, the transported items must be feasibly packed into the loading surfaces of the vehicles. We propose a metaheuristic algorithm which incorporates the rationale of Tabu Search and Guided Local Search. The loading aspects of the problem are tackled using a collection of packing heuristics. To accelerate the search process, we reduce the neighbourhoods explored, and employ a memory structure to record the loading feasibility information. Extensive experiments were conducted to calibrate the algorithmic parameters. The effectiveness of the proposed metaheuristic algorithm was tested on benchmark instances and led to several new best solutions. (C) 2007 Elsevier B.V. All rights reserved.	en
heal.publisher	ELSEVIER SCIENCE BV	en
heal.journalName	European Journal of Operational Research	en
dc.identifier.doi	10.1016/j.ejor.2007.05.058	en
dc.identifier.isi	ISI:000261941400009	en
dc.identifier.volume	195	en
dc.identifier.issue	3	en
dc.identifier.spage	729	en
dc.identifier.epage	743	en