Figure 3
Part (a): It shows a simplified map with several seaports labeled “Seaport A” at the top, “Seaport B” on the right, “Seaport C” at the bottom, and “Seaport D”on the left. A ship is depicted traveling between seaports A and B. Part (b): It presents the “Seaport Distance Matrix,” which provides the distances between the seaports. The columns and rows are labeled with “A,” “B,” “C,” and “D.” There is also an additional column labeled “Ma to Min (Closeness).” The row entries are as follows: Row 1: A: B: 10. C: 30. D: 15. Max to Min: 30 to 10. Row 1: B: A: 10. C: 20. D: 40. Max to Min: 40 to 10. Row 1: C: A: 30. B: 20. D: 10. Max to Min: 30 to 10. Row 1: D: A: 15. B: 40. C: 10. Max to Min: 40 to 10. Part (c): It illustrates the calculation of “Weighted Closeness” by multiplying “Closeness” by an “Agent Action” factor: The “Closeness” values for the four seaports are 20, 30, 20, and 30. The corresponding “Agent Action” factors are 0.2, 0.4, 0.1, and 0.3. The resulting “Weighted Closeness” values are 8 (20 times 0.4), 6 (30 times 0.2), 2 (20 times 0.1), and 9 (30 times 0.3). Part (d): It shows the final steps of sorting the seaports and assigning them to routes: The table shows the initial “Seaport” and “Weighted Closeness” pairs: A with 8, B with 6, C with 2, and D with 9. The next step, “Sort the weighted Penalty,” reorders the seaports based on their weighted closeness: C with 2, B with 6, A with 8, and D with 9. Based on the “Number Seaports per Route: 2,” the seaports are then “Assigned the seaports evenly into a route”: The “1st Route” is “C and B.” The “2nd Route” is “A and D.”Seaport clustered process. Source: Created by authors