Paper Title

Capacitated Vehicle Routing Problem Using Conventional and Approximation Method

Article Identifiers

Registration ID: IJNRD_183518

Published ID: IJNRD2210103

DOI: Click Here to Get

Authors

Apurv Choudhari , Ameya Ekbote , Prerona Chaudhuri

Keywords

Vehicle Routing Problem, constraints, DBSCAN algorithm, Christofide’s algorithm, cluster first route second approach, approximation algorithm, integer linear programming

Abstract

This paper attempts to solve the famous Vehicle Routing Problem by considering multiple constraints including capacitated vehicles, single depot, and distance using two approaches namely, cluster first and route the second algorithm and using integer linear programming. A set of nodes are provided as input to the system and a feasible route is generated as output, giving clusters of nodes and the route to be traveled within the cluster. For clustering the nodes, we have adopted the DBSCAN algorithm, and the routing is done using the approximation algorithm, Christofide’s algorithm. The solution generated can be employed for solving real-life situations, like delivery systems consisting of various demand nodes.

How To Cite

"Capacitated Vehicle Routing Problem Using Conventional and Approximation Method", IJNRD - INTERNATIONAL JOURNAL OF NOVEL RESEARCH AND DEVELOPMENT (www.IJNRD.org), ISSN:2456-4184, Vol.7, Issue 10, page no.850-853, October-2022, Available :https://ijnrd.org/papers/IJNRD2210103.pdf

Issue

Volume 7 Issue 10, October-2022

Pages : 850-853

Other Publication Details

Paper Reg. ID: IJNRD_183518

Published Paper Id: IJNRD2210103

Downloads: 000121121

Research Area: Computer Science & Technology 

Country: pune, OTHER, India

Published Paper PDF: https://ijnrd.org/papers/IJNRD2210103.pdf

Published Paper URL: https://ijnrd.org/viewpaperforall?paper=IJNRD2210103

About Publisher

Journal Name: INTERNATIONAL JOURNAL OF NOVEL RESEARCH AND DEVELOPMENT(IJNRD)

ISSN: 2456-4184 | IMPACT FACTOR: 8.76 Calculated By Google Scholar | ESTD YEAR: 2016

An International Scholarly Open Access Journal, Peer-Reviewed, Refereed Journal Impact Factor 8.76 Calculate by Google Scholar and Semantic Scholar | AI-Powered Research Tool, Multidisciplinary, Monthly, Multilanguage Journal Indexing in All Major Database & Metadata, Citation Generator

Publisher: IJNRD (IJ Publication) Janvi Wave

Publication Timeline

Peer Review
Through Scholar9.com Platform

Article Preview: View Full Paper

Call For Paper

Call For Paper - Volume 10 | Issue 8 | August 2025

IJNRD is Scholarly open access journals, Peer-reviewed, and Refereed Journals, High Impact factor 8.76 (Calculate by google scholar and Semantic Scholar | AI-Powered Research Tool), Multidisciplinary, Monthly, Indexing in all major database & Metadata, Citation Generator, Digital Object Identifier(DOI) with Open-Access Publications.

INTERNATIONAL JOURNAL OF NOVEL RESEARCH AND DEVELOPMENT (IJNRD) aims to explore advances in research pertaining to applied, theoretical and experimental Technological studies. The goal is to promote scientific information interchange between researchers, developers, engineers, students, and practitioners working in and around the world. IJNRD will provide an opportunity for practitioners and educators of engineering field to exchange research evidence, models of best practice and innovative ideas.

Indexing In Google Scholar, SSRN, ResearcherID-Publons, Semantic Scholar | AI-Powered Research Tool, Microsoft Academic, Academia.edu, arXiv.org, Research Gate, CiteSeerX, ResearcherID Thomson Reuters, Mendeley : reference manager, DocStoc, ISSUU, Scribd, and many more

How to submit the paper?

Important Dates for Current issue

Paper Submission Open For: August 2025

Current Issue: Volume 10 | Issue 8

Last Date for Paper Submission: Till 31-Aug-2025

Notification of Review Result: Within 1-2 Days after Submitting paper.

Publication of Paper: Within 01-02 Days after Submititng documents.

Frequency: Monthly (12 issue Annually).

Journal Type: International Peer-reviewed, Refereed, and Open Access Journal.

Subject Category: Research Area