Package jsprit.core.algorithm.ruin.RuinRadial

Examples of jsprit.core.algorithm.ruin.RuinRadial.JobNeighborhoodsImplWithCapRestriction

68
69
70
71
72
73
74
75
76
77
78
79
80
    jobDistance = new EuclideanServiceDistance();
  }
 
  @Test
  public void whenRequestingNeighborhoodOfTargetJob_nNeighborsShouldBeTwo(){
    JobNeighborhoodsImplWithCapRestriction jn = new JobNeighborhoodsImplWithCapRestriction(vrp, jobDistance, 2);
    jn.initialise();
    Iterator<Job> iter = jn.getNearestNeighborsIterator(2, target);
    List<Service> services = new ArrayList<Service>();
    while(iter.hasNext()){
      services.add((Service) iter.next());
    }
    assertEquals(2,services.size());
View Full Code Here
80
81
82
83
84
85
86
87
88
89
90
91
92
    assertEquals(2,services.size());
  }
 
  @Test
  public void whenRequestingNeighborhoodOfTargetJob_s2ShouldBeNeighbor(){
    JobNeighborhoodsImplWithCapRestriction jn = new JobNeighborhoodsImplWithCapRestriction(vrp, jobDistance, 2);
    jn.initialise();
    Iterator<Job> iter = jn.getNearestNeighborsIterator(2, target);
    List<Service> services = new ArrayList<Service>();
    while(iter.hasNext()){
      services.add((Service) iter.next());
    }
    assertTrue(services.contains(s2));
View Full Code Here
92
93
94
95
96
97
98
99
100
101
102
103
104
    assertTrue(services.contains(s2));
  }
 
  @Test
  public void whenRequestingNeighborhoodOfTargetJob_s4ShouldBeNeighbor(){
    JobNeighborhoodsImplWithCapRestriction jn = new JobNeighborhoodsImplWithCapRestriction(vrp, jobDistance, 2);
    jn.initialise();
    Iterator<Job> iter = jn.getNearestNeighborsIterator(2, target);
    List<Service> services = new ArrayList<Service>();
    while(iter.hasNext()){
      services.add((Service) iter.next());
    }
    assertTrue(services.contains(s5));
View Full Code Here
104
105
106
107
108
109
110
111
112
113
114
115
116
    assertTrue(services.contains(s5));
  }
 
  @Test
  public void whenRequestingNeighborhoodOfTargetJob_sizeShouldBe4(){
    JobNeighborhoodsImplWithCapRestriction jn = new JobNeighborhoodsImplWithCapRestriction(vrp, jobDistance, 4);
    jn.initialise();
    Iterator<Job> iter = jn.getNearestNeighborsIterator(4, target);
    List<Service> services = new ArrayList<Service>();
    while(iter.hasNext()){
      services.add((Service) iter.next());
    }
    assertEquals(4,services.size());
View Full Code Here
116
117
118
119
120
121
122
123
124
125
126
127
128
    assertEquals(4,services.size());
  }
 
  @Test
  public void whenRequestingMoreNeighborsThanExisting_itShouldReturnMaxNeighbors(){
    JobNeighborhoodsImplWithCapRestriction jn = new JobNeighborhoodsImplWithCapRestriction(vrp, jobDistance, 2);
    jn.initialise();
    Iterator<Job> iter = jn.getNearestNeighborsIterator(100, target);
    List<Service> services = new ArrayList<Service>();
    while(iter.hasNext()){
      services.add((Service) iter.next());
    }
    assertEquals(2,services.size());
View Full Code Here
TOP

Related Classes of jsprit.core.algorithm.ruin.RuinRadial.JobNeighborhoodsImplWithCapRestriction

  • jsprit.core.algorithm.ruin.JobNeighborhoodsWithCapRestrictionImplTest
    • 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.