Package jmt.analytical

Examples of jmt.analytical.SolverMulti.solve()

104
105
106
107
108
109
110
111
112
113
114
    if (classes < 5) {
      solver = new SolverMultiClosedMVA(classes, stations);
      algorithm = "MVA";
      if (((SolverMultiClosedMVA)solver).input(name, type, servt, visits, pop)) {
        long start = System.currentTimeMillis();
        solver.solve();
        System.out.print(algorithm+",");
        System.out.print(0+",");
        //System.out.println(algorithm);
        //System.out.println("-------------------------------------");
        mvaQueueLen = solver.getQueueLen();
View Full Code Here
140
141
142
143
144
145
146
147
148
149
150
   
    solver = new SolverMultiClosedChow(classes, stations, pop);
    algorithm = "Chow";
    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));
View Full Code Here
174
175
176
177
178
179
180
181
182
183
184
    solver = new SolverMultiClosedBardSchweitzer(classes, stations, pop);
    algorithm = "Bard-Schweitzer";
    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));
View Full Code Here
208
209
210
211
212
213
214
215
216
217
218
    solver = new SolverMultiClosedAQL(classes, stations, pop);
    algorithm = "AQL";
    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));
View Full Code Here
242
243
244
245
246
247
248
249
250
251
252
    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));
View Full Code Here
276
277
278
279
280
281
282
283
284
285
286
    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+",");
      //System.out.print(maxDiff(pop, solver.getQueueLen(), mvaQueueLen)+",");
      //System.out.println(algorithm);
      //System.out.println("-------------------------------------");
      //System.out.println(queueLength(stations, classes, solver));
View Full Code Here
311
312
313
314
315
316
317
318
319
320
321
    if (classes > 4) {
      solver = new SolverMultiClosedMVA(classes, stations);
      algorithm = "MVA";
      if (((SolverMultiClosedMVA)solver).input(name, type, servt, visits, pop)) {
        long start = System.currentTimeMillis();
        solver.solve();
        System.out.print(algorithm+",");
        System.out.print(0+",");
        //System.out.println(algorithm);
        //System.out.println("-------------------------------------");
        mvaQueueLen = solver.getQueueLen();
View Full Code Here
510
511
512
513
514
515
516
517
518
519
520
   
    SolverMulti solver = new SolverMultiClosedChow(classes, stations, pop);
    String algorithm = "Chow";
    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);
View Full Code Here
547
548
549
550
551
552
553
554
555
556
557
    solver = new SolverMultiClosedBardSchweitzer(classes, stations, pop);
    algorithm = "Bard-Schweitzer";
    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);
View Full Code Here
583
584
585
586
587
588
589
590
591
592
593
    solver = new SolverMultiClosedAQL(classes, stations, pop);
    algorithm = "AQL";
    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);
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.