Evaluate the shortest path from o to t

Assignment Help Other Subject
Reference no: EM134443

Question 1

One subway station in Toronto has six turnstiles, each of which may be controlled by the station manager to be used for either entrance or exit control - but never for both. The manager must decide at different times of the day just how several turnstiles to use for entering passengers and how many to be set up to allow exiting passengers.

Consider that passengers enter the station at a rate of about 84 per minute between the hours of 7 and 9 A.M. Passengers exiting trains at the stop reach the exit turnstile area at a rate of about 48 per minute during the same morning rush hours. Each turnstile will allow an average of 30 passengers per minute to enter or exit. Service and Arrival times have been thought to follow Poisson and exponential distributions, respectively. Consider riders form a common queue at both entry and exit turnstile areas and proceed to the first empty turnstile.

The station manager does not want the average passenger at his station to have to wait in the turnstile line for more than six seconds, nor does he want more than eight people in any queue at any average time.

a) How many turnstiles should be opened in each direction every morning?
b) Show the assumptions underlying the solution of this problem using queuing theory.

Question 2

Consider the subsequent network, where the numbers represent actual distance between the corresponding nodes.

2257_Evaluate the shortest path from O to T.png

a) Use the algorithm described to evaluate the shortest path from O to T.

b) Formulate this shortest path problem as an integer programming problem and solve it in EXCEL.

Question 3

A computer engineer lives in town A and needs to visit each of the towns B, C, D, and E to service various installations. He must visit each town once and return to town A. The distances in miles between the towns are shown in the table.

1007_Evaluate the shortest path from O to T1.png

a) Use the nearest neighbor algorithm to find a tour, starting at town A.
b) Use the nearest insertion algorithm to find a tour, starting at town A.
c) Use Clarke and Wright savings algorithm to find a tour, starting at town A.

Reference no: EM134443

What changes can you identify between the exposition

You might consider mentioning that during Mozart’s time the piano was considerably different from the modern instrument in mechanism, number of strings (double rather than tri

Understanding of the content of the article

The first step in writing an article review is to carefully read and note the article to be reviewed. Without a thorough understanding of the content of the article, it will

Identify five specific executive functioning deficits

Executive functioning involves many of the cognitive processes with which students with disabilities struggle. Identify 5 specific executive functioning deficits, and write on

How should region address e.coli problem in river system

How should the region address the E.coli problem in this river system? Should the region and the nation expend funds to remove this enviromental hazard, a liability to economi

Gay science by nietzsche

Here Nietzsche introduces his idea of the eternal recurrence of all things- which implies that you will live this life that you are now living an infinite number of times. s

How you will plan and prepare for the intake interview

You are required to read through the scenario and in a separate word document detail how you will plan and prepare for the intake interview by responding to each of the ques

Is stop-and-frisk a form of harassment

The New York Police Department said its controversial policy kept the streets safe, but critics claim it was a form of harassment. What arguments can you think of that count

Calculating quantity of groundwater using darcy law

Using Darcy's Law, calculate the quantity of groundwater (L/day), the seepage velocity (m/s), and the contaminant loading (Kg/day) to the river (assuming no retardation) for

Reviews

Write a Review

 
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd