Package jmt.analytical

Examples of jmt.analytical.SolverMultiClosedLinearizer$DeSouzaMuntzLinearizerCoreAlgorithm

238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
      mem0 = 0; mem1 = 0;
    } else {
      System.out.println("Wrong input!!");
    }

    solver = new SolverMultiClosedLinearizer(classes, stations, pop, false);
    algorithm = "Linearizer";
    if (solver.input(name, type, servt, visits)) {
      long start = System.currentTimeMillis();
      solver.solve();
      System.out.print(algorithm+",");
      //System.out.print(maxDiff(pop, solver.getQueueLen(), mvaQueueLen)+",");
      //System.out.println(algorithm);
      //System.out.println("-------------------------------------");
      //System.out.println(queueLength(stations, classes, solver));
      long stop = System.currentTimeMillis();
      System.out.print(((stop-start)/(double)1000) + ",");
      //System.out.println("Elapsed time (ms) = " + (stop - start));
      start = 0; stop = 0;
     
      long mem0 = Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory();
      solver = null;
      System.gc(); System.gc(); System.gc(); System.gc();
      System.gc(); System.gc(); System.gc(); System.gc();
      System.gc(); System.gc(); System.gc(); System.gc();
      System.gc(); System.gc(); System.gc(); System.gc();
      System.gc(); System.gc(); System.gc(); System.gc();
      long mem1 = Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory();
     
      System.out.print(((mem0-mem1)/(double)1024) + ",");
      System.out.print((mem0/(double)1024) + "\n");
//      System.out.println("Memory Usage (KB) = " + ((mem0 - mem1)/(double)1024));
//      System.out.println("Memory Usage w/o diff (KB) = " + ((mem0)/(double)1024));
//      System.out.println("-------------------------------------");
      mem0 = 0; mem1 = 0;
    } else {
      System.out.println("Wrong input!!");
    }

    solver = new SolverMultiClosedLinearizer(classes, stations, pop, true);
    algorithm = "DeSouza-Muntz Linearizer";
    if (solver.input(name, type, servt, visits)) {
      long start = System.currentTimeMillis();
      solver.solve();
      System.out.print(algorithm+",");
View Full Code Here
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
      mem0 = 0; mem1 = 0;
    } else {
      System.out.println("Wrong input!!");
    }

    solver = new SolverMultiClosedLinearizer(classes, stations, pop, false);
    algorithm = "Linearizer";
    if (solver.input(name, type, servt, visits)) {
      long start = System.currentTimeMillis();
      solver.solve();
      System.out.println(algorithm);
      System.out.println(solver);
     
      System.out.print(algorithm+",");
      //System.out.println(algorithm);
      //System.out.println("-------------------------------------");
      //System.out.println(queueLength(stations, classes, solver));
      long stop = System.currentTimeMillis();
      System.out.print(((stop-start)/(double)1000) + ",");
      //System.out.println("Elapsed time (ms) = " + (stop - start));
      start = 0; stop = 0;
     
      long mem0 = Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory();
      solver = null;
      System.gc(); System.gc(); System.gc(); System.gc();
      System.gc(); System.gc(); System.gc(); System.gc();
      System.gc(); System.gc(); System.gc(); System.gc();
      System.gc(); System.gc(); System.gc(); System.gc();
      System.gc(); System.gc(); System.gc(); System.gc();
      long mem1 = Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory();
     
      System.out.print(((mem0-mem1)/(double)1024) + ",");
      System.out.print((mem0/(double)1024) + "\n");
//      System.out.println("Memory Usage (KB) = " + ((mem0 - mem1)/(double)1024));
//      System.out.println("Memory Usage w/o diff (KB) = " + ((mem0)/(double)1024));
//      System.out.println("-------------------------------------");
      mem0 = 0; mem1 = 0;
    } else {
      System.out.println("Wrong input!!");
    }

    solver = new SolverMultiClosedLinearizer(classes, stations, pop, true);
    algorithm = "DeSouza-Muntz Linearizer";
    if (solver.input(name, type, servt, visits)) {
      long start = System.currentTimeMillis();
      solver.solve();
      System.out.println(algorithm);
View Full Code Here
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
      mem0 = 0; mem1 = 0;
    } else {
      System.out.println("Wrong input!!");
    }

    solver = new SolverMultiClosedLinearizer(classes, stations, pop, false);
    algorithm = "Linearizer";
    if (solver.input(name, type, servt, visits)) {
      long start = System.currentTimeMillis();
      solver.solve();
      System.out.print(algorithm+",");
      System.out.print(maxDiff(pop, solver.getQueueLen(), mvaQueueLen)+",");
      //System.out.println(algorithm);
      //System.out.println("-------------------------------------");
      //System.out.println(queueLength(stations, classes, solver));
      long stop = System.currentTimeMillis();
      System.out.print(((stop-start)/(double)1000) + ",");
      //System.out.println("Elapsed time (ms) = " + (stop - start));
      start = 0; stop = 0;
     
      long mem0 = Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory();
      solver = null;
      System.gc(); System.gc(); System.gc(); System.gc();
      System.gc(); System.gc(); System.gc(); System.gc();
      System.gc(); System.gc(); System.gc(); System.gc();
      System.gc(); System.gc(); System.gc(); System.gc();
      System.gc(); System.gc(); System.gc(); System.gc();
      long mem1 = Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory();
     
      System.out.print(((mem0-mem1)/(double)1024) + ",");
      System.out.print((mem0/(double)1024) + "\n");
//      System.out.println("Memory Usage (KB) = " + ((mem0 - mem1)/(double)1024));
//      System.out.println("Memory Usage w/o diff (KB) = " + ((mem0)/(double)1024));
//      System.out.println("-------------------------------------");
      mem0 = 0; mem1 = 0;
    } else {
      System.out.println("Wrong input!!");
    }

    solver = new SolverMultiClosedLinearizer(classes, stations, pop, true);
    algorithm = "DeSouza-Muntz Linearizer";
    if (solver.input(name, type, servt, visits)) {
      long start = System.currentTimeMillis();
      solver.solve();
      System.out.print(algorithm+",");
View Full Code Here
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
    } else {
      System.out.println("Wrong input!!");
    }

    start = System.currentTimeMillis();
    SolverMultiClosedLinearizer mClosedLinearizer = new SolverMultiClosedLinearizer(classes, stations, pop, false);
    if (mClosedLinearizer.input(name, type, servt, visits)) {
      String algorithm = "Linearizer";
      mClosedLinearizer.solve();
      models.put(algorithm, mClosedLinearizer);
      long stop = System.currentTimeMillis();
      elapsedTimes.put(algorithm, ((stop - start)/(double)1000));
    } else {
      System.out.println("Wrong input!!");
    }
   
    start = System.currentTimeMillis();
    SolverMultiClosedLinearizer mClosedOptimisedLinearizer = new SolverMultiClosedLinearizer(classes, stations, pop, true);
    if (mClosedOptimisedLinearizer.input(name, type, servt, visits)) {
      String algorithm = "Optimised Linearizer";
      mClosedOptimisedLinearizer.solve();
      models.put(algorithm, mClosedOptimisedLinearizer);
      long stop = System.currentTimeMillis();
      elapsedTimes.put(algorithm, ((stop - start)/(double)1000));
    } else {
      System.out.println("Wrong input!!");
View Full Code Here
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
    } else {
      System.out.println("Wrong input!!");
    }

    start = System.currentTimeMillis();
    SolverMultiClosedLinearizer mClosedLinearizer = new SolverMultiClosedLinearizer(classes, stations, pop, false);
    if (mClosedLinearizer.input(name, type, servt, visits)) {
      String algorithm = "Linearizer";
      mClosedLinearizer.solve();
      models.put(algorithm, mClosedLinearizer);
      long stop = System.currentTimeMillis();
      elapsedTimes.put(algorithm, ((stop - start)/(double)1000));
    } else {
      System.out.println("Wrong input!!");
    }
   
    start = System.currentTimeMillis();
    SolverMultiClosedLinearizer mClosedOptimisedLinearizer = new SolverMultiClosedLinearizer(classes, stations, pop, true);
    if (mClosedOptimisedLinearizer.input(name, type, servt, visits)) {
      String algorithm = "Optimised Linearizer";
      mClosedOptimisedLinearizer.solve();
      models.put(algorithm, mClosedOptimisedLinearizer);
      long stop = System.currentTimeMillis();
      elapsedTimes.put(algorithm, ((stop - start)/(double)1000));
    } else {
      System.out.println("Wrong input!!");
View Full Code Here
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
    } else {
      System.out.println("Wrong input!!");
    }

    start = System.currentTimeMillis();
    SolverMultiClosedLinearizer mClosedLinearizer = new SolverMultiClosedLinearizer(classes, stations, pop, false);
    if (mClosedLinearizer.input(name, type, servt, visits)) {
      String algorithm = "Linearizer";
      mClosedLinearizer.solve();
      models.put(algorithm, mClosedLinearizer);
      long stop = System.currentTimeMillis();
      elapsedTimes.put(algorithm, ((stop - start)/(double)1000));
    } else {
      System.out.println("Wrong input!!");
    }
   
    start = System.currentTimeMillis();
    SolverMultiClosedLinearizer mClosedOptimisedLinearizer = new SolverMultiClosedLinearizer(classes, stations, pop, true);
    if (mClosedOptimisedLinearizer.input(name, type, servt, visits)) {
      String algorithm = "Optimised Linearizer";
      mClosedOptimisedLinearizer.solve();
      models.put(algorithm, mClosedOptimisedLinearizer);
      long stop = System.currentTimeMillis();
      elapsedTimes.put(algorithm, ((stop - start)/(double)1000));
    } else {
      System.out.println("Wrong input!!");
View Full Code Here
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
    } else {
      System.out.println("Wrong input!!");
    }

    start = System.currentTimeMillis();
    SolverMultiClosedLinearizer mClosedLinearizer = new SolverMultiClosedLinearizer(classes, stations, pop, false);
    if (mClosedLinearizer.input(name, type, servt, visits)) {
      String algorithm = "Linearizer";
      mClosedLinearizer.solve();
      models.put(algorithm, mClosedLinearizer);
      long stop = System.currentTimeMillis();
      elapsedTimes.put(algorithm, ((stop - start)/(double)1000));
    } else {
      System.out.println("Wrong input!!");
    }
   
    start = System.currentTimeMillis();
    SolverMultiClosedLinearizer mClosedOptimisedLinearizer = new SolverMultiClosedLinearizer(classes, stations, pop, true);
    if (mClosedOptimisedLinearizer.input(name, type, servt, visits)) {
      String algorithm = "Optimised Linearizer";
      mClosedOptimisedLinearizer.solve();
      models.put(algorithm, mClosedOptimisedLinearizer);
      long stop = System.currentTimeMillis();
      elapsedTimes.put(algorithm, ((stop - start)/(double)1000));
    } else {
      System.out.println("Wrong input!!");
View Full Code Here
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
    } else {
      System.out.println("Wrong input!!");
    }

    start = System.currentTimeMillis();
    SolverMultiClosedLinearizer mClosedLinearizer = new SolverMultiClosedLinearizer(classes, stations, pop, false);
    if (mClosedLinearizer.input(name, type, servt, visits)) {
      String algorithm = "Linearizer";
      mClosedLinearizer.solve();
      models.put(algorithm, mClosedLinearizer);
      long stop = System.currentTimeMillis();
      elapsedTimes.put(algorithm, ((stop - start)/(double)1000));
    } else {
      System.out.println("Wrong input!!");
    }
   
    start = System.currentTimeMillis();
    SolverMultiClosedLinearizer mClosedOptimisedLinearizer = new SolverMultiClosedLinearizer(classes, stations, pop, true);
    if (mClosedOptimisedLinearizer.input(name, type, servt, visits)) {
      String algorithm = "Optimised Linearizer";
      mClosedOptimisedLinearizer.solve();
      models.put(algorithm, mClosedOptimisedLinearizer);
      long stop = System.currentTimeMillis();
      elapsedTimes.put(algorithm, ((stop - start)/(double)1000));
    } else {
      System.out.println("Wrong input!!");
View Full Code Here
TOP

Related Classes of jmt.analytical.SolverMultiClosedLinearizer$DeSouzaMuntzLinearizerCoreAlgorithm

  • jmt.test.analytical.TestAMVA
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.