{'fraction_non_alphanumeric': 0.022727272727272728, 'fraction_numerical': 0.001893939393939394, 'mean_word_length': 5.109826589595376, '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}}
NGAP: a novel hybrid metaheuristic algorithm for round-trip carsharing fleet planning

The growing awareness of the environmental movement greatly influences the transportation scene of this century leading to several transportation alternatives. One among them is carsharing service which has been gaining traction and support in major cities around the globe. It is also undeniable that the location planning of the fleet vehicles can contribute to its success. The fleet vehicles must be easily accessed and in the proximity of various transportation hubs and facilities. In this paper, we study the Vehicle Placement Problem (VPP) for round-trip carsharing and propose a novel hybrid algorithm, NGAP, which is a combination of NSGA-III and Pareto Local Search (PLS) to enhance the quality of the results over NSGA-III. The proposed algorithm is tested on 10 synthetic and four real-world instances. NGAP is shown to be significantly more efficient than NSGA-III on almost all instances in terms of Inverted Generational Distance (IGD), and Hypervolume.