摘要
建立和研究了具有转向惩罚值的网络模型。在定义罚转向网络模型的符号、路径及路径长度的基础上，对所建立的罚转向网络模型的性质进行了讨论，指出了该模型中的最短路径允许具有回路，提出了求解从任一节点到其他有向弧和节点的最短路径的一个算法。
A model for the network with swerve penalty(NSP) is developed. The
symbols, the path and its length of NSP are defined and the properties of NSP are studied. The
dissimilitude for shortest path of general net and NSP is indicated, and a loop in the NSP shortest
path is allowed. A shortest path algorithm based on NSP is proposed. An example of finding the
shortest path is presented.
