Package org.apache.commons.math3.random

Examples of org.apache.commons.math3.random.MersenneTwister


        .setAnnouncementIntensityPerKm2(1.3d)
        .setOrdersPerAnnouncement(1.3)
        .setScale(.1, 5)
        .setScenarioLength(240)
        .build();
    final RandomGenerator rng = new MersenneTwister(123);

    for (int i = 0; i < 10; i++) {
      final Scenario s = sg.generate(rng);

      Metrics.checkTimeWindowStrictness(s);
View Full Code Here


    final ScenarioGenerator.Builder sg = ScenarioGenerator.builder()
        .setAnnouncementIntensityPerKm2(0.3d).setOrdersPerAnnouncement(1.3) //
        .setScale(.1, 5) //
        .setScenarioLength(480);

    final RandomGenerator rng = new MersenneTwister(123);

    final List<List<Double>> allLoads = newArrayList();
    for (int i = 0; i < 10; i++) {
      final Scenario s = sg.build().generate(rng);
      Metrics.checkTimeWindowStrictness(s);
View Full Code Here

    final long endTime = 180;
    final Point depotLocation = new Point(5, 5);
    final double vehicleSpeed = 40;
    final ProportionateUniformTWGenerator twg = new ProportionateUniformTWGenerator(
        depotLocation, endTime, serviceTime, 30, vehicleSpeed);
    final RandomGenerator rng = new MersenneTwister(123);
    for (int i = 0; i < 10000; i++) {
      final Point p1 = new Point(6, 6);
      final Point p2 = new Point(4, 4);
      final List<TimeWindow> tws = twg.generate(DoubleMath.roundToLong(rng
          .nextDouble() * 120, RoundingMode.HALF_DOWN), p1, p2, rng);
      assertTrue(tws.toString(), tws.get(0).end <= tws.get(1).end
          + travelTime(p1, p2, vehicleSpeed) + serviceTime);
      assertTrue(tws.toString() + " tt: " + travelTime(p1, p2, vehicleSpeed), tws.get(0).begin
          + travelTime(p1, p2, vehicleSpeed) + serviceTime <= tws.get(1).begin);
View Full Code Here

  @VisibleForTesting
  static DynamicPDPTWProblem init(DynamicPDPTWScenario scenario,
      MASConfiguration config, long seed, boolean showGui,
      @Nullable UICreator uic) {

    final RandomGenerator rng = new MersenneTwister(seed);
    final long simSeed = rng.nextLong();

    final ImmutableList<? extends SupplierRng<? extends Model<?>>> modelSuppliers = config
        .getModels();
    final Model<?>[] models = new Model<?>[modelSuppliers.size()];
    for (int i = 0; i < modelSuppliers.size(); i++) {
      models[i] = modelSuppliers.get(i).get(rng.nextLong());
    }

    final DynamicPDPTWProblem problem = new DynamicPDPTWProblem(scenario,
        simSeed, models);
    problem.addCreator(AddVehicleEvent.class, config.getVehicleCreator());
View Full Code Here

   */
  public static SupplierRng<Solver> supplier() {
    return new DefaultSupplierRng<Solver>() {
      @Override
      public Solver get(long seed) {
        return new RandomSolver(new MersenneTwister(seed));
      }
    };
  }
View Full Code Here

      return runAllRunners(runners);
    }

    private ImmutableList<Long> generateSeeds() {
      if (repetitions > 1) {
        final RandomGenerator rng = new MersenneTwister(masterSeed);
        return ExperimentUtil
            .generateDistinct(rng, repetitions);
      } else {
        return ImmutableList.of(masterSeed);
      }
View Full Code Here

    final long scenarioLength = arrivalTimesGenerator.getScenarioLength();
    // final double expectedDynamism = 1 / arrivalTimesGenerator
    // .getOrdersPerAnnouncement();
    final Frequency f = new Frequency();

    final RandomGenerator rng = new MersenneTwister(0);
    for (int i = 0; i < 100; i++) {
      final List<Long> list = ScenarioGenerator.convert(arrivalTimesGenerator
          .generate(rng));
      // dynamismTest(list, expectedDynamism);
      ascendingOrderTest(list);
View Full Code Here

  }

  @Test
  public void determinismTest() {
    final RandomGenerator outer = new MersenneTwister(123);

    for (int i = 0; i < 100; i++) {
      final long seed = outer.nextLong();
      final RandomGenerator inner = new MersenneTwister(seed);
      final List<Double> list1 = arrivalTimesGenerator.generate(inner);
      for (int j = 0; j < 100; j++) {
        inner.setSeed(seed);
        final List<Double> list2 = arrivalTimesGenerator.generate(inner);
        assertEquals(list1, list2);
      }
    }
  }
View Full Code Here

  public void test() throws IOException {
    final int numSamples = 1000;
    final long lengthOfScenario = 28800;
    final int orders = 200;
    final List<Point> dataPoints = newArrayList();
    final RandomGenerator rng = new MersenneTwister(123);

    final List<Double> relHeights = newArrayList();
    for (int i = 0; i < 10; i++) {
      relHeights.add(-.999 + (i * .001));
    }
View Full Code Here

  public static SupplierRng<MultiVehicleArraysSolver> supplier() {
    return new DefaultSupplierRng<MultiVehicleArraysSolver>() {
      @Override
      public MultiVehicleArraysSolver get(long seed) {
        return ArraysSolverValidator.wrap(new RandomMVArraysSolver(
            new MersenneTwister(seed)));
      }
    };
  }
View Full Code Here

TOP

Related Classes of org.apache.commons.math3.random.MersenneTwister

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.