Using a monte-carlo approach for bus regulation

Abstract

In this paper, our objective is to minimize passengers waiting times at the bus stops by making buses wait at a stop. We compare a simple rule based approach to a Monte-Carlo method to reach this objective. When allocated enough time, the Monte-Carlo method gives better results. If the passengers arrivals and the bus travel times are known, the best algorithm is nested Monte-Carlo search with memorization which clearly outperforms nested Monte-Carlo search without memorization as well as Monte-Carlo and rule based regulation.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 8 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.