Improved ant colony optimization for solving dial-a-ride-problem
The dial-a-ride problem (DARP) is a combinatorial optimization problem in which passengers claim requests in the form of their departure location, destination and the specific time windows during which they must be picked up and dropped off. A certain number of vehicles are assigned to serve these r...
Saved in:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Theses and Dissertations |
| 語言: | English |
| 出版: |
2018
|
| 主題: | |
| 在線閱讀: | http://hdl.handle.net/10356/73130 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|