Analyzed the similarity between scheme solving problem and traveling salesman problem (TSP), the scheme solving problem for conceptual design is transformed into an optimal path problem in combinatorial optimization, where the dynamic programming based so
Analyzed the similarity between scheme solving problem and traveling salesman problem (TSP), the scheme solving problem for conceptual design is transformed into an optimal path problem in combinatorial optimization, where the dynamic programming based so
摘要通过分析概念设计方案求解问题与旅行商问题的相似性，将方案求解问题转化为组合优化的最优路径问题，建立了基于动态规划的解空间模型和基于最长路径的优化模型。