ABC is an LTL (less-than-truckload) trucking company that delivers loads on a daily basis to five customers. The following list provides the customers associated with each route Route 1 2 3 4 5 ABC 1 2 3 4 5 6 The segments of each route are dictated by the capacity of the truck delivering t loads. For example, on route 1, the capacity of the truck is sufficient to deliver the loads to customers 3,2, and 4 only. The following table lists distances (in miles) among the truck terminal (ABC) and the customers. ABC 0 10 12 16 9 8 Customers served on the route 3, 2, 4 5, 3, 4 2, 1, 5, 3 2, 3, 5 1, 4, 2 1, 3, 5 Miles from i to j 1 2 10 0 32 8 17 10 12 32 0 14 21 20 3 16 8 14 0 15 18 4 9 17 21 15 0 11 5 8 10 20 18 11 0 The objective is to determine the least distance needed to make the daily deliveries to all five customers. Though the solution may result in a customer being served by more than one route, the implementation phase will use only one such route. Formulate the problem as an ILP, and find the optimum solution.

ABC is an LTL (less-than-truckload) trucking company that delivers loads on a daily basis to five customers. The following list provides the customers associated with each route Route 1 2 3 4 5 ABC 1 2 3 4 5 6 The segments of each route are dictated by the capacity of the truck delivering t loads. For example, on route 1, the capacity of the truck is sufficient to deliver the loads to customers 3,2, and 4 only. The following table lists distances (in miles) among the truck terminal (ABC) and the customers. ABC 0 10 12 16 9 8 Customers served on the route 3, 2, 4 5, 3, 4 2, 1, 5, 3 2, 3, 5 1, 4, 2 1, 3, 5 Miles from i to j 1 2 10 0 32 8 17 10 12 32 0 14 21 20 3 16 8 14 0 15 18 4 9 17 21 15 0 11 5 8 10 20 18 11 0 The objective is to determine the least distance needed to make the daily deliveries to all five customers. Though the solution may result in a customer being served by more than one route, the implementation phase will use only one such route. Formulate the problem as an ILP, and find the optimum solution.

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter6: Optimization Models With Integer Variables

Section: Chapter Questions

Problem 2C

See similar textbooks

Similar questions

Cars-to-Dealers Logistics Inc. is the exclusive logistics provider for the Summit Motor Co. and has responsibilityfor transporting cars from Summit’s 3 manufacturing plants in Toledo, OH; Charlotte, NC and Savannah, GA tothe 7 regional dealer locations as in the tables provided in your dataset. To do this, Cars-to-Dealers uses threetransshipment facilities and all cars in the distribution network pass through these transshipment facilities.Dataset also contains the information about the capacities of each of these transshipment facilities, the demandrequirement at each of the regional dealer locations and the unit cost to ship one car between the variouslocations.In addition to supply of cars (manufacturers) and demand for cars (dealers) there are two types of constraintsfor each transshipment facility:1. Balance flow constraints: dictate that all cars flowing into a transshipment facility should also flow out of thetransshipment facility – i.e. no inventory of cars should remain at…
Greenstreets Recycling, Inc., collects used motor oil from several collection sites around the Greater Stanford area. To minimize the use, and thereby the cost, of its labor, vehicle, and energy resources, the company is interested in locating the shortest route that will allow its collection vehicle to visit each collection site exactly once. The following table provides the travel distances in miles between each site. Note that the company’s recycling facility is located at site A. From/To A B C D E F A (depot) – 25 50 48 41 60 B 25 – 35 22 23 43 C 50 35 – 25 47 65 D 48 22 25 – 24 40 E 41 23 47 24 – 21 F 60 43 65 40 21 – Provide an efficient route for the collection vehicle.
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 -
Suppliers A, B, and C supply components to three plants -- F, G, and H via two transshipment facilities -- T1 and T2. It costs $4 to ship from T1 regardless of final destination and $3 to ship to T2 regardless of supplier. Shipping to T1 from A, B, and C costs $3, $4, and $5, respectively, and shipping from T2 to F, G, and H costs $10, $9, and $8, respectively. Suppliers A, B, and C can provide 200, 300 and 500 units respectively and plants F, G, and H need 350, 450, and 200 units respectively. The Logistics Manager has come to you for help. Answer the following question: Which of these is not an element of the objective function? Group of answer choices 4D-T1 600T1 9T2-G 3C-T2 Plz do fast asap
John Clooney, a bush pilot in Alaska, makes regular charter flights in his floatplane to various towns and cities in western Alaska. His passengers include hunters, fishermen, backpackers and campers, and tradespeople hired for jobs in the different localities. He also carries some cargo for delivery. The following network shows the possible air routes between various towns and cities John might take (with the times, in hours). For safety reasons, he flies point-to-point, flying over at least one town along a route, even though he might not land there. In the upcoming week John has scheduled charter flights for Kotzebue, Nome, and Stebbins. Determine the shortest route between John’s home base in Anchorage and each of these destinations.
a) Define the Transportation model. b) A Power company has three plants that supply the need of three cities. Each plant can supply the following numbers of kWh of electricity. Plants 1, 2 and 3 can supply 30, 40 and 50 million kWh respectively. The demand at City 1, City 2 and City 3 are 20, 40 and 40, respectively. Table 1 shows the cost of sending electricity from each plant to each city depends on the distance the electricity must travel. Table 1: Transportation costs From City 1 City 2 City 3 To Plant 1 10 11 16 Plant 2 8 14 11 Plant 3 7 10 13 Formulate the above problem as a balanced Transportation problem.
The MidLands Trucking Company based in Louisvillehas eight trucks located throughout the Mideast that havedelivered their loads and are available for shipments. Through their Internet logistics site MidLands has re-ceived shipping requests from 12 customers. The follow-ing table shows the mileage for a truck to travel to a customer location, pick up the load, and deliver it. Determine the optimal assignment of trucks to customersthat will minimize the total mileage. Customers Truck A B C D E F G H I J K L1 500 730 620 410 550 600 390 480 670 710 440 5902 900 570 820 770 910 660 650 780 840 950 590 6703 630 660 750 540 680 750 810 560 710 1200 490 6504 870 1200 810 670 710 820 1200 630 700 900 540 6205 950 910 740 810 630 590 930 650 840 930 460 5606 1100 860 800 590 570 550 780 610 1300 840 550 7907 610 710 910 550 810 730 910 720 850 760 580 6308 560 690 660 640 720 670 830 690 880 1000 710 680
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.
7. The BD restaurant chain purchases materials from four different food suppliers. The company wants to construct a new central distribution center to process and package the materials before shipping them to their various restaurants. The suppliers transport items in 40-foot truck trailers, each with a capacity of 38,000 lbs. The locations of the four suppliers and the annual number of trailer loads that will be transported to the distribution center are shown in the following table (distance in miles). Using the center-of-gravity method, determine a possible location for the distribution center. A B с D X Y 200 200 100 500 250 600 500 300 Load 75 105 135 60 BD wants to evaluate three different sites it has identified for its new distribution center relative to the four suppliers identified. The coordinates of the three sites under consideration are as follows: Site 1: x1 = 360, y₁ = 180 Site 2: X2 = 420, y2 = 450 Site 3: X3 = 250, y3 = 400
Explain along with examples related to Freight Traffic Assignment Problems and vehicle routing problem in the logistics activities of manufacturing and service companies! Solve the following case study using the transportation method: Suppose there is a manufacturing company that produces and distributes its products to various customer locations across the country. This company has three production plants (Plant A, Plant B, and Plant C) located in different locations, and there are also five distribution centers (DC 1, DC 2, DC 3, DC 4, and DC 5) scattered across various regions. The company's goal is to determine the most efficient transportation routes for delivering products from the plants to the distribution centers, considering transportation costs and available capacities.
Solve the following case study using the transportation method:Suppose there is a manufacturing company that produces and distributes its products to various customer locations across the country. This company has three production plants (Plant A, Plant B, and Plant C) located in different locations, and there are also five distribution centers (DC 1, DC 2, DC 3, DC 4, and DC 5) scattered across various regions. Sources Distribution Center DC 1 DC 2 DC 3 DC 4 Capacity Plant A $145 $150 $165 $140 2000 Plant B $175 $135 $120 $165 1250 Plant C $113 $156 $134 $148 1250 Demand 1000 1200 1400 900 The company's goal is to determine the most efficient transportation routes for delivering products from the plants to the distribution centers, considering transportation costs and available capacities.
A farmers' cooperative association plans to build a new sugar mill in Georgetown. Theprimary objective of the mill is to provide the farmers with a place to take their crop forprocessing that will reduce their transportation costs. The members of the co-op believe thatthe center-of-gravity method is appropriate for this objective. While there are over 200 sugarcane farms in the region, they are tightly clustered around six villages. Using the data below,use the center-of-gravity method to calculate the coordinates of the best location for this mill.All mileage references use Browns Town as (0,0).VillageMiles East ofBrowns TownMiles North ofBrowns TownSugar CanetonnageBarney Valley 90 10 240,000Blue Pasture 140 60 320,000Congo Valley 20 70 450,000Bower 50 20 120,000Rabacca 100 80 60,000Salem 10 120 140,000