POST TEST MODULE 6

What is the title of this module?

• Planning and Allocation of Freight Modes

• Freight Mode Planning and Allocation

• Freight Mode Allocation and Planning

• Allocation and Planning of Freight Modes

The object used to find truck routes in this module is...

• Distribution Center

• Coordinate

• Total Distance

• Capacity

This planning involves multiple transportation fleets to serve different destinations. Is the definition of . . .

• Multiple Separate Origin

• Multi-Fleet Route Planning

• Shortest route determination

• Single Fleet Route Planning

This planning involves multiple transportation fleets to serve different destinations. Is the definition of . . .

• Multi-Fleet Route Planning

• Single Fleet Route Planning

• Shortest route determination

• Crisis Trajectory Method

to determine the shortest route, fastest time or smallest cost

that must be traveled by a fleet of vehicles, what is the method used?

• Dijkstra Method

• Crisis Trajectory Method

• Shortest route determination

• Fleet Route Planning

The assumptions in determining the shortest route using the forward

calculation of the CPM method, EXCEPT . . .

• The time or distance of an activity is deterministic

• The activity network has only one origin node and one final

  destination node

• The fastest time to start an activity at the origin node is zero.

• A fleet of vehicles must make a complete trip

Complete the following formula:
=IF(L28=$I$10,_____(K28,$B$13:$F$22,5),0)

• Sumif

• IF

• VLOOKUP

• HLOOKUP

The picture is . . .

• Send goods from its factory in city A to its warehouse in city G.

• Send goods from its Warehouse in city A to its factory in city G.

• Send goods from its factory in city A to its factory in city G.

• Send goods from its warehouse in city A to its warehouse in city G.

The goal of vehicle routing is to find the best segment (shortest travel distance, fastest travel time, and smallest transportation cost) that must be passed by a freight fleet on the network - a network of highways, railways, shipping sections, and flight routes.

• TRUE

• FALSE

dIn the CVRP method, the formula for calculating customer 1 to DC is ...

• =SQRT((DC x-coordinate-Customer 1 coordinate)^2+(DC x-coordinate-Customer 1 coordinate)^2)

• =SQRT((DC x-coordinate-Customer 1 coordinate)/2+(DC x-coordinate-Customer 1 coordinate)/2)

• =SQRT((DC x-coordinate-Customer 2 coordinate)*2+(DC x-coordinate-Customer 1 coordinate)*2)

• =SQRT((DC x-coordinate-Customer 1 coordinate)*2+(DC x-coordinate-Customer 2 coordinate)*2)