Performance analysis of large neighborhood search algorithm applied on vehicle routing problem with pickup and delivery
The Pickup and Drop Problem with Time Window constraint or PDPTW is a hard combinatorial optimization problem. In this problem, requests are generated for goods or load to be carried from their respective pickup point to a designated delivery location. A certain number of vehicles are assigned...
Saved in:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Theses and Dissertations |
| 語言: | English |
| 出版: |
2019
|
| 主題: | |
| 在線閱讀: | http://hdl.handle.net/10356/78919 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|