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

1
Jai Keerthy Chowlur Revanna
Jai Keerthy Chowlur Revanna
2
Nushwan Yousif B.Al-Nakash
Nushwan Yousif B.Al-Nakash

Send Message

To: Author

GJCST Volume 22 Issue D1
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
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu

Abstract not found

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.

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): .

Download Citation

Vehicle Routing Problem with Time Window Constraints.
Issue Cover
GJCST Volume 22 Issue D1
Pg. 25- 37
Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords
Classification
GJCST-D Classification: F.1.1
Version of record

v1.2

Issue date

January 22, 2022

Language

English

Experiance in AR

The methods for personal identification and authentication are no exception.

Read in 3D

The methods for personal identification and authentication are no exception.

Article Matrices
Total Views: 3202
Total Downloads: 12
2026 Trends
Research Identity (RIN)
Related Research

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]
×

This Page is Under Development

We are currently updating this article page for a better experience.

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

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

Jai Keerthy Chowlur Revanna
Jai Keerthy Chowlur Revanna
Nushwan Yousif B.Al-Nakash
Nushwan Yousif B.Al-Nakash

Research Journals