Attribute reduction is a research hotspot in rough set theory. Traditional heuristic attribute reduction methods add the most important attribute to the decision attribute set each time, resulting in multiple redundan...Attribute reduction is a research hotspot in rough set theory. Traditional heuristic attribute reduction methods add the most important attribute to the decision attribute set each time, resulting in multiple redundant attribute calculations, high time consumption, and low reduction efficiency. In this paper, based on the idea of sequential three-branch decision classification domain, attributes are treated as objects of three-branch division, and attributes are divided into core attributes, relatively necessary attributes, and unnecessary attributes using attribute importance and thresholds. Core attributes are added to the decision attribute set, unnecessary attributes are rejected from being added, and relatively necessary attributes are repeatedly divided until the reduction result is obtained. Experiments were conducted on 8 groups of UCI datasets, and the results show that, compared to traditional reduction methods, the method proposed in this paper can effectively reduce time consumption while ensuring classification performance.展开更多
Aiming at the triangular fuzzy(TF)multi-attribute decision making(MADM)problem with a preference for the distribution density of attribute(DDA),a decision making method with TF number two-dimensional density(TFTD)oper...Aiming at the triangular fuzzy(TF)multi-attribute decision making(MADM)problem with a preference for the distribution density of attribute(DDA),a decision making method with TF number two-dimensional density(TFTD)operator is proposed based on the density operator theory for the decision maker(DM).Firstly,a simple TF vector clustering method is proposed,which considers the feature of TF number and the geometric distance of vectors.Secondly,the least deviation sum of squares method is used in the program model to obtain the density weight vector.Then,two TFTD operators are defined,and the MADM method based on the TFTD operator is proposed.Finally,a numerical example is given to illustrate the superiority of this method,which can not only solve the TF MADM problem with a preference for the DDA but also help the DM make an overall comparison.展开更多
Aiming at the problem of multi-UAV pursuit-evasion confrontation, a UAV cooperative maneuver method based on an improved multi-agent deep reinforcement learning(MADRL) is proposed. In this method, an improved Comm Net...Aiming at the problem of multi-UAV pursuit-evasion confrontation, a UAV cooperative maneuver method based on an improved multi-agent deep reinforcement learning(MADRL) is proposed. In this method, an improved Comm Net network based on a communication mechanism is introduced into a deep reinforcement learning algorithm to solve the multi-agent problem. A layer of gated recurrent unit(GRU) is added to the actor-network structure to remember historical environmental states. Subsequently,another GRU is designed as a communication channel in the Comm Net core network layer to refine communication information between UAVs. Finally, the simulation results of the algorithm in two sets of scenarios are given, and the results show that the method has good effectiveness and applicability.展开更多
Coexistence of fast and slow traveling waves without synaptic transmission has been found in hhhippocampal tissues,which is closely related to both normal brain activity and abnormal neural activity such as epileptic ...Coexistence of fast and slow traveling waves without synaptic transmission has been found in hhhippocampal tissues,which is closely related to both normal brain activity and abnormal neural activity such as epileptic discharge. However, the propagation mechanism behind this coexistence phenomenon remains unclear. In this paper, a three-dimensional electric field coupled hippocampal neural network is established to investigate generation of coexisting spontaneous fast and slow traveling waves. This model captures two types of dendritic traveling waves propagating in both transverse and longitude directions: the N-methyl-D-aspartate(NMDA)-dependent wave with a speed of about 0.1 m/s and the Ca-dependent wave with a speed of about 0.009 m/s. These traveling waves are synaptic-independent and could be conducted only by the electric fields generated by neighboring neurons, which are basically consistent with the in vitro data measured experiments. It is also found that the slow Ca wave could trigger generation of fast NMDA waves in the propagation path of slow waves whereas fast NMDA waves cannot affect the propagation of slow Ca waves. These results suggest that dendritic Ca waves could acted as the source of the coexistence fast and slow waves. Furthermore, we also confirm the impact of cellular spacing heterogeneity on the onset of coexisting fast and slow waves. The local region with decreasing distances among neighbor neurons is more liable to promote the onset of spontaneous slow waves which, as sources, excite propagation of fast waves. These modeling studies provide possible biophysical mechanisms underlying the neural dynamics of spontaneous traveling waves in brain tissues.展开更多
Traditional 3Ni weathering steel cannot completely meet the requirements for offshore engineering development,resulting in the design of novel 3Ni steel with the addition of microalloy elements such as Mn or Nb for st...Traditional 3Ni weathering steel cannot completely meet the requirements for offshore engineering development,resulting in the design of novel 3Ni steel with the addition of microalloy elements such as Mn or Nb for strength enhancement becoming a trend.The stress-assisted corrosion behavior of a novel designed high-strength 3Ni steel was investigated in the current study using the corrosion big data method.The information on the corrosion process was recorded using the galvanic corrosion current monitoring method.The gradi-ent boosting decision tree(GBDT)machine learning method was used to mine the corrosion mechanism,and the importance of the struc-ture factor was investigated.Field exposure tests were conducted to verify the calculated results using the GBDT method.Results indic-ated that the GBDT method can be effectively used to study the influence of structural factors on the corrosion process of 3Ni steel.Dif-ferent mechanisms for the addition of Mn and Cu to the stress-assisted corrosion of 3Ni steel suggested that Mn and Cu have no obvious effect on the corrosion rate of non-stressed 3Ni steel during the early stage of corrosion.When the corrosion reached a stable state,the in-crease in Mn element content increased the corrosion rate of 3Ni steel,while Cu reduced this rate.In the presence of stress,the increase in Mn element content and Cu addition can inhibit the corrosion process.The corrosion law of outdoor-exposed 3Ni steel is consistent with the law based on corrosion big data technology,verifying the reliability of the big data evaluation method and data prediction model selection.展开更多
In this article,multiple attribute decision-making problems are solved using the vague normal set(VNS).It is possible to generalize the vague set(VS)and q-rung fuzzy set(FS)into the q-rung vague set(VS).A log q-rung n...In this article,multiple attribute decision-making problems are solved using the vague normal set(VNS).It is possible to generalize the vague set(VS)and q-rung fuzzy set(FS)into the q-rung vague set(VS).A log q-rung normal vague weighted averaging(log q-rung NVWA),a log q-rung normal vague weighted geometric(log q-rung NVWG),a log generalized q-rung normal vague weighted averaging(log Gq-rung NVWA),and a log generalized q-rungnormal vagueweightedgeometric(logGq-rungNVWG)operator are discussed in this article.Adescription is provided of the scoring function,accuracy function and operational laws of the log q-rung VS.The algorithms underlying these functions are also described.A numerical example is provided to extend the Euclidean distance and the Humming distance.Additionally,idempotency,boundedness,commutativity,and monotonicity of the log q-rung VS are examined as they facilitate recognizing the optimal alternative more quickly and help clarify conceptualization.We chose five anemia patients with four types of symptoms including seizures,emotional shock or hysteria,brain cause,and high fever,who had either retrograde amnesia,anterograde amnesia,transient global amnesia,post-traumatic amnesia,or infantile amnesia.Natural numbers q are used to express the results of the models.To demonstrate the effectiveness and accuracy of the models we are investigating,we compare several existing models with those that have been developed.展开更多
To solve the problem of the low interference success rate of air defense missile radio fuzes due to the unified interference form of the traditional fuze interference system,an interference decision method based Q-lea...To solve the problem of the low interference success rate of air defense missile radio fuzes due to the unified interference form of the traditional fuze interference system,an interference decision method based Q-learning algorithm is proposed.First,dividing the distance between the missile and the target into multiple states to increase the quantity of state spaces.Second,a multidimensional motion space is utilized,and the search range of which changes with the distance of the projectile,to select parameters and minimize the amount of ineffective interference parameters.The interference effect is determined by detecting whether the fuze signal disappears.Finally,a weighted reward function is used to determine the reward value based on the range state,output power,and parameter quantity information of the interference form.The effectiveness of the proposed method in selecting the range of motion space parameters and designing the discrimination degree of the reward function has been verified through offline experiments involving full-range missile rendezvous.The optimal interference form for each distance state has been obtained.Compared with the single-interference decision method,the proposed decision method can effectively improve the success rate of interference.展开更多
This study proposes a prediction model considering external weather and holiday factors to address the issue of accurately predicting urban taxi travel demand caused by complex data and numerous influencing factors.Th...This study proposes a prediction model considering external weather and holiday factors to address the issue of accurately predicting urban taxi travel demand caused by complex data and numerous influencing factors.The model integrates the Complete Ensemble Empirical Mode Decomposition with Adaptive Noise(CEEMDAN)and Convolutional Long Short Term Memory Neural Network(ConvLSTM)to predict short-term taxi travel demand.The CEEMDAN decomposition method effectively decomposes time series data into a set of modal components,capturing sequence characteristics at different time scales and frequencies.Based on the sample entropy value of components,secondary processing of more complex sequence components after decomposition is employed to reduce the cumulative prediction error of component sequences and improve prediction efficiency.On this basis,considering the correlation between the spatiotemporal trends of short-term taxi traffic,a ConvLSTM neural network model with Long Short Term Memory(LSTM)time series processing ability and Convolutional Neural Networks(CNN)spatial feature processing ability is constructed to predict the travel demand for urban taxis.The combined prediction model is tested on a taxi travel demand dataset in a certain area of Beijing.The results show that the CEEMDAN-ConvLSTM prediction model outperforms the LSTM,Autoregressive Integrated Moving Average model(ARIMA),CNN,and ConvLSTM benchmark models in terms of Symmetric Mean Absolute Percentage Error(SMAPE),Root Mean Square Error(RMSE),Mean Absolute Error(MAE),and R2 metrics.Notably,the SMAPE metric exhibits a remarkable decline of 21.03%with the utilization of our proposed model.These results confirm that our study provides a highly accurate and valid model for taxi travel demand forecasting.展开更多
The existing algorithms for solving multi-objective optimization problems fall into three main categories:Decomposition-based,dominance-based,and indicator-based.Traditional multi-objective optimization problemsmainly...The existing algorithms for solving multi-objective optimization problems fall into three main categories:Decomposition-based,dominance-based,and indicator-based.Traditional multi-objective optimization problemsmainly focus on objectives,treating decision variables as a total variable to solve the problem without consideringthe critical role of decision variables in objective optimization.As seen,a variety of decision variable groupingalgorithms have been proposed.However,these algorithms are relatively broad for the changes of most decisionvariables in the evolution process and are time-consuming in the process of finding the Pareto frontier.To solvethese problems,a multi-objective optimization algorithm for grouping decision variables based on extreme pointPareto frontier(MOEA-DV/EPF)is proposed.This algorithm adopts a preprocessing rule to solve the Paretooptimal solution set of extreme points generated by simultaneous evolution in various target directions,obtainsthe basic Pareto front surface to determine the convergence effect,and analyzes the convergence and distributioneffects of decision variables.In the later stages of algorithm optimization,different mutation strategies are adoptedaccording to the nature of the decision variables to speed up the rate of evolution to obtain excellent individuals,thusenhancing the performance of the algorithm.Evaluation validation of the test functions shows that this algorithmcan solve the multi-objective optimization problem more efficiently.展开更多
With the development of big data and social computing,large-scale group decisionmaking(LGDM)is nowmerging with social networks.Using social network analysis(SNA),this study proposes an LGDM consensus model that consid...With the development of big data and social computing,large-scale group decisionmaking(LGDM)is nowmerging with social networks.Using social network analysis(SNA),this study proposes an LGDM consensus model that considers the trust relationship among decisionmakers(DMs).In the process of consensusmeasurement:the social network is constructed according to the social relationship among DMs,and the Louvain method is introduced to classify social networks to form subgroups.In this study,the weights of each decision maker and each subgroup are computed by comprehensive network weights and trust weights.In the process of consensus improvement:A feedback mechanism with four identification and two direction rules is designed to guide the consensus of the improvement process.Based on the trust relationship among DMs,the preferences are modified,and the corresponding social network is updated to accelerate the consensus.Compared with the previous research,the proposedmodel not only allows the subgroups to be reconstructed and updated during the adjustment process,but also improves the accuracy of the adjustment by the feedbackmechanism.Finally,an example analysis is conducted to verify the effectiveness and flexibility of the proposed method.Moreover,compared with previous studies,the superiority of the proposed method in solving the LGDM problem is highlighted.展开更多
Mobile edge computing(MEC)-enabled satellite-terrestrial networks(STNs)can provide Internet of Things(IoT)devices with global computing services.Sometimes,the network state information is uncertain or unknown.To deal ...Mobile edge computing(MEC)-enabled satellite-terrestrial networks(STNs)can provide Internet of Things(IoT)devices with global computing services.Sometimes,the network state information is uncertain or unknown.To deal with this situation,we investigate online learning-based offloading decision and resource allocation in MEC-enabled STNs in this paper.The problem of minimizing the average sum task completion delay of all IoT devices over all time periods is formulated.We decompose this optimization problem into a task offloading decision problem and a computing resource allocation problem.A joint optimization scheme of offloading decision and resource allocation is then proposed,which consists of a task offloading decision algorithm based on the devices cooperation aided upper confidence bound(UCB)algorithm and a computing resource allocation algorithm based on the Lagrange multiplier method.Simulation results validate that the proposed scheme performs better than other baseline schemes.展开更多
A Josephson traveling wave parametric amplifier(JTWPA),which is a quantum-limited amplifier with high gain and large bandwidth,is the core device of large-scale measurement and control systems for quantum computing.A ...A Josephson traveling wave parametric amplifier(JTWPA),which is a quantum-limited amplifier with high gain and large bandwidth,is the core device of large-scale measurement and control systems for quantum computing.A typical JTWPA consists of thousands of Josephson junctions connected in series to form a transmission line and hundreds of shunt LC resonators periodically loaded along the line for phase matching.Because the variation of these capacitors and inductors can be detrimental to their high-frequency characteristics,the fabrication of a JTWPA typically necessitates precise processing equipment.To guide the fabrication process and further improve the design for manufacturability,it is necessary to understand how each electronic component affects the amplifier.In this paper,we use the harmonic balance method to conduct a comprehensive study on the impact of nonuniformity and fabrication yield of the electronic components on the performance of a JTWPA.The results provide insightful and scientific guidance for device design and fabrication processes.展开更多
The large-scale multi-objective optimization algorithm(LSMOA),based on the grouping of decision variables,is an advanced method for handling high-dimensional decision variables.However,in practical problems,the intera...The large-scale multi-objective optimization algorithm(LSMOA),based on the grouping of decision variables,is an advanced method for handling high-dimensional decision variables.However,in practical problems,the interaction among decision variables is intricate,leading to large group sizes and suboptimal optimization effects;hence a large-scale multi-objective optimization algorithm based on weighted overlapping grouping of decision variables(MOEAWOD)is proposed in this paper.Initially,the decision variables are perturbed and categorized into convergence and diversity variables;subsequently,the convergence variables are subdivided into groups based on the interactions among different decision variables.If the size of a group surpasses the set threshold,that group undergoes a process of weighting and overlapping grouping.Specifically,the interaction strength is evaluated based on the interaction frequency and number of objectives among various decision variables.The decision variable with the highest interaction in the group is identified and disregarded,and the remaining variables are then reclassified into subgroups.Finally,the decision variable with the strongest interaction is added to each subgroup.MOEAWOD minimizes the interactivity between different groups and maximizes the interactivity of decision variables within groups,which contributed to the optimized direction of convergence and diversity exploration with different groups.MOEAWOD was subjected to testing on 18 benchmark large-scale optimization problems,and the experimental results demonstrate the effectiveness of our methods.Compared with the other algorithms,our method is still at an advantage.展开更多
Objectives Renal replacement therapy(RRT)is increasingly adopted for critically ill patients diagnosed with acute kidney injury,but the optimal time for initiation remains unclear and prognosis is uncertain,leading to...Objectives Renal replacement therapy(RRT)is increasingly adopted for critically ill patients diagnosed with acute kidney injury,but the optimal time for initiation remains unclear and prognosis is uncertain,leading to medical complexity,ethical conflicts,and decision dilemmas in intensive care unit(ICU)settings.This study aimed to develop a decision aid(DA)for the family surrogate of critically ill patients to support their engagement in shared decision-making process with clinicians.Methods Development of DA employed a systematic process with user-centered design(UCD)principle,which included:(i)competitive analysis:searched,screened,and assessed the existing DAs to gather insights for design strategies,developmental techniques,and functionalities;(ii)user needs assessment:interviewed family surrogates in our hospital to explore target user group's decision-making experience and identify their unmet needs;(iii)evidence syntheses:integrate latest clinical evidence and pertinent information to inform the content development of DA.Results The competitive analysis included 16 relevant DAs,from which we derived valuable insights using existing resources.User decision needs were explored among a cohort of 15 family surrogates,revealing four thematic issues in decision-making,including stuck into dilemmas,sense of uncertainty,limited capacity,and delayed decision confirmation.A total of 27 articles were included for evidence syntheses.Relevant decision making knowledge on disease and treatment,as delineated in the literature sourced from decision support system or clinical guidelines,were formatted as the foundational knowledge base.Twenty-one items of evidence were extracted and integrated into the content panels of benefits and risks of RRT,possible outcomes,and reasons to choose.The DA was drafted into a web-based phototype using the elements of UCD.This platform could guide users in their preparation of decision-making through a sequential four-step process:identifying treatment options,weighing the benefits and risks,clarifying personal preferences and values,and formulating a schedule for formal shared decision-making with clinicians.Conclusions We developed a rapid prototype of DA tailored for family surrogate decision makers of critically ill patients in need of RRT in ICU setting.Future studies are needed to evaluate its usability,feasibility,and clinical effects of this intervention.展开更多
Genetic algorithms(GAs)are very good metaheuristic algorithms that are suitable for solving NP-hard combinatorial optimization problems.AsimpleGAbeginswith a set of solutions represented by a population of chromosomes...Genetic algorithms(GAs)are very good metaheuristic algorithms that are suitable for solving NP-hard combinatorial optimization problems.AsimpleGAbeginswith a set of solutions represented by a population of chromosomes and then uses the idea of survival of the fittest in the selection process to select some fitter chromosomes.It uses a crossover operator to create better offspring chromosomes and thus,converges the population.Also,it uses a mutation operator to explore the unexplored areas by the crossover operator,and thus,diversifies the GA search space.A combination of crossover and mutation operators makes the GA search strong enough to reach the optimal solution.However,appropriate selection and combination of crossover operator and mutation operator can lead to a very good GA for solving an optimization problem.In this present paper,we aim to study the benchmark traveling salesman problem(TSP).We developed several genetic algorithms using seven crossover operators and six mutation operators for the TSP and then compared them to some benchmark TSPLIB instances.The experimental studies show the effectiveness of the combination of a comprehensive sequential constructive crossover operator and insertion mutation operator for the problem.The GA using the comprehensive sequential constructive crossover with insertion mutation could find average solutions whose average percentage of excesses from the best-known solutions are between 0.22 and 14.94 for our experimented problem instances.展开更多
The presence of numerous uncertainties in hybrid decision information systems(HDISs)renders attribute reduction a formidable task.Currently available attribute reduction algorithms,including those based on Pawlak attr...The presence of numerous uncertainties in hybrid decision information systems(HDISs)renders attribute reduction a formidable task.Currently available attribute reduction algorithms,including those based on Pawlak attribute importance,Skowron discernibility matrix,and information entropy,struggle to effectively manages multiple uncertainties simultaneously in HDISs like the precise measurement of disparities between nominal attribute values,and attributes with fuzzy boundaries and abnormal values.In order to address the aforementioned issues,this paper delves into the study of attribute reduction withinHDISs.First of all,a novel metric based on the decision attribute is introduced to solve the problem of accurately measuring the differences between nominal attribute values.The newly introduced distance metric has been christened the supervised distance that can effectively quantify the differences between the nominal attribute values.Then,based on the newly developed metric,a novel fuzzy relationship is defined from the perspective of“feedback on parity of attribute values to attribute sets”.This new fuzzy relationship serves as a valuable tool in addressing the challenges posed by abnormal attribute values.Furthermore,leveraging the newly introduced fuzzy relationship,the fuzzy conditional information entropy is defined as a solution to the challenges posed by fuzzy attributes.It effectively quantifies the uncertainty associated with fuzzy attribute values,thereby providing a robust framework for handling fuzzy information in hybrid information systems.Finally,an algorithm for attribute reduction utilizing the fuzzy conditional information entropy is presented.The experimental results on 12 datasets show that the average reduction rate of our algorithm reaches 84.04%,and the classification accuracy is improved by 3.91%compared to the original dataset,and by an average of 11.25%compared to the other 9 state-of-the-art reduction algorithms.The comprehensive analysis of these research results clearly indicates that our algorithm is highly effective in managing the intricate uncertainties inherent in hybrid data.展开更多
The studypresents theHalfMax InsertionHeuristic (HMIH) as a novel approach to solving theTravelling SalesmanProblem (TSP). The goal is to outperform existing techniques such as the Farthest Insertion Heuristic (FIH) a...The studypresents theHalfMax InsertionHeuristic (HMIH) as a novel approach to solving theTravelling SalesmanProblem (TSP). The goal is to outperform existing techniques such as the Farthest Insertion Heuristic (FIH) andNearest Neighbour Heuristic (NNH). The paper discusses the limitations of current construction tour heuristics,focusing particularly on the significant margin of error in FIH. It then proposes HMIH as an alternative thatminimizes the increase in tour distance and includes more nodes. HMIH improves tour quality by starting withan initial tour consisting of a ‘minimum’ polygon and iteratively adding nodes using our novel Half Max routine.The paper thoroughly examines and compares HMIH with FIH and NNH via rigorous testing on standard TSPbenchmarks. The results indicate that HMIH consistently delivers superior performance, particularly with respectto tour cost and computational efficiency. HMIH’s tours were sometimes 16% shorter than those generated by FIHand NNH, showcasing its potential and value as a novel benchmark for TSP solutions. The study used statisticalmethods, including Friedman’s Non-parametric Test, to validate the performance of HMIH over FIH and NNH.This guarantees that the identified advantages are statistically significant and consistent in various situations. Thiscomprehensive analysis emphasizes the reliability and efficiency of the heuristic, making a compelling case for itsuse in solving TSP issues. The research shows that, in general, HMIH fared better than FIH in all cases studied,except for a few instances (pr439, eil51, and eil101) where FIH either performed equally or slightly better thanHMIH. HMIH’s efficiency is shown by its improvements in error percentage (δ) and goodness values (g) comparedto FIH and NNH. In the att48 instance, HMIH had an error rate of 6.3%, whereas FIH had 14.6% and NNH had20.9%, indicating that HMIH was closer to the optimal solution. HMIH consistently showed superior performanceacross many benchmarks, with lower percentage error and higher goodness values, suggesting a closer match tothe optimal tour costs. This study substantially contributes to combinatorial optimization by enhancing currentinsertion algorithms and presenting a more efficient solution for the Travelling Salesman Problem. It also createsnew possibilities for progress in heuristic design and optimization methodologies.展开更多
In this paper, we study the propagation and its failure to propagate (pinning) of a travelling wave in a Nagumo type equation, an equation that describes impulse propagation in nerve axons that also models population ...In this paper, we study the propagation and its failure to propagate (pinning) of a travelling wave in a Nagumo type equation, an equation that describes impulse propagation in nerve axons that also models population growth with Allee effect. An analytical solution is derived for the traveling wave and the work is extended to a discrete formulation with a piecewise linear reaction function. We propose an operator splitting numerical scheme to solve the equation and demonstrate that the wave either propagates or gets pinned based on how the spatial mesh is chosen.展开更多
The North China Plain and the agricultural region are crossed by the Shanxi-Beijing natural gas pipeline.Resi-dents in the area use rototillers for planting and harvesting;however,the depth of the rototillers into the...The North China Plain and the agricultural region are crossed by the Shanxi-Beijing natural gas pipeline.Resi-dents in the area use rototillers for planting and harvesting;however,the depth of the rototillers into the ground is greater than the depth of the pipeline,posing a significant threat to the safe operation of the pipeline.Therefore,it is of great significance to study the dynamic response of rotary tillers impacting pipelines to ensure the safe opera-tion of pipelines.This article focuses on the Shanxi-Beijing natural gas pipeline,utilizingfinite element simulation software to establish afinite element model for the interaction among the machinery,pipeline,and soil,and ana-lyzing the dynamic response of the pipeline.At the same time,a decision tree model is introduced to classify the damage of pipelines under different working conditions,and the boundary value and importance of each influen-cing factor on pipeline damage are derived.Considering the actual conditions in the hemp yam planting area,targeted management measures have been proposed to ensure the operational safety of the Shanxi-Beijing natural gas pipeline in this region.展开更多
The paper describes some implementation aspects of an algorithm for approximate solution of the traveling salesman problem based on the construction of convex closed contours on the initial set of points (“cities”) ...The paper describes some implementation aspects of an algorithm for approximate solution of the traveling salesman problem based on the construction of convex closed contours on the initial set of points (“cities”) and their subsequent combination into a closed path (the so-called contour algorithm or “onion husk” algorithm). A number of heuristics related to the different stages of the algorithm are considered, and various variants of the algorithm based on these heuristics are analyzed. Sets of randomly generated points of different sizes (from 4 to 90 and from 500 to 10,000) were used to test the algorithms. The numerical results obtained are compared with the results of two well-known combinatorial optimization algorithms, namely the algorithm based on the branch and bound method and the simulated annealing algorithm. .展开更多
文摘Attribute reduction is a research hotspot in rough set theory. Traditional heuristic attribute reduction methods add the most important attribute to the decision attribute set each time, resulting in multiple redundant attribute calculations, high time consumption, and low reduction efficiency. In this paper, based on the idea of sequential three-branch decision classification domain, attributes are treated as objects of three-branch division, and attributes are divided into core attributes, relatively necessary attributes, and unnecessary attributes using attribute importance and thresholds. Core attributes are added to the decision attribute set, unnecessary attributes are rejected from being added, and relatively necessary attributes are repeatedly divided until the reduction result is obtained. Experiments were conducted on 8 groups of UCI datasets, and the results show that, compared to traditional reduction methods, the method proposed in this paper can effectively reduce time consumption while ensuring classification performance.
基金supported by the Natural Science Foundation of Hunan Province(2023JJ50047,2023JJ40306)the Research Foundation of Education Bureau of Hunan Province(23A0494,20B260)the Key R&D Projects of Hunan Province(2019SK2331)。
文摘Aiming at the triangular fuzzy(TF)multi-attribute decision making(MADM)problem with a preference for the distribution density of attribute(DDA),a decision making method with TF number two-dimensional density(TFTD)operator is proposed based on the density operator theory for the decision maker(DM).Firstly,a simple TF vector clustering method is proposed,which considers the feature of TF number and the geometric distance of vectors.Secondly,the least deviation sum of squares method is used in the program model to obtain the density weight vector.Then,two TFTD operators are defined,and the MADM method based on the TFTD operator is proposed.Finally,a numerical example is given to illustrate the superiority of this method,which can not only solve the TF MADM problem with a preference for the DDA but also help the DM make an overall comparison.
基金supported in part by the National Key Laboratory of Air-based Information Perception and Fusion and the Aeronautical Science Foundation of China (Grant No. 20220001068001)National Natural Science Foundation of China (Grant No.61673327)+1 种基金Natural Science Basic Research Plan in Shaanxi Province,China (Grant No. 2023-JC-QN-0733)China IndustryUniversity-Research Innovation Foundation (Grant No. 2022IT188)。
文摘Aiming at the problem of multi-UAV pursuit-evasion confrontation, a UAV cooperative maneuver method based on an improved multi-agent deep reinforcement learning(MADRL) is proposed. In this method, an improved Comm Net network based on a communication mechanism is introduced into a deep reinforcement learning algorithm to solve the multi-agent problem. A layer of gated recurrent unit(GRU) is added to the actor-network structure to remember historical environmental states. Subsequently,another GRU is designed as a communication channel in the Comm Net core network layer to refine communication information between UAVs. Finally, the simulation results of the algorithm in two sets of scenarios are given, and the results show that the method has good effectiveness and applicability.
基金supported in part by the National Natural Science Foundation of China (Grant Nos. 62171312 and 61771330)the Tianjin Municipal Education Commission Scientific Research Project (Grant No. 2020KJ114)。
文摘Coexistence of fast and slow traveling waves without synaptic transmission has been found in hhhippocampal tissues,which is closely related to both normal brain activity and abnormal neural activity such as epileptic discharge. However, the propagation mechanism behind this coexistence phenomenon remains unclear. In this paper, a three-dimensional electric field coupled hippocampal neural network is established to investigate generation of coexisting spontaneous fast and slow traveling waves. This model captures two types of dendritic traveling waves propagating in both transverse and longitude directions: the N-methyl-D-aspartate(NMDA)-dependent wave with a speed of about 0.1 m/s and the Ca-dependent wave with a speed of about 0.009 m/s. These traveling waves are synaptic-independent and could be conducted only by the electric fields generated by neighboring neurons, which are basically consistent with the in vitro data measured experiments. It is also found that the slow Ca wave could trigger generation of fast NMDA waves in the propagation path of slow waves whereas fast NMDA waves cannot affect the propagation of slow Ca waves. These results suggest that dendritic Ca waves could acted as the source of the coexistence fast and slow waves. Furthermore, we also confirm the impact of cellular spacing heterogeneity on the onset of coexisting fast and slow waves. The local region with decreasing distances among neighbor neurons is more liable to promote the onset of spontaneous slow waves which, as sources, excite propagation of fast waves. These modeling studies provide possible biophysical mechanisms underlying the neural dynamics of spontaneous traveling waves in brain tissues.
基金supported by the National Nat-ural Science Foundation of China(No.52203376)the National Key Research and Development Program of China(No.2023YFB3813200).
文摘Traditional 3Ni weathering steel cannot completely meet the requirements for offshore engineering development,resulting in the design of novel 3Ni steel with the addition of microalloy elements such as Mn or Nb for strength enhancement becoming a trend.The stress-assisted corrosion behavior of a novel designed high-strength 3Ni steel was investigated in the current study using the corrosion big data method.The information on the corrosion process was recorded using the galvanic corrosion current monitoring method.The gradi-ent boosting decision tree(GBDT)machine learning method was used to mine the corrosion mechanism,and the importance of the struc-ture factor was investigated.Field exposure tests were conducted to verify the calculated results using the GBDT method.Results indic-ated that the GBDT method can be effectively used to study the influence of structural factors on the corrosion process of 3Ni steel.Dif-ferent mechanisms for the addition of Mn and Cu to the stress-assisted corrosion of 3Ni steel suggested that Mn and Cu have no obvious effect on the corrosion rate of non-stressed 3Ni steel during the early stage of corrosion.When the corrosion reached a stable state,the in-crease in Mn element content increased the corrosion rate of 3Ni steel,while Cu reduced this rate.In the presence of stress,the increase in Mn element content and Cu addition can inhibit the corrosion process.The corrosion law of outdoor-exposed 3Ni steel is consistent with the law based on corrosion big data technology,verifying the reliability of the big data evaluation method and data prediction model selection.
基金supported by the National Research Foundation of Korea(NRF)Grant funded by the Korea government(MSIT)(No.RS-2023-00218176)Korea Institute for Advancement of Technology(KIAT)Grant funded by the Korea government(MOTIE)(P0012724)The Competency Development Program for Industry Specialist)and the Soonchunhyang University Research Fund.
文摘In this article,multiple attribute decision-making problems are solved using the vague normal set(VNS).It is possible to generalize the vague set(VS)and q-rung fuzzy set(FS)into the q-rung vague set(VS).A log q-rung normal vague weighted averaging(log q-rung NVWA),a log q-rung normal vague weighted geometric(log q-rung NVWG),a log generalized q-rung normal vague weighted averaging(log Gq-rung NVWA),and a log generalized q-rungnormal vagueweightedgeometric(logGq-rungNVWG)operator are discussed in this article.Adescription is provided of the scoring function,accuracy function and operational laws of the log q-rung VS.The algorithms underlying these functions are also described.A numerical example is provided to extend the Euclidean distance and the Humming distance.Additionally,idempotency,boundedness,commutativity,and monotonicity of the log q-rung VS are examined as they facilitate recognizing the optimal alternative more quickly and help clarify conceptualization.We chose five anemia patients with four types of symptoms including seizures,emotional shock or hysteria,brain cause,and high fever,who had either retrograde amnesia,anterograde amnesia,transient global amnesia,post-traumatic amnesia,or infantile amnesia.Natural numbers q are used to express the results of the models.To demonstrate the effectiveness and accuracy of the models we are investigating,we compare several existing models with those that have been developed.
基金National Natural Science Foundation of China(61973037)National 173 Program Project(2019-JCJQ-ZD-324).
文摘To solve the problem of the low interference success rate of air defense missile radio fuzes due to the unified interference form of the traditional fuze interference system,an interference decision method based Q-learning algorithm is proposed.First,dividing the distance between the missile and the target into multiple states to increase the quantity of state spaces.Second,a multidimensional motion space is utilized,and the search range of which changes with the distance of the projectile,to select parameters and minimize the amount of ineffective interference parameters.The interference effect is determined by detecting whether the fuze signal disappears.Finally,a weighted reward function is used to determine the reward value based on the range state,output power,and parameter quantity information of the interference form.The effectiveness of the proposed method in selecting the range of motion space parameters and designing the discrimination degree of the reward function has been verified through offline experiments involving full-range missile rendezvous.The optimal interference form for each distance state has been obtained.Compared with the single-interference decision method,the proposed decision method can effectively improve the success rate of interference.
基金supported by the Surface Project of the National Natural Science Foundation of China(No.71273024)the Fundamental Research Funds for the Central Universities of China(2021YJS080).
文摘This study proposes a prediction model considering external weather and holiday factors to address the issue of accurately predicting urban taxi travel demand caused by complex data and numerous influencing factors.The model integrates the Complete Ensemble Empirical Mode Decomposition with Adaptive Noise(CEEMDAN)and Convolutional Long Short Term Memory Neural Network(ConvLSTM)to predict short-term taxi travel demand.The CEEMDAN decomposition method effectively decomposes time series data into a set of modal components,capturing sequence characteristics at different time scales and frequencies.Based on the sample entropy value of components,secondary processing of more complex sequence components after decomposition is employed to reduce the cumulative prediction error of component sequences and improve prediction efficiency.On this basis,considering the correlation between the spatiotemporal trends of short-term taxi traffic,a ConvLSTM neural network model with Long Short Term Memory(LSTM)time series processing ability and Convolutional Neural Networks(CNN)spatial feature processing ability is constructed to predict the travel demand for urban taxis.The combined prediction model is tested on a taxi travel demand dataset in a certain area of Beijing.The results show that the CEEMDAN-ConvLSTM prediction model outperforms the LSTM,Autoregressive Integrated Moving Average model(ARIMA),CNN,and ConvLSTM benchmark models in terms of Symmetric Mean Absolute Percentage Error(SMAPE),Root Mean Square Error(RMSE),Mean Absolute Error(MAE),and R2 metrics.Notably,the SMAPE metric exhibits a remarkable decline of 21.03%with the utilization of our proposed model.These results confirm that our study provides a highly accurate and valid model for taxi travel demand forecasting.
基金the Liaoning Province Nature Fundation Project(2022-MS-291)the National Programme for Foreign Expert Projects(G2022006008L)+2 种基金the Basic Research Projects of Liaoning Provincial Department of Education(LJKMZ20220781,LJKMZ20220783,LJKQZ20222457)King Saud University funded this study through theResearcher Support Program Number(RSPD2023R704)King Saud University,Riyadh,Saudi Arabia.
文摘The existing algorithms for solving multi-objective optimization problems fall into three main categories:Decomposition-based,dominance-based,and indicator-based.Traditional multi-objective optimization problemsmainly focus on objectives,treating decision variables as a total variable to solve the problem without consideringthe critical role of decision variables in objective optimization.As seen,a variety of decision variable groupingalgorithms have been proposed.However,these algorithms are relatively broad for the changes of most decisionvariables in the evolution process and are time-consuming in the process of finding the Pareto frontier.To solvethese problems,a multi-objective optimization algorithm for grouping decision variables based on extreme pointPareto frontier(MOEA-DV/EPF)is proposed.This algorithm adopts a preprocessing rule to solve the Paretooptimal solution set of extreme points generated by simultaneous evolution in various target directions,obtainsthe basic Pareto front surface to determine the convergence effect,and analyzes the convergence and distributioneffects of decision variables.In the later stages of algorithm optimization,different mutation strategies are adoptedaccording to the nature of the decision variables to speed up the rate of evolution to obtain excellent individuals,thusenhancing the performance of the algorithm.Evaluation validation of the test functions shows that this algorithmcan solve the multi-objective optimization problem more efficiently.
基金The work was supported by Humanities and Social Sciences Fund of the Ministry of Education(No.22YJA630119)the National Natural Science Foundation of China(No.71971051)Natural Science Foundation of Hebei Province(No.G2021501004).
文摘With the development of big data and social computing,large-scale group decisionmaking(LGDM)is nowmerging with social networks.Using social network analysis(SNA),this study proposes an LGDM consensus model that considers the trust relationship among decisionmakers(DMs).In the process of consensusmeasurement:the social network is constructed according to the social relationship among DMs,and the Louvain method is introduced to classify social networks to form subgroups.In this study,the weights of each decision maker and each subgroup are computed by comprehensive network weights and trust weights.In the process of consensus improvement:A feedback mechanism with four identification and two direction rules is designed to guide the consensus of the improvement process.Based on the trust relationship among DMs,the preferences are modified,and the corresponding social network is updated to accelerate the consensus.Compared with the previous research,the proposedmodel not only allows the subgroups to be reconstructed and updated during the adjustment process,but also improves the accuracy of the adjustment by the feedbackmechanism.Finally,an example analysis is conducted to verify the effectiveness and flexibility of the proposed method.Moreover,compared with previous studies,the superiority of the proposed method in solving the LGDM problem is highlighted.
基金supported by National Key Research and Development Program of China(2018YFC1504502).
文摘Mobile edge computing(MEC)-enabled satellite-terrestrial networks(STNs)can provide Internet of Things(IoT)devices with global computing services.Sometimes,the network state information is uncertain or unknown.To deal with this situation,we investigate online learning-based offloading decision and resource allocation in MEC-enabled STNs in this paper.The problem of minimizing the average sum task completion delay of all IoT devices over all time periods is formulated.We decompose this optimization problem into a task offloading decision problem and a computing resource allocation problem.A joint optimization scheme of offloading decision and resource allocation is then proposed,which consists of a task offloading decision algorithm based on the devices cooperation aided upper confidence bound(UCB)algorithm and a computing resource allocation algorithm based on the Lagrange multiplier method.Simulation results validate that the proposed scheme performs better than other baseline schemes.
基金support from the Youth Innovation Promotion Association of Chinese Academy of Sciences (Grant No.2019319)support from the Start-up Foundation of Suzhou Institute of Nano-Tech and Nano-Bionics,CAS,Suzhou (Grant No.Y9AAD110)。
文摘A Josephson traveling wave parametric amplifier(JTWPA),which is a quantum-limited amplifier with high gain and large bandwidth,is the core device of large-scale measurement and control systems for quantum computing.A typical JTWPA consists of thousands of Josephson junctions connected in series to form a transmission line and hundreds of shunt LC resonators periodically loaded along the line for phase matching.Because the variation of these capacitors and inductors can be detrimental to their high-frequency characteristics,the fabrication of a JTWPA typically necessitates precise processing equipment.To guide the fabrication process and further improve the design for manufacturability,it is necessary to understand how each electronic component affects the amplifier.In this paper,we use the harmonic balance method to conduct a comprehensive study on the impact of nonuniformity and fabrication yield of the electronic components on the performance of a JTWPA.The results provide insightful and scientific guidance for device design and fabrication processes.
基金supported in part by the Central Government Guides Local Science and TechnologyDevelopment Funds(Grant No.YDZJSX2021A038)in part by theNational Natural Science Foundation of China under(Grant No.61806138)in part by the China University Industry-University-Research Collaborative Innovation Fund(Future Network Innovation Research and Application Project)(Grant 2021FNA04014).
文摘The large-scale multi-objective optimization algorithm(LSMOA),based on the grouping of decision variables,is an advanced method for handling high-dimensional decision variables.However,in practical problems,the interaction among decision variables is intricate,leading to large group sizes and suboptimal optimization effects;hence a large-scale multi-objective optimization algorithm based on weighted overlapping grouping of decision variables(MOEAWOD)is proposed in this paper.Initially,the decision variables are perturbed and categorized into convergence and diversity variables;subsequently,the convergence variables are subdivided into groups based on the interactions among different decision variables.If the size of a group surpasses the set threshold,that group undergoes a process of weighting and overlapping grouping.Specifically,the interaction strength is evaluated based on the interaction frequency and number of objectives among various decision variables.The decision variable with the highest interaction in the group is identified and disregarded,and the remaining variables are then reclassified into subgroups.Finally,the decision variable with the strongest interaction is added to each subgroup.MOEAWOD minimizes the interactivity between different groups and maximizes the interactivity of decision variables within groups,which contributed to the optimized direction of convergence and diversity exploration with different groups.MOEAWOD was subjected to testing on 18 benchmark large-scale optimization problems,and the experimental results demonstrate the effectiveness of our methods.Compared with the other algorithms,our method is still at an advantage.
文摘Objectives Renal replacement therapy(RRT)is increasingly adopted for critically ill patients diagnosed with acute kidney injury,but the optimal time for initiation remains unclear and prognosis is uncertain,leading to medical complexity,ethical conflicts,and decision dilemmas in intensive care unit(ICU)settings.This study aimed to develop a decision aid(DA)for the family surrogate of critically ill patients to support their engagement in shared decision-making process with clinicians.Methods Development of DA employed a systematic process with user-centered design(UCD)principle,which included:(i)competitive analysis:searched,screened,and assessed the existing DAs to gather insights for design strategies,developmental techniques,and functionalities;(ii)user needs assessment:interviewed family surrogates in our hospital to explore target user group's decision-making experience and identify their unmet needs;(iii)evidence syntheses:integrate latest clinical evidence and pertinent information to inform the content development of DA.Results The competitive analysis included 16 relevant DAs,from which we derived valuable insights using existing resources.User decision needs were explored among a cohort of 15 family surrogates,revealing four thematic issues in decision-making,including stuck into dilemmas,sense of uncertainty,limited capacity,and delayed decision confirmation.A total of 27 articles were included for evidence syntheses.Relevant decision making knowledge on disease and treatment,as delineated in the literature sourced from decision support system or clinical guidelines,were formatted as the foundational knowledge base.Twenty-one items of evidence were extracted and integrated into the content panels of benefits and risks of RRT,possible outcomes,and reasons to choose.The DA was drafted into a web-based phototype using the elements of UCD.This platform could guide users in their preparation of decision-making through a sequential four-step process:identifying treatment options,weighing the benefits and risks,clarifying personal preferences and values,and formulating a schedule for formal shared decision-making with clinicians.Conclusions We developed a rapid prototype of DA tailored for family surrogate decision makers of critically ill patients in need of RRT in ICU setting.Future studies are needed to evaluate its usability,feasibility,and clinical effects of this intervention.
基金the Deanship of Scientific Research at Imam Mohammad Ibn Saud Islamic University(IMSIU)(Grant Number IMSIU-RP23030).
文摘Genetic algorithms(GAs)are very good metaheuristic algorithms that are suitable for solving NP-hard combinatorial optimization problems.AsimpleGAbeginswith a set of solutions represented by a population of chromosomes and then uses the idea of survival of the fittest in the selection process to select some fitter chromosomes.It uses a crossover operator to create better offspring chromosomes and thus,converges the population.Also,it uses a mutation operator to explore the unexplored areas by the crossover operator,and thus,diversifies the GA search space.A combination of crossover and mutation operators makes the GA search strong enough to reach the optimal solution.However,appropriate selection and combination of crossover operator and mutation operator can lead to a very good GA for solving an optimization problem.In this present paper,we aim to study the benchmark traveling salesman problem(TSP).We developed several genetic algorithms using seven crossover operators and six mutation operators for the TSP and then compared them to some benchmark TSPLIB instances.The experimental studies show the effectiveness of the combination of a comprehensive sequential constructive crossover operator and insertion mutation operator for the problem.The GA using the comprehensive sequential constructive crossover with insertion mutation could find average solutions whose average percentage of excesses from the best-known solutions are between 0.22 and 14.94 for our experimented problem instances.
基金Anhui Province Natural Science Research Project of Colleges and Universities(2023AH040321)Excellent Scientific Research and Innovation Team of Anhui Colleges(2022AH010098).
文摘The presence of numerous uncertainties in hybrid decision information systems(HDISs)renders attribute reduction a formidable task.Currently available attribute reduction algorithms,including those based on Pawlak attribute importance,Skowron discernibility matrix,and information entropy,struggle to effectively manages multiple uncertainties simultaneously in HDISs like the precise measurement of disparities between nominal attribute values,and attributes with fuzzy boundaries and abnormal values.In order to address the aforementioned issues,this paper delves into the study of attribute reduction withinHDISs.First of all,a novel metric based on the decision attribute is introduced to solve the problem of accurately measuring the differences between nominal attribute values.The newly introduced distance metric has been christened the supervised distance that can effectively quantify the differences between the nominal attribute values.Then,based on the newly developed metric,a novel fuzzy relationship is defined from the perspective of“feedback on parity of attribute values to attribute sets”.This new fuzzy relationship serves as a valuable tool in addressing the challenges posed by abnormal attribute values.Furthermore,leveraging the newly introduced fuzzy relationship,the fuzzy conditional information entropy is defined as a solution to the challenges posed by fuzzy attributes.It effectively quantifies the uncertainty associated with fuzzy attribute values,thereby providing a robust framework for handling fuzzy information in hybrid information systems.Finally,an algorithm for attribute reduction utilizing the fuzzy conditional information entropy is presented.The experimental results on 12 datasets show that the average reduction rate of our algorithm reaches 84.04%,and the classification accuracy is improved by 3.91%compared to the original dataset,and by an average of 11.25%compared to the other 9 state-of-the-art reduction algorithms.The comprehensive analysis of these research results clearly indicates that our algorithm is highly effective in managing the intricate uncertainties inherent in hybrid data.
基金the Centre of Excellence in Mobile and e-Services,the University of Zululand,Kwadlangezwa,South Africa.
文摘The studypresents theHalfMax InsertionHeuristic (HMIH) as a novel approach to solving theTravelling SalesmanProblem (TSP). The goal is to outperform existing techniques such as the Farthest Insertion Heuristic (FIH) andNearest Neighbour Heuristic (NNH). The paper discusses the limitations of current construction tour heuristics,focusing particularly on the significant margin of error in FIH. It then proposes HMIH as an alternative thatminimizes the increase in tour distance and includes more nodes. HMIH improves tour quality by starting withan initial tour consisting of a ‘minimum’ polygon and iteratively adding nodes using our novel Half Max routine.The paper thoroughly examines and compares HMIH with FIH and NNH via rigorous testing on standard TSPbenchmarks. The results indicate that HMIH consistently delivers superior performance, particularly with respectto tour cost and computational efficiency. HMIH’s tours were sometimes 16% shorter than those generated by FIHand NNH, showcasing its potential and value as a novel benchmark for TSP solutions. The study used statisticalmethods, including Friedman’s Non-parametric Test, to validate the performance of HMIH over FIH and NNH.This guarantees that the identified advantages are statistically significant and consistent in various situations. Thiscomprehensive analysis emphasizes the reliability and efficiency of the heuristic, making a compelling case for itsuse in solving TSP issues. The research shows that, in general, HMIH fared better than FIH in all cases studied,except for a few instances (pr439, eil51, and eil101) where FIH either performed equally or slightly better thanHMIH. HMIH’s efficiency is shown by its improvements in error percentage (δ) and goodness values (g) comparedto FIH and NNH. In the att48 instance, HMIH had an error rate of 6.3%, whereas FIH had 14.6% and NNH had20.9%, indicating that HMIH was closer to the optimal solution. HMIH consistently showed superior performanceacross many benchmarks, with lower percentage error and higher goodness values, suggesting a closer match tothe optimal tour costs. This study substantially contributes to combinatorial optimization by enhancing currentinsertion algorithms and presenting a more efficient solution for the Travelling Salesman Problem. It also createsnew possibilities for progress in heuristic design and optimization methodologies.
文摘In this paper, we study the propagation and its failure to propagate (pinning) of a travelling wave in a Nagumo type equation, an equation that describes impulse propagation in nerve axons that also models population growth with Allee effect. An analytical solution is derived for the traveling wave and the work is extended to a discrete formulation with a piecewise linear reaction function. We propose an operator splitting numerical scheme to solve the equation and demonstrate that the wave either propagates or gets pinned based on how the spatial mesh is chosen.
文摘The North China Plain and the agricultural region are crossed by the Shanxi-Beijing natural gas pipeline.Resi-dents in the area use rototillers for planting and harvesting;however,the depth of the rototillers into the ground is greater than the depth of the pipeline,posing a significant threat to the safe operation of the pipeline.Therefore,it is of great significance to study the dynamic response of rotary tillers impacting pipelines to ensure the safe opera-tion of pipelines.This article focuses on the Shanxi-Beijing natural gas pipeline,utilizingfinite element simulation software to establish afinite element model for the interaction among the machinery,pipeline,and soil,and ana-lyzing the dynamic response of the pipeline.At the same time,a decision tree model is introduced to classify the damage of pipelines under different working conditions,and the boundary value and importance of each influen-cing factor on pipeline damage are derived.Considering the actual conditions in the hemp yam planting area,targeted management measures have been proposed to ensure the operational safety of the Shanxi-Beijing natural gas pipeline in this region.
文摘The paper describes some implementation aspects of an algorithm for approximate solution of the traveling salesman problem based on the construction of convex closed contours on the initial set of points (“cities”) and their subsequent combination into a closed path (the so-called contour algorithm or “onion husk” algorithm). A number of heuristics related to the different stages of the algorithm are considered, and various variants of the algorithm based on these heuristics are analyzed. Sets of randomly generated points of different sizes (from 4 to 90 and from 500 to 10,000) were used to test the algorithms. The numerical results obtained are compared with the results of two well-known combinatorial optimization algorithms, namely the algorithm based on the branch and bound method and the simulated annealing algorithm. .