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 |
| Summary: | 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 metaheuristic methods. An agent-based simulation (ABS) model was developed, where each vehicle bids to service customers based on a weighted objective function that considers the cost to service the customer and the time quality of the service that would be achieved. The approach applied a pre- processing technique to reduce the search space, given the service time window constraints. Tests of the model showed significantly better customer transit and waiting times than the benchmark datasets. The ABS was able to obtain solutions for much larger problem sizes than the benchmark solutions, with this work being the first known application of ABS to the DARP. |
|---|---|
| ISSN: | 1012-277X 2224-7890 |