Reference point based near insertion approach and two-stage approach for TSP

Ling Wang, Hanghang Tong, Da Zhong Zheng

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

By analyzing the existing nearest insertion method, a kind of reference point based near insertion approach (RPBNI) and its improvement version (I-RPBNI) with O(n2) and O(n3) polynomial time performances are proposed respectively to solve traveling salesman problem (TSP). An effective two-stage approach combining simulated annealing with I-RPBNI is proposed. Numerical simulations based on typical benchmarks demonstrate the effectiveness, efficiency and robustness of the proposed approach.

Original languageEnglish (US)
JournalKongzhi yu Juece/Control and Decision
Volume19
Issue number7
StatePublished - Jul 2004
Externally publishedYes

Fingerprint

Traveling salesman problem
Reference Point
Travelling salesman problems
Simulated annealing
Insertion
Polynomials
Computer simulation
Simulated Annealing
Polynomial time
Benchmark
Robustness
Numerical Simulation
Demonstrate

Keywords

  • Near insertion approach
  • Reference point
  • Simulated annealing
  • Traveling salesman problem

ASJC Scopus subject areas

  • Control and Systems Engineering

Cite this

Reference point based near insertion approach and two-stage approach for TSP. / Wang, Ling; Tong, Hanghang; Zheng, Da Zhong.

In: Kongzhi yu Juece/Control and Decision, Vol. 19, No. 7, 07.2004.

Research output: Contribution to journalArticle

@article{b89c879d90874038a5c2f3055c2082dc,
title = "Reference point based near insertion approach and two-stage approach for TSP",
abstract = "By analyzing the existing nearest insertion method, a kind of reference point based near insertion approach (RPBNI) and its improvement version (I-RPBNI) with O(n2) and O(n3) polynomial time performances are proposed respectively to solve traveling salesman problem (TSP). An effective two-stage approach combining simulated annealing with I-RPBNI is proposed. Numerical simulations based on typical benchmarks demonstrate the effectiveness, efficiency and robustness of the proposed approach.",
keywords = "Near insertion approach, Reference point, Simulated annealing, Traveling salesman problem",
author = "Ling Wang and Hanghang Tong and Zheng, {Da Zhong}",
year = "2004",
month = "7",
language = "English (US)",
volume = "19",
journal = "Kongzhi yu Juece/Control and Decision",
issn = "1001-0920",
publisher = "Northeast University",
number = "7",

}

TY - JOUR

T1 - Reference point based near insertion approach and two-stage approach for TSP

AU - Wang, Ling

AU - Tong, Hanghang

AU - Zheng, Da Zhong

PY - 2004/7

Y1 - 2004/7

N2 - By analyzing the existing nearest insertion method, a kind of reference point based near insertion approach (RPBNI) and its improvement version (I-RPBNI) with O(n2) and O(n3) polynomial time performances are proposed respectively to solve traveling salesman problem (TSP). An effective two-stage approach combining simulated annealing with I-RPBNI is proposed. Numerical simulations based on typical benchmarks demonstrate the effectiveness, efficiency and robustness of the proposed approach.

AB - By analyzing the existing nearest insertion method, a kind of reference point based near insertion approach (RPBNI) and its improvement version (I-RPBNI) with O(n2) and O(n3) polynomial time performances are proposed respectively to solve traveling salesman problem (TSP). An effective two-stage approach combining simulated annealing with I-RPBNI is proposed. Numerical simulations based on typical benchmarks demonstrate the effectiveness, efficiency and robustness of the proposed approach.

KW - Near insertion approach

KW - Reference point

KW - Simulated annealing

KW - Traveling salesman problem

UR - http://www.scopus.com/inward/record.url?scp=19544389833&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=19544389833&partnerID=8YFLogxK

M3 - Article

VL - 19

JO - Kongzhi yu Juece/Control and Decision

JF - Kongzhi yu Juece/Control and Decision

SN - 1001-0920

IS - 7

ER -