Name		Name	Last commit message	Last commit date
parent directory ..
images		images
README.md		README.md
one-pager.png		one-pager.png

README.md

Route Planning for Optimised On-Time Delivery

This repository serves as the official submission of IIT Bhubaneswar for the Grow Simplee Problem Statement, which earned them a Silver Medal🥈 among 23 competing IITs.

🌟 Problem Statement

Given n items to deliver and a fleet of m riders, (n > m), and some k dynamically added pickup points. Optimize for n items and at most m tours, also considering the cases where k >= 0 and points are added or deleted from the original route .

The Objectives are:

A tool that accurately estimates the length, breadth, height and volumetric weight of an item with a small margin of error. The product developed should be easy to use, reproduceable and reusuable. Bonus points will be awarded, if erroneous objects can be flagged on conveyor.
An effective route planning system to cluster items into different tours that maximizes number of items delivered in each route of tour, maximizing the on time delivery percentage and minimizing overall distance travelled on all routes combined with minimum tours/riders involved in fulfillment. While route planning, maximizing output of rider by smart bag creation/clustering to get the best out of riders and routes. This Route planning system should also have the ability to add pickup points dynamically for multi pickup cases by selecting the correct rider/tour, reroute their routes to cater pickups along with their on going tour, and considering the rider bag capacity as well.
A basic platform ( web / app ) to fit in all these objectives together where points can be added or removed dynamically. The app is expected to support navigation on map by prompting the best route between any two points on the tour for riders. The app needs to be integrated with Challenge-1 for rider-bag problem.