Aimed at a multiple traveling salesman problem(MTSP)with multiple depots and closed paths,this paper proposes a k-means clustering donkey and a smuggler algorithm(KDSA).The algorithm first uses the k-means clustering ...Aimed at a multiple traveling salesman problem(MTSP)with multiple depots and closed paths,this paper proposes a k-means clustering donkey and a smuggler algorithm(KDSA).The algorithm first uses the k-means clustering method to divide all cities into several categories based on the center of various samples;the large-scale MTSP is divided into multiple separate traveling salesman problems(TSPs),and the TSP is solved through the DSA.The proposed algorithm adopts a solution strategy of clustering first and then carrying out,which can not only greatly reduce the search space of the algorithm but also make the search space more fully explored so that the optimal solution of the problem can be more quickly obtained.The experimental results from solving several test cases in the TSPLIB database show that compared with other related intelligent algorithms,the K-DSA has good solving performance and computational efficiency in MTSPs of different scales,especially with large-scale MTSP and when the convergence speed is faster;thus,the advantages of this algorithm are more obvious compared to other algorithms.展开更多
Advanced traveler information systems （ATIS） can not only improve drivers＇ accessibility to the more accurate route travel time information, but also can improve drivers＇ adaptability to the stochastic network cap...Advanced traveler information systems （ATIS） can not only improve drivers＇ accessibility to the more accurate route travel time information, but also can improve drivers＇ adaptability to the stochastic network capacity degradations. In this paper, a mixed stochastic user equilibrium model was proposed to describe the interactive route choice behaviors between ATIS equipped and unequipped drivers on a degradable transport network. In the proposed model the information accessibility of equipped drivers was reflected by lower degree of uncertainty in their stochastic equilibrium flow distributions, and their behavioral adaptability was captured by multiple equilibrium behaviors over the stochastic network state set. The mixed equilibrium model was formulated as a fixed point problem defined in the mixed route flows, and its solution was achieved by executing an iterative algorithm. Numerical experiments were provided to verify the properties of the mixed network equilibrium model and the efficiency of the iterative algorithm.展开更多
基金the Natural Science Basic Research Program of Shaanxi(2021JQ-368).
文摘Aimed at a multiple traveling salesman problem(MTSP)with multiple depots and closed paths,this paper proposes a k-means clustering donkey and a smuggler algorithm(KDSA).The algorithm first uses the k-means clustering method to divide all cities into several categories based on the center of various samples;the large-scale MTSP is divided into multiple separate traveling salesman problems(TSPs),and the TSP is solved through the DSA.The proposed algorithm adopts a solution strategy of clustering first and then carrying out,which can not only greatly reduce the search space of the algorithm but also make the search space more fully explored so that the optimal solution of the problem can be more quickly obtained.The experimental results from solving several test cases in the TSPLIB database show that compared with other related intelligent algorithms,the K-DSA has good solving performance and computational efficiency in MTSPs of different scales,especially with large-scale MTSP and when the convergence speed is faster;thus,the advantages of this algorithm are more obvious compared to other algorithms.
基金Projects(51378119,51578150)supported by the National Natural Science Foundation of China
文摘Advanced traveler information systems （ATIS） can not only improve drivers＇ accessibility to the more accurate route travel time information, but also can improve drivers＇ adaptability to the stochastic network capacity degradations. In this paper, a mixed stochastic user equilibrium model was proposed to describe the interactive route choice behaviors between ATIS equipped and unequipped drivers on a degradable transport network. In the proposed model the information accessibility of equipped drivers was reflected by lower degree of uncertainty in their stochastic equilibrium flow distributions, and their behavioral adaptability was captured by multiple equilibrium behaviors over the stochastic network state set. The mixed equilibrium model was formulated as a fixed point problem defined in the mixed route flows, and its solution was achieved by executing an iterative algorithm. Numerical experiments were provided to verify the properties of the mixed network equilibrium model and the efficiency of the iterative algorithm.
基金Supported by National Natural Science Foundation of China(60474058,60604026)National High Technology Research and Development Program of China(863 Program)(2007AA04Z156)
