John is travelling from home in Sydney to a hotel in Perth. Three stopovers on the way a number of choices of towns for each stop only one hotel to choose from in each town, except for Perth, where there are three hotels (J, K, and L) to choose from Each trip has a different distance resulting in a different cost (petrol) (cost is marked by each arc) Hotels have different costs (cost is marked by each node (town)) The goal is to select a route to and a hotel in Perth so that the overall cost of the trip is minimized. Use dynamic programming (forward recursion) to solve this problem by constructing the usual tables for each stage. Stage: (Sydney) Petrol cost start 22 8 Hotel cost 1 70 A 80 B C 80 25 10 2 50 D FR E 70 25 30 10 18 8 3 50 70 G 70 H I 60 8 20 10 10 10 10 50 4 (Perth) 15 13 K 10 15 L 60 70

John is travelling from home in Sydney to a hotel in Perth. Three stopovers on the way a number of choices of towns for each stop only one hotel to choose from in each town, except for Perth, where there are three hotels (J, K, and L) to choose from Each trip has a different distance resulting in a different cost (petrol) (cost is marked by each arc) Hotels have different costs (cost is marked by each node (town)) The goal is to select a route to and a hotel in Perth so that the overall cost of the trip is minimized. Use dynamic programming (forward recursion) to solve this problem by constructing the usual tables for each stage. Stage: (Sydney) Petrol cost start 22 8 Hotel cost 1 70 A 80 B C 80 25 10 2 50 D FR E 70 25 30 10 18 8 3 50 70 G 70 H I 60 8 20 10 10 10 10 50 4 (Perth) 15 13 K 10 15 L 60 70

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter2: Introduction To Spreadsheet Modeling

Section: Chapter Questions

Problem 20P: Julie James is opening a lemonade stand. She believes the fixed cost per week of running the stand...

See similar textbooks

Similar questions

Q: When we solve the given transportation problem according to the lowest cost method, which warehouse and/or warehouses are suitable for shipment from f3 (F: Factory M: Customer)A) no needb) M1, M2, M3c) M1 and M2d) M3 and M1E) M3
On a daily basis, the Vampire Van is dispatched from Maplewood Hospital to pickup blood and platelet donations made at its local donation centers. The distances in miles between all locations may be found in Table.a. The Vampire Van travels from Maplewood Hospital (A) to (B) to (C) to (D) to (E) and then returns to the hospital (A). What is the total number of miles that the van must travel using this route?b. Using Maplewood Hospital as the beginning location, create a route using the NN heuristic. What is the total number of miles that the van must travel using this route?c. Using Valley Hills (E) as the beginning location, create a route using the NN heuristic. What is the total number of miles that the van must travel using this route?
7. Novelis at Oswego NY supplies rolled aluminum sheets to Ford Motor's Kansas City plant to make F150 truck. The transportation manager of Novelis needs to choose from rail, waterway, and truck. The following information are gathered to make the transportation mode decision: Transportation Mode Transit Time, Days Rate $/cwt Shipment Size, cwt Rail 15 $2.50 12,000 Waterway 20 $0.80 200,000 4 $12.50 4,000 Truck The annual transportation volume is 2.5 million cwt. The value of aluminum is $500 per cwt. Inventory carrying cost for both companies is 20% per year. Please calculate the total logistics costs (transportation, inventory at Novelis, inventory at Ford, inventory in transit), and decide which transportation mode should be selected. (20 points)
A supplier ships goods from Richmond, VA to three market places in 3 cities (Chicago, IL; Athens, GA; St. Luis, MO). The supplier can ship every day, every other day, or every third day. There is a penalty of $0.30/cwt for each day delayed. Consolidating shipments allows for lower transportation costs from larger loads, but incurs penalty costs due to the delay. Transportation Rate (S/cwt) Shipment City Weight/day LTL 50,000 lb 50000 lb Chicago, IL 18,000 lb (180 cwt) 1.50 1.25 Athens, GA 15,000 lb (150 cwt) 1.35 1.00 St. Luis, MO 12,000 lb (120 cwt) 2.00 1.50 Total 45,000 Ib = 450 cwt Find what is the cost for the following: Shipping Every Day Shipping on the alternate Day (every two days) Shipping every three Day
Q2. Pharmaceutical company producing asingle product sold it through five agencies situated in different cities. All of sudden there rouse a demand for the product in another five cities that didn't agency of the company. The company is now facing the problem of deciding on how to assign the existing agencies in order to dispatch the product to needy cities in such a waythat the travelling distance is minimized. The distance between the surplus and deficit cities in kilometer is given the following table. Surplus city Deficit cities Deficit cites A1 160 130 115 190 200 B1 135 120 130 160 175 C1 140 110 125 170 185 D1 50 50 80 80 110 E1 55 35 80 80 105 Determine the optimum assignment schedule.
GANIER RIDGE EAST LOT-> ACCESS TRAIL
A company is considering four modes of transportationfor its shipments. It plans to ship 32 pallets weighing500 pounds each from Salt Lake City, Utah to Reno,Nevada at a distance of 518 miles. What is the best way tomake these shipments given the following information?
A company has four distribution centers, located in Atlanta, Lexington, Milwaukee, and Salt Lake City, and ships to 12 retail stores, located in Seattle, San Francisco, Las Vegas, Tucson, Denver, Charlotte, Minneapolis, Fayetteville, Birmingham, Orlando, Cleveland, and Philadelphia. The company wants to minimize the transportation costs of shipping one of its products. The per-unit shipping cost from each distribution center to each retail location and the amounts currently in inventory and ordered at each retail location are shown in the accompanying table. Develop and solve an optimization model to minimize the total transportation cost and answer parts a and b. Click here to view the shipping data. .... a. What is the minimum cost of shipping? Total Cost = S (Type an integer or a decimal. Do not round.)
eBook Problem 10-31 A long-distance telephone company uses a fiber-optic network to transmit phone calls and other information between locations. Calls are carried through cable lines and switching nodes. A portion of the company's transmission network is shown here. The numbers above each arc show the capacity in thousands of messages that can be transmitted over that branch of the network. To keep up with the volume of information transmitted between origin and destination points, use the network to determine the maximum number of messages that may be sent from a city located at node 1 to a oty located at node 7. 3 Maximum number of messages -
A dynamic distance vector protocol used in the Internet as exterior routing protocol: O OFPF О ВБР O ICMP RIP
Travelling Salesman Problem (TSP); Given the following distance matrix, use the nearest neighbor (NN) heuristic to find a route that starts from the warehouse (W), visits each customer only once, and finishes at the warehouse to minimize the distance traveled. What is the route and the corresponding distance? Distances W 1 2 3 4 in miles 18 57 27 50 18 0 65 29 61 57 65 0 36 99 3 27 29 36 0 76 4 50 61 99 76 Route=W-1-3-2-4, Distance=182 miles Route=W-3-1-2-4-W, Distance=270 miles Route = W-3-1-2-4, Distance=220 miles Route=W-1-3-2-4-W, Distance=232 miles Route=W-1-3-4-2, Distance=272 miles 1, 2.
Ancient history of logistics distribution regarding probability?