A Priori Optimization of the Probabilistic Traveling Salesman Problem
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1264413
- scientific article; zbMATH DE number 1818013
- Further results on the probabilistic traveling salesman problem
- Probabilistic a priori routing-location problems
- Aggregation for the probabilistic traveling salesman problem
- Probabilistic Algorithm for the Directed Traveling Salesman Problem
- scientific article; zbMATH DE number 808804
- Probabilistic Analysis of Assignment Ranking: The Traveling Salesman Problems
Cited in
(65)- On the one-commodity pickup-and-delivery traveling salesman 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
- Heuristics for the stochastic Eulerian tour problem
- Stochastic vehicle routing
- The probabilistic orienteering problem
- The Benders decomposition algorithm: a literature review
- Solving the probabilistic TSP with ant colony optimization
- A priori TSP in the scenario model
- Routing problems: A bibliography
- The probabilistic travelling salesman problem with crowdsourcing
- Stochastic hub location problems with Bernoulli demands
- A cutting plane method for risk-constrained traveling salesman problem with random arc costs
- Further results on the probabilistic traveling salesman problem
- Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem
- Solving the vehicle routing problem with stochastic demands using the cross-entropy method
- Aggregation for the probabilistic traveling salesman problem
- Improving the integer L-shaped method
- A priori TSP in the Scenario Model
- Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm
- A Branch-and-Cut Approach to a Traveling Salesman Problem with Side Constraints
- Challenges and Advances in A Priori Routing
- EFFICIENT NEIGHBORHOOD SEARCH FOR THE PROBABILISTIC MULTI-VEHICLE PICKUP AND DELIVERY PROBLEM
- scientific article; zbMATH DE number 4051377 (Why is no real title available?)
- scientific article; zbMATH DE number 4055347 (Why is no real title available?)
- scientific article; zbMATH DE number 4055393 (Why is no real title available?)
- Finding the Optimal a Priori Tour and Location of a Traveling Salesman with Nonhomogeneous Customers
- Weighted Hamiltonian augmentation method involving insertions
- A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
- Risky traveling salesman problem
- scientific article; zbMATH DE number 1264413 (Why is no real title available?)
- scientific article; zbMATH DE number 1330075 (Why is no real title available?)
- Probabilistic a priori routing-location problems
- scientific article; zbMATH DE number 1961987 (Why is no real title available?)
- scientific article; zbMATH DE number 1487884 (Why is no real title available?)
- Analysis of Probabilistic Combinatorial Optimization Problems in Euclidean Spaces
- Computational Approaches to Stochastic Vehicle Routing Problems
- Robust multiperiod vehicle routing under customer order uncertainty
- Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios
- An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
- The double exponential runtime is tight for 2-stage stochastic ILPs
- The double exponential runtime is tight for 2-stage stochastic ILPs
- A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands
- A priori optimization for the probabilistic maximum independent set problem
- A vehicle routing problem with multiple service agreements
- Solving the multidepot vehicle routing problem with limited depot capacity and stochastic demands
- Solving the probabilistic profitable tour problem on a line
- Stochastic crowd shipping last-mile delivery with correlated marginals and probabilistic constraints
- Asymmetric probabilistic minimum-cost Hamiltonian cycle problem considering arc and vertex failures
- Routing Courier Delivery Services with Urgent Demand
- The traveling purchaser problem with stochastic prices: exact and approximate algorithms
- Local search heuristics for the probabilistic dial-a-ride problem
- Fifty years of operational research: 1972--2022
- Tight lower bounds for block-structured integer programs
- Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms
- Tight lower bounds for block-structured integer programs
- The dynamic dispatch waves problem for same-day delivery
- Heuristic and lower bound for a stochastic location-routing problem
- Solving a generalized traveling salesperson problem with stochastic customers
- A hybrid scatter search for the 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
- Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines
- Estimation-based metaheuristics for the probabilistic traveling salesman problem
This page was built for publication: A Priori Optimization of the Probabilistic Traveling Salesman Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4305756)
