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

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

Jai Keerthy Chowlur Revanna

Contact

Nushwan Yousif B.Al-Nakash

Contact

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

Article Fingerprint

ReserarchID

5LDN2

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

AI TAKEAWAY

Connecting with the Eternal Ground

References

31 Cites in Article

Reference Format

G Dantzig,J Ramser (1959). The Truck Dispatching Problem.
G Clarke,J Wright (1964). Scheduling of vehicles from a central depot to a number of delivery points.
Chryssi Malandraki,Mark Daskin (1992). Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms.
Soumia Ichoua,Michel Gendreau,Jean-Yves Potvin (2003). Vehicle dispatching with time-dependent travel times.
Ana Osvald,Lidija Stirn (2008). A vehicle routing algorithm for the distribution of fresh vegetables and similar perishable food.
Y Kuo (2010). Using simulated annealing to minimize fuel consumption for the time-dependent vehicle routing problem.
Balseiro S R,I Loiseau,Ramonet (2011). An ant colony algorithm hybridized with insertion heuristics for the time de pendent vehicle routing problem with time windows.
Hideki Hashimoto,Mutsunori Yagiura,Toshihide Ibaraki (2008). An iterated local search algorithm for the time-dependent vehicle routing problem with time windows.
A Figliozzi The time dependent vehicle routing problem with time windows: benchmark problems, an efficient solution algorithm, and solution characteristics.
L Kok A,Hans Schutten,J (2012). Vehicle routing under time-dependent travel times: the impact of congestion avoidance.
B Minocha,Tripathi S (2013). Two phase algorithm for solving VRPTW problem.
Juliane Müller (2010). Approximative solutions to the bicriterion Vehicle Routing Problem with Time Windows.
S Kumar,R Panneerselvam (2012). A Survey on the Vehicle Routing Problem and Its Variants.
Huiting Mao,Jianmai Shi,Yuzhen Zhou,Guoqing Zhang (2020). The Electric Vehicle Routing Problem With Time Windows and Multiple Recharging Options.
Yao Wu,Bin Zheng,Xueliang Zhou (2020). A Disruption Recovery Model for Time-Dependent Vehicle Routing Problem With Time Windows in Delivering Perishable Goods.
L Wu,Z He,Y Chen,D Wu,J Cui (2019). Brainstorming-Based Ant Colony Optimization for Vehicle Routing With Soft Time Windows.
Robert Bowerman,Paul Calamai,G Brent Hall (1994). The spacefilling curve with optimal partitioning heuristic for the vehicle routing problem.
Rodolfo Dondo,Jaime Cerdá (2007). A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows.
J-F Cordeau,M Gendreau,G Laporte,J-Y Potvin,F Semet (2002). A guide to vehicle routing heuristics.
W Szeto,Yongzhong Wu,Sin Ho (2011). An artificial bee colony algorithm for the capacitated vehicle routing problem.
B Bullnheimer,R Hartl,C Strauss Applying the ant system to the vehicle routing problem.
S Voss,S Martello,I Osman,C Roucairol,Eds (2012). Unknown Title.
W Tan,L Lee,Z Majid,H Seow (2012). Ant colony optimization for capacitated vehicle routing problem.
Karl Doerner,Manfred Gronalt,Richard Hartl,Marc Reimann,Christine Strauss,Michael Stummer (2002). SavingsAnts for the Vehicle Routing Problem.
Yanfang Ma,Jie Han,Kai Kang,Fang Yan (2018). An Improved ACO for the Multi-depot Vehicle Routing Problem with Time Windows.
Xiaoxia Zhang,Lixin Tang (2009). A new hybrid ant colony optimization algorithm for the vehicle routing problem.
Silvia Mazzeo,Irene Loiseau (2004). An Ant Colony Algorithm for the Capacitated Vehicle Routing.
Bin Yu,Zhong-Zhen Yang,Baozhen Yao (2009). An improved ant colony optimization for vehicle routing problem.
Yanfang Ma,Jie Han,Kai Kang,Fang Yan (2018). An Improved ACO for the Multi-depot Vehicle Routing Problem with Time Windows.
B Bullnheimer,R Hartl,C Strauss (1999). An improved ant system for the vehicle routing problem.
Banglei Zhao,Haixia Gui,Huizong Li,Jing Xue (2020). Cold Chain Logistics Path Optimization via Improved Multi-Objective Ant Colony Algorithm.

Download References

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

Jai Keerthy Chowlur Revanna. 2026. \u201cVehicle Routing Problem with Time Window Constrain using KMeans Clustering to Obtain the Closest Customer\u201d. Global Journal of Computer Science and Technology - D: Neural & AI GJCST-D Volume 22 (GJCST Volume 22 Issue D1): .

More Citation Formats

Select Citation Style:

Download Citation

Download Article

GJCST Volume 22 Issue D1
Pg. 25- 37

Explore Journals Explore Volume Read This Issue

Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords

Not Found

Classification

GJCST-D Classification: F.1.1

Submission ReceivedDecember 3, 2021
Peer Review Double Blind
Handling Editor
Accepted December 31, 2021
Published January 14, 2022

Version of record

v1.2

Issue date

January 22, 2022

Language

Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

View in VR

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

View in 3D

Article Matrices

Total Views: 3226

Total Downloads: 39

2026 Trends

Published Article

Abstract not found

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]