• Sonuç bulunamadı

New integer programming formulation for multiple traveling repairmen problem

N/A
N/A
Protected

Academic year: 2021

Share "New integer programming formulation for multiple traveling repairmen problem"

Copied!
7
0
0

Yükleniyor.... (view fulltext now)

Tam metin

Şekil

Table 1. CPU times and optimal values of 10 node problems for k=2  Problem  Optimal  value  M1  CPU (Sec)  YM1  CPU (Sec)  YM2  CPU (Sec)  Problem  Optimal value  M1  CPU (Sec)  YM1  CPU (Sec)  YM2  CPU (Sec)  1  828  0.13  0.16  0.11  11  767  0.10  0.28
Table 2. CPU times and optimal values of 20 node problems for k=2  Problem  Optimal  value  M1  CPU (Sec)  YM1  CPU (Sec)  YM2  CPU (Sec)  Problem  Optimal value  M1  CPU (Sec)  YM1  CPU (Sec)  YM2  CPU (Sec)  1  1950  379.54  456.47  7.47  11  1697  1990.
Table 4. Average CPU times for 39 node problems

Referanslar

Benzer Belgeler

Among these, tapping- mode atomic force microscope (TM-AFM) has become the most widely used. l), the cantilever is vibrated at a frequency close to one of its

The impact of environmental regulations on exports depends on the details of the situation and, as a result, it makes little sense to make sweeping generalizations that

The performance of class A OPO's is limited by crystal properties whereas classes C and D can be optimized by adjusting the polarization

Tablo 23 incelendiğinde, araştırmaya katılan yöneticilerin, Öğrencilerden toplanan, Eğitime Katkı Payı gelirlerinden; “Yoksul öğrencilere yardıma yönelik

In  Table  3,  we  only  report  results  for  the  IP­based  heuristic  and  pure  CPLEX  runs.  The 

The previous results showed us the effect of 2-Opt local search algorithm along with the cooperative coevolutionary algorithm to TSP with increased population size,

As yet, genetic algorithms have not found a better solution to the traveling salesman problem than the one already known, but many of the known best solutions