{'fraction_non_alphanumeric': 0.013210039630118891, 'fraction_numerical': 0.002642007926023778, 'mean_word_length': 5.9495412844036695, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
An Analysis of Pediatric Vaccine Formulary Selection Problems

Vaccination against infectious disease is hailed as one of the great achievements in public health. However, the United States Recommended Childhood Immunization Schedule is becoming increasingly complex as it is expanded to cover additional diseases. Moreover, biotechnology advances have allowed vaccine manufacturers to create combination vaccines that immunize against several diseases in a single injection. All these factors are creating a combinatorial explosion of alternatives and choices (each with a different cost) for public health policy makers, pediatricians, and parents/guardians (each with a different perspective). The General Vaccine Formulary Selection Problem (GVFSP) is introduced to model general childhood immunization schedules that can be used to illuminate these alternatives and choices by selecting a vaccine formulary that minimizes the cost of fully immunizing a child and the amount of extraimmunization. Both exact algorithms and heuristics for GVFSP are presented. A computational comparison of these algorithms and heuristics is presented for the 2006 Recommended Childhood Immunization Schedule, as well as several randomly generated childhood immunization schedules that are likely to be representative of future childhood immunization schedules. The results reported here provide both fundamental insights into the structure of the GVFSP models and algorithms and practical value for the public health community.