Nur Azriati Mat
New Member
hello,
i have a coding for nearest greedy but i have a problem.. in this problem the salesman have to start at node 1 and going back to node 1 at last. Before going back to node 1, the salesman have to visit 2.
Example: 1>4>3>5>6>2>1
My problem is i don't know how to code for if i have to visit node 2 before going back to node 1 at the end.Here, i also have attached my excel workbook..
Hopefully, anyone can help me.. Thanks in advance
i have a coding for nearest greedy but i have a problem.. in this problem the salesman have to start at node 1 and going back to node 1 at last. Before going back to node 1, the salesman have to visit 2.
Example: 1>4>3>5>6>2>1
My problem is i don't know how to code for if i have to visit node 2 before going back to node 1 at the end.Here, i also have attached my excel workbook..
Hopefully, anyone can help me.. Thanks in advance