Efficient Harvest Planning in C++

By Rachit Singh

The primary goal of this C++ project is to assist a farmer in harvesting cotton without waste while also reducing transportation costs and time.

Description

Dhananjay is an illiterate cotton farmer. He owns a farm that he has divided into eight separate lands, each with a different capacity for cotton cultivation. He accepts bulk orders from consumers and harvests the number of acres based on the overall quantity desired by the customers. Dhananjay's cotton is squandered since he has to harvest the entire piece of land at once, and if the order is less than the quantity a land can produce, the remaining is useless and must be discarded. Every day, he gets up early and drives his van to his customers to deliver cotton. He's been working for 5 years, yet he barely makes enough to make a decent living and support his family. He has good quality lands and can make a good profit if he works efficiently. The main goal of this C++ project is to assist Dhananjay in harvesting cotton with minimal waste and in transporting milk with the least amount of time and expense feasible, as he is illiterate and hence frequently duped by his customers.

Task to be performed:
• Harvest cotton efficiently.
• Finding the shortest path to deliver the cotton.

Data Structures used:

• Arrays
• Graphs

Algorithms used:
1.Perfect Subset Sum Problem (using Recursion & Dynamic Programming Approach)
2.Backtracking technique
3.Travelling Salesman Problem (Hamiltonian Cycle with minimum weights)

Results/Input & Output snapshots: