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

Ling Wang; Hang Hang Tong; Da Zhong Zheng

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

Ling Wang, Hang Hang Tong, Da Zhong Zheng

Arizona State University

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

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(n²) and O(n³) 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 language	English (US)
Pages (from-to)	831-833+837
Journal	Kongzhi yu Juece/Control and Decision
Volume	19
Issue number	7
State	Published - Jul 1 2004

Keywords

Near insertion approach
Reference point
Simulated annealing
Traveling salesman problem

ASJC Scopus subject areas

Control and Systems Engineering
Software
Control and Optimization
Artificial Intelligence

Cite this

@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 Tong, {Hang Hang} and Zheng, {Da Zhong}",

year = "2004",

month = jul,

day = "1",

language = "English (US)",

volume = "19",

pages = "831--833+837",

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, Hang Hang

AU - Zheng, Da Zhong

PY - 2004/7/1

Y1 - 2004/7/1

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

AN - SCOPUS:19544389833

SN - 1001-0920

VL - 19

SP - 831-833+837

JO - Kongzhi yu Juece/Control and Decision

JF - Kongzhi yu Juece/Control and Decision

IS - 7

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this