The results are summarized in fig. 4(e). For all instances, the majority of the solutions represented the
optimal solution. For the 10-city problem (A), all the solutions were optimal. For this problem instance,
Wilson and Pawley [2] found only 15 solutions in 100 runs. These solutions were only slightly better than
randomly chosen tours. For larger problems the performance of our network was very good. For all problem
instances, the worst solution did not exceed the optimal solution by more than 7% and the average solution
did not exceed the optimal solution by more than 0.5%. For a 22-city problem, 100 iterations took about
13 seconds CPU time on a VAX 8700. For example, instance D converged to a solution in 37 seconds on
aver age.
The results are summarized in fig. 4(e). For all instances, the majority of the solutions represented theoptimal solution. For the 10-city problem (A), all the solutions were optimal. For this problem instance,Wilson and Pawley [2] found only 15 solutions in 100 runs. These solutions were only slightly better thanrandomly chosen tours. For larger problems the performance of our network was very good. For all probleminstances, the worst solution did not exceed the optimal solution by more than 7% and the average solutiondid not exceed the optimal solution by more than 0.5%. For a 22-city problem, 100 iterations took about13 seconds CPU time on a VAX 8700. For example, instance D converged to a solution in 37 seconds onaver age.
การแปล กรุณารอสักครู่..

ผลที่ได้สรุปไว้ในรูป 4 ( The results are summarized in fig. 4(e). For all instances, the majority of the solutions represented the
สำหรับทุกกรณีส่วนใหญ่ของการแก้ปัญหาที่เป็นตัวแทนของการแก้ปัญหาที่ดีที่สุด สำหรับปัญหาที่เกิดขึ้น optimal solution. For the 10-city problem (A), all the solutions were optimal. For this problem instance,
Wilson and Pawley [2] found only 15 solutions in 100 runs. These solutions were only slightly better than
randomly chosen tours. For larger problems the performance of our network was very good. For all problem
instances, the worst solution did not exceed the optimal solution by more than 7% and the average solution
did not exceed the optimal solution by more than 0.5%. For a 22-city problem, 100 iterations took about
13 seconds CPU time on a VAX 8700. For example, instance D converged to a solution in 37 seconds on
aver age.
การแปล กรุณารอสักครู่..
