Location Choice Modeling for Shopping and Leisure Activities with MATSim
Bibliographic record
Abstract
The activity-based multiagent simulation toolkit MATSim adopts a coevolutionary approach to capturing the patterns of people's activity scheduling and participation behavior at a high level of detail. Until now, the search space of the MATSim system was formed by every agent's route and time choice. This paper focuses on the crucial computational issues that have to be addressed when the system is being extended to include location choice. This results in an enormous search space that would be impossible to explore exhaustively within a reasonable time. With the use of a large-scale scenario, it is shown that the system rapidly converges toward a system's fixed point if the agents’ choices are per iteration confined to local steps. This approach was inspired by local search methods in numerical optimization. The study shows that the approach can be incorporated easily and consistently into MATSim by using Hägerstrand's time–geographic approach. This paper additionally presents a first approach to improving the behavioral realism of the MATSim location choice module. A singly constrained model is created; it introduces competition for slots on the activity infrastructure, where the actual load is coupled with time-dependent capacity restraints for every activity location and is incorporated explicitly into the agent's location choice process. As expected, this constrained model reduces the number of implausibly overcrowded activity locations. To the authors’ knowledge, incorporating competition in the activity infrastructure has received only marginal attention in multiagent simulations to date, and thus, this contribution is also meant to raise the issue by presenting this new model.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.005 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".