Dynamic pickup and delivery with transfers

Bouros, P; Sacharidis, D; Dalamagas, T; Sellis, T

dc.contributor.author	Bouros, P	en
dc.contributor.author	Sacharidis, D	en
dc.contributor.author	Dalamagas, T	en
dc.contributor.author	Sellis, T	en
dc.date.accessioned	2014-03-01T02:53:14Z
dc.date.available	2014-03-01T02:53:14Z
dc.date.issued	2011	en
dc.identifier.issn	03029743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/36186
dc.subject	dynamic shortest path	en
dc.subject	Pickup and delivery problem	en
dc.subject.other	Bellman-Ford	en
dc.subject.other	Conceptual graph	en
dc.subject.other	Cost metrics	en
dc.subject.other	Dynamic shortest path	en
dc.subject.other	Graph-based	en
dc.subject.other	Local search algorithm	en
dc.subject.other	Novel solutions	en
dc.subject.other	Pickup and delivery	en
dc.subject.other	Pickup and delivery problem	en
dc.subject.other	Pickup and delivery problems	en
dc.subject.other	Rule of thumb	en
dc.subject.other	Shortest path	en
dc.subject.other	Fleet operations	en
dc.subject.other	Graph theory	en
dc.subject.other	Learning algorithms	en
dc.subject.other	Pickups	en
dc.title	Dynamic pickup and delivery with transfers	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/978-3-642-22922-0_8	en
heal.identifier.secondary	http://dx.doi.org/10.1007/978-3-642-22922-0_8	en
heal.publicationDate	2011	en
heal.abstract	In the dynamic Pickup and Delivery Problem with Transfers (dPDPT), a set of transportation requests that arrive at arbitrary times must be assigned to a fleet of vehicles. We use two cost metrics that capture both the company's and the customer's viewpoints regarding the quality of an assignment. In most related problems, the rule of thumb is to apply a two-phase local search algorithm to heuristically determine a good requests-to-vehicles assignment. This work proposes a novel solution based on a graph-based formulation of the problem that treats each request independently. Briefly, in this conceptual graph, the goal is to find a shortest path from a node representing the pickup location to that of the delivery location. However, we show that efficient Bellman-Ford or Dijkstra-like algorithms cannot be applied. Still, our method is able to find dPDPT solutions significantly faster than a conventional two-phase local search algorithm, while the quality of the solution is only marginally lower. © 2011 Springer-Verlag.	en
heal.journalName	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)	en
dc.identifier.doi	10.1007/978-3-642-22922-0_8	en
dc.identifier.volume	6849 LNCS	en
dc.identifier.spage	112	en
dc.identifier.epage	129	en