• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利：CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法，用中文像聊天一样搜索，搜遍4000万医学文献。AI智能推荐，让科研检索更轻松。

立即免费搜索

文件翻译

保留排版，准确专业，支持PDF/Word/PPT等文件格式，支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述，25分钟生成高质量综述，智能提取关键信息，辅助科研写作。

立即免费体验

Traveling salesman problem with a center.

作者信息

Lipowski Adam, Lipowska Dorota

机构信息

Faculty of Physics, Adam Mickiewicz University, 61-614 Poznań, Poland.

出版信息

Phys Rev E Stat Nonlin Soft Matter Phys. 2005 Jun;71(6 Pt 2):067701. doi: 10.1103/PhysRevE.71.067701. Epub 2005 Jun 10.

DOI:10.1103/PhysRevE.71.067701
PMID:16089923
Abstract

We study a traveling salesman problem where the path is optimized with a cost function that includes its length L as well as a certain measure C of its distance from the geometrical center of the graph. Using simulated annealing (SA) we show that such a problem has a transition point that separates two phases differing in the scaling behavior of L and C, in efficiency of SA, and in the shape of minimal paths.

摘要

相似文献

1
Traveling salesman problem with a center.
Phys Rev E Stat Nonlin Soft Matter Phys. 2005 Jun;71(6 Pt 2):067701. doi: 10.1103/PhysRevE.71.067701. Epub 2005 Jun 10.
2
Characterization of the probabilistic traveling salesman problem.
Phys Rev E Stat Nonlin Soft Matter Phys. 2003 Sep;68(3 Pt 2):036703. doi: 10.1103/PhysRevE.68.036703. Epub 2003 Sep 9.
3
Colored Traveling Salesman Problem.有色彩的旅行商问题。
IEEE Trans Cybern. 2015 Nov;45(11):2390-401. doi: 10.1109/TCYB.2014.2371918. Epub 2014 Dec 4.
4
A three-phase algorithm for the pollution traveling Salesman problem.一种用于污染旅行商问题的三相算法。
Heliyon. 2024 Apr 20;10(9):e29958. doi: 10.1016/j.heliyon.2024.e29958. eCollection 2024 May 15.
5
Quantum annealing of the traveling-salesman problem.旅行商问题的量子退火
Phys Rev E Stat Nonlin Soft Matter Phys. 2004 Nov;70(5 Pt 2):057701. doi: 10.1103/PhysRevE.70.057701. Epub 2004 Nov 10.
6
Fast marching methods for the continuous traveling salesman problem.连续旅行商问题的快速行进方法。
Proc Natl Acad Sci U S A. 2007 Jan 23;104(4):1118-23. doi: 10.1073/pnas.0609910104. Epub 2007 Jan 12.
7
Critical transition in the constrained traveling salesman problem.约束旅行商问题中的关键转变。
Phys Rev E Stat Nonlin Soft Matter Phys. 2001 Apr;63(4 Pt 2):047103. doi: 10.1103/PhysRevE.63.047103. Epub 2001 Mar 27.
8
A Kohonen-like decomposition method for the Euclidean traveling salesman problem-KNIES/spl I.bar/DECOMPOSE.一种用于欧几里得旅行商问题的类Kohonen分解方法——KNIES/SPL I.bar/DECOMPOSE。
IEEE Trans Neural Netw. 2003;14(4):869-90. doi: 10.1109/TNN.2003.811562.
9
A neural-network-based approach to the double traveling salesman problem.一种基于神经网络的双旅行商问题求解方法。
Neural Comput. 2002 Feb;14(2):437-71. doi: 10.1162/08997660252741194.
10
Verification and rectification of the physical analogy of simulated annealing for the solution of the traveling salesman problem.用于解决旅行商问题的模拟退火物理类比的验证与修正
Phys Rev E Stat Nonlin Soft Matter Phys. 2011 Mar;83(3 Pt 2):036708. doi: 10.1103/PhysRevE.83.036708. Epub 2011 Mar 31.