Method and Model The model models the vehicle routing problem using integer programming. The objective function is to minimize the total distance, and this cost consists of the distances traveled by the vehicles. The mathematical model of the problem, its indices and constraints are specified as follows: Indices: J$=$ All pharmacies $(1,.\mathrm{.}20)($the number of pharmacies you have will be that number$)($Node $1$ is assumed to be the exit point of the vehicles, other nodes are assumed to be neighborhoods, Ferhatpa$$a is where all vehicles exit.$)$ F $=$ Vehicles $(1,.,7)(7$ capacity $????$ vehicles$)$ Note: you decide!!!!!!!!!!!!!! You decide the number of vehicles. $7$ is shown here as an example. Parameters: M$\_$i All nodes $($pharmacies$,$ Node $1$ is the warehouse, and Node M is the pharmacies.$)$ C$\_$ij Distance between i and jth pharmacy p$\_$i i$.$ amount of medicine to be distributed to the pharmacy Qv capacity of type v vehicle D: warehouse Decision variables: u$\_$i in Z$\_+$ Positive variable used to prevent sub$-$tour X$\_$ijv in $\{0,1\}=\{(1,$if vehicle v goes from i$.$ pharmacy to j$.$ pharmacy@$0,$otherwise$)$