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:
主要作者: | Fauzy Amrullah, Iqbal |
---|---|
格式: | Theses |
語言: | Indonesia |
在線閱讀: | https://digilib.itb.ac.id/gdl/view/71080 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Institut Teknologi Bandung |
語言: | Indonesia |
相似書籍
-
Efficiency analysis of tabu search heuristic for static dial-a-ride problem
由: Ho, Song Guang
出版: (2018) -
Adaptive algorithm for dial-a-ride problem with vehicle breakdown
由: Pandi, Ramesh Ramasamy, et al.
出版: (2020) -
Real-time adaptive algorithms for dial-a-ride problems
由: Pandi, Ramesh Ramasamy
出版: (2020) -
Deterministic annealing for depot optimization : applications to the dial-a-ride problem
由: Pandi, Ramesh Ramasamy, et al.
出版: (2020) -
Solving dial-a-ride problem using ant colony optimisation
由: Kolumam Anantharamakrishnan Krishnamurthy
出版: (2018)