Scribd
Upload
39 views

POSTER

The document presents a novel algorithm for solving the capacitated vehicle routing problem (CVRP) for smart cities. The algorithm is based on the non-dominated sorting genetic algorithm-II (NSGA-II) approach. It aims to find routing solutions that balance the trade-off between minimizing total distance traveled and balancing route lengths. The quality of final solutions depends on the quality of initial solutions provided. Intelligent heuristics could help generate better initial solutions. Contact information is provided for the lead researcher.

Uploaded by

Devank Garg
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
39 views

POSTER

The document presents a novel algorithm for solving the capacitated vehicle routing problem (CVRP) for smart cities. The algorithm is based on the non-dominated sorting genetic algorithm-II (NSGA-II) approach. It aims to find routing solutions that balance the trade-off between minimizing total distance traveled and balancing route lengths. The quality of final solutions depends on the quality of initial solutions provided. Intelligent heuristics could help generate better initial solutions. Contact information is provided for the lead researcher.

Uploaded by

Devank Garg
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 1

[6,7].

A Novel Algorithm For Capacitated Vehicle


Routing Problem For Smart Cities
Jagendra Singh*, Deepak Garg*, Mohammad Sajid
*School of Computer Science Engineering and Technology, Bennett University
Published in Symmetry, 13(10), 2021 (SCI Impact Factor: 2.71)

Abstract

Although bird classification can be done manually by domain


experts, with growing amounts of data, this rapidly becomes a
tedious and time-consuming process. So, by this model we can
identify the species of the birds accurately and in less time. In our
application, the user needs to input the image of the bird, and our
model will classify the species of the bird.
It is required to find the perfect hyperparameter values so that the
training time can be reduced and the model can be used to

Introduction

In this paper, we are going to present a perfectly tuned


mobilenetv5 model for bird species classification , the model
has been trained for more than 400 species of birds present
throughout the world, dataset which we have taken consists
of near 100000 high quality images, the model has been
run for various values of same set of hyperparameters and
after playing around with these parameters we have found
the optimal set of values for training the model, which gives Experimental Results
us correct prediction every time.

Proposed Method
Pretrained mobilenetv2:

We have taken pretrained mobilenetv5, and retrained it on our 450


bird- species dataset,
Which consists of over 95000 images
Then we used the keras image data generator for Generating
batches of tensor image data with real-time data augmentation.
Then we fine tuned the model.
Then model was evaluated and tested on custom images

Conclusion
As the proposed NSGA-II-based routing algorithm offers solutions with a
trade-off between the overall distance traveled and the route with the longest
length, the user can employ different solutions to meet their requirements. It is
also observed that the quality of the final solutions is affected by the quality of
initial solutions. Intelligent heuristics can be developed to generate good
initial solutions.
Contact Information
Dr. Jagendra Singh, SCSET, Bennett University
Email- [email protected] www.postersession.com
www.postersession.com

You might also like