Aggregation for the probabilistic traveling salesman problem
From MaRDI portal
Publication:2489311
DOI10.1016/j.cor.2005.02.024zbMath1086.90047OpenAlexW2129968104MaRDI QIDQ2489311
Publication date: 16 May 2006
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.02.024
Related Items (11)
Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling ⋮ Coupling ant colony systems with strong local searches ⋮ The probabilistic minimum dominating set problem ⋮ On the computational complexity of the probabilistic traveling salesman problem with deadlines ⋮ 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 ⋮ Estimation-based metaheuristics for the probabilistic traveling salesman problem ⋮ A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem
Cites Work
- On worst-case aggregation analysis for network location problems
- Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms
- Aggregation effects in maximum covering models
- An O(N log N) planar travelling salesman heuristic based on spacefilling curves
- Vehicle routing with a sparse feasibility graph
- A \(p\)-center grid-positioning aggregation procedure
- Analysis of centroid aggregation for the Euclidean distance \(p\)-median problem
- Further results on the probabilistic traveling salesman problem
- Finding the Optimal a Priori Tour and Location of a Traveling Salesman with Nonhomogeneous Customers
- 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
- Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem
- Computer Solutions of the Traveling Salesman Problem
- An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
- A Priori Optimization
- A Vehicle Routing Problem with Stochastic Demand
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Aggregation for the probabilistic traveling salesman problem
