public void neighborhoodRounds(int neighChoice, int from, int to){	
		//
		orgSolutionFalse = sol.checkConstraint();
		//
		if(neighChoice==0){ //random neighbor
			int times = 1000;
			for(int neighCnt=from; neighCnt<to; neighCnt++){
				randomNeighborhoodRounds(neighCnt, times);
			}
			//System.out.println("Neighborhood (rounds) "+neighChoice+": "+sol.getCumulativeCost()+" (costs), Iterationsteps: "+times);
			if(Util.protocolBoolean){
				Util.protocol += "Neighborhood (rounds) "+neighChoice+": "+sol.getCumulativeCost()+" (costs), Iterationsteps: "+times+"\n";
			}
		}
		else if(neighChoice==1){//next improvement: search in a specified order, take first solution, which is better than x
			
			for(int neighCnt=from; neighCnt<to; neighCnt++){
				listNeighborhoodRound(neighCnt,minNotMax);
			}
			//System.out.println("Neighborhood (rounds) "+neighChoice+": "+sol.getCumulativeCost()+" (costs), Iterationsteps: "+iterationStep);
			if(Util.protocolBoolean){
				Util.protocol += "Neighborhood (rounds) "+neighChoice+": "+sol.getCumulativeCost()+" (costs), Iterationsteps: "+iterationStep+"\n";
			}
		}
		else if(neighChoice==2){//best improvement: search through N completely and take the best solution
			for(int neighCnt=from; neighCnt<to; neighCnt++){
				bestNeighborhoodRounds(neighCnt);
			}
			//System.out.println("Neighborhood (rounds) "+neighChoice+": "+sol.getCumulativeCost()+" (costs), Iterationsteps: "+iterationStep);
			if(Util.protocolBoolean){
				Util.protocol += "Neighborhood (rounds) "+neighChoice+": "+sol.getCumulativeCost()+" (costs), Iterationsteps: "+iterationStep+"\n";
			}
		}
	}