Embedding learning capability in Lagrangean relaxation: An application to the travelling salesman problem

European Journal of Operational Research

Volumn 201, Issue 1, 2010, Pages 82-88

  Zamani, Reza ^a   Lau, Sim Kim ^a  

^a UNIVERSITY OF WOLLONGONG   (Australia)

Author keywords

Heuristics; Lagrangian relaxation; Traveling salesman

Indexed keywords

COMPUTATIONAL RESULTS; EUCLIDEAN; HEURISTICS; LAGRANGEAN RELAXATION; LAGRANGIAN RELAXATION; LAGRANGIAN RELAXATION TECHNIQUES; LEARNING CAPABILITIES; LEARNING PROCESS; LOCAL OPTIMALITY; LOWER BOUNDS; NEIGHBOURING NODES; TRAVELING SALESMAN; TRAVELLING SALESMAN PROBLEM; WEIGHTED COST FUNCTIONS;

CONTROL THEORY; EDUCATION; HEURISTIC METHODS; SIMULATED ANNEALING;

LAGRANGE MULTIPLIERS;

EID: 70249108193     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2009.02.008     Document Type: Article

References (26)

1. Applegate D.L., Bixby R.E., Chvatal V., and Cook W.J. The Traveling Salesman Problem: A Computational Study. Princeton Series in Applied Mathematics (2006), Princeton University Press
2. Baker B.M., and Sheasby J. Accelerating the convergence of subgradient optimisation. European Journal of Operational Research 117 (1999) 136-144
3. Carpeneto G., Fischetti M., and Toth P. New lower bounds for the symmetric traveling salesman problems. Mathematical Programming 45 (1989) 233-254
4. Christofides N. Worst-Case Analysis of a New Heuristic for the Traveling Salesman Problem (1976), Carnegie-Mellon University, Pittsburgh
5. Fisher M. An application oriented guide to Lagrangian relaxation. Interfaces 15 2 (1985) 10-21
6. Fumero F. A modified subgradient algorithm for Lagrangian relaxation. Computers and Operations Research 28 1 (2001) 33-52
7. Guignard M. Lagrangian relaxation. Top 11 2 (2003) 151-228
8. Helbig-Hansen H., and Krarup J. Improvements of the Held-Karp algorithm for the symmetric traveling salesman problem. Mathematical Programming 7 (1974) 87-96
9. Held M., and Karp R.M. The traveling salesman problem and minimum spanning trees. Operations Research 18 (1970) 1138-1162
10. Held M., and Karp R.M. The traveling salesman problem and minimum spanning trees: Part II. Mathematical Programming 1 (1971) 6-25
11. Held M., Wolfe P., and Crowder H.P. Validation of subgradient optimization. Mathematical Programming 6 (1974) 62-88
12. Helsgaun K. An effective implementation of the Lin-Kernighan traveling salesman heuristic. European Journal of Operational Research 126 (2000) 106-130
13. Johnson, D.S., McGeoch, L.A., Rothberg, E.E., 1996. Asymptotic experimental analysis for the Held-Karp traveling salesman bound. In: Proceedings ACM-SIAM Symposium on Discrete Algorithms, pp. 341-350.
14. Lorena L.A., and Narciso M.G. Using logical surrogate information in Lagrangian relaxation: An application to symmetric traveling salesman problems. European Journal of Operational Research 138 (2002) 473-483
15. Marinakis Y., Migdalas A., and Pardalos P.A. Hybrid genetic - GRASP algorithm using Lagrangian relaxation for the travelling salesman problem. Journal of Combinatorial Optimization 10 (2005) 311-326
16. Prim R. Shortest connection networks and some generalizations. The Bell System Technical Journal 36 (1957) 1389-1401
17. Ravi R., and Sinha A. Approximating k-cuts using network strength as a Lagrangian relaxation. European Journal of Operational Research 186 (2008) 77-90
18. Reinelt G. TSPLIB - A traveling salesman problem library. ORSA Journal on Computing 3 (1991) 376-384
19. Reinelt G. The Traveling Salesman: Computational Solutions for TSP Applications (1994), Springer-Verlag, Heidelberg
20. Shutler P.M.E. An improved branching rule for the symmetric traveling salesman problem. Journal of Operational Research Society 52 (2001) 169-175
21. Shutler P.M.E. A priority list based heuristic for the job shop problem. Journal of Operational Research Society 54 (2003) 571-584
22. Smith T.H.C., and Thompson G.L. A LIFO implicit enumeration search algorithm for the symmetric traveling salesman problem using Held and Karp's 1-tree relaxation. Annals of Discrete Mathematics 1 (1977) 479-493
23. Süral H., Denizel M., and Wassenhove L.N.V. Lagrangian relaxation based heuristics for lot sizing with setup times. European Journal of Operational Research 194 (2007) 51-63
24. Valenzuela C.L., and Jones A.J. Estimating the Held-Karp lower bound for the geometric traveling salesman problem. European Journal of Operational Research 102 1 (1997) 157-175
25. Volgenant T., and Jonker R. A branch and bound algorithm for the symmetric traveling salesman problem based on 1-tree relaxation. European Journal of Operational Research 9 (1982) 83-89
26. Zamani, R., Lau, S.K., 2005. An effective mixed-and-fixed approach for computing lower bounds in the travelling salesman problem. Working paper - Information Systems Discipline; University of Wollongong.