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?
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?
Operations Research : Applications and Algorithms
4th Edition
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Wayne L. Winston
Chapter20: Queuing Theory
Section: Chapter Questions
Problem 17RP
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?](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F2db05b6a-0675-4fca-8f3e-99355c426502%2Fcb6f3bcc-ca8d-45aa-bec1-e1bec47c0d1f%2Fpuglkcf_processed.png&w=3840&q=75)
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
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Knowledge Booster
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.Recommended textbooks for you
![Operations Research : Applications and Algorithms](https://www.bartleby.com/isbn_cover_images/9780534380588/9780534380588_smallCoverImage.gif)
Operations Research : Applications and Algorithms
Computer Science
ISBN:
9780534380588
Author:
Wayne L. Winston
Publisher:
Brooks Cole
![A Guide to SQL](https://www.bartleby.com/isbn_cover_images/9781111527273/9781111527273_smallCoverImage.gif)
A Guide to SQL
Computer Science
ISBN:
9781111527273
Author:
Philip J. Pratt
Publisher:
Course Technology Ptr
Np Ms Office 365/Excel 2016 I Ntermed
Computer Science
ISBN:
9781337508841
Author:
Carey
Publisher:
Cengage
![Operations Research : Applications and Algorithms](https://www.bartleby.com/isbn_cover_images/9780534380588/9780534380588_smallCoverImage.gif)
Operations Research : Applications and Algorithms
Computer Science
ISBN:
9780534380588
Author:
Wayne L. Winston
Publisher:
Brooks Cole
![A Guide to SQL](https://www.bartleby.com/isbn_cover_images/9781111527273/9781111527273_smallCoverImage.gif)
A Guide to SQL
Computer Science
ISBN:
9781111527273
Author:
Philip J. Pratt
Publisher:
Course Technology Ptr
Np Ms Office 365/Excel 2016 I Ntermed
Computer Science
ISBN:
9781337508841
Author:
Carey
Publisher:
Cengage