Simulating Network of Queues

For the course Queues & Logistics a few lectures were given to show the theory behind single MM1 queus and networks of MM1 queues. After this a simulation of a network of queues should be made. This network is basically a grid of queues in which each queue has its own ID. Customers have different start and end queue couples. Each customer arrives at a start queue and has to reach its end queue by walking through the network of queues. Each time a customer arrives at a queue, the queue has to check if the queue is busy or not. If the queue is busy with serving another customer, the customer that arrives has to wait. The goal of the assignment was to realize an optimal routing algorithm to minimize the time a customer has to wait.