A multi-commodity, capacitated pickup and delivery problem: The single and two-vehicle cases

Psaraftis, HN

dc.contributor.author	Psaraftis, HN	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	0377-2217	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/20930
dc.subject	Pickup and delivery	en
dc.subject	Routing	en
dc.subject	Scheduling	en
dc.subject.classification	Management	en
dc.subject.classification	Operations Research & Management Science	en
dc.subject.other	Computational effort	en
dc.subject.other	matrix	en
dc.subject.other	Multi-commodity	en
dc.subject.other	Node pairs	en
dc.subject.other	Objective functions	en
dc.subject.other	Pickup and delivery	en
dc.subject.other	Pickup and delivery problems	en
dc.subject.other	Problem structure	en
dc.subject.other	Programming solutions	en
dc.subject.other	Routing	en
dc.subject.other	Solution approach	en
dc.subject.other	Dynamic programming	en
dc.subject.other	Pickups	en
dc.subject.other	Vehicles	en
dc.title	A multi-commodity, capacitated pickup and delivery problem: The single and two-vehicle cases	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/j.ejor.2011.06.038	en
heal.identifier.secondary	http://dx.doi.org/10.1016/j.ejor.2011.06.038	en
heal.language	English	en
heal.publicationDate	2011	en
heal.abstract	We explore dynamic programming solutions for a multi-commodity, capacitated pickup and delivery problem. Cargo flows are given by an origin/destination matrix which is not necessarily symmetric. This problem is a generalization of several known pickup and delivery problems, as regards both problem structure and objective function. Solution approaches are developed for the single-vehicle and two-vehicle cases. The fact that for each cargo that goes from a node i to another node j there may be a cargo going in the opposite direction provides the motivation for the two-vehicle case, because one may conceivably consider solutions where no cargoes that travel in opposite directions between node pairs are carried by the same vehicle. Yet, it is shown that such scenarios are generally sub-optimal. As expected, the computational effort of the single vehicle algorithm is exponential in the number of cargoes. For the two-vehicle case, said effort is of an order of magnitude that is not higher than that of the single-vehicle case. Some rudimentary examples are presented or both the single-vehicle and two-vehicle cases so as to better illustrate the method. © 2011 Published by 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.2011.06.038	en
dc.identifier.isi	ISI:000295301200008	en
dc.identifier.volume	215	en
dc.identifier.issue	3	en
dc.identifier.spage	572	en
dc.identifier.epage	580	en