A theoretical study was conducted on finding optimal paths in transportation networks where link travel times were stochastic and time-dependent(STD). The methodology of relative robust optimization was applied as mea...A theoretical study was conducted on finding optimal paths in transportation networks where link travel times were stochastic and time-dependent(STD). The methodology of relative robust optimization was applied as measures for comparing time-varying, random path travel times for a priori optimization. In accordance with the situation in real world, a stochastic consistent condition was provided for the STD networks and under this condition, a mathematical proof was given that the STD robust optimal path problem can be simplified into a minimum problem in specific time-dependent networks. A label setting algorithm was designed and tested to find travelers' robust optimal path in a sampled STD network with computation complexity of O(n2+n·m). The validity of the robust approach and the designed algorithm were confirmed in the computational tests. Compared with conventional probability approach, the proposed approach is simple and efficient, and also has a good application prospect in navigation system.展开更多
跨域推荐技术通过深入挖掘及利用其他域的有用信息,有效提升目标域的推荐表现,为解决用户冷启动问题提供了一种有效途径。然而,当前跨域推荐方法存在局限,未能细粒度地扩展隐式关系,并且忽视了嵌入向量中可能包含的冗余信息,从而制约了...跨域推荐技术通过深入挖掘及利用其他域的有用信息,有效提升目标域的推荐表现,为解决用户冷启动问题提供了一种有效途径。然而,当前跨域推荐方法存在局限,未能细粒度地扩展隐式关系,并且忽视了嵌入向量中可能包含的冗余信息,从而制约了跨域推荐系统的性能。鉴于此,提出一种基于域内和域间元路径聚合的跨域推荐方法,IMCDR(intra-domain and inter-domain meta-paths aggregation based cross-domain recommendation)。IMCDR首先通过细粒度地计算实体多字段的语义嵌入,有效扩展用户-用户和物品-物品关系;然后,IMCDR基于域内元路径和域间元路径为每个节点分别生成私有特征和共享特征,并将它们有效融合,以获得更高质量的嵌入向量。在三个跨域推荐任务上的综合实验结果表明,IMCDR在有效性和性能上具有明显优势。展开更多
Ant colony optimization （ACO） is a new heuristic algo- rithm which has been proven a successful technique and applied to a number of combinatorial optimization problems. The traveling salesman problem （TSP） is amo...Ant colony optimization （ACO） is a new heuristic algo- rithm which has been proven a successful technique and applied to a number of combinatorial optimization problems. The traveling salesman problem （TSP） is among the most important combinato- rial problems. An ACO algorithm based on scout characteristic is proposed for solving the stagnation behavior and premature con- vergence problem of the basic ACO algorithm on TSP. The main idea is to partition artificial ants into two groups： scout ants and common ants. The common ants work according to the search manner of basic ant colony algorithm, but scout ants have some differences from common ants, they calculate each route＇s muta- tion probability of the current optimal solution using path evaluation model and search around the optimal solution according to the mutation probability. Simulation on TSP shows that the improved algorithm has high efficiency and robustness.展开更多
This paper considers a project scheduling problem with the objective of minimizing resource availability costs appealed to finish al activities before the deadline. There are finish-start type precedence relations amo...This paper considers a project scheduling problem with the objective of minimizing resource availability costs appealed to finish al activities before the deadline. There are finish-start type precedence relations among the activities which require some kinds of renewable resources. We predigest the process of sol-ving the resource availability cost problem （RACP） by using start time of each activity to code the schedule. Then, a novel heuris-tic algorithm is proposed to make the process of looking for the best solution efficiently. And then pseudo particle swarm optimiza-tion （PPSO） combined with PSO and path relinking procedure is presented to solve the RACP. Final y, comparative computational experiments are designed and the computational results show that the proposed method is very effective to solve RACP.展开更多
The optimal path planning for fixed-wing unmanned aerial vehicles(UAVs) in multi-target surveillance tasks(MTST) in the presence of wind is concerned.To take into account the minimal turning radius of UAVs,the Dubins ...The optimal path planning for fixed-wing unmanned aerial vehicles(UAVs) in multi-target surveillance tasks(MTST) in the presence of wind is concerned.To take into account the minimal turning radius of UAVs,the Dubins model is used to approximate the dynamics of UAVs.Based on the assumption,the path planning problem of UAVs in MTST can be formulated as a Dubins traveling salesman problem(DTSP).By considering its prohibitively high computational cost,the Dubins paths under terminal heading relaxation are introduced,which leads to significant reduction of the optimization scale and difficulty of the whole problem.Meanwhile,in view of the impact of wind on UAVs' paths,the notion of virtual target is proposed.The application of the idea successfully converts the Dubins path planning problem from an initial configuration to a target in wind into a problem of finding the minimal root of a transcendental equation.Then,the Dubins tour is derived by using differential evolution(DE) algorithm which employs random-key encoding technique to optimize the visiting sequence of waypoints.Finally,the effectiveness and efficiency of the proposed algorithm are demonstrated through computational experiments.Numerical results exhibit that the proposed algorithm can produce high quality solutions to the problem.展开更多
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.展开更多
Due to the limited transmission resources for data relay in the tracking and data relay satellite system （TDRSS）, there are many job requirements in busy days which will be discarded in the conventional job scheduli...Due to the limited transmission resources for data relay in the tracking and data relay satellite system （TDRSS）, there are many job requirements in busy days which will be discarded in the conventional job scheduling model. Therefore, the improvement of scheduling efficiency in the TDRSS can not only help to increase the resource utilities, but also to reduce the scheduling failure ratio. A model of nonhomogeneous parallel machines scheduling problems with time window （NPM-TW） is firstly built up for the TDRSS, considering the distinct features of the variable preparation time and the nonhomogeneous transmission rates for different types of antennas on each tracking and data relay satellite （TDRS）. Then, an adaptive subsequence adjustment （ASA） framework with evolutionary asymmetric path-relinking （EvAPR） is proposed to solve this problem, in which an asymmetric progressive crossover operation is involved to overcome the local optima by the conventional job inserting methods. The numerical results show that, compared with the classical greedy randomized adaptive search procedure （GRASP） algorithm, the scheduling failure ratio of jobs can be reduced over 11% on average by the proposed ASA with EvAPR.展开更多
基金Project(71001079)supported by the National Natural Science Foundation of China
文摘A theoretical study was conducted on finding optimal paths in transportation networks where link travel times were stochastic and time-dependent(STD). The methodology of relative robust optimization was applied as measures for comparing time-varying, random path travel times for a priori optimization. In accordance with the situation in real world, a stochastic consistent condition was provided for the STD networks and under this condition, a mathematical proof was given that the STD robust optimal path problem can be simplified into a minimum problem in specific time-dependent networks. A label setting algorithm was designed and tested to find travelers' robust optimal path in a sampled STD network with computation complexity of O(n2+n·m). The validity of the robust approach and the designed algorithm were confirmed in the computational tests. Compared with conventional probability approach, the proposed approach is simple and efficient, and also has a good application prospect in navigation system.
文摘跨域推荐技术通过深入挖掘及利用其他域的有用信息,有效提升目标域的推荐表现,为解决用户冷启动问题提供了一种有效途径。然而,当前跨域推荐方法存在局限,未能细粒度地扩展隐式关系,并且忽视了嵌入向量中可能包含的冗余信息,从而制约了跨域推荐系统的性能。鉴于此,提出一种基于域内和域间元路径聚合的跨域推荐方法,IMCDR(intra-domain and inter-domain meta-paths aggregation based cross-domain recommendation)。IMCDR首先通过细粒度地计算实体多字段的语义嵌入,有效扩展用户-用户和物品-物品关系;然后,IMCDR基于域内元路径和域间元路径为每个节点分别生成私有特征和共享特征,并将它们有效融合,以获得更高质量的嵌入向量。在三个跨域推荐任务上的综合实验结果表明,IMCDR在有效性和性能上具有明显优势。
基金supported by the National Natural Science Foundation of China(60573159)
文摘Ant colony optimization （ACO） is a new heuristic algo- rithm which has been proven a successful technique and applied to a number of combinatorial optimization problems. The traveling salesman problem （TSP） is among the most important combinato- rial problems. An ACO algorithm based on scout characteristic is proposed for solving the stagnation behavior and premature con- vergence problem of the basic ACO algorithm on TSP. The main idea is to partition artificial ants into two groups： scout ants and common ants. The common ants work according to the search manner of basic ant colony algorithm, but scout ants have some differences from common ants, they calculate each route＇s muta- tion probability of the current optimal solution using path evaluation model and search around the optimal solution according to the mutation probability. Simulation on TSP shows that the improved algorithm has high efficiency and robustness.
基金supported by the National Natural Science Foundation of China(7120116671201170)
文摘This paper considers a project scheduling problem with the objective of minimizing resource availability costs appealed to finish al activities before the deadline. There are finish-start type precedence relations among the activities which require some kinds of renewable resources. We predigest the process of sol-ving the resource availability cost problem （RACP） by using start time of each activity to code the schedule. Then, a novel heuris-tic algorithm is proposed to make the process of looking for the best solution efficiently. And then pseudo particle swarm optimiza-tion （PPSO） combined with PSO and path relinking procedure is presented to solve the RACP. Final y, comparative computational experiments are designed and the computational results show that the proposed method is very effective to solve RACP.
基金Project(61120106010)supported by the Projects of Major International(Regional)Joint Research Program Nature Science Foundation of ChinaProject(61304215,61203078)supported by National Natural Science Foundation of China+1 种基金Project(2013000704)supported by the Beijing Outstanding Ph.D.Program Mentor,ChinaProject(61321002)supported by the Foundation for Innovative Research Groups of the National Natural Science Foundation of China
文摘The optimal path planning for fixed-wing unmanned aerial vehicles(UAVs) in multi-target surveillance tasks(MTST) in the presence of wind is concerned.To take into account the minimal turning radius of UAVs,the Dubins model is used to approximate the dynamics of UAVs.Based on the assumption,the path planning problem of UAVs in MTST can be formulated as a Dubins traveling salesman problem(DTSP).By considering its prohibitively high computational cost,the Dubins paths under terminal heading relaxation are introduced,which leads to significant reduction of the optimization scale and difficulty of the whole problem.Meanwhile,in view of the impact of wind on UAVs' paths,the notion of virtual target is proposed.The application of the idea successfully converts the Dubins path planning problem from an initial configuration to a target in wind into a problem of finding the minimal root of a transcendental equation.Then,the Dubins tour is derived by using differential evolution(DE) algorithm which employs random-key encoding technique to optimize the visiting sequence of waypoints.Finally,the effectiveness and efficiency of the proposed algorithm are demonstrated through computational experiments.Numerical results exhibit that the proposed algorithm can produce high quality solutions to the problem.
基金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.
基金supported by the National Natural Science Foundation of China(6113200291338101+3 种基金91338108)the National S&T Major Project(2011ZX03004-001-01)the Research Fund of Tsinghua University(2011Z05117)the Co-innovation Laboratory of Aerospace Broadband Network Technology
文摘Due to the limited transmission resources for data relay in the tracking and data relay satellite system （TDRSS）, there are many job requirements in busy days which will be discarded in the conventional job scheduling model. Therefore, the improvement of scheduling efficiency in the TDRSS can not only help to increase the resource utilities, but also to reduce the scheduling failure ratio. A model of nonhomogeneous parallel machines scheduling problems with time window （NPM-TW） is firstly built up for the TDRSS, considering the distinct features of the variable preparation time and the nonhomogeneous transmission rates for different types of antennas on each tracking and data relay satellite （TDRS）. Then, an adaptive subsequence adjustment （ASA） framework with evolutionary asymmetric path-relinking （EvAPR） is proposed to solve this problem, in which an asymmetric progressive crossover operation is involved to overcome the local optima by the conventional job inserting methods. The numerical results show that, compared with the classical greedy randomized adaptive search procedure （GRASP） algorithm, the scheduling failure ratio of jobs can be reduced over 11% on average by the proposed ASA with EvAPR.
