Population Synthesis with Quasirandom Integer Sampling

被引:9
作者
Smith, Andrew P. [1 ]
Lovelace, Robin [2 ]
Birkin, Mark [3 ]
机构
[1] Univ Leeds, Leeds Inst Data Analyt, Level 11 Worsley Bldg,Clarendon Way, Leeds LS2 9NL, W Yorkshire, England
[2] Univ Leeds, Consumer Data Res Ctr, 40 Sholebroke Ave, Leeds LS7 3HB, W Yorkshire, England
[3] Univ Leeds, Sch Geog, Univ Rd, Leeds LS2 9JT, W Yorkshire, England
来源
JASSS-THE JOURNAL OF ARTIFICIAL SOCIETIES AND SOCIAL SIMULATION | 2017年 / 20卷 / 04期
基金
英国工程与自然科学研究理事会;
关键词
Microsynthesis; Microsimulation; Quasirandom Sequences; Sampling;
D O I
10.18564/jasss.3550
中图分类号
C [社会科学总论];
学科分类号
03 ; 0303 ;
摘要
Established methods for synthesising a population from geographically aggregated data are robust and well understood. However, most rely on the potentially detrimental process of integerisation if a whole-individual population is required, e.g. for use in agent-based modelling (ABM). This paper describes and investigates the use of quasirandom sequences to sample populations from known marginal constraints whilst preserving those marginal distributions. We call this technique Quasirandom Integer Without-replacement Sampling (QIWS) and show that the statistical properties of quasirandomly sampled populations to be superior to those of pseudorandomly sampled ones in that they tend to yield entropies much closer to populations generated using the entropy-maximising iterative proportional fitting (IPF) algorithm. The implementation is extremely efficient, easily outperforming common IPF implementations. It is freely available as an open source R package called humanleague. Finally, we suggest how the current limitations of the implementation can be overcome, providing a direction for future work.
引用
收藏
页数:15
相关论文
共 17 条
[1]  
[Anonymous], 1998, ACM T MODEL COMPUT S
[2]  
Barthelemy J., 2016, CRAN PACKAGE MIPFP
[3]   IMPLEMENTING SOBOLS QUASIRANDOM SEQUENCE GENERATOR [J].
BRATLEY, P ;
FOX, BL .
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1988, 14 (01) :88-100
[4]  
Burkardt J., 2008, ASA032 INCOMPLETE GA
[5]  
Flannery B. P., 1992, Numerical Recipes in C: The Art of Scientific Computing, V24, P36
[6]   Commuting Network Models: Getting the Essentials [J].
Gargiulo, Floriana ;
Lenormand, Maxime ;
Huet, Sylvie ;
Espinosa, Omar Baqueiro .
JASSS-THE JOURNAL OF ARTIFICIAL SOCIETIES AND SOCIAL SIMULATION, 2012, 15 (02)
[7]   Remark on algorithm 659: Implementing Sobol's quasirandom sequence generator [J].
Joe, S ;
Kuo, FY .
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 2003, 29 (01) :49-57
[8]  
Johnson S., 2017, STEVENGJ NLOPT LIB N
[9]  
Jones PM, 2016, RAKER EASY SPATIAL M
[10]   Systematic comparison of trip distribution laws and models [J].
Lenormand, Maxime ;
Bassolas, Aleix ;
Ramasco, Jose J. .
JOURNAL OF TRANSPORT GEOGRAPHY, 2016, 51 :158-169