KanTech Corporation is a global distributor of electrical parts and components. Its customers are electronics companies in the United States, including computer manufacturers and audio/visual product manufacturers. The company contracts to purchase components and parts from manufacturers in Russia, Eastern and eastern Europe, and the Mediterranean, and it has them delivered to warehouses in three European ports, Gdansk, Hamburg, and Lisbon. The various components and parts are loaded into containers based on demand from U.S. customers. Each port has a limited fixed number of containers available each month. The containers are then shipped overseas by container ships to the ports of Norfolk, Jacksonville, New Orleans, and Galveston. From these seaports, the containers are typically coupled with trucks and hauled to inland ports in Front Royal (Virginia), Kansas City, and Dallas. There are a fixed number of freight haulers available at each port each month. These inland ports are sometimes called "freight villages," or intermodal junctions, where the containers are collected and transferred from one transport mode to another (i.e., from truck to rail or vice versa). From the inland ports, the containers are transported to KanTech's distribution centers in Tucson, Pittsburgh, Denver, Nashville, and Cleveland. Following are the handling and shipping costs ($/container) between each of the embarkation and destination points along this overseas supply chain and the available containers at each port:
Formulate and solve a linear programming model to determine the optimal shipments from each point of embarkation to each destination along this supply chain that will result in the minimum total shipping cost.© BrainMass Inc. brainmass.com March 5, 2021, 1:53 am ad1c9bdddf
xij = containers shipped from European port I (where i = 1, 2, 3) to U.S. Port j (where j = 4, 5, 6, 7); from U.S. Port i (where i = 4, 5, 6, 7) to Inland Port j (where j = 8, 9, 10); from Inland Port i (where i = 8, 9, 10) to distribution center j (where j = 11, 12, 13, 14, 15)
Minimize Z = 1,725x14 + 1,800x15 + 2,345x16 + 2,700x17 + 1,825x24 + 1,750x25 + 1,945x26 + 2,320x27 +
2,060x34 + 2,175x35 + 2,050x36 + ...
This posting contains a detailed formulation to an elaborate transshipment problem.