Skip to content

arushi-08/inventory-route-optimization-system

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

41 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Overview

A visual tool for designing supply chain networks and calculating optimal inventory collection routes using graph algorithms. It models an inventory as a graph and computes the most efficient route for picking items.

Key Features

Graph Configuration

  • Define warehouse nodes (storage locations) via comma-separated list
  • Create directed/undirected edges with weights
  • Interactive edge management with validation
  • Automatic graph layout using force-directed algorithms

Route Optimization

  • Multiple algorithm support:
    • Dijkstra - Exact shortest path for single orders
    • TSP with Nearest Neighbor - Efficient multi-item collection
  • Multi-item order handling with start/end constraints
  • Real-time path calculation

Visual Analytics

  • Interactive route simulation with speed control
  • Weighted edge visualization
  • Step-through debugging for routes

Tech Stack

  • Frontend: React + ReactFlow (graph visualization)
  • Algorithms: Dijkstra, TSP heuristic implementations
  • State Management: React Hooks with memoization
  • API: Axios for backend communication

Quick Start (Development)

git clone https://github.com/arushi-08/inventory-route-optimization-system.git
cd inventory-route-optimization-system

Backend

cd backend && mvn spring-boot:run

Frontend (in new terminal)

cd frontend && npm install && npm start

Access:

Frontend: http://localhost:3000 Backend API: http://localhost:8080/api

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors