Help page for Line Optimization simulator

The Simulation

This program is a simulation of a day's traffic flow through a polling place. It is based on simple queueing theory and data from research projects regarding polling places and elections. Each time you run the simulation, voters arrive randomly within a pattern based on data collected at polling places. There is randomness involved, just as in reality. But as you will see, the randomness approximates the typical daily flow found at polling places, which should give you an accurate range of possible wait times that might develop.

The basic design simulates a polling place with a number of check-in stations (or just one), where the first line will form. Then there is a number of voting stations, for which the second line will form.

For those using optical-scan ballots that require voters to run their ballots through a scanner after completion of the ballot, there is also an option to simulate lines for the scanner(s).

The simulation also has an option to handle same-day registration stations for those states to which they apply. The simulation makes the assumption that arriving voters will be directed to a check-in station if already registered, or a registration station if not. Both of those lines will feed into the voting station line as the check-in or registration tasks are completed.

Critical Data

You will quickly discover that waiting times are surprisingly sensitive to the average amount of time to check-in and the average time to complete a ballot.

As you know, time to complete a ballot depends greatly on the length and make-up of the ballot. The voting technology used also has a minor impact. We can only provide a starting point for ballot completion time; you must provide a reasonably accurate estimate for each election for this simulation to give you accurate estimates of potential waiting times.

Likewise, the average amount of time to check-in depends on the process used and the people staffing that step. When setting this value, remember to not assume that every voter will check in smoothly. Don't use a number for the amount of time it ought to normally take. The average that you provide must include those who for whatever reason take extra time at the check-in station. If one out of every ten voters takes a couple extra minutes to check in because of some issue, that will affect the process, your average, and the waiting times.

Similarly, your average scanning time (for those who use that option), should consider those that do not go smoothly. Don't just use a number that represents how long it should take if all goes well, because seldom does all go well for every person.

Lastly, your average times must account for the turnover period between voters. If 30 seconds elapse between the time one person completes a ballot and the next person settles in at the same voting station and begins voting, those 30 seconds MUST be part of the average that you use.

Simulating All Your Precincts

When you upload a list of all your precincts (from an Excel spreadsheet or a similar source), along with turnout estimates and resource deployment, you can run this simulation across all precincts at once to see which have potential problems. A new table will appear at the bottom of the page with stats for each precinct, which can then be sorted on any field and on which adjustments can be made. See the Load your own data section of this help page for details.

Feedback, Suggestions, and Critiques

This simulation was written by Mark Pelczarski. Questions, comments, suggestions, and pleas for help are welcome. E-mail Mark here.