Solving the dial-a-ride problem using agent-based simulation
The ‘dial-a-ride problem’ (DARP) requires a set of customers to be transported by a limited fleet of vehicles between unique origins and destinations under several service constraints, including within defined time windows. The problem is considered NP-hard, and has typically been solved using metah...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Stellenbosch University
2016-11-01
|
| Series: | South African Journal of Industrial Engineering |
| Subjects: | |
| Online Access: | http://sajie.journals.ac.za/pub/article/view/1649 |