Hybridizing Genetic Algorithms with Branch and Bound Techniques for the Resolution of the TSP-Reference-Cited by-同舟云学术

Hybridizing Genetic Algorithms with Branch and Bound Techniques for the Resolution of the TSP

Published:1995 Issue: Volume: Page:277-280
ISSN:
Container-title:Artificial Neural Nets and Genetic Algorithms
language:
Short-container-title:

Author:

Cotta C.,Aldana J. F.,Nebro A. J.,Troya J. M.

Publisher

Springer Vienna

Link

http://link.springer.com/content/pdf/10.1007/978-3-7091-7535-4_73.pdf

Reference7 articles.

1. Reeves C.R., “Modern Heuristic Techniques for Combinatorial Problems”, Blackwell Scientific Publications, 1993

2. Davis L., “Handbook of genetic algorithms”, VNR Computer Library, 1991

3. Volgenant T., Jonker R. “A branch and bound algorithm for the symmetric travelling salesman problem based on the 1-tree relaxation.”, Univ. of Amsterdam, 1981

4. Michalewicz Z., “Genetic Algorithms + Data Structures = Evolution Programs”, Springer Verlag, 1992

5. Nebro Urbaneja A.J. “Implementation and Evaluation of Parallel Schemes for Branch and Bound Techniques” MCS Tesis, Univ. of Málaga, 1991

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

1. Interval constraint programming for globally solving catalog-based categorical optimization;Journal of Global Optimization;2024-01-22

2. The applications of hybrid approach combining exact method and evolutionary algorithm in combinatorial optimization;Journal of Computational Design and Engineering;2023-04-14

3. A Hybrid Exact Algorithm for the Asymmetric Traveling Salesman Problem: Construction and a Statistical Study of Computational Efficiency;Automation and Remote Control;2019-11

4. Reliable communication network design: The hybridisation of metaheuristics with the branch and bound method;Journal of the Operational Research Society;2019-06-27

5. An Accelerated Introduction to Memetic Algorithms;Handbook of Metaheuristics;2018-09-21