Z08
Automated Warehouse AGV Tour
Problem Statement & Objective
Find the optimal routing schedule for autonomous guided vehicles in a logistics facility.
Function Signature (Python)
automated_warehouse_agv_tour(distances: list[list[int]]) -> intInput & Output Contract
Output Rule:En kısa turun toplam mesafesi. n == 1 ise 0.
System Constraints
1 <= n <= 9 (n = mesafeler.length)
0 <= mesafeler[i][j] <= 10^4
Matris simetriktir, köşegen 0'dır. Üçgen eşitsizliği GARANTİ EDİLMEZ.Example Execution Walkthrough
mesafeler =
0 10 15 20
10 0 35 25
15 35 0 30
20 25 30 0
olası turlar: 0->1->3->2->0 = 10 + 25 + 30 + 15 = 80 (EN KISA)
cevap: 80Example Test Scenarios (3)
Example 1 (4x4 Matris)
Input:
[[[0,10,15,20],[10,0,35,25],[15,35,0,30],[20,25,30,0]]]Expected Output:
80Example 2: 2 Şehir Symmetric Tur (4)
Input:
[[[0,2],[2,0]]]Expected Output:
4Example 3: 3 Şehirli Tur (60)
Input:
[[[0,10,20],[10,0,30],[20,30,0]]]Expected Output:
60