搜索结果

找到约 16 项符合 travelling 的查询结果

Java编程 使用进化计算算法解决TSP(Travelling Sales man Problem)问题的算法实现。程序显示了进化计算在解决NP-Hard的传统难题上的优势。

使用进化计算算法解决TSP(Travelling Sales man Problem)问题的算法实现。程序显示了进化计算在解决NP-Hard的传统难题上的优势。
https://www.eeworm.com/dl/633/487182.html
下载: 186
查看: 1444

Java编程 Flight panel java GUI selecting the departure city, origin city, the day and time of travel, number

Flight panel java GUI selecting the departure city, origin city, the day and time of travel, number of adults and children travelling and will calculate the total order.
https://www.eeworm.com/dl/633/476369.html
下载: 54
查看: 1133

技术资料 dw1000双向测距的实现(英文版)

INTRODUCTION  In this application note two-way ranging (TWR) scheme as used by Decawave’s example application (DecaRanging) is described. TWR is a basic concept to calculate the distance between two objects by determining the time of flight (TOF) of signals tr ...
https://www.eeworm.com/dl/843118.html
下载: 8
查看: 9682

数学计算 旅行商问题

旅行商问题,即TSP问题(Travelling Salesman Problem)是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市,他必须选择所要走的路径,路经的限制是每个城市只能拜访一次,而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 ...
https://www.eeworm.com/dl/641/232931.html
下载: 130
查看: 1053

数值算法/人工智能 TSP问题的动态规划求解。问题描述:旅行商问题

TSP问题的动态规划求解。问题描述:旅行商问题,即TSP问题(Travelling Salesman Problem)是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市,他必须选择所要走的路径,路经的限制是每个城市只能拜访一次,而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 ...
https://www.eeworm.com/dl/518/298554.html
下载: 146
查看: 1060

单片机开发 A new cable fault location method based on wavelet reconstruction is proposed. In this method the

A new cable fault location method based on wavelet reconstruction is proposed. In this method the difference between the currents of faulty phase and sound phase under the high voltage pulse excitation is used as the measured signal and is decomposed in multi-scale by wavelet transform, then reconst ...
https://www.eeworm.com/dl/648/255017.html
下载: 82
查看: 1121