We investigate the hypothesis that long-term memory in populations of agents can lead to counterproductive emergent properties at the system level. Our investigation is framed in the context of a discrete, one-dimensional road-traffic congestion model: we investigate the influence of simple cognition in a population of rational commuter agents that use memory to optimise their departure time, taking into account congestion delays on previous trips. Our results differ from the well-known minority game in that crowded slots do not carry any explicit penalty. We use Markov chain analysis to uncover fundamental properties of this model and then use the gained insight as a benchmark. Then, using Monte Carlo simulations, we study two scenarios: one in which “myopic” agents only remember the outcome (delay) of their latest commute, and one in which their memory is practically infinite. We show that there exists a trade-off, whereby myopic memory reduces congestion but increases uncertainty, while infinite memory does the opposite. We evaluate the performance against the optimal distribution of departure times (i.e. where both delay and uncertainty are minimised simultaneously). This optimal but unstable distribution is identified using a genetic algorithm.
Saffre, F., Gianini, G., Hildmann, H., Davies, J., Bullock, S., Damiani, E., et al. (2019). Long-term memory-induced synchronisation can impair collective performance in congested systems. SWARM INTELLIGENCE, 13(2), 95-114 [10.1007/s11721-019-00164-z].
Long-term memory-induced synchronisation can impair collective performance in congested systems
Gianini, G;
2019
Abstract
We investigate the hypothesis that long-term memory in populations of agents can lead to counterproductive emergent properties at the system level. Our investigation is framed in the context of a discrete, one-dimensional road-traffic congestion model: we investigate the influence of simple cognition in a population of rational commuter agents that use memory to optimise their departure time, taking into account congestion delays on previous trips. Our results differ from the well-known minority game in that crowded slots do not carry any explicit penalty. We use Markov chain analysis to uncover fundamental properties of this model and then use the gained insight as a benchmark. Then, using Monte Carlo simulations, we study two scenarios: one in which “myopic” agents only remember the outcome (delay) of their latest commute, and one in which their memory is practically infinite. We show that there exists a trade-off, whereby myopic memory reduces congestion but increases uncertainty, while infinite memory does the opposite. We evaluate the performance against the optimal distribution of departure times (i.e. where both delay and uncertainty are minimised simultaneously). This optimal but unstable distribution is identified using a genetic algorithm.File | Dimensione | Formato | |
---|---|---|---|
Saffre-2019-Swarm Intell-VoR.pdf
Solo gestori archivio
Descrizione: Article
Tipologia di allegato:
Publisher’s Version (Version of Record, VoR)
Licenza:
Tutti i diritti riservati
Dimensione
1.1 MB
Formato
Adobe PDF
|
1.1 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.