#

Junjie

14 小时以前 d2f410e1149597b9743c5e195f6b54a1504cf2d4

 src/main/java/com/zy/common/utils/NavigateUtils.java

@@ -4,6 +4,7 @@
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedHashSet;
import java.util.List;
import java.util.Map;
import java.util.Set;
@@ -72,10 +73,21 @@
    private StationTaskTraceRegistry stationTaskTraceRegistry;

    public synchronized List<NavigateNode> calcByStationId(Integer startStationId, Integer endStationId) {
        return calcByStationId(startStationId, endStationId, null);
        return calcByStationId(startStationId, endStationId, null, false);
    }

    public synchronized List<NavigateNode> calcByStationId(Integer startStationId, Integer endStationId, Integer currentTaskNo) {
        return calcByStationId(startStationId, endStationId, currentTaskNo, false);
    }

    public synchronized List<NavigateNode> calcReachablePathByStationId(Integer startStationId, Integer endStationId) {
        return calcByStationId(startStationId, endStationId, null, true);
    }

    private synchronized List<NavigateNode> calcByStationId(Integer startStationId,
                                                            Integer endStationId,
                                                            Integer currentTaskNo,
                                                            boolean reachabilityOnly) {
        BasStation startStation = basStationService.getById(startStationId);
        if (startStation == null) {
            throw new CoolException("未找到该 起点 对应的站点数据");
@@ -129,7 +141,9 @@

        startTime = System.currentTimeMillis();
        News.info("[WCS Debug] 站点路径权重开始分析,startStationId={},endStationId={}", startStationId, endStationId);
        List<NavigateNode> list = findStationBestPathTwoStage(allList, resolvedPolicy, currentTaskNo);
        List<NavigateNode> list = reachabilityOnly
                ? findStationReachablePath(allList, resolvedPolicy, startStationId, endStationId)
                : findStationBestPathTwoStage(allList, resolvedPolicy, currentTaskNo, startStationId, endStationId);
        News.info("[WCS Debug] 站点路径权重分析完成，耗时：{}ms", System.currentTimeMillis() - startTime);

        //去重
@@ -287,9 +301,42 @@
        return new StationPathResolvedPolicy();
    }

    private List<NavigateNode> findStationReachablePath(List<List<NavigateNode>> allList,
                                                        StationPathResolvedPolicy resolvedPolicy,
                                                        Integer startStationId,
                                                        Integer endStationId) {
        if (allList == null || allList.isEmpty()) {
            return new ArrayList<>();
        }

        StationPathRuleConfig ruleConfig = resolvedPolicy.getRuleConfig() == null
                ? new StationPathRuleConfig()
                : resolvedPolicy.getRuleConfig();

        List<List<NavigateNode>> filteredCandidates = applyRuleFilters(allList, ruleConfig, true);
        if (filteredCandidates.isEmpty() && hasWaypoint(ruleConfig) && !strictWaypoint(ruleConfig)) {
            filteredCandidates = applyRuleFilters(allList, ruleConfig, false);
            News.info("[WCS Debug] 站点路径可达性规则已降级，忽略关键途经点约束后重试");
        }
        if (filteredCandidates.isEmpty()) {
            if (resolvedPolicy.matchedRule()) {
                News.warn("站点路径规则命中但无可达路径，ruleCode={},startStationId={},endStationId={}",
                        resolvedPolicy.getRuleEntity() == null ? "" : resolvedPolicy.getRuleEntity().getRuleCode(),
                        startStationId, endStationId);
                return new ArrayList<>();
            }
            filteredCandidates = allList;
        }

        filteredCandidates.sort((left, right) -> compareReachabilityPath(left, right));
        return filteredCandidates.isEmpty() ? new ArrayList<>() : filteredCandidates.get(0);
    }

    private List<NavigateNode> findStationBestPathTwoStage(List<List<NavigateNode>> allList,
                                                           StationPathResolvedPolicy resolvedPolicy,
                                                           Integer currentTaskNo) {
                                                           Integer currentTaskNo,
                                                           Integer startStationId,
                                                           Integer endStationId) {
        if (allList == null || allList.isEmpty()) {
            return new ArrayList<>();
        }
@@ -328,11 +375,18 @@
        Map<Integer, StationProtocol> statusMap = loadStationStatusMap();
        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;
        int skippedByLoopMergeGuard = 0;
        for (List<NavigateNode> path : filteredCandidates) {
            if (path == null || path.isEmpty()) {
                continue;
            }
            if (!isLoopMergePathAllowed(path, statusMap, trafficSnapshot, loopMergeGuardContext, mandatoryLoopMergeEntrySet)) {
                skippedByLoopMergeGuard++;
                continue;
            }
            PathCandidateMetrics metrics = buildCandidateMetrics(path, statusMap, stationLoopLoadMap, trafficSnapshot, profileConfig, ruleConfig, globalPolicy, outStationIdSet);
@@ -345,8 +399,10 @@
        if (metricsList.isEmpty()) {
            if (globalPolicy.forceSkipPassOtherOutStation && skippedByOtherOutStation > 0) {
                News.warn("[WCS Debug] 站点路径候选全部被过滤，因经过其他出库站点,startStationId={},endStationId={}",
                        resolvedPolicy.getRuleEntity() == null ? null : resolvedPolicy.getRuleEntity().getStartStationId(),
                        resolvedPolicy.getRuleEntity() == null ? null : resolvedPolicy.getRuleEntity().getEndStationId());
                        startStationId, endStationId);
            } else if (skippedByLoopMergeGuard > 0) {
                News.warn("[WCS Debug] 站点路径候选全部被过滤，因分叉口插入环线主干会影响主干道,startStationId={},endStationId={}",
                        startStationId, endStationId);
            }
            return new ArrayList<>();
        }
@@ -660,6 +716,16 @@
        return count;
    }

    private int compareReachabilityPath(List<NavigateNode> left, List<NavigateNode> right) {
        int leftLen = left == null ? Integer.MAX_VALUE : left.size();
        int rightLen = right == null ? Integer.MAX_VALUE : right.size();
        int leftTurnCount = countTurnCount(left);
        int rightTurnCount = countTurnCount(right);
        int leftLiftCount = countLiftTransferCount(left);
        int rightLiftCount = countLiftTransferCount(right);
        return compareDouble(leftLen, rightLen, leftTurnCount, rightTurnCount, leftLiftCount, rightLiftCount);
    }

    private int countLiftTransferCount(List<NavigateNode> path) {
        int count = 0;
        for (NavigateNode node : safeList(path)) {
@@ -936,6 +1002,158 @@
        return stationLoopLoadMap;
    }

    private LoopMergeGuardContext loadLoopMergeGuardContext() {
        LoopMergeGuardContext context = new LoopMergeGuardContext();
        try {
            if (stationCycleCapacityService == null) {
                return context;
            }
            StationCycleCapacityVo capacityVo = stationCycleCapacityService.getLatestSnapshot();
            if (capacityVo == null || capacityVo.getLoopList() == null || capacityVo.getLoopList().isEmpty()) {
                return context;
            }

            Map<Integer, Set<Integer>> stationGraph = loadUndirectedStationGraph();
            if (stationGraph.isEmpty()) {
                return context;
            }

            for (StationCycleLoopVo loopVo : capacityVo.getLoopList()) {
                List<Integer> rawStationIdList = loopVo == null ? Collections.emptyList() : loopVo.getStationIdList();
                List<Integer> loopStationIdList = distinctPositiveStationIds(rawStationIdList);
                if (loopStationIdList.size() < 3) {
                    continue;
                }
                Set<Integer> loopStationSet = new HashSet<>(loopStationIdList);
                for (Integer stationId : loopStationSet) {
                    context.loopStationIdSet.add(stationId);
                    Set<Integer> graphNeighborSet = stationGraph.getOrDefault(stationId, Collections.emptySet());
                    Set<Integer> loopNeighborSet = new LinkedHashSet<>();
                    for (Integer neighborStationId : graphNeighborSet) {
                        if (neighborStationId != null && loopStationSet.contains(neighborStationId)) {
                            loopNeighborSet.add(neighborStationId);
                        }
                    }
                    if (!loopNeighborSet.isEmpty()) {
                        context.loopNeighborMap.computeIfAbsent(stationId, key -> new LinkedHashSet<>()).addAll(loopNeighborSet);
                    }
                }
            }
        } catch (Exception ignore) {
        }
        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();
        if (levList.isEmpty()) {
            return graph;
        }

        NavigateSolution navigateSolution = new NavigateSolution();
        for (Integer lev : levList) {
            if (lev == null) {
                continue;
            }
            List<List<NavigateNode>> stationMap;
            try {
                stationMap = navigateSolution.getStationMap(lev);
            } catch (Exception ignore) {
                continue;
            }
            if (stationMap == null || stationMap.isEmpty()) {
                continue;
            }

            for (List<NavigateNode> row : stationMap) {
                for (NavigateNode node : safeList(row)) {
                    Integer stationId = extractStationId(node);
                    if (stationId == null) {
                        continue;
                    }
                    graph.computeIfAbsent(stationId, key -> new LinkedHashSet<>());
                    List<NavigateNode> nextNodeList = navigateSolution.extend_current_node(stationMap, node);
                    for (NavigateNode nextNode : safeList(nextNodeList)) {
                        Integer nextStationId = extractStationId(nextNode);
                        if (nextStationId == null || stationId.equals(nextStationId)) {
                            continue;
                        }
                        graph.computeIfAbsent(nextStationId, key -> new LinkedHashSet<>());
                        graph.get(stationId).add(nextStationId);
                        graph.get(nextStationId).add(stationId);
                    }
                }
            }
        }
        return graph;
    }

    private List<Integer> loadStationLevList() {
        List<Integer> levList = new ArrayList<>();
        if (basStationService == null) {
            return levList;
        }
        try {
            List<BasStation> stationList = basStationService.list(new QueryWrapper<BasStation>().select("station_lev"));
            Set<Integer> seen = new HashSet<>();
            for (BasStation station : safeList(stationList)) {
                Integer lev = station == null ? null : station.getStationLev();
                if (lev != null && seen.add(lev)) {
                    levList.add(lev);
                }
            }
            Collections.sort(levList);
        } catch (Exception ignore) {
        }
        return levList;
    }

    private StationTrafficSnapshot loadStationTrafficSnapshot(Map<Integer, StationProtocol> statusMap, Integer currentTaskNo) {
        StationTrafficSnapshot snapshot = new StationTrafficSnapshot();
        Map<Integer, Integer> busyMap = new HashMap<>();
@@ -1025,6 +1243,145 @@
            }
        }
        return snapshot;
    }

    private boolean isLoopMergePathAllowed(List<NavigateNode> path,
                                           Map<Integer, StationProtocol> statusMap,
                                           StationTrafficSnapshot trafficSnapshot,
                                           LoopMergeGuardContext loopMergeGuardContext,
                                           Set<LoopMergeEntry> mandatoryLoopMergeEntrySet) {
        if (path == null || path.size() < 2 || loopMergeGuardContext == null || loopMergeGuardContext.loopStationIdSet.isEmpty()) {
            return true;
        }

        List<Integer> stationIdList = extractStationIdList(path);
        if (stationIdList.size() < 2) {
            return true;
        }

        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;
            }

            Set<Integer> trunkNeighborSet = loopMergeGuardContext.loopNeighborMap.getOrDefault(currentStationId, Collections.emptySet());
            if (trunkNeighborSet.size() < 2) {
                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,
                                                  Map<Integer, StationProtocol> statusMap,
                                                  StationTrafficSnapshot trafficSnapshot) {
        if (stationId == null) {
            return false;
        }

        StationProtocol protocol = statusMap == null ? null : statusMap.get(stationId);
        if (protocol != null) {
            if ((protocol.getTaskNo() != null && protocol.getTaskNo() > 0) || protocol.isRunBlock()) {
                return true;
            }
        }

        if (trafficSnapshot == null) {
            return false;
        }
        if (trafficSnapshot.queueDepthMap.getOrDefault(stationId, 0) > 0) {
            return true;
        }

        for (TraceRouteSnapshot routeSnapshot : trafficSnapshot.traceRouteList) {
            if (routeSnapshot == null) {
                continue;
            }
            if (stationId.equals(routeSnapshot.currentStationId)) {
                return true;
            }
            if (containsStation(routeSnapshot.issuedStationIds, stationId)
                    || containsStation(routeSnapshot.pendingStationIds, stationId)) {
                return true;
            }
        }
        return false;
    }

    private boolean containsStation(List<Integer> stationIdList, Integer stationId) {
        if (stationId == null || stationIdList == null || stationIdList.isEmpty()) {
            return false;
        }
        for (Integer currentStationId : stationIdList) {
            if (stationId.equals(currentStationId)) {
                return true;
            }
        }
        return false;
    }

    private List<StationTaskTraceVo> loadActiveTraceList(Integer currentTaskNo, Map<Integer, StationProtocol> statusMap) {
@@ -1506,6 +1863,41 @@
        private Date sendTime;
    }

    private static class LoopMergeGuardContext {
        private final Set<Integer> loopStationIdSet = new HashSet<>();
        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;