Traveling salesman problem with a center

被引：3

作者：

Lipowski, A ^{[1
]}

Lipowska, D

机构：

[1] Adam Mickiewicz Univ, Fac Phys, PL-61614 Poznan, Poland

[2] Adam Mickiewicz Univ, Inst Linguist, PL-60371 Poznan, Poland

来源：

PHYSICAL REVIEW E | 2005年 / 71卷 / 06期

关键词：

D O I：

10.1103/PhysRevE.71.067701

中图分类号：

O35 [流体力学]; O53 [等离子体物理学];

学科分类号：

070204 ; 080103 ; 080704 ;

摘要：

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.

引用

页数：4

共 17 条

[1]

[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness

[2]

[Anonymous], P CAMB PHILO SOC, DOI DOI 10.1017/S0305004100034095

[3] Optimization of the time-dependent traveling salesman problem with Monte Carlo methods [J].