車輛行駛路線優化（Vehicle Routing Problem）
標簽： Vehicle Routing Problem 車輛行駛
上傳時間： 2014-10-13
上傳用戶：561596
this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once) Notes: 1. Input error checking included 2. Inputs can be specified in any order, so long as the parameter pairs are specified as a parameter , value
標簽： Traveling Salesman solution Problem
上傳時間： 2013-12-22
上傳用戶：ruixue198909
算法的許多例子都是最優化問題（ optimization problem），每個最優化問題都包含一組限制條件（ c o n s t r a i n t）和一個優化函數（ optimization function），符合限制條件的問題求解方案稱為可行解（ feasible solution），使優化函數取得最佳值的可行解稱為最優解（optimal solution）。
標簽： optimization problem 算法
上傳時間： 2014-08-25
上傳用戶：123456wh
Problem Statement You are given a string input. You are to find the longest substring of input such that the reversal of the substring is also a substring of input. In case of a tie, return the string that occurs earliest in input. Definition Class: ReverseSubstring Method: findReversed Parameters: string Returns: string Method signature: string findReversed(string input) (be sure your method is public) Notes The substring and its reversal may overlap partially or completely. The entire original string is itself a valid substring (see example 4). Constraints input will contain between 1 and 50 characters, inclusive. Each character of input will be an uppercase letter ( A - Z ). Examples 0) "XBCDEFYWFEDCBZ" Returns: "BCDEF" We see that the reverse of BCDEF is FEDCB, which appears later in the string. 1)
上傳時間： 2015-09-21
上傳用戶：sunjet
traveling saleman problem的代碼
標簽： traveling saleman problem 代碼
上傳時間： 2014-01-03
上傳用戶：yph853211
traveling saleman problem的一個Ｃ＋＋算法
標簽： traveling saleman problem 算法
上傳時間： 2015-10-08
上傳用戶：水口鴻勝電器
主要解決旅行商問題(traveling saleman problem,簡稱tsp，即已知n個城市之間的相互距離，現有一個推銷員必須遍訪這n個城市，并且每個城市只能訪問一次，最后又必須返回出發城市，求解最短距離的遺傳算法。
標簽： traveling saleman problem tsp
上傳時間： 2015-10-09
上傳用戶：cylnpy
fortran CG-FFT程序 Conjugate gradient package for solving complex matrix equations
標簽： Conjugate equations gradient fortran
上傳時間： 2015-10-10
上傳用戶：dyctj
用于求解TSP(Traveling salesman problem，旅行商問題)問題，基本執行見run.bat, 其它詳見其中的readme.txt。（實例為TSPLIB格式，見myprojects目錄，包括eil51, d198, lin318等小型問題，以及1000到3000城市之間的例子，基本能得到最優解）
標簽： Traveling salesman problem TSP
上傳時間： 2015-10-16
上傳用戶：myworkpost
This paper studies the problem of categorical data clustering, especially for transactional data characterized by high dimensionality and large volume. Starting from a heuristic method of increasing the height-to-width ratio of the cluster histogram, we develop a novel algorithm – CLOPE, which is very fast and scalable, while being quite effective. We demonstrate the performance of our algorithm on two real world
標簽： data transactional categorical clustering
上傳時間： 2015-10-24
上傳用戶：evil
