Mobile Unit Service Planning in Public-Service Networks - Data & Code
This record contains the code, benchmark instances and results of the paper "Mobile Unit Service Planning in Public-Service Networks: Jointly Optimizing Strategic, Tactical, and Operational Decisions in Dispersed Territories" (J. de Armas). The archive mobile_units_code_instances_results.zip (2.7 MB) holds the Python implementation of the integrated MILP and of the matheuristic decomposition, the 28 benchmark instances (Excel files), the result tables behind every table and figure of the paper, the scripts that produce them, and the paper's figures. It covers the comparison between the MILP and the decomposition over five budget levels, the parameter sensitivity analysis, the comparison of depot-selection families, and the comparison of the lexicographic objective with cost-first objectives. The archive mobile_units_raw_results.zip holds one solution file for every decomposition design evaluated in these experiments, including designs that were not selected (14,176 files). These files contain the purchased units, the depot assignments, the weekly unit–village assignment, served and unserved demand, cost components and working-day cut statistics. The README in the first archive maps each file to the section, table or figure of the paper that uses it, and gives the commands to reproduce the results. Running the code requires Python 3.13 and Gurobi 12. The code is released under the MIT licence; the instances, results and figures are released under CC BY 4.0.
Authors
- Jésica de Armas (ORCID: https://orcid.org/0000-0002-7619-7407)
Institutions
- Universitat Pompeu Fabra (ES)
- UPF Barcelona School of Management (ES)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-19
- DOI
- https://doi.org/10.5281/zenodo.24369449
- Primary Topic
- Facility Location and Emergency Management
- Type
- article
- Field-Weighted Citation Impact
- 0.00