This paper develops a semi-analytical solution for pile penetration in natural soft clays using the strain path method(SPM).The stress-strain behavior of soils is characterized by the S-CLAY1S model,which can capture ...This paper develops a semi-analytical solution for pile penetration in natural soft clays using the strain path method(SPM).The stress-strain behavior of soils is characterized by the S-CLAY1S model,which can capture the anisotropic evolution and destructuring nature of soft clays.By integrating the S-CLAY1S model into the theoretical framework of the SPM,a set of ordinary differential equations is formulated with respect to the vertical coordinate of soil particles.The distribution of excess pore water pressure(EPWP)following pile installation is approximated through one-dimensional(1D)radial integration around the pile shaft.The distribution of stresses and EPWP,along with the evolution of fabric anisotropy within the soil surrounding the pile,is presented to illustrate the response of pile penetration in natural soft clays.The proposed solution is validated against existing theoretical solutions using the SPM and cavity expansion method(CEM),along with experimental data.The findings demonstrate that the SPM reveals lower radial effective stresses and EPWP at the pile shaft than that of CEM.Pile penetration alters the soil's anisotropic properties,inducing rotational hardening and affecting post-installation stress distribution.Soil destructuration eliminates bonding among particles near the pile,resulting in a complete disruption of soil structure at the pile surface,which is particularly pronounced for higher initial soil structure ratios.Minimal variation was observed in the three principal stresses and shear stress on the cone side surface as the angle increased from 18°to 60°,except for a slight reduction in EPWP.展开更多
This paper discusses the problem of finding a shortest path from a fixed origin s to a specified node t in a network with arcs represented as typical triangular fuzzy numbers (TFN). Because of the characterist...This paper discusses the problem of finding a shortest path from a fixed origin s to a specified node t in a network with arcs represented as typical triangular fuzzy numbers (TFN). Because of the characteristic of TFNs, the length of any path p from s to t , which equals the extended sum of all arcs belonging to p , is also TFN. Therefore, the fuzzy shortest path problem (FSPP) becomes to select the smallest among all those TFNs corresponding to different paths from s to t (specifically, the smallest TFN represents the shortest path). Based on Adamo's method for ranking fuzzy number, the pessimistic method and its extensions - optimistic method and λ combination method, are presented, and the FSPP is finally converted into the crisp shortest path problems.展开更多
Acoustic waves in the pseudo-triaxial experiment system experience refraction phenomena.The conventional assumption that acoustic waves propagate along a straight line in traditional methods can lead to significant er...Acoustic waves in the pseudo-triaxial experiment system experience refraction phenomena.The conventional assumption that acoustic waves propagate along a straight line in traditional methods can lead to significant errors in localization results.To the end,this paper presents a method for locating acoustic emission(AE)sources in pseudo-triaxial experiments using shortest paths and orthogonal constraints.The approach consists of three main steps:(1)establishing control equations for refraction paths from AE sources to sensor locations;(2)calculating refraction point locations using the shortest travel principle and orthogonal constraints;(3)determining source coordinates using Taylor's first-order expansion.The results from laboratory AE experiments demonstrate that the average localization accuracy of the new method is only 6.5 mm,which is 66%more precise than the accuracy(19.4 mm)of the traditional method.Furthermore,simulation results indicate that the new method is not affected by the refraction ratio of the media and maintains the highest positioning accuracy across various arrival and velocity errors.展开更多
A three-dimensional path-planning approach has been developed to coordinate multiple fixed-wing unmanned aerial vehicles(UAVs)while avoiding collisions.The hierarchical path-planning architecture that divides the path...A three-dimensional path-planning approach has been developed to coordinate multiple fixed-wing unmanned aerial vehicles(UAVs)while avoiding collisions.The hierarchical path-planning architecture that divides the path-planning process into two layers is proposed by designing the velocityobstacle strategy for satisfying timeliness and effectiveness.The upper-level layer focuses on creating an efficient Dubins initial path considering the dynamic constraints of the fixed wing.Subsequently,the lower-level layer detects potential collisions and adjusts its flight paths to avoid collisions by using the threedimensional velocity obstacle method,which describes the maneuvering space of collision avoidance as the intersection space of half space.To further handle the dynamic and collisionavoidance constraints,a priority mechanism is designed to ensure that the adjusted path is still feasible for fixed-wing UAVs.Simulation experiments demonstrate the effectiveness of the proposed method.展开更多
Path planning for recovery is studied on the engineering background of double unmanned surface vehicles(USVs)towing oil booms for oil spill recovery.Given the influence of obstacles on the sea,the improved artificial ...Path planning for recovery is studied on the engineering background of double unmanned surface vehicles(USVs)towing oil booms for oil spill recovery.Given the influence of obstacles on the sea,the improved artificial potential field(APF)method is used for path planning.For addressing the two problems of unreachable target and local minimum in the APF,three improved algorithms are proposed by combining the motion performance constraints of the double USV system.These algorithms are then combined as the final APF-123 algorithm for oil spill recovery.Multiple sets of simulation tests are designed according to the flaws of the APF and the process of oil spill recovery.Results show that the proposed algorithms can ensure the system’s safety in tracking oil spills in a complex environment,and the speed is increased by more than 40%compared with the APF method.展开更多
In this article, we are interested in solving a combinatorial optimization problem, the shortest path problem in a multi-attribute graph, by the out-ranking methods. A multi-attribute graph has simultaneously qualitat...In this article, we are interested in solving a combinatorial optimization problem, the shortest path problem in a multi-attribute graph, by the out-ranking methods. A multi-attribute graph has simultaneously qualitative and quantitative criteria. This situation gives rise to incomparable paths thus forming the Pareto front. Outranking methods in Multi-criteria Decision Making (MCDM) are the only methods that can take into account this situation (incomparability of actions). After presenting the categories of Multi-criteria Decision Making (MCDM) and the difficulties related to the problems of the shortest paths, we propose an evolutionary algorithm based on the outranking methods to solve the problem of finding “best” paths in a multi-attribute graph with non-additive criteria. Our approach is based on the exploration of induced subgraphs of the outranking graph. Properties have been established to serve as algorithmic basis. Numerical experiments have been carried out and the results presented in this article.展开更多
The All-pairs shortest path problem(ALL-SPP)aims to find the shortest path joining all the vertices in a given graph.This study proposed a new optimal method,Dhouib-matrix-ALL-SPP(DM-ALL-SPP)to solve the ALL-SPP based...The All-pairs shortest path problem(ALL-SPP)aims to find the shortest path joining all the vertices in a given graph.This study proposed a new optimal method,Dhouib-matrix-ALL-SPP(DM-ALL-SPP)to solve the ALL-SPP based on column-row navigation through the adjacency matrix.DM-ALL-SPP is designed to generate in a single execution the shortest path with details among all-pairs of vertices for a graph with positive and negative weighted edges.Even for graphs with a negative cycle,DM-ALL-SPP reported a negative cycle.In addition,DM-ALL-SPP continues to work for directed,undirected and mixed graphs.Furthermore,it is characterized by two phases:the first phase consists of adding by column repeated(n)iterations(where n is the number of vertices),and the second phase resides in adding by row executed in the worst case(n∗log(n))iterations.The first phase,focused on improving the elements of each column by adding their values to each row and modifying them with the smallest value.The second phase is emphasized by rows only for the elements modified in the first phase.Different instances from the literature were used to test the performance of the proposed DM-ALL-SPP method,which was developed using the Python programming language and the results were compared to those obtained by the Floyd-Warshall algorithm.展开更多
The problem of the unmanned surface vessel (USV) path planning in static and dynamic obstacle environments is addressed in this paper. Multi-behavior fusion based potential field method is proposed, which contains thr...The problem of the unmanned surface vessel (USV) path planning in static and dynamic obstacle environments is addressed in this paper. Multi-behavior fusion based potential field method is proposed, which contains three behaviors: goal-seeking, boundary-memory following and dynamic-obstacle avoidance. Then, different activation conditions are designed to determine the current behavior. Meanwhile, information on the positions, velocities and the equation of motion for obstacles are detected and calculated by sensor data. Besides, memory information is introduced into the boundary following behavior to enhance cognition capability for the obstacles, and avoid local minima problem caused by the potential field method. Finally, the results of theoretical analysis and simulation show that the collision-free path can be generated for USV within different obstacle environments, and further validated the performance and effectiveness of the presented strategy.展开更多
A numerical method was used in order to establish the constitutive relationship of sands under different stress paths, Firstly, based on the numerical method modeling the constitutive law of sands, the elastoplastic c...A numerical method was used in order to establish the constitutive relationship of sands under different stress paths, Firstly, based on the numerical method modeling the constitutive law of sands, the elastoplastic constitutive relationship of sand was established for three paths： the constant proportion of principle stress path, the conventional triaxial compression （CTC） path, and the p=constant （TC） path. The yield lines of plastic volumetric strain and plastic generalized shear strain were given. Through visualization, the three dimensional surface of the stress-strain relationship in the whole stress field （p, q） obtained under the three paths was plotted. Also, by comparing the stress-strain surfaces and yield locus of the three stress paths, the differences were found to be obvious, which demonstrates that the influence of the stress paths on constitutive law was not neglected. The numerical modeling method overcame the difficulty of finding an analytical expression for plastic potential. The results simulated the experimental data with an accuracy of 90% on average, so the constitutive model established in this paper provides an effective constitutive equation for this kind of engineering, reflecting the effect of practical stress paths that occur in sands.展开更多
Unlike the shortest path problem that has only one optimal solution and can be solved in polynomial time, the muhi-objective shortest path problem （ MSPP ） has a set of pareto optimal solutions and cannot be solved ...Unlike the shortest path problem that has only one optimal solution and can be solved in polynomial time, the muhi-objective shortest path problem （ MSPP ） has a set of pareto optimal solutions and cannot be solved in polynomial time. The present algorithms focused mainly on how to obtain a precisely pareto optimal solution for MSPP resulting in a long time to obtain multiple pareto optimal solutions with them. In order to obtain a set of satisfied solutions for MSPP in reasonable time to meet the demand of a decision maker, a genetic algo- rithm MSPP-GA is presented to solve the MSPP with typically competing objectives, cost and time, in this pa- per. The encoding of the solution and the operators such as crossover, mutation and selection are developed. The algorithm introduced pareto domination tournament and sharing based selection operator, which can not only directly search the pareto optimal frontier but also maintain the diversity of populations in the process of evolutionary computation. Experimental results show that MSPP-GA can obtain most efficient solutions distributed all along the pareto frontier in less time than an exact algorithm. The algorithm proposed in this paper provides a new and effective method of how to obtain the set of pareto optimal solutions for other multiple objective optimization problems in a short time.展开更多
In order to form an algorithm for distribution network routing,an automatic routing method of distribution network planning was proposed based on the shortest path.The problem of automatic routing was divided into two...In order to form an algorithm for distribution network routing,an automatic routing method of distribution network planning was proposed based on the shortest path.The problem of automatic routing was divided into two steps in the method:the first step was that the shortest paths along streets between substation and load points were found by the basic ant colony algorithm to form a preliminary radial distribution network,and the second step was that the result of the shortest path was used to initialize pheromone concentration and pheromone updating rules to generate globally optimal distribution network.Cases studies show that the proposed method is effective and can meet the planning requirements.It is verified that the proposed method has better solution and utility than planning method based on the ant colony algorithm.展开更多
A new algorithm called homotopy iteration method based on the homotopy function is studied and improved. By the improved homotopy iteration method, Polynomial systems with high Order and deficient can be solved fast a...A new algorithm called homotopy iteration method based on the homotopy function is studied and improved. By the improved homotopy iteration method, Polynomial systems with high Order and deficient can be solved fast and efficiently comparing to the original homotopy iteration method. Numerical examples for the ninepoint path synthesis of four-bar linkages show the advantages and efficiency of the improved homotopy iteration method.展开更多
The particle path tracking method is proposed and used in two-dimensional（2D） and three-dimensional（3D） numerical simulations of continuously rotating detonation engines（CRDEs）. This method is used to analyze th...The particle path tracking method is proposed and used in two-dimensional（2D） and three-dimensional（3D） numerical simulations of continuously rotating detonation engines（CRDEs）. This method is used to analyze the combustion and expansion processes of the fresh particles, and the thermodynamic cycle process of CRDE. In a 3D CRDE flow field, as the radius of the annulus increases, the no-injection area proportion increases, the non-detonation proportion decreases, and the detonation height decreases. The flow field parameters on the 3D mid annulus are different from in the 2D flow field under the same chamber size. The non-detonation proportion in the 3D flow field is less than in the 2D flow field. In the 2D and 3D CRDE, the paths of the flow particles have only a small fluctuation in the circumferential direction. The numerical thermodynamic cycle processes are qualitatively consistent with the three ideal cycle models, and they are right in between the ideal F–J cycle and ideal ZND cycle. The net mechanical work and thermal efficiency are slightly smaller in the 2D simulation than in the 3D simulation. In the 3D CRDE, as the radius of the annulus increases, the net mechanical work is almost constant, and the thermal efficiency increases. The numerical thermal efficiencies are larger than F–J cycle, and much smaller than ZND cycle.展开更多
Rational planning of agricultural product transport route from initial node to destination node can effectively reduce the cost price of agricultural products,and the calculation of shortest path between any two point...Rational planning of agricultural product transport route from initial node to destination node can effectively reduce the cost price of agricultural products,and the calculation of shortest path between any two points also affects people’s daily travel.Taking Heze Railway Station to Heze College for example,with remote sensing image data as the base map,we conduct vectorization and topological analysis on roads in the target area.With Dijkstra as theoretical basis of shortest path algorithm,we use ArcG IS network analysis method to build road network,and calculate the planning program of the shortest distance path,the shortest path by driving and the shortest path by walking.展开更多
This paper presents an efficient parallel algorithm for the shortest path problem in planar layered digraphs that runs in O(log^3n) time with n processors. The algorithms uses a divide and conquer approach and is base...This paper presents an efficient parallel algorithm for the shortest path problem in planar layered digraphs that runs in O(log^3n) time with n processors. The algorithms uses a divide and conquer approach and is based on the novel idea of a one-way separator, which has the property that any directed path can be crossed only once.展开更多
The shortest path planning issure is critical for dynamic traffic assignment and route guidance in intelligent transportation systems. In this paper, a Particle Swarm Optimization (PSO) algorithm with priority-based e...The shortest path planning issure is critical for dynamic traffic assignment and route guidance in intelligent transportation systems. In this paper, a Particle Swarm Optimization (PSO) algorithm with priority-based encoding scheme based on fluid neural network (FNN) to search for the shortest path in stochastic traffic networks is introduced. The proposed algorithm overcomes the weight coefficient symmetry restrictions of the traditional FNN and disadvantage of easily getting into a local optimum for PSO. Simulation experiments have been carried out on different traffic network topologies consisting of 15-65 nodes and the results showed that the proposed approach can find the optimal path and closer sub-optimal paths with good success ratio. At the same time, the algorithms greatly improve the convergence efficiency of fluid neuron network.展开更多
Damage in a rock mass is heavily dependent on the existence and growth of joints,which are also influenced by the complex stress states induced by human activities(e.g.,tunneling and excavation).A proper representatio...Damage in a rock mass is heavily dependent on the existence and growth of joints,which are also influenced by the complex stress states induced by human activities(e.g.,tunneling and excavation).A proper representation of the loading path is essential for understanding the mechanical behaviors of rock masses.Based on the discrete element method(DEM),the influence of the loading path on the cracking process of a rock specimen containing an open flaw is examined.The effectiveness of the model is confirmed by comparing the simulation results under a uniaxial compression test to existing research findings,where wing crack initiates first and secondary cracks contribute to the failure of the specimen.Simulation results confirm that the cracking process is dependent upon both the confining pressure and the loading path.Under the axial loading test,a higher confining pressure suppresses the development of tensile wing cracks and forces the formation of secondary cracks in the form of shear bands perpendicular to the flaw.Increase of confining pressure also decreases the influence of the loading path on the cracking process.Reduction of confining pressure during an unloading test amplifies the concentration of tensile stress and ultimately promotes the appearance of a tensile splitting fracture at meso-scale.Confining pressure at the failure stage is well predicted by the Hoek-Brown failure criterion under quasi-static conditions.展开更多
Passengers’demands for riding comfort have been getting higher and higher as the high-speed railway develops.Scientific methods to analyze the interior noise of the high-speed train are needed and the operational tra...Passengers’demands for riding comfort have been getting higher and higher as the high-speed railway develops.Scientific methods to analyze the interior noise of the high-speed train are needed and the operational transfer path analysis(OTPA)method provides a theoretical basis and guidance for the noise control of the train and overcomes the shortcomings of the traditional method,which has high test efficiency and can be carried out during the working state of the targeted machine.The OTPA model is established from the aspects of“path reference point-target point”and“sound source reference point-target point”.As for the mechanism of the noise transmission path,an assumption is made that the direct sound propagation is ignored,and the symmetric sound source and the symmetric path are merged.Using the operational test data and the OTPA method,combined with the results of spherical array sound source identification,the path contribution and sound source contribution of the interior noise are analyzed,respectively,from aspects of the total value and spectrum.The results show that the OTPA conforms to the calculation results of the spherical array sound source identification.At low speed,the contribution of the floor path and the contribution of the bogie sources are dominant.When the speed is greater than 300 km/h,the contribution of the roof path is dominant.Moreover,for the carriage with a pantograph,the lifted pantograph is an obvious source.The noise from the exterior sources of the train transfer into the interior mainly through the form of structural excitation,and the contribution of air excitation is non-significant.Certain analyses of train parts provide guides for the interior noise control.展开更多
In this figure, it finds a vertex to another vertex k shortest path algorithm. Provided there are n vertices and edges in the diagram. If the path loops, the time complexity of the algorithm is allowed O（w ＋ n log 2...In this figure, it finds a vertex to another vertex k shortest path algorithm. Provided there are n vertices and edges in the diagram. If the path loops, the time complexity of the algorithm is allowed O（w ＋ n log 2 n ＋ kw log 2 k）. If the request path does not contain the loop, the time complexity of the algorithm O（kn（w ＋ n log2 n）＋ kw log2 k）. The algorithm utilizes a simple extension of the Dijkstra algorithm determined the end of the length of the shortest path to the other vertices, and then, based on these data, branch and bound method to identify the required path. Experimental results show that the actual running time has relations with the structure of FIG.展开更多
基金support from the National Natural Science Foundation of China(Grant No.42407256)the State Key Laboratory of Hydraulics and Mountain River Engineering,China(Grant No.SKHL2113)the Sichuan Science and Technology Program(Grant No.2024YFHZ0341).
文摘This paper develops a semi-analytical solution for pile penetration in natural soft clays using the strain path method(SPM).The stress-strain behavior of soils is characterized by the S-CLAY1S model,which can capture the anisotropic evolution and destructuring nature of soft clays.By integrating the S-CLAY1S model into the theoretical framework of the SPM,a set of ordinary differential equations is formulated with respect to the vertical coordinate of soil particles.The distribution of excess pore water pressure(EPWP)following pile installation is approximated through one-dimensional(1D)radial integration around the pile shaft.The distribution of stresses and EPWP,along with the evolution of fabric anisotropy within the soil surrounding the pile,is presented to illustrate the response of pile penetration in natural soft clays.The proposed solution is validated against existing theoretical solutions using the SPM and cavity expansion method(CEM),along with experimental data.The findings demonstrate that the SPM reveals lower radial effective stresses and EPWP at the pile shaft than that of CEM.Pile penetration alters the soil's anisotropic properties,inducing rotational hardening and affecting post-installation stress distribution.Soil destructuration eliminates bonding among particles near the pile,resulting in a complete disruption of soil structure at the pile surface,which is particularly pronounced for higher initial soil structure ratios.Minimal variation was observed in the three principal stresses and shear stress on the cone side surface as the angle increased from 18°to 60°,except for a slight reduction in EPWP.
文摘This paper discusses the problem of finding a shortest path from a fixed origin s to a specified node t in a network with arcs represented as typical triangular fuzzy numbers (TFN). Because of the characteristic of TFNs, the length of any path p from s to t , which equals the extended sum of all arcs belonging to p , is also TFN. Therefore, the fuzzy shortest path problem (FSPP) becomes to select the smallest among all those TFNs corresponding to different paths from s to t (specifically, the smallest TFN represents the shortest path). Based on Adamo's method for ranking fuzzy number, the pessimistic method and its extensions - optimistic method and λ combination method, are presented, and the FSPP is finally converted into the crisp shortest path problems.
基金the financial support provided by the National Key Research and Development Program for Young Scientists(Grant No.2021YFC2900400)the National Natural Science Foundation of China(Grant No.52304123)the China Postdoctoral Science Foundation(Grant No.2023M730412).
文摘Acoustic waves in the pseudo-triaxial experiment system experience refraction phenomena.The conventional assumption that acoustic waves propagate along a straight line in traditional methods can lead to significant errors in localization results.To the end,this paper presents a method for locating acoustic emission(AE)sources in pseudo-triaxial experiments using shortest paths and orthogonal constraints.The approach consists of three main steps:(1)establishing control equations for refraction paths from AE sources to sensor locations;(2)calculating refraction point locations using the shortest travel principle and orthogonal constraints;(3)determining source coordinates using Taylor's first-order expansion.The results from laboratory AE experiments demonstrate that the average localization accuracy of the new method is only 6.5 mm,which is 66%more precise than the accuracy(19.4 mm)of the traditional method.Furthermore,simulation results indicate that the new method is not affected by the refraction ratio of the media and maintains the highest positioning accuracy across various arrival and velocity errors.
基金supported by the National Science Fund for Distinguished Young Scholars(52425211)BIT Research Fund Program for Young Scholars(XSQD-202201005).
文摘A three-dimensional path-planning approach has been developed to coordinate multiple fixed-wing unmanned aerial vehicles(UAVs)while avoiding collisions.The hierarchical path-planning architecture that divides the path-planning process into two layers is proposed by designing the velocityobstacle strategy for satisfying timeliness and effectiveness.The upper-level layer focuses on creating an efficient Dubins initial path considering the dynamic constraints of the fixed wing.Subsequently,the lower-level layer detects potential collisions and adjusts its flight paths to avoid collisions by using the threedimensional velocity obstacle method,which describes the maneuvering space of collision avoidance as the intersection space of half space.To further handle the dynamic and collisionavoidance constraints,a priority mechanism is designed to ensure that the adjusted path is still feasible for fixed-wing UAVs.Simulation experiments demonstrate the effectiveness of the proposed method.
基金Supported by the National Natural Science Foundation of China (Grant No. 52071097)Hainan Provincial Natural Science Foundation of China (Grant No. 522MS162)Research Fund from Science and Technology on Underwater Vehicle Technology Laboratory (Grant No. 2021JCJQ-SYSJJ-LB06910)。
文摘Path planning for recovery is studied on the engineering background of double unmanned surface vehicles(USVs)towing oil booms for oil spill recovery.Given the influence of obstacles on the sea,the improved artificial potential field(APF)method is used for path planning.For addressing the two problems of unreachable target and local minimum in the APF,three improved algorithms are proposed by combining the motion performance constraints of the double USV system.These algorithms are then combined as the final APF-123 algorithm for oil spill recovery.Multiple sets of simulation tests are designed according to the flaws of the APF and the process of oil spill recovery.Results show that the proposed algorithms can ensure the system’s safety in tracking oil spills in a complex environment,and the speed is increased by more than 40%compared with the APF method.
文摘In this article, we are interested in solving a combinatorial optimization problem, the shortest path problem in a multi-attribute graph, by the out-ranking methods. A multi-attribute graph has simultaneously qualitative and quantitative criteria. This situation gives rise to incomparable paths thus forming the Pareto front. Outranking methods in Multi-criteria Decision Making (MCDM) are the only methods that can take into account this situation (incomparability of actions). After presenting the categories of Multi-criteria Decision Making (MCDM) and the difficulties related to the problems of the shortest paths, we propose an evolutionary algorithm based on the outranking methods to solve the problem of finding “best” paths in a multi-attribute graph with non-additive criteria. Our approach is based on the exploration of induced subgraphs of the outranking graph. Properties have been established to serve as algorithmic basis. Numerical experiments have been carried out and the results presented in this article.
文摘The All-pairs shortest path problem(ALL-SPP)aims to find the shortest path joining all the vertices in a given graph.This study proposed a new optimal method,Dhouib-matrix-ALL-SPP(DM-ALL-SPP)to solve the ALL-SPP based on column-row navigation through the adjacency matrix.DM-ALL-SPP is designed to generate in a single execution the shortest path with details among all-pairs of vertices for a graph with positive and negative weighted edges.Even for graphs with a negative cycle,DM-ALL-SPP reported a negative cycle.In addition,DM-ALL-SPP continues to work for directed,undirected and mixed graphs.Furthermore,it is characterized by two phases:the first phase consists of adding by column repeated(n)iterations(where n is the number of vertices),and the second phase resides in adding by row executed in the worst case(n∗log(n))iterations.The first phase,focused on improving the elements of each column by adding their values to each row and modifying them with the smallest value.The second phase is emphasized by rows only for the elements modified in the first phase.Different instances from the literature were used to test the performance of the proposed DM-ALL-SPP method,which was developed using the Python programming language and the results were compared to those obtained by the Floyd-Warshall algorithm.
基金financially supported by the National Natural Science Foundation of China(Grant No.51879049)DK-I Dynamic Positioning System Console Project
文摘The problem of the unmanned surface vessel (USV) path planning in static and dynamic obstacle environments is addressed in this paper. Multi-behavior fusion based potential field method is proposed, which contains three behaviors: goal-seeking, boundary-memory following and dynamic-obstacle avoidance. Then, different activation conditions are designed to determine the current behavior. Meanwhile, information on the positions, velocities and the equation of motion for obstacles are detected and calculated by sensor data. Besides, memory information is introduced into the boundary following behavior to enhance cognition capability for the obstacles, and avoid local minima problem caused by the potential field method. Finally, the results of theoretical analysis and simulation show that the collision-free path can be generated for USV within different obstacle environments, and further validated the performance and effectiveness of the presented strategy.
文摘A numerical method was used in order to establish the constitutive relationship of sands under different stress paths, Firstly, based on the numerical method modeling the constitutive law of sands, the elastoplastic constitutive relationship of sand was established for three paths： the constant proportion of principle stress path, the conventional triaxial compression （CTC） path, and the p=constant （TC） path. The yield lines of plastic volumetric strain and plastic generalized shear strain were given. Through visualization, the three dimensional surface of the stress-strain relationship in the whole stress field （p, q） obtained under the three paths was plotted. Also, by comparing the stress-strain surfaces and yield locus of the three stress paths, the differences were found to be obvious, which demonstrates that the influence of the stress paths on constitutive law was not neglected. The numerical modeling method overcame the difficulty of finding an analytical expression for plastic potential. The results simulated the experimental data with an accuracy of 90% on average, so the constitutive model established in this paper provides an effective constitutive equation for this kind of engineering, reflecting the effect of practical stress paths that occur in sands.
文摘Unlike the shortest path problem that has only one optimal solution and can be solved in polynomial time, the muhi-objective shortest path problem （ MSPP ） has a set of pareto optimal solutions and cannot be solved in polynomial time. The present algorithms focused mainly on how to obtain a precisely pareto optimal solution for MSPP resulting in a long time to obtain multiple pareto optimal solutions with them. In order to obtain a set of satisfied solutions for MSPP in reasonable time to meet the demand of a decision maker, a genetic algo- rithm MSPP-GA is presented to solve the MSPP with typically competing objectives, cost and time, in this pa- per. The encoding of the solution and the operators such as crossover, mutation and selection are developed. The algorithm introduced pareto domination tournament and sharing based selection operator, which can not only directly search the pareto optimal frontier but also maintain the diversity of populations in the process of evolutionary computation. Experimental results show that MSPP-GA can obtain most efficient solutions distributed all along the pareto frontier in less time than an exact algorithm. The algorithm proposed in this paper provides a new and effective method of how to obtain the set of pareto optimal solutions for other multiple objective optimization problems in a short time.
基金Project(2009CB219703) supported by the National Basic Research Program of ChinaProject(2011AA05A117) supported by the National High Technology Research and Development Program of China
文摘In order to form an algorithm for distribution network routing,an automatic routing method of distribution network planning was proposed based on the shortest path.The problem of automatic routing was divided into two steps in the method:the first step was that the shortest paths along streets between substation and load points were found by the basic ant colony algorithm to form a preliminary radial distribution network,and the second step was that the result of the shortest path was used to initialize pheromone concentration and pheromone updating rules to generate globally optimal distribution network.Cases studies show that the proposed method is effective and can meet the planning requirements.It is verified that the proposed method has better solution and utility than planning method based on the ant colony algorithm.
文摘A new algorithm called homotopy iteration method based on the homotopy function is studied and improved. By the improved homotopy iteration method, Polynomial systems with high Order and deficient can be solved fast and efficiently comparing to the original homotopy iteration method. Numerical examples for the ninepoint path synthesis of four-bar linkages show the advantages and efficiency of the improved homotopy iteration method.
文摘The particle path tracking method is proposed and used in two-dimensional（2D） and three-dimensional（3D） numerical simulations of continuously rotating detonation engines（CRDEs）. This method is used to analyze the combustion and expansion processes of the fresh particles, and the thermodynamic cycle process of CRDE. In a 3D CRDE flow field, as the radius of the annulus increases, the no-injection area proportion increases, the non-detonation proportion decreases, and the detonation height decreases. The flow field parameters on the 3D mid annulus are different from in the 2D flow field under the same chamber size. The non-detonation proportion in the 3D flow field is less than in the 2D flow field. In the 2D and 3D CRDE, the paths of the flow particles have only a small fluctuation in the circumferential direction. The numerical thermodynamic cycle processes are qualitatively consistent with the three ideal cycle models, and they are right in between the ideal F–J cycle and ideal ZND cycle. The net mechanical work and thermal efficiency are slightly smaller in the 2D simulation than in the 3D simulation. In the 3D CRDE, as the radius of the annulus increases, the net mechanical work is almost constant, and the thermal efficiency increases. The numerical thermal efficiencies are larger than F–J cycle, and much smaller than ZND cycle.
基金Supported by Science Foundation of Heze University(XY14SK14)
文摘Rational planning of agricultural product transport route from initial node to destination node can effectively reduce the cost price of agricultural products,and the calculation of shortest path between any two points also affects people’s daily travel.Taking Heze Railway Station to Heze College for example,with remote sensing image data as the base map,we conduct vectorization and topological analysis on roads in the target area.With Dijkstra as theoretical basis of shortest path algorithm,we use ArcG IS network analysis method to build road network,and calculate the planning program of the shortest distance path,the shortest path by driving and the shortest path by walking.
文摘This paper presents an efficient parallel algorithm for the shortest path problem in planar layered digraphs that runs in O(log^3n) time with n processors. The algorithms uses a divide and conquer approach and is based on the novel idea of a one-way separator, which has the property that any directed path can be crossed only once.
文摘The shortest path planning issure is critical for dynamic traffic assignment and route guidance in intelligent transportation systems. In this paper, a Particle Swarm Optimization (PSO) algorithm with priority-based encoding scheme based on fluid neural network (FNN) to search for the shortest path in stochastic traffic networks is introduced. The proposed algorithm overcomes the weight coefficient symmetry restrictions of the traditional FNN and disadvantage of easily getting into a local optimum for PSO. Simulation experiments have been carried out on different traffic network topologies consisting of 15-65 nodes and the results showed that the proposed approach can find the optimal path and closer sub-optimal paths with good success ratio. At the same time, the algorithms greatly improve the convergence efficiency of fluid neuron network.
基金supported by the Shandong Provincial Natural Science Foundation of China(No.ZR2020YQ44)the National Natural Science Foundation of China(No.51909138)。
文摘Damage in a rock mass is heavily dependent on the existence and growth of joints,which are also influenced by the complex stress states induced by human activities(e.g.,tunneling and excavation).A proper representation of the loading path is essential for understanding the mechanical behaviors of rock masses.Based on the discrete element method(DEM),the influence of the loading path on the cracking process of a rock specimen containing an open flaw is examined.The effectiveness of the model is confirmed by comparing the simulation results under a uniaxial compression test to existing research findings,where wing crack initiates first and secondary cracks contribute to the failure of the specimen.Simulation results confirm that the cracking process is dependent upon both the confining pressure and the loading path.Under the axial loading test,a higher confining pressure suppresses the development of tensile wing cracks and forces the formation of secondary cracks in the form of shear bands perpendicular to the flaw.Increase of confining pressure also decreases the influence of the loading path on the cracking process.Reduction of confining pressure during an unloading test amplifies the concentration of tensile stress and ultimately promotes the appearance of a tensile splitting fracture at meso-scale.Confining pressure at the failure stage is well predicted by the Hoek-Brown failure criterion under quasi-static conditions.
文摘Passengers’demands for riding comfort have been getting higher and higher as the high-speed railway develops.Scientific methods to analyze the interior noise of the high-speed train are needed and the operational transfer path analysis(OTPA)method provides a theoretical basis and guidance for the noise control of the train and overcomes the shortcomings of the traditional method,which has high test efficiency and can be carried out during the working state of the targeted machine.The OTPA model is established from the aspects of“path reference point-target point”and“sound source reference point-target point”.As for the mechanism of the noise transmission path,an assumption is made that the direct sound propagation is ignored,and the symmetric sound source and the symmetric path are merged.Using the operational test data and the OTPA method,combined with the results of spherical array sound source identification,the path contribution and sound source contribution of the interior noise are analyzed,respectively,from aspects of the total value and spectrum.The results show that the OTPA conforms to the calculation results of the spherical array sound source identification.At low speed,the contribution of the floor path and the contribution of the bogie sources are dominant.When the speed is greater than 300 km/h,the contribution of the roof path is dominant.Moreover,for the carriage with a pantograph,the lifted pantograph is an obvious source.The noise from the exterior sources of the train transfer into the interior mainly through the form of structural excitation,and the contribution of air excitation is non-significant.Certain analyses of train parts provide guides for the interior noise control.
文摘In this figure, it finds a vertex to another vertex k shortest path algorithm. Provided there are n vertices and edges in the diagram. If the path loops, the time complexity of the algorithm is allowed O（w ＋ n log 2 n ＋ kw log 2 k）. If the request path does not contain the loop, the time complexity of the algorithm O（kn（w ＋ n log2 n）＋ kw log2 k）. The algorithm utilizes a simple extension of the Dijkstra algorithm determined the end of the length of the shortest path to the other vertices, and then, based on these data, branch and bound method to identify the required path. Experimental results show that the actual running time has relations with the structure of FIG.
