HEAL DSpace

A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows

DSpace/Manakin Repository

Show simple item record

dc.contributor.author JAW, J en
dc.contributor.author ODONI, A en
dc.contributor.author PSARAFTIS, H en
dc.contributor.author WILSON, N en
dc.date.accessioned 2014-03-01T01:38:52Z
dc.date.available 2014-03-01T01:38:52Z
dc.date.issued 1986 en
dc.identifier.uri https://dspace.lib.ntua.gr/xmlui/handle/123456789/22424
dc.subject Dynamic Programming Algorithm en
dc.subject Heuristic Algorithm en
dc.subject Objective Function en
dc.subject Process Scheduling en
dc.subject Service Quality en
dc.subject Time Window en
dc.subject Vehicle Routing Problem en
dc.subject dial a ride problem en
dc.subject North American en
dc.subject Real Time en
dc.title A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows en
heal.type journalArticle en
heal.identifier.primary 10.1016/0191-2615(86)90020-2 en
heal.identifier.secondary http://dx.doi.org/10.1016/0191-2615(86)90020-2 en
heal.publicationDate 1986 en
heal.abstract In this paper we describe a heuristic algorithm, Advanced Dial-A-Ride with Time Windows (ADARTW), for the advance-request version of the multi-vehicle, many-to-many Dial-A-Ride Problem (DARP) with service quality constraints. DARP is concerned with developing a set of routes for a fleet of vehicles carrying customers between specified origins and destinations. "Many-to-many" means that each customer can have a distinct origin en
heal.journalName Transportation Research Part B-methodological en
dc.identifier.doi 10.1016/0191-2615(86)90020-2 en


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record