Effective Local and Guided Variable Neighbourhood Search Methods for the Asymmetric Travelling Salesman Problem-Reference-Cited by-同舟云学术

Effective Local and Guided Variable Neighbourhood Search Methods for the Asymmetric Travelling Salesman Problem

Published:2001 Issue: Volume: Page:203-212
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Burke Edmund K.,Cowling Peter I.,Keuthen Ralf

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45365-2_21

Reference23 articles.

1. Johnson, D.S., McGeoch, L.A.: The travelling salesman problem: A case study. In: Aarts, E.H.L. and Lenstra, J.K. (eds.): Local Search in Combinatorial Optimization. John Wiley & Sons, New York (1997) 215–310

2. Lect Notes Comput Sci;G. Reinelt,1994

3. Bentley, J.L.: Fast algorithms for geometric traveling salesman problems. ORSA Journal on Computing, 4 (1992) 387–411

4. Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the travelling sales-man problem. Operat. Res. 21 (1973) 498–516

5. Lawler, E.J., Lenstra, J.K., Rinnoy Kan, A.H.G., Shmoys, D.B.: The travelling salesman problem: A guided tour of combinatorial optimization. Wiley, New York (1985)

Cited by 20 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Polynomial randomized algorithm for the asymmetric travelling salesman problem;Doklady of the National Academy of Sciences of Belarus;2022-11-02

2. AUV-Enabled Data Collection for Underwater Acoustic Sensor Networks;OCEANS 2022, Hampton Roads;2022-10-17

3. A Multi-start VNS Algorithm for the TSP-D with Energy Constraints;Lecture Notes in Computer Science;2021

4. Multi-material Design in the Case of a Coupled Selection of Architectures and Materials: Application to Embedded Electronic Packaging;Journal of Materials Engineering and Performance;2019-11-25

5. Solving multiple travelling officers problem with population-based optimization algorithms;Neural Computing and Applications;2019-05-17