From d2f410e1149597b9743c5e195f6b54a1504cf2d4 Mon Sep 17 00:00:00 2001
From: Junjie <fallin.jie@qq.com>
Date: 星期五, 20 三月 2026 20:18:26 +0800
Subject: [PATCH] #
---
src/main/java/com/zy/common/utils/NavigateUtils.java | 201 ++++++++++++++++++++++++++++++++++++++++++++++++--
1 files changed, 192 insertions(+), 9 deletions(-)
diff --git a/src/main/java/com/zy/common/utils/NavigateUtils.java b/src/main/java/com/zy/common/utils/NavigateUtils.java
index b3b87dc..152b125 100644
--- a/src/main/java/com/zy/common/utils/NavigateUtils.java
+++ b/src/main/java/com/zy/common/utils/NavigateUtils.java
@@ -73,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("鏈壘鍒拌 璧风偣 瀵瑰簲鐨勭珯鐐规暟鎹�");
@@ -130,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);
//鍘婚噸
@@ -288,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("绔欑偣璺緞瑙勫垯鍛戒腑浣嗘棤鍙揪璺緞锛宺uleCode={},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<>();
}
@@ -330,6 +376,7 @@
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;
@@ -338,7 +385,7 @@
if (path == null || path.isEmpty()) {
continue;
}
- if (!isLoopMergePathAllowed(path, statusMap, trafficSnapshot, loopMergeGuardContext)) {
+ if (!isLoopMergePathAllowed(path, statusMap, trafficSnapshot, loopMergeGuardContext, mandatoryLoopMergeEntrySet)) {
skippedByLoopMergeGuard++;
continue;
}
@@ -352,12 +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={}",
- resolvedPolicy.getRuleEntity() == null ? null : resolvedPolicy.getRuleEntity().getStartStationId(),
- resolvedPolicy.getRuleEntity() == null ? null : resolvedPolicy.getRuleEntity().getEndStationId());
+ startStationId, endStationId);
}
return new ArrayList<>();
}
@@ -669,6 +714,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) {
@@ -989,6 +1044,51 @@
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();
@@ -1148,7 +1248,8 @@
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;
}
@@ -1174,13 +1275,65 @@
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,
@@ -1715,6 +1868,36 @@
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;
--
Gitblit v1.9.1