Method for determining shortest loop with priority constraint

• Main Authors: GAO CHAOYI, ZHANG TAI, BAI LIPING, WU NAIQI
• Format: Patent
• Language: Chinese; English
• Published: 14.05.2024
• Subjects: CALCULATING; COMPUTING; COUNTING; DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES; PHYSICS; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR

The invention provides a method for determining a shortest loop with priority constraints. The method comprises the following steps: S1, acquiring a plurality of preset destinations and priority constraints thereof; s2, determining an initial loop passing through the plurality of destinations with the priority constraint; and S3, based on the initial loop, iteration is carried out by using a variable neighborhood search algorithm until the shortest loop passing through the plurality of destinations under the priority constraint is obtained. Therefore, the shortest loop meeting the priority constraint can be determined within the effective time, the method can be applied to part of international classical PCGTSP cases, and meanwhile, a better solution of a large instance can be obtained. 本发明通过提供一种带优先级约束的最短回路的确定方法，包括：S1.获取预先设定的多个目的地及其优先级约束；S2.确定以该优先级约束而途经该多个目的地的初始回路；S3.基于该初始回路，利用变邻域搜索算法进行迭代，直至得到以该优先级约束而途经所述多个目的地的最短回路。从而能够在有效的时间内确定一条满足优先级约束的最短回路，该方法能够应用于部分国际经典PCGTSP案例，同时也能得到大型实例的较优解。