MODEL AND VARIABLE NEIGHBORHOOD SEARCH FOR DIAL-A-RIDE PROBLEM CONSIDERING MINIMUM NUMBER OF CUSTOMERS
In the dial-a-ride problem (DARP) passengers must be transported from the pick-up point to the drop-off point taking into account the time window limitation and passenger inconvenience time. This study develops a mathematical model and a solution algorithm for the DARP case with multi depot characte...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/71080 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |