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

DOI10.1016/J.EJOR.2003.10.016MaRDI QIDQ707147zbMATH OpenOpenAlexFDO

Authors Leonora Bianchi, Joshua Knowles, Neill E. Bowler

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

zbMATH Keywords

heuristicslocal searchCombinatorial optimizationprobabilistic traveling salesman problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem
• Further results on the probabilistic traveling salesman problem
• scientific article; zbMATH DE number 1818013
• scientific article; zbMATH DE number 1487884
• A Priori Optimization of the Probabilistic Traveling Salesman Problem

Cites work

• scientific article; zbMATH DE number 4055393 (Why is no real title available?)
• scientific article; zbMATH DE number 1961987 (Why is no real title available?)
• A Priori Optimization
• A Priori Optimization of the Probabilistic Traveling Salesman Problem
• An O(N log N) planar travelling salesman heuristic based on spacefilling curves
• Computational Approaches to Stochastic Vehicle Routing Problems
• Further results on the probabilistic traveling salesman problem

Cited in

(25)

• Engineering Stochastic Local Search Algorithms: A Case Study in Estimation-Based Local Search for the Probabilistic Travelling Salesman Problem
• Challenges and Advances in A Priori Routing
• Vertex-Uncertainty in Graph-Problems
• Different initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problem
• Aggregation for the probabilistic traveling salesman problem
• The effects of a new selection operator on the performance of a genetic algorithm
• Estimation-based local search for stochastic combinatorial optimization using delta evaluations: a case study on the probabilistic traveling salesman problem
• Probabilistic graph-coloring in bipartite and split graphs
• Multiobjective optimization: when objectives exhibit non-uniform latencies
• 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 scatter search for the probabilistic traveling salesman problem
• Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem
• Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines
• Estimation-based metaheuristics for the probabilistic traveling salesman problem
• Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem
• The probabilistic minimum dominating set problem
• Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers
• On the probabilistic minimum coloring and minimum k-coloring
• On the probabilistic min spanning tree problem
• Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem
• Solving the probabilistic TSP with ant colony optimization
• A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem
• Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem
• Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem

This page was built for publication: Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q707147)