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:
| 主要作者: | |
|---|---|
| 格式: | Theses |
| 語言: | Indonesia |
| 在線閱讀: | https://digilib.itb.ac.id/gdl/view/71080 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Institut Teknologi Bandung |
| 語言: | Indonesia |