CHAPTER 13
Multiple Delivery Trucks Routing
Let us consider a distribution center at A that has to send a truck daily with refills to nine neighbouring towns B, C, D, …, J. The distances (in miles) between pairs of neighbouring towns are given in Table 13.1.
The daily demand (in cartons) for each of the nine towns B, C, D,…, J is given in Table 13.2.
The trucks used for distribution can carry only 60 cartons. How many trucks will be required for distribution? How should these trucks be routed from the distribution center A to the towns and back to A such that the total miles covered by these trucks is minimum?
Table 13.1
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
|
A |
– |
20 | 30 | 10 | 40 | 20 | 32 | 15 | 25 | 14 |
B |
20 | – | 35 | 24 | 15 | 20 | 25 | 19 | 11 | 10 |
C |
30 | 35 | – | 12 | 18 | 21 | 32 | 22 | 28 | 16 |
Get Business Applications of Operations Research now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
