Efficient and Effective Pair-Matching Algorithms for Microsimulations

Geffen, Nathan; Scholz, Stefan
October 2017
Journal of Artificial Societies & Social Simulation;Oct2017, Vol. 20 Issue 4, p1
Academic Journal
Microsimulations and agent-based models across various disciplines need to match agents into relationships. Some of these models need to repeatedly match different pairs of agents, for example microsimulations of sexually transmitted infection epidemics. We describe the requirements for pair-matching in these types of microsimulations, and present several pair-matching algorithms: Brute force (BFPM), Random (RPM), Random k (RKPM), Weighted shuffle (WSPM), Cluster shuffle (CSPM), and Distribution counting (DCPM). Using two microsimulations, we empirically compare the speeds, and pairing quality of these six algorithms. For models which execute pair-matching many thousands or millions of times, BFPM is not usually a practical option because it is slow. On the other hand RPM is fast but chooses poor quality pairs. Nevertheless both algorithms are used, sometimes implicitly, in many models. Here we use them as yardsticks for upper and lower bounds for speed and quality. In these tests CSPM offers the best trade-off of speed and effectiveness. In general, CSPM is fast and produces stochastic, high quality pair-matches, which are often desirable characteristics for pair-matching in discrete time step microsimulations. Moreover it is a simple algorithm that can be easily adapted for the specific needs of a particular domain. However, for some models, RKPM or DCPM would be as fast as CSPM with matches of similar quality. We discussthe circumstances underwhich this would happen.


Related Articles

  • Robust Stabilization Based on Periodic Observers for LDP Systems. Ling-Ling Lv; Lei Zhang // Journal of Computational Analysis & Applications;Jan2016, Vol. 20 Issue 1, p487 

    In this paper, the problem of robust stabilization based on observers for linear discrete-time periodic (LDP) systems is studied. It is proofed that principle of separating exists in this type of systems. Based on this, periodic controllers and periodic state observers can be builded...

  • Optimization of traffic signal timings based on surrogate measures of safety. Yi Zhang; Chaocheng Zheng; Li Zhang; Xinren You; Dongxiang Cheng // Advanced Materials Research;7/24/2014, Vol. 989-994, p3915 

    One alternative mathod to improve safety of signalized arterials is to optimize signal timings. Historically, signal retiming tools were used to reduce traffic delay and stops and other measures of traffic efficiency such as closed-loop systems in California and United States. The concept of...

  • Advanced Approach to Calibration of Traffic Microsimulation Models Using Travel Times. KORCEK, PAVOL; SEKANINA, LUKAS; FUCIK, OTTO // Journal of Cellular Automata;2013, Vol. 8 Issue 5/6, p457 

    An effective calibration method of the cellular automaton based traffic microsimulation model is proposed in this paper. It is shown that by utilizing a genetic algorithm it is possible to calibrate different parameters of the model much better than a traffic expert. Moreover, using this process...

  • A Simplified Approach to Estimate the Urban Expressway Capacity after Traffic Accidents Using a Micro-Simulation Model. Hong Chen; Yue-sheng You; Ji-biao Zhou; Lu Wang; Zhen-hua Shang // Advances in Mechanical Engineering (Hindawi Publishing Corporati;2013, p1 

    Based on the decomposition of the evolution processes of the urban expressway capacity after traffic accidents and the influence factors analysis, an approach for estimating the capacity has been proposed. Firstly, the approach introduces the Decision Tree ID algorithm, solves the accident delay...

  • Additive Effects of Road Intersection-Specific Volume-delay Functions. Vasvári, Gergely // Periodica Polytechnica: Civil Engineering;2015, Vol. 59 Issue 4, p487 

    Describing the relationship between vehicle volume and travel time delay on road sections consisting multiple intersections in the context of junction quantity is favorable to extend the advantage of intersection-specific volume-delay functions. This paper demonstrates a microsimulation method...

  • Discrete-time high-order distributed consensus algorithm. PENG Huan-xin; QI Guo-qing; SHENG An-dong // Application Research of Computers / Jisuanji Yingyong Yanjiu;Sep2013, Vol. 30 Issue 9, p2700 

    In order to improve the convergence rate of distributed consensus algorithms, this paper proposed a discrete-time high-order distributed consensus algorithm. The new high-order algorithm utilized the previous state values of two-hop adjacency nodes to accelerate the convergence rate based on...

  • State Attainability Analysis of Petri net with Discrete Time Span. Yu Zhu; Zhenglei Yang; Jiping Cao // Applied Mechanics & Materials;2014, Issue 630-642, p1675 

    When a event must be occur in a series of time span, it will not be fit enough to exhibit system's time speciality if we use existing time Petri net. Thus, This paper propose a discrete time span Petri net (DTSPN) on the base of time Petri net which using to solve modeling of real system with...

  • An Adaptive Questionnaire generation using learning from fuzzy and post clustering of customers responses: an Experience with Communication Products. Banerjee, Soumya; Al-Qaheri, Hameed; Chiş, Monica; Ali Hassan, M. // Telecommunication Systems;Mar2011, Vol. 46 Issue 3, p273 

    central problem in marketing is the clear understanding of consumer's choice or preferences. Designing questionnaires and then analyzing the answers of probable customers can achieve this. The traditional approach in the marketing analysis has been the designing of non-adaptive questionnaires,...

  • Erratum to: A Comparison of Cryptanalytic Tradeoff Algorithms. Hong, Jin; Moon, Sunghwan // Journal of Cryptology;Winter2014, Vol. 27 Issue 1, p181 

    No abstract available.

  • A Float-Path Theory and Its Application to the Time-Cost Tradeoff Problem. Su, Zhi-xiong; Qi, Jian-xun; Wei, Han-ying // Journal of Applied Mathematics;2/26/2015, Vol. 2015, p1 

    Activity floats are vital for project scheduling, such as total floats which determine the maximum permissible delays of activities. Moreover, activity paths in activity networks present essences of many project scheduling problems; for example, the time-cost tradeoff is to shorten long paths at...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics