| Algorithm 2 Assignment Construction |
| Input: ant k |
| Output: Ak |
| 1: Selects a starting vertex <xi, vp> |
| 2: Place ant k on the vertex <xi, vp> |
| 3: Ak ← <xi, vp> |
| 4: while |Ak| < |X| do |
| 5: Select vertex <xj, vq> that is not assigned to Ak |
| 6: Move ant k to <xj, vq> |
| 7: Ak ← Ak ∪ <xj, vq> |
| 8: end while |
| 9: return Ak |