Name
Title | ||
|---|---|---|
Embedding learning capability in Lagrangean relaxation: An application to the travelling salesman problem |
Abstract | ||
|---|---|---|
This paper presents an effective procedure that finds lower bounds for the travelling salesman problem based on the 1-tree using a learning-based Lagrangian relaxation technique. The procedure can dynamically alter its step-size depending upon its previous iterations. Along with having the capability of expansion–contraction, the procedure performs a learning process in which Lagrange multipliers are influenced by a weighted cost function of their neighbouring nodes. In analogy with simulated annealing paradigm, here a learning process is equivalent to escaping local optimality via exploiting the structure of the problem. Computational results conducted on Euclidean benchmarks from the TSPLIB library show that the procedure is very effective. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.ejor.2009.02.008 | European Journal of Operational Research |
Keywords | Field | DocType |
Traveling salesman,Lagrangian relaxation,Heuristics | Simulated annealing,Mathematical optimization,Weight function,Embedding,Local optimum,Lagrange multiplier,Relaxation (iterative method),Travelling salesman problem,Lagrangian relaxation,Mathematics | Journal |
Volume | Issue | ISSN |
201 | 1 | 0377-2217 |
Citations | PageRank | References |
16 | 0.73 | 14 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Reza Zamani | 1 | 258 | 26.67 |
| Sim Kim Lau | 2 | 50 | 10.24 |