Search - paths problem

Search - paths problem - List

[matlab] TSP DL : 0: 利用遗传算法求解旅行商问题旅行商问题，即TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 -Traveling salesman problem using genetic algorithm traveling salesman problem, namely, the problem TSP (Travelling Salesman Problem) is one of the famous field of mathematics. Suppose a business trip to visit n cities, he must choose the path to go, pass through the restriction is to visit each city only once, and finally go back to the original departure city. Path selection objective is to get the path distance to the minimum value among all paths.
Date : 2025-12-19 Size : 7kb User : yanzhongyuan
[matlab] abc DL : 0: 行商问题是一个经典的NP完全问题,多人旅行商问题的求解则更具挑战性。以往对求解多人旅行商问题的研究局限于以所有成员路径总和最小为优化标准-Salesmen problem is a classical NP complete problem, many people are solving the traveling salesman problem more challenging. Solving the traveling salesman problem of many previous studies limited to minimize the sum of all the members of the paths to optimize the standard
Date : 2025-12-19 Size : 245kb User : yuhui
[matlab] TSP DL : 0: 旅行商问题，即TSP问题（Travelling Salesman Problem）又译为旅行推销员问题、货郎担问题，是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路径的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。-Traveling Salesman Problem, or TSP problem (Travelling Salesman Problem) also translated as the traveling salesman problem, traveling salesman problem is one of the well-known problems in the field of mathematics. Suppose you have a travel business to visit n cities, he must choose which path to go, limiting the path is to visit each city only once, and the last to return to the original departure city. Select the destination path is the requirement for the minimum distance path was among all paths.
Date : 2025-12-19 Size : 1kb User : 艾岳巍
[matlab] GM-PHD1 DL : 1: Over-the-horizon radar (OTHR) exploits skywave propagation of high-frequency signals to detect and track targets, which are different from the conventional radar. It has received wide attention because of its wide area surveillance, long detection range, strong anti-stealth ability, the capability of the long early warning time, and so on. In OTHR, a significant problem is the effect of multipath propagation, which causes multiple detections via different propagation paths for a target with missed detections and false alarms at the receiver [1–6]. Nevertheless, the conventional tracking algorithms, such as probabilistic data association (PDA) [7–9], presume that a single-measurement per target, it may consider the other measurements of the same target as clutter, and multiple tracks are produced when a single target is present. Therefore, these methods cannot effectively solve the multipath propagation problem.(Conventional multitarget tracking systems presume that each target can produce at most one measurement per scan. Due to the multiple ionospheric propagation paths in over-the-horizon radar (OTHR), this assumption is not valid. To solve this problem, this paper proposes a novel tracking algorithm based on the theory of finite set statistics (FISST) called the multipath probability hypothesis density (MP-PHD) filter in cluttered environments. First, the FISST is used to derive the update equation, and then Gaussian mixture (GM) is introduced to derive the closed-form solution of the MP-PHD filter. Moreover, the extended Kalman filter (EKF) is presented to deal with the nonlinear problem of the measurement model in OTHR. Eventually, the simulation results are provided to demonstrate the effectiveness of the proposed filter.)
Date : 2025-12-19 Size : 18kb User : ioeyoyo