Guided local search and its application to the traveling salesman problem-Reference-Cited by-同舟云学术

Guided local search and its application to the traveling salesman problem

Published:1999-03 Issue:2 Volume:113 Page:469-499
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Voudouris Christos,Tsang Edward

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference50 articles.

1. Simulated Annealing and Boltzmann machines;Aarts,1989

2. B.D. Backer, V. Furnon, P. Prosser, P. Kilby, P. Shaw, Solving vehicle routing problems using constraint programming and metaheuristics (submitted to the Journal of Heuristics special issue on Constraint Programming).

3. Fast algorithms for geometric traveling salesman problems;Bentley;ORSA Journal of Computing,1992

4. Perturbation: An efficient technique for the solution of very large instances of the Euclidean TSP;Codenotti;ORSA Journal of Computing,1996

5. An improved annealing scheme for the QAP;Connoly;European Journal of Operational Research,1990

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

1. Q-learning based hyper-heuristic with clustering strategy for combinatorial optimization: A case study on permutation flow-shop scheduling problem;Computers & Operations Research;2025-01

2. AdaGuiDE: An adaptive and guided differential evolution for continuous optimization problems;Applied Intelligence;2024-08-31

3. Learning to guide local search optimisation for routing problems;Operations Research Letters;2024-07

4. Synchronous Parallel Heuristics for Solving the Joint Order Batching and Picker Routing Problem;2024 IEEE Congress on Evolutionary Computation (CEC);2024-06-30

5. Fifty years of metaheuristics;European Journal of Operational Research;2024-04