Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms
From MaRDI portal
Publication:707147
DOI10.1016/j.ejor.2003.10.016zbMath1132.90364OpenAlexW2027954882MaRDI QIDQ707147
Leonora Bianchi, Neill E. Bowler, Joshua D. Knowles
Publication date: 9 February 2005
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2003.10.016
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (22)
Multiobjective optimization: when objectives exhibit non-uniform latencies ⋮ A hybrid scatter search for the probabilistic traveling salesman problem ⋮ The probabilistic minimum dominating set problem ⋮ On the probabilistic min spanning tree problem ⋮ Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem ⋮ Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem ⋮ Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem ⋮ Challenges and Advances in A Priori Routing ⋮ Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines ⋮ Different initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problem ⋮ The effects of a new selection operator on the performance of a genetic algorithm ⋮ Aggregation for the probabilistic traveling salesman problem ⋮ On the probabilistic minimum coloring and minimum \(k\)-coloring ⋮ Estimation-based metaheuristics for the probabilistic traveling salesman problem ⋮ Solving the probabilistic TSP with ant colony optimization ⋮ Probabilistic graph-coloring in bipartite and split graphs ⋮ A solution approach from an analytic model to heuristic algorithm for special case of vehicle routing problem with stochastic demands ⋮ A survey on metaheuristics for stochastic combinatorial optimization ⋮ A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem ⋮ Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem ⋮ Vertex-Uncertainty in Graph-Problems ⋮ Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers
Cites Work
- Unnamed Item
- Unnamed Item
- An O(N log N) planar travelling salesman heuristic based on spacefilling curves
- Further results on the probabilistic traveling salesman problem
- A Priori Optimization of the Probabilistic Traveling Salesman Problem
- Computational Approaches to Stochastic Vehicle Routing Problems
- A Priori Optimization
This page was built for publication: Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms
