{'fraction_non_alphanumeric': 0.01443298969072165, 'fraction_numerical': 0.0013745704467353953, 'mean_word_length': 5.558558558558558, '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}}
Sweep Nearest Algorithm for Capacitated Vehicle Routing Problem

Heuristic algorithms are effective and deterministic solution methods to solve computationally hard problems. Design of heuristic algorithms exploits the structural and distributional properties of the problem instance and hence a reasonably good solution within modest computing times can be achieved. Sweep algorithm is a well-known constructive heuristic algorithm based on Cluster First Route Second paradigm. Nodes are clustered solely based on the polar angle of the nodes. In this experimental study, it is proposed to combine the basic sweep algorithm with nearest neighbor algorithm for Capacitated Vehicle Routing Problem(CVRP). In this method, clustering of nodes is based on both polar angles and neighboring nodes. Results show that the performance of sweep nearest algorithm, on average is 48% better than basic sweep algorithm. The sweep nearest algorithm is implemented and executed on CVRP benchmark instances. It is observed that in general, the performance of sweep algorithm and its variants is highly influenced by the structural properties of the problem instances like number of nodes, position of depot node, distribution of nodes, demand distribution etc. It is also observed that the relationship between the characteristic properties of instances and heuristic algorithm performance should be considered while selecting a heuristic algorithm to solve an instance.