Local search for the probabilistic traveling salesman problem: Correction to the 2-p-opt and 1-shift algorithms-Reference-Cited by-同舟云学术

Local search for the probabilistic traveling salesman problem: Correction to the 2-p-opt and 1-shift algorithms

Published:2005-04 Issue:1 Volume:162 Page:206-219
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Bianchi Leonora,Knowles Joshua,Bowler Neill

Publisher

Elsevier BV

Subject

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

Reference14 articles.

1. An O(nlogn) planar travelling salesman heuristic based on spacefilling curves;Bartholdi;Operations Research Letters,1982

2. D.J. Bertsimas, Probabilistic combinatorial optimization problems, PhD thesis, MIT, Cambridge, MA, 1988

3. Computational approaches to stochastic vehicle routing problems;Bertsimas;Transportation Science,1995

4. Further results on the probabilistic traveling salesman problem;Bertsimas;European Journal of Operational Research,1993

5. A priori optimization;Bertsimas;Operations Research,1990

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

1. Planning of reliable targeted evacuation under the threat of disasters;Transportation Research Part C: Emerging Technologies;2023-08

2. Solving Probabilistic Traveling Salesman Problem;The Traveling Salesman Problem;2023-07-09

3. A novel state transition simulated annealing algorithm for the multiple traveling salesmen problem;The Journal of Supercomputing;2021-03-29

4. Review of Tour Generation for Solving Traveling Salesman Problems;Nature-Inspired Computation in Navigation and Routing Problems;2020

5. Variable neighborhood search for consistent vehicle routing problem;Expert Systems with Applications;2018-12