industrial gas supplier every day supplies gas acturing particular day, the company has received following orders from 6 companies that they need to fulfill using their fleet of tankers each with a capacity of 100 units. Node 1 Node 2 Node 3 Node 4 Node 5 Node 6 Demand (Units) Node 0 Node 1 Node 2 Node 3 Node 4 Node 5 Node 6 30 40 37 52 45 60 31 Table below gives the distances (in Miles) between the companies central depot (Node 0) and the ix customers (Node1, Node 2.....Node 6). Node 0 Node 1 Node 2 30 40 27 27 21 29 26 20 20 38 20 10 30 32 40 30 27 42 Node 3 Node 4 Node 5 Node 6 37 31 21 20 38 32 42 28 39 52 30 29 20 30 26 28 60 26 40 30 27 26 39 (a) Use the sequential version of Savings algorithm to develop vehicle route that minimizes total distance travelled. (b) Use the parallel version of Savings algorithm to develop vehicle route that minimizes total distance travelled. How does this solution compare to one obtained in part (a)? Which in hotter?

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
An industrial gas supplier every day supplies gas to its local manufacturing companies. On a
particular day, the company has received following orders from 6 companies that they need to
fulfill using their fleet of tankers each with a capacity of 100 units.
Node 1 Node 2 Node 3 Node 4 Node 5 Node 6
Demand
(Units)
40
Table below gives the distances (in Miles) between the companies central depot (Node 0) and the
six customers (Node1, Node 2.....Node 6).
Node 0 Node 1 Node 2
30
40
27
Node 0
Node 1
Node 2
Node 3
Node 4
Node 5
Node 6
30
40
37
52
60
31
45
27
21
29
26
20
20
38
20
30
32
10
Node 3 Node 4 Node 5
37
52
29
20
30
21
38
30
27
42
30
26
28
60
26
30
27
26
40
39
Node 6
31
20
32
42
28
39
(a) Use the sequential version of Savings algorithm to develop vehicle route that minimizes
total distance travelled.
(b) Use the parallel version of Savings algorithm to develop vehicle route that minimizes
total distance travelled. How does this solution compare to one obtained in part (a)?
Which one is better?
Transcribed Image Text:An industrial gas supplier every day supplies gas to its local manufacturing companies. On a particular day, the company has received following orders from 6 companies that they need to fulfill using their fleet of tankers each with a capacity of 100 units. Node 1 Node 2 Node 3 Node 4 Node 5 Node 6 Demand (Units) 40 Table below gives the distances (in Miles) between the companies central depot (Node 0) and the six customers (Node1, Node 2.....Node 6). Node 0 Node 1 Node 2 30 40 27 Node 0 Node 1 Node 2 Node 3 Node 4 Node 5 Node 6 30 40 37 52 60 31 45 27 21 29 26 20 20 38 20 30 32 10 Node 3 Node 4 Node 5 37 52 29 20 30 21 38 30 27 42 30 26 28 60 26 30 27 26 40 39 Node 6 31 20 32 42 28 39 (a) Use the sequential version of Savings algorithm to develop vehicle route that minimizes total distance travelled. (b) Use the parallel version of Savings algorithm to develop vehicle route that minimizes total distance travelled. How does this solution compare to one obtained in part (a)? Which one is better?
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Binary Tree
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education