Accès ouvert · CC BY

SOLVING THE DIAL-A-RIDE PROBLEM USING AGENT- BASED SIMULATION

Article scientifique 2016 Sciences de l'ingénieur et technologies Anglais

Résumé

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 preprocessing 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.

Citer ce document

Campbell, I., Ali, M. M., & Fienberg, M. L. (2016). SOLVING THE DIAL-A-RIDE PROBLEM USING AGENT- BASED SIMULATION. https://doi.org/10.7166/27-3-1649

Exporter : BibTeX · RIS (Zotero, Mendeley, EndNote)

Accès au document

Texte intégral archivé sur SPHAERO, en accès ouvert : lisible gratuitement en ligne après connexion. Le document reste aussi disponible à sa source. Se connecter

Voir l'article sur le site de la revue

Licence et provenance

Licence : CC BY

Notice moissonnée depuis OpenAlex le 25/08/2026. Le document reste hébergé par sa source.
Voir le document à la source →

Statistiques

Consultations (hors robots) : 10

Téléchargements (hors robots) : 0

Méthode de comptage