ECL 201:  Scientific Computing Lab

Online Meeting Link

https://meet.google.com/pmp-dybr-mzb 

List of Experiments

CO-PO Mapping

Jupyter Notebooks

Folder

Internals

TBA

Bonus Problem

The Rabbit Problem 

• Start with a pair of newborn rabbits (one male and one female).

• Rabbits reach maturity and can reproduce after one month.

• Each month, each mature pair of rabbits produces a new pair of rabbits (one male and one female).

• Rabbits never die.

• How many rabbits will be there after one year?

Traveling Salesman Problem (TSP) 

Kerala's intricate network of roads and waterways presents a unique challenge for logistics companies, especially those involved in delivering perishable goods like seafood across various districts. Given the urgency and freshness required, optimizing the delivery routes is critical.

Objective

Develop a Python program to find the most efficient route for delivering seafood from a central distribution point in Kochi to multiple delivery locations across Kerala, ensuring that the total travel distance is minimized.

Inputs

• Locations: A list of tuples representing the coordinates (x, y) of Kochi and other delivery points. The number of locations will be inputted by the user and the coordinates are randomly generated. 

• Distance Function: A function to calculate the Euclidean distance between any two given locations.

Tasks

1. Generate Distance Matrix: Create a matrix that represents the distance between each pair of locations.

2. Route Optimization: Implement an algorithm to determine the shortest possible route that visits each location exactly once and returns to the starting point.

Please upload your Notebooks to this folder.