| | |
| | | Map<Integer, Double> stationLoopLoadMap = loadStationLoopLoadMap(); |
| | | StationTrafficSnapshot trafficSnapshot = loadStationTrafficSnapshot(statusMap, currentTaskNo); |
| | | LoopMergeGuardContext loopMergeGuardContext = loadLoopMergeGuardContext(); |
| | | Set<LoopMergeEntry> mandatoryLoopMergeEntrySet = resolveMandatoryLoopMergeEntrySet(filteredCandidates, loopMergeGuardContext); |
| | | Set<Integer> outStationIdSet = loadAllOutStationIdSet(); |
| | | List<PathCandidateMetrics> metricsList = new ArrayList<>(); |
| | | int skippedByOtherOutStation = 0; |
| | |
| | | if (path == null || path.isEmpty()) { |
| | | continue; |
| | | } |
| | | if (!isLoopMergePathAllowed(path, statusMap, trafficSnapshot, loopMergeGuardContext)) { |
| | | if (!isLoopMergePathAllowed(path, statusMap, trafficSnapshot, loopMergeGuardContext, mandatoryLoopMergeEntrySet)) { |
| | | skippedByLoopMergeGuard++; |
| | | continue; |
| | | } |
| | |
| | | return context; |
| | | } |
| | | |
| | | private Set<LoopMergeEntry> resolveMandatoryLoopMergeEntrySet(List<List<NavigateNode>> candidatePathList, |
| | | LoopMergeGuardContext loopMergeGuardContext) { |
| | | if (candidatePathList == null || candidatePathList.isEmpty() |
| | | || loopMergeGuardContext == null || loopMergeGuardContext.loopStationIdSet.isEmpty()) { |
| | | return Collections.emptySet(); |
| | | } |
| | | |
| | | Set<LoopMergeEntry> intersectionSet = null; |
| | | for (List<NavigateNode> path : candidatePathList) { |
| | | Set<LoopMergeEntry> entrySet = extractLoopMergeEntrySet(path, loopMergeGuardContext); |
| | | if (intersectionSet == null) { |
| | | intersectionSet = new HashSet<>(entrySet); |
| | | } else { |
| | | intersectionSet.retainAll(entrySet); |
| | | } |
| | | if (intersectionSet.isEmpty()) { |
| | | return Collections.emptySet(); |
| | | } |
| | | } |
| | | return intersectionSet == null ? Collections.emptySet() : intersectionSet; |
| | | } |
| | | |
| | | private Set<LoopMergeEntry> extractLoopMergeEntrySet(List<NavigateNode> path, |
| | | LoopMergeGuardContext loopMergeGuardContext) { |
| | | Set<LoopMergeEntry> result = new HashSet<>(); |
| | | if (path == null || path.size() < 2 || loopMergeGuardContext == null || loopMergeGuardContext.loopStationIdSet.isEmpty()) { |
| | | return result; |
| | | } |
| | | |
| | | List<Integer> stationIdList = extractStationIdList(path); |
| | | for (int i = 1; i < stationIdList.size(); i++) { |
| | | Integer prevStationId = stationIdList.get(i - 1); |
| | | Integer currentStationId = stationIdList.get(i); |
| | | if (prevStationId == null || currentStationId == null) { |
| | | continue; |
| | | } |
| | | if (loopMergeGuardContext.loopStationIdSet.contains(prevStationId) |
| | | || !loopMergeGuardContext.loopStationIdSet.contains(currentStationId)) { |
| | | continue; |
| | | } |
| | | result.add(new LoopMergeEntry(prevStationId, currentStationId)); |
| | | } |
| | | return result; |
| | | } |
| | | |
| | | private Map<Integer, Set<Integer>> loadUndirectedStationGraph() { |
| | | Map<Integer, Set<Integer>> graph = new HashMap<>(); |
| | | List<Integer> levList = loadStationLevList(); |
| | |
| | | private boolean isLoopMergePathAllowed(List<NavigateNode> path, |
| | | Map<Integer, StationProtocol> statusMap, |
| | | StationTrafficSnapshot trafficSnapshot, |
| | | LoopMergeGuardContext loopMergeGuardContext) { |
| | | LoopMergeGuardContext loopMergeGuardContext, |
| | | Set<LoopMergeEntry> mandatoryLoopMergeEntrySet) { |
| | | if (path == null || path.size() < 2 || loopMergeGuardContext == null || loopMergeGuardContext.loopStationIdSet.isEmpty()) { |
| | | return true; |
| | | } |
| | |
| | | continue; |
| | | } |
| | | |
| | | LoopMergeEntry currentEntry = new LoopMergeEntry(prevStationId, currentStationId); |
| | | for (Integer trunkNeighborStationId : trunkNeighborSet) { |
| | | if (isStationOccupiedForLoopMerge(trunkNeighborStationId, statusMap, trafficSnapshot)) { |
| | | return false; |
| | | } |
| | | } |
| | | boolean mandatoryEntry = mandatoryLoopMergeEntrySet != null && mandatoryLoopMergeEntrySet.contains(currentEntry); |
| | | if (!mandatoryEntry && !isLoopTrunkVeryIdle(currentStationId, loopMergeGuardContext, statusMap, trafficSnapshot)) { |
| | | return false; |
| | | } |
| | | } |
| | | return true; |
| | | } |
| | | |
| | | private boolean isLoopTrunkVeryIdle(Integer mergeStationId, |
| | | LoopMergeGuardContext loopMergeGuardContext, |
| | | Map<Integer, StationProtocol> statusMap, |
| | | StationTrafficSnapshot trafficSnapshot) { |
| | | if (mergeStationId == null || loopMergeGuardContext == null) { |
| | | return false; |
| | | } |
| | | Set<Integer> guardStationIdSet = collectLoopNeighborWindow(mergeStationId, loopMergeGuardContext, 2); |
| | | if (guardStationIdSet.isEmpty()) { |
| | | return false; |
| | | } |
| | | for (Integer stationId : guardStationIdSet) { |
| | | if (isStationOccupiedForLoopMerge(stationId, statusMap, trafficSnapshot)) { |
| | | return false; |
| | | } |
| | | } |
| | | return true; |
| | | } |
| | | |
| | | private Set<Integer> collectLoopNeighborWindow(Integer centerStationId, |
| | | LoopMergeGuardContext loopMergeGuardContext, |
| | | int depth) { |
| | | Set<Integer> visited = new LinkedHashSet<>(); |
| | | if (centerStationId == null || depth < 0 || loopMergeGuardContext == null) { |
| | | return visited; |
| | | } |
| | | |
| | | Set<Integer> frontier = new LinkedHashSet<>(); |
| | | frontier.add(centerStationId); |
| | | visited.add(centerStationId); |
| | | for (int step = 0; step < depth; step++) { |
| | | Set<Integer> nextFrontier = new LinkedHashSet<>(); |
| | | for (Integer stationId : frontier) { |
| | | for (Integer neighborStationId : loopMergeGuardContext.loopNeighborMap.getOrDefault(stationId, Collections.emptySet())) { |
| | | if (neighborStationId != null && visited.add(neighborStationId)) { |
| | | nextFrontier.add(neighborStationId); |
| | | } |
| | | } |
| | | } |
| | | if (nextFrontier.isEmpty()) { |
| | | break; |
| | | } |
| | | frontier = nextFrontier; |
| | | } |
| | | return visited; |
| | | } |
| | | |
| | | private boolean isStationOccupiedForLoopMerge(Integer stationId, |
| | |
| | | private final Map<Integer, Set<Integer>> loopNeighborMap = new HashMap<>(); |
| | | } |
| | | |
| | | private static class LoopMergeEntry { |
| | | private final Integer fromStationId; |
| | | private final Integer toStationId; |
| | | |
| | | private LoopMergeEntry(Integer fromStationId, Integer toStationId) { |
| | | this.fromStationId = fromStationId; |
| | | this.toStationId = toStationId; |
| | | } |
| | | |
| | | @Override |
| | | public boolean equals(Object obj) { |
| | | if (this == obj) { |
| | | return true; |
| | | } |
| | | if (!(obj instanceof LoopMergeEntry)) { |
| | | return false; |
| | | } |
| | | LoopMergeEntry other = (LoopMergeEntry) obj; |
| | | return (fromStationId == null ? other.fromStationId == null : fromStationId.equals(other.fromStationId)) |
| | | && (toStationId == null ? other.toStationId == null : toStationId.equals(other.toStationId)); |
| | | } |
| | | |
| | | @Override |
| | | public int hashCode() { |
| | | int result = fromStationId == null ? 0 : fromStationId.hashCode(); |
| | | result = 31 * result + (toStationId == null ? 0 : toStationId.hashCode()); |
| | | return result; |
| | | } |
| | | } |
| | | |
| | | private static class PathGlobalPolicy { |
| | | private double lenWeightFactor = 1.0d; |
| | | private double congWeightFactor = 1.0d; |