Skip to content

Latest commit

 

History

History
128 lines (76 loc) · 2.37 KB

README.md

File metadata and controls

128 lines (76 loc) · 2.37 KB

Delivery Route Optimization

Simulating optimal delivery route selection using Uniform Cost Search.

🚀 Project Overview

This repository contains the implementation of a Delivery Route Optimization System, developed to calculate the most cost-effective path between two locations using Uniform Cost Search.

💡 Features

User Account Management:

  • Interactive source and destination input.
  • Validation of graph data before computation.

Route Optimization:

  • Direct Routes: Identify the shortest direct path between locations.
  • Cost Optimization: Calculates the minimal cost route.

Comprehensive Data Handling:

  • Reads and processes graph data from CSV files.
  • Efficient management of route and cost information.

Interactive User Interface:

  • Intuitive prompts for seamless navigation.
  • Displays optimized path and costs clearly.

⚙️ How It Works

Graph Data Parsing

  • Loads graph data (source, destination, cost) from a CSV file.

Priority Queue Implementation

  • Manages route selection based on minimal cost using a custom priority queue.

Uniform Cost Search Algorithm

  • Efficiently finds the optimal route with cost calculations.

Output Details

  • Displays the path and total cost for selected source and destination.

🛠 Technologies Used

  • Programming Language: C
  • Algorithms: Uniform Cost Search
  • Data Structures: Structures, Priority Queue
  • File Handling: CSV Parsing

📝 How to Run

Clone the repository:

git clone https://github.com/Rakshak-D/Uniform-cost-search.git

Change the directory:

cd Uniform-cost-search

Compile the code:

gcc Delivery.c -o delivery

Run the program:

./delivery
  • Follow on-screen prompts to enter source and destination.

📈 Example Output

Enter source: A
Enter destination: C
Optimal route cost from A to C: 30
Path: A -> C

🧑‍💻 Contributing

Contributions are welcome! Please follow these steps:

  1. Fork the repository.
  2. Create a new branch (feature/your-feature-name).
  3. Commit your changes.
  4. Submit a pull request.

📧 Contact

For queries or suggestions, feel free to reach out:

Thank you for visiting! 🚀 Happy coding!