{'fraction_non_alphanumeric': 0.021739130434782608, 'fraction_numerical': 0.0, 'mean_word_length': 5.076388888888889, '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}}
Enumeration of Pareto Optima for a Bicriteria Evacuation Scheduling Problem

In this paper, we consider a large-scale evacuation problem after an important disaster. We model the evacuation of a region from a set of collection points to a set of capacitated shelters with the help of buses, thus leading to scheduling the evacuation operations by buses (Bus Evacuation Problem, BEP). The goal is twofold; first, minimizing the total evacuation time needed to bring the resident out of the endangered region, and secondly, minimizing the total exposure to danger. The resulting problem is a bicriteria problem. We propose a time-indexed formulation, as well as several approaches for finding both upper and lower bounds for BEP used within a branch and bound algorithm. In computational experiments, we analyse and evaluate the efficiency of the proposed solution algorithms.