Route Optimization Problem for a Logistics Company The logistics company XpreSS operates with 9 distribution centers strategically located around Nacional level. The company must make daily deliveries of products from these centers of distribution to different destinations. Each connection between two distribution centers has an associated a transportation cost. 1.- Distribution Centers (Nodes): - Arica, Buin, Calama, Dichato, El Quisco, Frutillar, Galvarino, Huasco, Illapel. 2.- Transportation Costs (in monetary units): - Transportation cost from Arica to Buin: $30 - Transportation cost from Arica to Calama: $25 - Transportation cost from Arica to Dichato: $40 - Transportation cost from Buin to Calama: $20 - Transportation cost from Buin to Dichato: $35 - Transportation cost from Buin to El Quisco: $45 - Transportation cost from Calama to Dichato: $15 - Transportation cost from Calama to El Quisco: $30 - Transportation cost from Calama to Frutillar: $50 - Transportation cost from Dichato to El Quisco: $25 - Transportation cost from Dichato to Frutillar: $30 - Transportation cost from Dichato to Galvarino: $40 - Transportation cost from El Quisco to Frutillar: $20 - Transportation cost from El Quisco to Galvarino: $35 - Transportation cost from El Quisco to Huasco: $40 - Transportation cost from Frutillar to Galvarino: $15 - Transportation cost from Frutillar to Huasco: $25 - Transportation cost from Frutillar to Illapel: $30 - Transportation cost from Galvarino to Huasco: $20 - Transportation cost from Galvarino to Illapel: $30 - Transportation cost from Huasco to Illapel: $25 Minimize the total transportation cost by finding optimal routes from each transportation center distribution to others. Each distribution center must be connected to at least one other center (it cannot be isolated). Represent the problem using a graph in Python with the networkx library, which Model the network of distribution centers and their connection

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

Route Optimization Problem for a Logistics Company

The logistics company XpreSS operates with 9 distribution centers strategically located around

Nacional level. The company must make daily deliveries of products from these centers of

distribution to different destinations. Each connection between two distribution centers has an associated

a transportation cost.

1.- Distribution Centers (Nodes):

- Arica, Buin, Calama, Dichato, El Quisco, Frutillar, Galvarino, Huasco, Illapel.

2.- Transportation Costs (in monetary units):

- Transportation cost from Arica to Buin: $30

- Transportation cost from Arica to Calama: $25

- Transportation cost from Arica to Dichato: $40

- Transportation cost from Buin to Calama: $20

- Transportation cost from Buin to Dichato: $35

- Transportation cost from Buin to El Quisco: $45

- Transportation cost from Calama to Dichato: $15

- Transportation cost from Calama to El Quisco: $30

- Transportation cost from Calama to Frutillar: $50

- Transportation cost from Dichato to El Quisco: $25

- Transportation cost from Dichato to Frutillar: $30

- Transportation cost from Dichato to Galvarino: $40

- Transportation cost from El Quisco to Frutillar: $20

- Transportation cost from El Quisco to Galvarino: $35

- Transportation cost from El Quisco to Huasco: $40

- Transportation cost from Frutillar to Galvarino: $15

- Transportation cost from Frutillar to Huasco: $25

- Transportation cost from Frutillar to Illapel: $30

- Transportation cost from Galvarino to Huasco: $20

- Transportation cost from Galvarino to Illapel: $30

- Transportation cost from Huasco to Illapel: $25

Minimize the total transportation cost by finding optimal routes from each transportation center

distribution to others.

Each distribution center must be connected to at least one other center (it cannot be

isolated).

Represent the problem using a graph in Python with the networkx library, which
Model the network of distribution centers and their connections.
Use a route optimization algorithm (such as the Dijkstra algorithm or the
Floyd-Warshall) to find the optimal solution.
 Add nodes for each distribution center.
Add weighted edges to represent roads and their costs.
Use the networkx package to view the graph. Mark the routes in a different color
shorter ones found for better visualization.

Show the minimum total cost to transport packages to all destinations.

Expert Solution
steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY