fix previous comment

contribs/informed-mode-choice/src/main/java/org/matsim/modechoice/replanning/SelectSubtourModeStrategy.java

@@ -137,20 +137,14 @@ public void run(Plan plan) {
 					for (int i = 0; i < mask.length; i++) {
 						if (mask[i])
 							option[i] = m;
-
-						options.add(option);
 					}
+
+					options.add(option);
 				}
 
 				List<PlanCandidate> singleModeCandidates = ctx.generator.generatePredefined(model, options);
 				singleModeCandidates.removeIf(p -> p.getUtility() == Double.NEGATIVE_INFINITY);
 
-				// if none of the single mode options are valid, no further search is needed
-				// this works in conjunction with subtour constraints, with other constraints it might be too strict
-				if (singleModeCandidates.size() <= 1) {
-					continue;
-				}
-
 				// Single modes are also added
 				Set<PlanCandidate> candidateSet = new LinkedHashSet<>(singleModeCandidates);
 

contribs/informed-mode-choice/src/main/java/org/matsim/modechoice/search/TopKChoicesGenerator.java

@@ -320,8 +320,6 @@ public List<PlanCandidate> generatePredefined(PlanModel planModel, List<String[]
 		Set<String> consolidateModes = planModel.filterModes(ModeEstimate::isMin);
 		Set<String> usableModes = planModel.filterModes(ModeEstimate::isUsable);
 
-		ReferenceSet<String> usedModes = new ReferenceOpenHashSet<>();
-
 		// Same Logic as the top k estimator
 		for (String[] result : modes) {
 
@@ -330,6 +328,8 @@ public List<PlanCandidate> generatePredefined(PlanModel planModel, List<String[]
 
 			double estimate = 0;
 
+			ReferenceSet<String> usedModes = new ReferenceOpenHashSet<>();
+
 			// Collect estimates for all entries
 			for (int i = 0; i < result.length; i++) {