{'fraction_non_alphanumeric': 0.011152416356877323, 'fraction_numerical': 0.0, 'mean_word_length': 5.341176470588235, '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}}
A particle swarm optimization for the quay crane scheduling problem with non-interference constraints

The quay crane scheduling problem discussed in this paper is to schedule a fixed number of cranes in order to load and unload containers into and from a vessel considering interference between cranes. This study proposes a particle swarm optimization (PSO) algorithm to obtain solutions, and the performance of it is assessed by comparing with the lower bound which is calculated from CPLEX by relaxing the noninterference constraints.