A Parallel Multi-start Search Algorithm for Dynamic Traveling Salesman Problem-Reference-Cited by-同舟云学术

A Parallel Multi-start Search Algorithm for Dynamic Traveling Salesman Problem

Published:2011 Issue: Volume: Page:65-75
ISSN:0302-9743
Container-title:Experimental Algorithms
language:
Short-container-title:

Author:

Li Weiqi

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-20662-7_6

Reference35 articles.

1. Corne, D.W., Oates, M.J., Smith, G.D.: Telecommunications Optimization: Heuristic and Adaptive Techniques. John Wiley & Sons, Chichester (2000)

2. Powell, W.B., Jaillet, P., Odoni, A.: Stochastic and Dynamic Networks and Routing. In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds.) Network Routing, Handbooks in Operations Research and Management Science, vol. 8, pp. 141–296. Elsevier, Amsterdam (1995)

3. Branke, J.: Evolutionary Optimization in Dynamic Environments. Kluwer, Dordrecht (2002)

4. Lecture Notes in Computer Science;C.J. Eyckelhof,2002

5. Lecture Notes in Computer Science;M. Guntsch,2001

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

1. An efficient harris hawk optimization algorithm for solving the travelling salesman problem;Cluster Computing;2021-05-31

2. Discrete farmland fertility optimization algorithm with metropolis acceptance criterion for traveling salesman problems;International Journal of Intelligent Systems;2020-12-22

3. Adjustability of a discrete particle swarm optimization for the dynamic TSP;Soft Computing;2017-07-28

4. A Simulation-Based Algorithm for the Probabilistic Traveling Salesman Problem;EVOLVE – A Bridge between Probability, Set Oriented Numerics and Evolutionary Computation VII;2017

5. Heterogeneous DPSO Algorithm for DTSP;Computational Collective Intelligence;2015