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.

Use the sequential version of Savings algorithm to develop vehicle route that minimizes
total distance travelled.

Answer 1

The sequential version of the Savings algorithm can be used to develop vehicle routes that minimize the total distance traveled by an industrial gas supplier. It involves calculating the savings for each pair of companies, sorting them in descending order, and assigning pairs to vehicle routes based on capacity and conflicts.

Step-by-step explanation:

The problem can be solved using the Savings algorithm, which is used to optimize vehicle routes and minimize total distance traveled. In this case, the industrial gas supplier has received orders from 6 companies and needs to fulfill them using their fleet of tankers. Each tanker has a capacity of 100 units.

To apply the sequential version of the Savings algorithm, start by calculating the savings for each pair of companies, which represents the potential distance reduction if their deliveries are combined. Then, sort the pairs in descending order of savings. Next, iterate over the sorted pairs and assign each pair to a vehicle route if it does not create a conflict or exceed the capacity of a tanker.

Continue this process until all pairs are assigned or there are no more pairs left. Finally, assign any remaining single companies to the nearest route. This sequential version of the Savings algorithm helps to minimize the total distance traveled by optimizing the order of deliveries.