-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
1 changed file
with
20 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,20 @@ | ||
outline: | ||
1. Describe the problem: | ||
a. normal explanation of problem. | ||
b. constraints and their priorities. | ||
c. impact of this problem in real time, eg. millions of dollars can | ||
be saved by having efficient soln. | ||
d. the general methods of solving this; eg. linear programming and | ||
heuristic approaches in it, ant colonization and why these fail. | ||
2. Our Solution | ||
a. Use TSP as we want to minimise cost eventually(explain TSP too). | ||
b. Problem in using TSP though, is its bad time complexity. | ||
c. Hence use clustering to improve time; explain the derivation | ||
d. This serves another purpose as well i.e bus size and percent occupancy, | ||
how: assign 1 bus for each cluster and run TSP for that cluster | ||
e. Now we have to make sure size of each cluster is >85% of bus cap | ||
and number of clusters is <= total number of buses available, | ||
to handle this, explain the process given by Chaithanya. | ||
f. To handle time window, run TSP on weighted graph, alpha beta | ||
method | ||
|