车辆行驶路线优化（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
