Bài báo quốc tế
Kho tri thức
/
Bài báo quốc tế
/
Improving VRPTW Optimization Efficiency with K- means clustering and advanced genetic algorithms
Improving VRPTW Optimization Efficiency with K- means clustering and advanced genetic algorithms
Nguyen Ha Nam
Vehicle Routing Problems with Time Windows (VRPTW) is an important part of modern traffic control and a key part of transportation logistics. The goal is to reduce the total distance traveled or the number of vehicles utilized and to designate the routes for the vehicles. These issues have constantly gotten the attention of researchers and have become well-known problems in network optimization. This paper suggested a novel combination model that solves VRPTW using STPB Crossover in Genetic Algorithm and refined K-mean clustering. Experiments on the standard Solomon benchmark dataset were conducted to demonstrate the efficiency and reliability of VRPTW.
Xuất bản trên:
Improving VRPTW Optimization Efficiency with K- means clustering and advanced genetic algorithms
Ngày đăng:
2025
Nhà xuất bản:
Địa điểm:
Từ khoá:
Genetic Algorithm, K-means Clustering, Vehicle Routing Problem
Bài báo liên quan
HRM strategies for sustainable performance: A focus on SDG-3 and SDG-8 in the logistics sector
Lê Thanh TùngAnoResLSTM: A Hybrid Deep Learning Framework for Real-Time Cheating Detection in Online Exams
Bùi Quốc HuyPerformance Analysis of Satellite-to-Ground Entanglement-based QKD under Realistic Atmospheric Turbulence
Nguyễn Đức MinhRWIDS: An Innovative Feature Selection Approach for Network Intrusion Detection System Leveraging Graph-based Random Walk
Phạm Văn Thịnh