Description: 一个使用免疫算法实现物流调度的源代码，使用SQL Server 2005+Visual Studio C# 2005开发，可以在地图上描出优化路径。压缩包中的wldd.bak和wldd1.bak为数据库文件，将其恢复到SQL Server 2005中即可。需要注意的是，默认的连接字符串为
connectionString=\"Data Source=YANXL\\SQLEXPRESS Initial Catalog=wldd1 User ID=sa Password=dream\"
初始密码可以改掉-an immunosuppressive logistics scheduling algorithm source code. SQL Server 2005 Visual Studio 2005 C# development, on the map can delineate optimal path. Compressed and the wldd.bak wldd1.bak for database files, will be restored to its SQL Server 2005 will be. Need to pay attention to, The default link to the string connectionString = "Data Source = YA NXL \\ SQLEXPRESS Initial Catalog wldd1 User ID = Password = = sa dream "initial password can fit Platform: |
Size: 7264379 |
Author:闫小良 |
Hits:
Description: 一个使用免疫算法实现物流调度的源代码，使用SQL Server 2005+Visual Studio C# 2005开发，可以在地图上描出优化路径。压缩包中的wldd.bak和wldd1.bak为数据库文件，将其恢复到SQL Server 2005中即可。需要注意的是，默认的连接字符串为
connectionString="Data Source=YANXL\SQLEXPRESS Initial Catalog=wldd1 User ID=sa Password=dream"
初始密码可以改掉-an immunosuppressive logistics scheduling algorithm source code. SQL Server 2005 Visual Studio 2005 C# development, on the map can delineate optimal path. Compressed and the wldd.bak wldd1.bak for database files, will be restored to its SQL Server 2005 will be. Need to pay attention to, The default link to the string connectionString = "Data Source = YA NXL \ SQLEXPRESS Initial Catalog wldd1 User ID = Password = = sa dream "initial password can fit Platform: |
Size: 10878976 |
Author:闫小良 |
Hits:
Description: 魔力宝贝地图浏览，编辑修改程序全部源码。包含魔力/石器图档解码算法。-CROSSGATE map view, edit and modify the program all the source code. Contains the CG/SA bin file decoding algorithm. Platform: |
Size: 460800 |
Author:露水 |
Hits:
Description: VB中最短路径算法的设计思路，并附带源码。-VB in the shortest path algorithm design ideas, and comes with source code. Platform: |
Size: 5120 |
Author:wajika |
Hits:
Description: c++编写的模拟退火算法旅行家问题，可以执行，包含源代码 -c++ written in the problem simulated annealing algorithm traveler, you can perform, including the source code Platform: |
Size: 2048 |
Author:xxx |
Hits:
Description: 基于MATLAB 使用模拟退火算法求解旅行商问题的源码实现。解压后就可以用。-MATLAB based simulated annealing algorithm using the source code for the traveling salesman problem implementation. After decompression can be used. Platform: |
Size: 4096 |
Author:徐小夏 |
Hits:
Description: 压缩包中的工程包含了三种风格。adtstyle文件夹对应的是抽象数据风格，invretstyle文件夹对应的是调用返回风格，pipestyle文件夹对应的是管道过滤器风格。源代码是用MyEclipse 6.5写的。可直接将工程导入MyEclipse中即可运行，也可以运行SA文件夹里面的start.bat选择某个风格运行。
抽象数据风格的按字母排序算法用的是快速排序算法，代码位于SA\src\adtstyle\impl.AlphabetizerImpl.java，调用返回风格用的是插入排序算法，代码位于SA\src\invretstyle\Alphabetizer.java，管道过滤器风格用的是堆排序算法，代码位于SA\src\pipestyle\Alphabetizer.java。三种风格都对一些噪音词汇进行过滤，private static final String ignore = "a#$an#$and#$as#$is#$the#$of#$"，上面语句中由"#$"间隔开的就是噪音词汇。SA\input.txt是输入文件，可对其进行配置来解析不同的文本。-The compression works package includes three different styles. adtstyle folder corresponding abstract data style, invretstyle folder corresponding to the call returns the style, pipestyle folder corresponding to the pipe filter style. The source code is written using MyEclipse 6.5. Directly to the project into MyEclipse to run can run SA folder inside the start.bat select a style run. Abstract data-style alphabetical sorting algorithm is quick sort algorithm, the code is located in SA, \ src \ adtstyle \ impl.AlphabetizerImpl.java, call return style is the insertion sort algorithm, the code in SA \ src \ invretstyle \ Alphabetizer.java pipe filter style using a heap sort algorithm, the code is located in SA, \ the src the \ pipestyle \ Alphabetizer.java. Three styles of some noise words filter private static final String ignore = " a# $ an# $ and# $ as# $ is# $# $ of# $" , " # $" in the above statement spaced noise words. SA, \ input.txt yes the input file can be confi Platform: |
Size: 38912 |
Author:杨诗听 |
Hits:
Description: this a source code to solve TSP problem with obstacle in warehouse. the distance between nodes is calculated by A* algorithm and SA algorithm within the source code returns the sequence which is best sequence.
how to use the code::
First you need to put how many code you wanna visit.
second please put the x coordinate and y coordinate.
( if you want to change the map information, please change the map in SAFuction class.and also change the width and height.-this is a source code to solve TSP problem with obstacle in warehouse. the distance between nodes is calculated by A* algorithm and SA algorithm within the source code returns the sequence which is best sequence.
how to use the code::
First you need to put how many code you wanna visit.
second please put the x coordinate and y coordinate.
( if you want to change the map information, please change the map in SAFuction class.and also change the width and height. Platform: |
Size: 9216 |
Author:taeho Noh |
Hits:
Search - sa algorithm source code