Loading...
Please wait, while we are loading the content...
A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows
| Content Provider | Semantic Scholar |
|---|---|
| Author | Jaw, Jang-Jei Odoni, Amedeo R. Psaraftis, Harilaos N. Wilson, Nigel H. M. |
| Copyright Year | 1986 |
| Abstract | A heuristic algorithm is described for a time-constrained version of the advance-request, multi-vehicle, many-to-many Dial-A-Ride Problem (DARP). The time constraints consist of upper bounds on: (1) the amount of time by which the pick-up or delivery of a customer can deviate from the desired pick-up or delivery time; (2) the time that a customer can spend riding in a vehicle. The algorithm uses a sequential insertion procedure to assign customers to vehicles and to determine a time schedule of pick-ups and deliveries for each vehicle. A flexible objective function balances the cost of providing service with the customers' preferences for pick-up and delivery times close to those requested, and for short ride times. Computational experience with the algorithm is described, including a run with a real database of 2600 customers and some 20 simultaneously active vehicles. The scenario for the application of the algorithm is also discussed in detail. |
| Starting Page | 243 |
| Ending Page | 257 |
| Page Count | 15 |
| File Format | PDF HTM / HTML |
| DOI | 10.1016/0191-2615(86)90020-2 |
| Alternate Webpage(s) | http://www.martrans.org/docs/publ/REFEREED%20JOURNALS/TR%20RES%20JAW%20ET%20AL%20DIAL%20A%20RIDE%201986.pdf |
| Alternate Webpage(s) | https://orbit.dtu.dk/files/103121003/A_heuristic_algorithm_for_the_multivehicle_advance_request_dial_a_ride_problem_with_time_windows.pdf |
| Alternate Webpage(s) | https://doi.org/10.1016/0191-2615%2886%2990020-2 |
| Volume Number | 20 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
