Solving dial-a-ride problems using multiple ant colony system with fleet size minimisation
This paper proposes an ant colony optimization (ACO) based algorithm to minimise the fleet size required to solve dial-a-ride problem (DARP). In this work, a static multi-vehicle case of DARP is considered where routes of multiple vehicles are designed to serve customer requests which are known a pr...
Saved in:
Main Authors: | , , , , |
---|---|
其他作者: | |
格式: | Conference or Workshop Item |
語言: | English |
出版: |
2020
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/140330 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
語言: | English |