{'fraction_non_alphanumeric': 0.015429122468659595, 'fraction_numerical': 0.0019286403085824494, 'mean_word_length': 5.611464968152866, '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}}
Sustainable traveling purchaser problem with speed optimization

Abstract This paper addresses a multi-objective single-product network design and operations problem that consists of selecting the suppliers, allocating the orders, routing a single vehicle to collect the purchased items, and choosing the vehicle speed levels. The objective functions minimize the purchasing and transportation costs, the fuel consumption, and consequently the CO2 emissions, and maximize the total sustainability value of the purchased products. The proposed model is an extension to the well-studied traveling purchaser problem and pollution routing problem in the sense that it integrates the social and environmental sustainability aspects in the supplier selection process in addition to cost and CO2 emissions. The model is solved using the branch-and-cut algorithm as well as a proposed genetic algorithm. An extensive numerical study shows that the proposed heuristic converges to the optimal solution in few minutes for the considered instances.