登录
首页 » matlab » 模拟退火算法

模拟退火算法

于 2020-06-17 发布
0 191
下载积分: 1 下载次数: 2

代码说明:

说明:  智能算法模拟退火算法(Simulate Anneal,SA)是一种通用概率演算法,用来在一个大的搜寻空间内找寻命题的最优解。模拟退火是由在1983年所发明的。在1985年也独立发明此演算法。模拟退火算法是解决TSP问题的有效方法之一。(Simulate Anneal (SA) is a general probabilistic algorithm to Simulate the optimal solution of proposition in a large search space. Simulated annealing was developed by. The algorithm was also independently invented in 1985. Simulated annealing algorithm is one of the effective methods to solve TSP problem)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • 地址特别卡后台通信
    地址特别卡后台通信程序-address special card background Communication Program
    2022-02-16 03:58:50下载
    积分:1
  • 用Java实现断点续传
    用Java实现断点续传-using Java HTTP
    2022-02-01 10:36:50下载
    积分:1
  • JavaScript和Flash的通信
    JavaScript和Flash的通信-JavaScript and Flash Communication
    2022-07-28 11:42:38下载
    积分:1
  • 具有异形窗口的电话的
    具有异形窗口的网络电话的程序-Profiled window with the telephone network procedures
    2022-02-03 01:04:46下载
    积分:1
  • udt.sdk.4.9.tar
    UDT(UDP-based Data Transfer Protocol,简称UDT)是一种互联网数据传输协议。UDT建于UDP之上,并引入新的拥塞控制和数据可靠性控制机制。UDT是面向连接的双向的应用层协议。它同时支持可靠的数据流传输和部分可靠的数据报传输。 (UDT is a reliable UDP based application level data transport protocol for distributed data intensive applications over wide area high-speed networks. UDT uses UDP to transfer bulk data with its own reliability control and congestion control mechanisms. The new protocol can transfer data at a much higher speed than TCP does. UDT is also a highly configurable framework that can accommodate various congestion control algorithms)
    2012-01-16 10:53:35下载
    积分:1
  • UDPChattool
    这是用VB编辑的点对点通讯工具,只要双方拥有IP地址,就可以连接通讯.可以用于Internet,局域网等网络中.()
    2008-04-10 17:14:34下载
    积分:1
  • c# 扫描IP Http Header
    c# 扫描IP Http Headerusing System;using System.Collections.Generic;using System.ComponentModel;using System.Data;using System.Drawing;using System.Linq;using System.Text;using System.Windows.Forms;using System.Threading;using System.IO;namespace HScan{ public partial class Form1 : Form { int _currentThreads = 0; int _maxThreads = 100; Thread main = null; Thread mt = null; List threads = new List(); public Form1() { InitializeComponent(); Control.CheckForIllegalCrossThreadCalls = false; } private void btnStart_Click(object sender, EventArgs e) { btnStart.Enabled = false; if (txtStart.Text.Trim() == "") { MessageBox.Show("起始IP不能为空."); return; } if (txtEnd.Text.Trim() == "") { MessageBox.Show("结束IP不能为空."); return; } int ts = Convert.ToInt32(txtThreads.Text); _maxThreads = ts; string startIp = txtStart.Text; string endIp = txtEnd.Text; TParameter tp=new TParameter(); tp.StartIp=startIp; tp.EndIp=endIp; tp.ThreadCount=ts; main = new Thread(new ParameterizedThreadStart(StartMe)); main.Start(tp); } protected void ThreadManage() { Thread c=null; while (true) { System.Object lockThis = new System.Object(); lock (lockThis) { for (int i = 0; i < threads.Count; i ) { if (threads[i] != null && !threads[i].IsAlive) { c = threads[i]; break; } } if (c != null) { threads.Remove(c); } } } } protected void StartMe(object ob) { mt = new Thread(new ThreadStart(ThreadManage)); mt.Start(); TParameter p = ob as TParameter; string curIp = p.StartIp; while (true) { for (int i = 0; i < _maxThreads; i ) { if (curIp != "") { if (_currentThreads >= _maxThreads) break; System.Object lockThis = new System.Object(); lock (lockThis) { _currentThreads ; if (_currentThreads > _maxThreads) _currentThreads = _maxThreads; string tip = curIp; Thread t = new Thread(new ParameterizedThreadStart(Run)); t.Start(tip); threads.Add(t); curIp = IPUtility.getLastIp(curIp, p.EndIp, 1); } } else { break; } } } } protected void Run(object ob) { string ip = ob.ToString(); SocketGetHead h = new SocketGetHead(); string ret = h.GetHtml(ip, 80); if (ret.IndexOf("DVRDVS-Webs") > 0) { ListViewItem item = new ListViewItem(); item.SubItems[0].Text = (listView1.Items.Count 1).ToString(); ListViewItem.ListViewSubItem lvSubItem = new ListViewItem.ListViewSubItem(); lvSubItem.Text = ip; item.SubItems.Add(lvSubItem); lvSubItem = new ListViewItem.ListViewSubItem(); lvSubItem.Text = "DVRDVS-Webs"; item.SubItems.Add(lvSubItem); listView1.Items.Add(item); } System.Object lockThis = new System.Object(); lock(lockThis) { lblCurIp.Text = ip; _currentThreads--; if (_currentThreads < 0) _currentThreads = 0; } } private void tsmCopy_Click(object sender, EventArgs e) { if (listView1.SelectedItems.Count > 0) { string ip = listView1.SelectedItems[0].SubItems[1].Text; Clipboard.SetText(ip); } } private void tsmExport_Click(object sender, EventArgs e) { StreamWriter writer = new StreamWriter(AppDomain.CurrentDomain.BaseDirectory "\export.txt",true); foreach (ListViewItem item in listView1.Items) { string ip=item.SubItems[1].Text; writer.WriteLine(ip); writer.Flush(); } writer.Flush(); writer.Close(); MessageBox.Show("导出成功!"); } private void Form1_FormClosing(object sender, FormClosingEventArgs e) { try { if (mt != null) { mt.Interrupt(); mt.Abort(); } foreach (Thread t in threads) { t.Interrupt(); t.Abort(); } if (main != null) { main.Interrupt(); main.Abort(); } } catch { } Thread.Sleep(5000); } private void btnStop_Click(object sender, EventArgs e) { try { if (mt != null) { mt.Interrupt(); mt.Abort(); } foreach (Thread t in threads) { t.Interrupt(); t.Abort(); } if (main != null) { main.Interrupt(); main.Abort(); } } catch { } btnStart.Enabled = true; } }}
    2014-06-23下载
    积分:1
  • buck电路bode图闭环设计
    说明:  文件内容包括buck电路的开环传递函数、加PI后的闭环传递推导;m文件;仿真mdl文件。实现功能——通过闭环BODE图整定出PID参数。(The contents of the file include the open-loop transfer function of the buck circuit, the closed-loop transfer derivation after adding PI, the m file, and the simulation MDL file. Realization function: PID parameters are adjusted by closed-loop Bode diagram.)
    2020-11-23 17:19:34下载
    积分:1
  • shuangjiaoxian
    通过他可以学会如何制作双绞线连接网络,如何制作直连和交叉两种类型的双绞线(through he can learn how to produce UTP connectivity, and how to make direct cross-company and the two types of UTP)
    2007-06-10 11:04:34下载
    积分:1
  • PtoP-CHAT
    点对点聊天工具,完整的工程,学习网络编程的可以参考(POINT TO POINT CHAT)
    2013-05-05 00:40:52下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载