Diet Optimization Using Local Search & Metaheuristics 🥗📊

Optimizes daily meal plans by minimizing cost while satisfying nutritional constraints, food categories, and meal prohibitions using Local Beam Search, Hill Climbing, and Tabu Search.

• Real-world Diet Problem: 3 meals/day (breakfast, lunch, dinner) optimization

• Complex Constraints:
  • Total quantity ≤ 6kg/day
  • Per-food maximum limits
  • Meal composition (minimum category representation)
  • Meal-specific food prohibitions
  • Not Recommended at Dinner
• Three Metaheuristic Algorithms:
  • Local Beam Search
  • Hill Climbing
  • Tabu Search
• Pandas-powered: Intuitive DataFrame solution representation
• Excel Export: Complete results with nutrient analysis

Make sure to download the requirements using:

pip install -r requirements.txt

Run the program using

py main.py