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