Vehicle Routing Problem with Time Window Constrain using KMeans Clustering to Obtain the Closest Customer

Abstract

In this paper, the problem statement is solving the Vehicle Routing Problem with Time Window constraint using the Ant Colony Algorithm with K-Means Clustering. In this problem, the vehicles must start at a common depot, pickup from various warehouses, deliver to the respective nodes within the time window defined by the customer and return back to the depot.The objectives defined are to reduce number of vehicles employed, the total logistics cost and to reduce carbon emissions. The mathematical model described in this paper has considered multiple pickup and multiple delivery points. The proposed solution of this paper aims to provide better and more efficient solution while minimizing areas of conflict so as to provide the best output on a large scale.

A Lightweight Security Model using Delta Probabilistic Hashing Technique for Secured Data Transmission in IoT Systems

“…The results of this paper work is validated based on the parameters that are referring the security level and the rate of complexities that are can be measured from the proposed lightweight security model. The performance of the proposed work can be validated and compared with the existing models that are referred from [26][27][28][29]. According to that the proposed model of data security is developed in the PYTHON (3.8V) script.…”

“…To validate the performance of key generation, the time complexity in seconds compare with the existing model of cryptographic technique QBCPDA referred from [29]. This can be represented in the bar plot as shown in figure 6.…”

“…In [11], the author assessed the lightweight symmetric ciphers' hardware and software implementations. The lightweight ciphers were mimicked from genetic algorithm [29] in the paper for cost, balance and efficiency. A lightweight block cipher called Hew based on hash functions was presented by [12].…”

A Secure Lightweight Cryptographic Algorithm for the Internet of Things (IoT) Based on Deoxyribonucleic Acid (DNA) Sequences

“…The construction of a DNA-based encryption key relies on uncomplicated substitution techniques and transposition operations, thus lending itself well to the constrained computational environments of IoT devices [12]. Revanna and Al-Nakash (2022) [13] focused on the vehicle routing problem with time window constraints using KMeans clustering to optimize customer routes. The authors aimed to improve the efficiency of delivery services.…”

Advanced Route Optimization using Hybridized Salesforce Geopointe Package

“…Use Geopointe to create, plan, and carry out your trip arrangements. all localizable info (Salesforce, Google, or any address) can be used to create routes [15]. Get Google directions, manage up to 100 stops per route, and even optimize travel.…”