The dynamic traveling salesman problem(DTSP)is significant in logistics distribution in real-world applications in smart cities,but it is uncertain and difficult to solve.This paper proposes a scheme library-based ant...The dynamic traveling salesman problem(DTSP)is significant in logistics distribution in real-world applications in smart cities,but it is uncertain and difficult to solve.This paper proposes a scheme library-based ant colony optimization(ACO)with a two-optimization(2-opt)strategy to solve the DTSP efficiently.The work is novel and contributes to three aspects:problemmodel,optimization framework,and algorithmdesign.Firstly,in the problem model,traditional DTSP models often consider the change of travel distance between two nodes over time,while this paper focuses on a special DTSP model in that the node locations change dynamically over time.Secondly,in the optimization framework,the ACO algorithm is carried out in an offline optimization and online application framework to efficiently reuse the historical information to help fast respond to the dynamic environment.The framework of offline optimization and online application is proposed due to the fact that the environmental change inDTSPis caused by the change of node location,and therefore the newenvironment is somehowsimilar to certain previous environments.This way,in the offline optimization,the solutions for possible environmental changes are optimized in advance,and are stored in a mode scheme library.In the online application,when an environmental change is detected,the candidate solutions stored in the mode scheme library are reused via ACO to improve search efficiency and reduce computational complexity.Thirdly,in the algorithm design,the ACO cooperates with the 2-opt strategy to enhance search efficiency.To evaluate the performance of ACO with 2-opt,we design two challenging DTSP cases with up to 200 and 1379 nodes and compare them with other ACO and genetic algorithms.The experimental results show that ACO with 2-opt can solve the DTSPs effectively.展开更多
In this research we are going to define two new concepts: a) “The Potential of Events” (EP) and b) “The Catholic Information” (CI). The term CI derives from the ancient Greek language and declares all the Catholic...In this research we are going to define two new concepts: a) “The Potential of Events” (EP) and b) “The Catholic Information” (CI). The term CI derives from the ancient Greek language and declares all the Catholic (general) Logical Propositions (<img src="Edit_5f13a4a5-abc6-4bc5-9e4c-4ff981627b2a.png" width="33" height="21" alt="" />) which will true for every element of a set A. We will study the Riemann Hypothesis in two stages: a) By using the EP we will prove that the distribution of events e (even) and o (odd) of Square Free Numbers (SFN) on the axis Ax(N) of naturals is Heads-Tails (H-T) type. b) By using the CI we will explain the way that the distribution of prime numbers can be correlated with the non-trivial zeros of the function <em>ζ</em>(<em>s</em>) of Riemann. The Introduction and the Chapter 2 are necessary for understanding the solution. In the Chapter 3 we will present a simple method of forecasting in many very useful applications (e.g. financial, technological, medical, social, etc) developing a generalization of this new, proven here, theory which we finally apply to the solution of RH. The following Introduction as well the Results with the Discussion at the end shed light about the possibility of the proof of all the above. The article consists of 9 chapters that are numbered by 1, 2, …, 9.展开更多
针对多模态多目标优化中种群多样性难以维持和所得等价Pareto最优解数量不足问题,提出一种融合聚类和小生境搜索的多模态多目标优化算法(multimodal multi-objective optimization algorithm with clustering and niching searching,CSS...针对多模态多目标优化中种群多样性难以维持和所得等价Pareto最优解数量不足问题,提出一种融合聚类和小生境搜索的多模态多目标优化算法(multimodal multi-objective optimization algorithm with clustering and niching searching,CSSMPIO)。首先利用基于聚类的特殊拥挤距离非支配排序方法(clustering-based special crowding distance,CSCD)初始化种群;引入自适应物种形成策略生成稳定的小生境,在不同的小生境子空间并行搜索和保持等价Pareto最优解;采用特殊拥挤距离非支配排序策略实现个体选优、精英学习策略避免过早收敛。通过在14个多模态多目标函数上进行测试,并与7种新提出的多模态多目标优化算法进行对比实验以及Wilcoxon秩和检验发现,CSSMPIO的总体性能优于对比算法。最后将算法用于基于地图的测试问题,进一步证明了算法的有效性。展开更多
基金supported in part by the National Research Foundation of Korea (NRF-2021H1D3A2A01082705).
文摘The dynamic traveling salesman problem(DTSP)is significant in logistics distribution in real-world applications in smart cities,but it is uncertain and difficult to solve.This paper proposes a scheme library-based ant colony optimization(ACO)with a two-optimization(2-opt)strategy to solve the DTSP efficiently.The work is novel and contributes to three aspects:problemmodel,optimization framework,and algorithmdesign.Firstly,in the problem model,traditional DTSP models often consider the change of travel distance between two nodes over time,while this paper focuses on a special DTSP model in that the node locations change dynamically over time.Secondly,in the optimization framework,the ACO algorithm is carried out in an offline optimization and online application framework to efficiently reuse the historical information to help fast respond to the dynamic environment.The framework of offline optimization and online application is proposed due to the fact that the environmental change inDTSPis caused by the change of node location,and therefore the newenvironment is somehowsimilar to certain previous environments.This way,in the offline optimization,the solutions for possible environmental changes are optimized in advance,and are stored in a mode scheme library.In the online application,when an environmental change is detected,the candidate solutions stored in the mode scheme library are reused via ACO to improve search efficiency and reduce computational complexity.Thirdly,in the algorithm design,the ACO cooperates with the 2-opt strategy to enhance search efficiency.To evaluate the performance of ACO with 2-opt,we design two challenging DTSP cases with up to 200 and 1379 nodes and compare them with other ACO and genetic algorithms.The experimental results show that ACO with 2-opt can solve the DTSPs effectively.
文摘In this research we are going to define two new concepts: a) “The Potential of Events” (EP) and b) “The Catholic Information” (CI). The term CI derives from the ancient Greek language and declares all the Catholic (general) Logical Propositions (<img src="Edit_5f13a4a5-abc6-4bc5-9e4c-4ff981627b2a.png" width="33" height="21" alt="" />) which will true for every element of a set A. We will study the Riemann Hypothesis in two stages: a) By using the EP we will prove that the distribution of events e (even) and o (odd) of Square Free Numbers (SFN) on the axis Ax(N) of naturals is Heads-Tails (H-T) type. b) By using the CI we will explain the way that the distribution of prime numbers can be correlated with the non-trivial zeros of the function <em>ζ</em>(<em>s</em>) of Riemann. The Introduction and the Chapter 2 are necessary for understanding the solution. In the Chapter 3 we will present a simple method of forecasting in many very useful applications (e.g. financial, technological, medical, social, etc) developing a generalization of this new, proven here, theory which we finally apply to the solution of RH. The following Introduction as well the Results with the Discussion at the end shed light about the possibility of the proof of all the above. The article consists of 9 chapters that are numbered by 1, 2, …, 9.
文摘针对多模态多目标优化中种群多样性难以维持和所得等价Pareto最优解数量不足问题,提出一种融合聚类和小生境搜索的多模态多目标优化算法(multimodal multi-objective optimization algorithm with clustering and niching searching,CSSMPIO)。首先利用基于聚类的特殊拥挤距离非支配排序方法(clustering-based special crowding distance,CSCD)初始化种群;引入自适应物种形成策略生成稳定的小生境,在不同的小生境子空间并行搜索和保持等价Pareto最优解;采用特殊拥挤距离非支配排序策略实现个体选优、精英学习策略避免过早收敛。通过在14个多模态多目标函数上进行测试,并与7种新提出的多模态多目标优化算法进行对比实验以及Wilcoxon秩和检验发现,CSSMPIO的总体性能优于对比算法。最后将算法用于基于地图的测试问题,进一步证明了算法的有效性。
