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...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | English |
| Published: |
2018
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10356/73130 |