Phuong Thao Nguyen Le

Phuong Thao Nguyen Le

orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 May 2021 in Logistics
Verified
Journal Article
Open access
PDF file
KNKy Phuc Phan Nguyen
Ky Phuc Phan Nguyen
PLPhuong Thao Nguyen Le
Phuong Thao Nguyen Le
This study focuses on solving the vehicle routing problem (VRP) of E-logistics service providers. In our problem, each vehicle must visit some pick up nodes first, for instance, warehouses to pick up the orders then makes deliveries for customers in the list. Each pickup node has its own list of more than one customers requiring delivery. The objective is to minimize the total travelling cost while real-world application constraints, such as heterogeneous vehicles, capacity limits, time window, driver working duration, etc. are still considered. This research firstly proposes a mathematical model for this multiple pickup and multiple delivery vehicle routing problem with time window and heterogeneous fleets (MPMDVRPTWHF). In the next step, the ant colony optimization algorithm is studied to solve the problem in the large-scale.

18 February 2025
Verified
Conference Paper
Open access
PDF file
PLPhuong Thao Nguyen Le
Phuong Thao Nguyen Le
VLVinh Le
Vinh Le
Vincent F. YuVincent F. Yu
Vincent F. Yu
KNKy Phuc Phan Nguyen
Ky Phuc Phan Nguyen
NLNgan Le
Ngan Le
Clustering algorithms are critical in data analysis and optimization, particularly for segmenting datasets in practical applications. This study proposes an improved variant of K-means clustering algorithm and do evaluation on the performance of nine popular clustering methods—DBSCAN, HDBSCAN, Spectral Clustering, Hierarchical Clustering, OPTICS, Mean-Shift Clustering, Self-Organizing Map (SOM), K-Means, Gaussian Mixture Model (GMM), and the proposed Improved K-Means algorithm—using Vehicle Routing Problem (VRP) dataset. Implemented in Python, the methods are compared using the Calinski-Harabasz Index and Silhouette Index to assess cluster quality. Results show that the proposed improved K-Means algorithm, with its optimized parameter configuration through the initialization process of the parameter K and cluster centroid set, performs exceptionally well compared to other methods. These findings highlight the importance of parameter tuning and algorithm selection in clustering tasks, offering valuable insights for researchers and practitioners. This work provides practical guidance for selecting and refining clustering approaches, contributing to advancements in applications such as vehicle routing and beyond.