Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem

DOI10.1016/J.EJOR.2005.05.027zbMATH Open1137.90686OpenAlexW1996908848MaRDI QIDQ2432887FDOQ2432887

Leonora Bianchi, Ann Melissa Campbell

Publication date: 25 October 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.05.027

Recommendations

• Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms
• scientific article; zbMATH DE number 1487884
• scientific article; zbMATH DE number 4066604
• Further results on the probabilistic traveling salesman problem
• A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited

zbMATH Keywords

heuristicscombinatorial optimizationlocal searchstochastic vehicle routingprobabilistic traveling salesman

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic programming (90C15)

Cites Work

• Finding the Optimal a Priori Tour and Location of a Traveling Salesman with Nonhomogeneous Customers
• Computer Solutions of the Traveling Salesman Problem
• Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms
• Solving the probabilistic TSP with ant colony optimization
• Further results on the probabilistic traveling salesman problem
• A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
• A Priori Optimization of the Probabilistic Traveling Salesman Problem
• Computational Approaches to Stochastic Vehicle Routing Problems

Cited In (15)

• A progressive hedging method for the multi-path travelling salesman problem with stochastic travel times
• Challenges and Advances in A Priori Routing
• Different initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problem
• The dynamic dispatch waves problem for same-day delivery
• Delivery strategies for blood products supplies
• A survey on metaheuristics for stochastic combinatorial optimization
• Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms
• Stochastic hub location problems with Bernoulli demands
• The traveling purchaser problem with stochastic prices: exact and approximate algorithms
• 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
• Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers
• Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem

This page was built for publication: Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem

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