Exam 9: Transportation, Assignment, and Network Models

The west-to-east air traffic system passing through the United States can handle aircraft flows with capacities in hundreds of planes per hour as shown.What is the peak air traffic load (From City 1 to City 5)in aircraft per hour that this system can handle?

Four projects must be completed, and each of four employees will be assigned to work on exactly one of the four projects.The table below presents an estimate of the cost that each employee would incur if working on the respective projects.What is the minimum-cost assignment of workers to projects?

All the nodes must be connected in which of the following techniques?

The Pointy-haired boss has five projects to assign and decides to go against all convention and assign them to individuals rather than project teams.He has the Elbonians estimate the labor cost in dollars of each possible assignment and that information is summarized in the table. Use Solver to determine the optimal assignment.

The maximal-flow model might be of use to an engineer looking for spare capacity in an oil pipeline system.

Given a network with the following distances: Determine which nodes should be connected to get the minimum distance flowing from Node 1 through Node 7. Determine the minimum distance.

Neki Sports Company manufactures treadmills in factories located in Pittsburgh and Kansas City.These are shipped to regional distribution centers in Chicago, Phoenix, and Philadelphia.Ultimately they are delivered to supply houses in New York and Los Angeles.The available supplies at the factories, demands at the final destinations, and shipping costs are illustrated in the table below. Determine how many units should be shipped for all possible origin and destination points (final or intermediate)in the distribution network in order to minimize shipping costs.

A traveling salesperson might use the shortest route technique to minimize the distance traveled to reach one of his/her customers.

The two most common objectives for the assignment problem are the minimization of

Table 9-3 To demonstrate the personal touch that is part of the Apple experience, Tim Cook decides to personally deliver the first iCar produced in San Jose to the customer's home in Nashville.In order to minimize the carbon footprint, he decides to push the car rather than actually driving it, and since his time is valuable, he wants to choose the shortest route possible.Fortunately, the first genius he talks to at The Genius Bar is able to determine the drive times between cities Tim might pass through along the way to Nashville.The cities and drive times are shown in the table - the push time is assumed to be a direct multiple of the drive time, which will act as a surrogate to keep the numbers low. -What is the duration of the shortest route for the scenario described in Table 9-3?

Find the shortest route from Node 1 to each of the other nodes in the transportation network represented below.

Given the following distances between destination nodes, what is the minimum distance that connects all the nodes?

The Pointy-haired boss has five projects to assign and decides to go against all convention and assign them to individuals rather than project teams.He has the Elbonians estimate the labor cost in dollars of each possible assignment and that information is summarized in the table.Use Solver to determine which worker is assigned Project 1.

A line in a network that may represent a path or a route is called a(n)

Find the shortest route from Node 1 to Node 5.

A cable company must provide service for 7 houses in a particular neighborhood.They would like to wire the neighborhood in a way to minimize the wiring costs (or distance).What is the minimal length of the network required to span the entire neighborhood?

A cable company must provide service for 6 houses in a particular neighborhood.They would like to wire the neighborhood in a way to minimize the wiring costs (or distance).What is the minimal length of the network required to span the entire neighborhood?

Given the following traffic flows, in hundreds of cars per hour, what is the maximum traffic flow from City 1 to City 7?

Given the following distances between destination nodes, what is the minimum distance that connects all the nodes?

In a transportation problem, each destination must be supplied by one and only one source.